{"$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":"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":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"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":"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":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"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":"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":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"App::create (cyclomatic 291): App::create has cyclomatic complexity 291 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/mod.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04c92435b89b2d4d62e78f97018804ae4e93575dbdcb76d394443ea9c1d1f47"}},{"ruleId":"D1","level":"warning","message":{"text":"App::handle (cyclomatic 182): App::handle has cyclomatic complexity 182 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/mod.rs"},"region":{"startLine":2757}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e54000e79ff5e95ba767bf05bbc082f156512cb5f9e2f0926c71251e70b6b07"}},{"ruleId":"D1","level":"warning","message":{"text":"App::test_step (cyclomatic 117): App::test_step has cyclomatic complexity 117 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/testscript.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1fc66b7251a4542e46b07e2a2914aa1994bbff1ab466a4cd657c28a8b43a9c"}},{"ruleId":"D1","level":"warning","message":{"text":"App::show_fence_menu (cyclomatic 110): App::show_fence_menu has cyclomatic complexity 110 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/menus.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"93df3bebeda24ff356eda375da9b2ad5f1cdea1837ff22b98a83e24cb07069fe"}},{"ruleId":"D1","level":"warning","message":{"text":"App::ipc_dispatch (cyclomatic 107): App::ipc_dispatch 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":"crates/app/src/app/ipc.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"5706979711b9c1c4eb7a742194a11d1e5c67be0c40ae128944c7c6e1cbbdc134"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::fence_window::handler::mouse_move::on_mousemove (cyclomatic 104): pecofence::fence_window::handler::mouse_move::on_mousemove has cyclomatic complexity 104 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/mouse_move.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc9fc8bca9ce81d4bf0317c4ed7a8354e0bfbf111a1a479cfc089b71ca33ed9"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::app::fence_options::parse_fence_prop (cyclomatic 101): pecofence::app::fence_options::parse_fence_prop has cyclomatic complexity 101 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/fence_options.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5705b724a58a4918c6129fcb8f14c8f6d1bc896e2daf3014710aa567243f17a"}},{"ruleId":"D1","level":"warning","message":{"text":"App::on_settings_message (cyclomatic 97): App::on_settings_message has cyclomatic complexity 97 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/settings.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c728feacc894e2fccfffd7abcda00b1be4284f1cd6207d9555c4e14ed14151"}},{"ruleId":"D1","level":"warning","message":{"text":"FenceWindow::make_handler (cyclomatic 90): FenceWindow::make_handler has cyclomatic complexity 90 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/mod.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da5af50ce874f2cfb0d75fa2da7a238928688c96536ecd53e257c8267cd4035"}},{"ruleId":"D1","level":"warning","message":{"text":"FenceChrome::draw (cyclomatic 88): FenceChrome::draw 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":"crates/render/src/fence_chrome.rs"},"region":{"startLine":2998}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2bc7a967484237bf4b4b5371f73a913e87256f430c90253cd651de378e702e"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.html.renderFences (cyclomatic 77): settings.html.renderFences has cyclomatic complexity 77 (threshold 15). Of this number, 52 points are the body\u0027s own statements and 25 belong to 6 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":"ui/settings.html"},"region":{"startLine":2108}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a705216baad11286318840ed026c7c351eb81823276fb2b9407fcb62df9329"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::fence_window::handler::keyboard::on_keydown (cyclomatic 63): pecofence::fence_window::handler::keyboard::on_keydown has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/keyboard.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"04cf3c27715be1f1df0027ae3f0821f2424c4226a99e561652190def2e122ba9"}},{"ruleId":"D1","level":"warning","message":{"text":"make-trailer-audio.compose_music (cyclomatic 62): make-trailer-audio.compose_music 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":"extras/pecofence-promo/scripts/make-trailer-audio.py"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"202f8018afb9242b4e2f730ffacc99f4f0da05d04b3cbae994011a3432ccf469"}},{"ruleId":"D1","level":"warning","message":{"text":"FenceViewState::replace_items (cyclomatic 61): FenceViewState::replace_items 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":"crates/app/src/fence_window/items.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"7063db15bcd54cd8790bb1d382ddecd7af47ea11d791a6bc085aae25665aceb9"}},{"ruleId":"D1","level":"warning","message":{"text":"make-trailer-audio.compose_sfx (cyclomatic 52): make-trailer-audio.compose_sfx 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":"extras/pecofence-promo/scripts/make-trailer-audio.py"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dff4e5dcdbc1441ac3a7d54cad7de9c7c91924f1274a39269fe131c0feb9fdc"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::peek_search::paint_box (cyclomatic 48): pecofence::peek_search::paint_box has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/peek_search.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"562113211301b7fb322b98812dab6a118fcf88d3962159e8ee6d2e3cfdee04a8"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.html.seRead (cyclomatic 48): settings.html.seRead has cyclomatic complexity 48 (threshold 15). Of this number, 46 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":"ui/settings.html"},"region":{"startLine":3203}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e548d16645d7d712a73d21aa2c7eef3d6761757bbbfc80f7c6d75e8f21dabeb"}},{"ruleId":"D1","level":"warning","message":{"text":"AppState::sync_desktop_partly_read (cyclomatic 46): AppState::sync_desktop_partly_read has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/state.rs"},"region":{"startLine":1479}}}],"partialFingerprints":{"codehealthFindingId/v1":"21cd0df52cd51571a46646e13c6b99b27cc0464f055492d4171ff3de41681c02"}},{"ruleId":"D1","level":"warning","message":{"text":"App::apply_settings (cyclomatic 45): App::apply_settings has cyclomatic complexity 45 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/settings.rs"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd9bf78d33d7a75ca70f65e03b6719719f2d35478b5ffde662df860524dc2ea"}},{"ruleId":"D1","level":"warning","message":{"text":"FenceDropHandler::drop (cyclomatic 45): FenceDropHandler::drop has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/dnd.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"83de865342aa6c8f40d325bfe124d86a8673b68e6ce14d92060e6a3c3de2cffc"}},{"ruleId":"D1","level":"warning","message":{"text":"FenceChrome::draw_tab_list (cyclomatic 44): FenceChrome::draw_tab_list 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":"crates/render/src/fence_chrome.rs"},"region":{"startLine":3777}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03117df7ff244e8c1e61bc640cf1d37c3603a5f0e46a1ba703c34fa82042aad"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::fence_window::handler::mouse::on_lbuttondown (cyclomatic 43): pecofence::fence_window::handler::mouse::on_lbuttondown 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":"crates/app/src/fence_window/handler/mouse.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3f032a23fbf031163db90fc60d4d7ecd346c1499499373ced9f4d42cc05cab"}},{"ruleId":"D1","level":"warning","message":{"text":"App::apply_fence_prop (cyclomatic 42): App::apply_fence_prop has cyclomatic complexity 42 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/fence_options.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a45dba5c1cf4bb5521e2c2c2d6a1e77579773d5caf703d10ce25c5b78c89e59"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::fence_window::handler::mouse::on_lbuttonup (cyclomatic 42): pecofence::fence_window::handler::mouse::on_lbuttonup has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/mouse.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"837b5c349465d3b95fce8522df4c0cfab8bedd64301d63a45f28b0c94249eb23"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.html.readCond (cyclomatic 41): settings.html.readCond 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":"ui/settings.html"},"region":{"startLine":2682}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba00d356ba796af8185f3d6f70e33a91cbbde1d0b755a703ebaef126309ba4a4"}},{"ruleId":"D1","level":"warning","message":{"text":"App::apply_undo (cyclomatic 40): App::apply_undo has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/undo.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e014fcd40671ad84f8722e1d194852e967ca7d795cebb8420babece9c4d5472"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::notice::handle (cyclomatic 40): pecofence::notice::handle has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/notice.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ede0d135e2766a68adaf44dd1d7973bc47ab1c31af385c2fbfa73d10dfa9437"}},{"ruleId":"D1","level":"warning","message":{"text":"App::reflow_pushed_once (cyclomatic 39): App::reflow_pushed_once 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/app/src/app/push.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"39bfc42629ceb9286607e156d32ab1b8f84b3de0936500ba5e5ffc9f6796efdf"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::note_edit::on_key (cyclomatic 39): pecofence::note_edit::on_key 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/app/src/note_edit.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"48af5eb1d4da01a945874ed12fdb7bbe2b6345e390e664cc82f6ef63222f633e"}},{"ruleId":"D1","level":"warning","message":{"text":"FenceChrome::draw_rows (cyclomatic 39): FenceChrome::draw_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":"crates/render/src/fence_chrome.rs"},"region":{"startLine":4051}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f74518c4ed8cfafa34017505ccc6b4d485298ad98fc2f17b86c98546075ba1"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence_cli::run::run_fence (cyclomatic 38): pecofence_cli::run::run_fence 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/cli/src/run.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"319780352dcd8b061a96b8730a1f0594a64aba251e8b42e0237c10ee56d1c5bf"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.html.hotkeyRecorder (cyclomatic 38): settings.html.hotkeyRecorder has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 9 of the 38 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 1832, a function literal at line 1876, a function literal at line 1865, \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":"ui/settings.html"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"3829f5ecbc6f93e109353eeb34cc5e1c401ce553b05cefbd6e6632951fd5d3fd"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.html.slider (cyclomatic 37): settings.html.slider has cyclomatic complexity 37 (threshold 15). Most of this is not in the body itself: 6 of the 37 points are its own statements and the rest belongs to 11 function items inside it that branch (a function literal at line 1104, a function literal at line 1116, fit, \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":"ui/settings.html"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a0708254eb3efd0ea3f7491357acc8795e143f1c37fa827547c606342305ce"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::peek_search::build (cyclomatic 36): pecofence::peek_search::build has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/peek_search.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e5cb8e48cbdaa35bd90999f1c43f0ccfc569a1dab351372626747f5865bf22"}},{"ruleId":"D1","level":"warning","message":{"text":"App::on_fileop_done (cyclomatic 35): App::on_fileop_done has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/fileops.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80b7a258be56e13059a83514ac7d1123265e5b0f6391eae5b51321407580071"}},{"ruleId":"D1","level":"warning","message":{"text":"FenceWindow::set_tabs (cyclomatic 35): FenceWindow::set_tabs has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/api.rs"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"0917da035649e726cfee4785033df9a56bf76a8cf824497d254b8cd5da2c9e7c"}},{"ruleId":"D1","level":"warning","message":{"text":"FenceChrome::draw_note (cyclomatic 34): FenceChrome::draw_note has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/fence_chrome.rs"},"region":{"startLine":4876}}}],"partialFingerprints":{"codehealthFindingId/v1":"60eb2ffb33d290e7840a9e8067c8b761db8d7054f1886c41546a16ec59d54dd6"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.html.seVal (cyclomatic 34): settings.html.seVal has cyclomatic complexity 34 (threshold 15). Of this number, 33 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":3137}}}],"partialFingerprints":{"codehealthFindingId/v1":"3464017e34c1678cd3add5cd1b95ad15f641b2949fc912401710d9560e0d07f8"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.html.seRow (cyclomatic 34): settings.html.seRow has cyclomatic complexity 34 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 17 belong to 8 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":"ui/settings.html"},"region":{"startLine":3277}}}],"partialFingerprints":{"codehealthFindingId/v1":"8483923ea171f2cefa990589d59439e5744a7b64799757bc2e2934dd2e02a783"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopAnchor::on_timer (cyclomatic 33): DesktopAnchor::on_timer has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/anchor.rs"},"region":{"startLine":2138}}}],"partialFingerprints":{"codehealthFindingId/v1":"50b73976d94f872abe8676caade484cb5a51e1ef0d15c2e1b881d97221f240f3"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::peek_search::on_key (cyclomatic 33): pecofence::peek_search::on_key has cyclomatic complexity 33 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/peek_search.rs"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"780ee2a603a84930d0385fc61fe3622c2d67c7ce16ba1a3319227fd333b56d8a"}},{"ruleId":"D1","level":"warning","message":{"text":"App::script_row_clicked (cyclomatic 32): App::script_row_clicked 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/app/src/app/tools.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab3ae1c775423152388c2a90134a20f166b82abc42a3179f50bb9cff35dc4fd"}},{"ruleId":"D1","level":"warning","message":{"text":"App::show_item_menu (cyclomatic 31): App::show_item_menu has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/menus.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f60e31089eb5ead376b0a0651ad31fcf947b46ff13c3f6d03eb7a96454d79fe"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.html.fits (cyclomatic 31): settings.html.fits has cyclomatic complexity 31 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 3 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":"ui/settings.html"},"region":{"startLine":2534}}}],"partialFingerprints":{"codehealthFindingId/v1":"111e47ff121c2ca2eb6316615d080cebb2ee688d1541872fec5cdfb9b6bcfec2"}},{"ruleId":"D1","level":"warning","message":{"text":"LiveStandIn.Main (cyclomatic 30): LiveStandIn.Main has cyclomatic complexity 30 (threshold 15). Of this number, 29 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":"scripts/wintest/assets/live-wallpaper-standin.cs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"26dad6472fb376273151f3a9bb7e31d3737a78d979cd397bace924e9143b6e2e"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence_core::config_store::lint (cyclomatic 30): pecofence_core::config_store::lint 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/core/src/config_store.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08abb4f3ce05843b1446426a58511ec6e155147e5bc8f690ba81226199dd42d"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::fence_window::snap::size_among (cyclomatic 29): pecofence::fence_window::snap::size_among has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/snap.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9ff82a64a311edc29711b18d48566acc1effa07a66d4134f6f5a6e9390e0cf"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence_render::fence_chrome::draw_plate (cyclomatic 29): pecofence_render::fence_chrome::draw_plate has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/fence_chrome.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d21d42ed69f1a7cccdff940d1ac0cf539517a5448f1a7f8720c4d6e8eaf21a3"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence_platform::edit::handle (cyclomatic 28): pecofence_platform::edit::handle 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/platform/src/edit.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"909876c28a19ef0cb3ba5f04155b68439aeec23d56b6171a97c220204bca2eb5"}},{"ruleId":"D1","level":"warning","message":{"text":"measure-trailer-targets.main (cyclomatic 28): measure-trailer-targets.main 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":"extras/pecofence-promo/scripts/measure-trailer-targets.py"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"23407de121387422cf8f6f4498ab6b9b401513232968d8ce4413ee8c6d4b3d04"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.html.renderRules (cyclomatic 28): settings.html.renderRules has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 12 of the 28 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 2408, 2428, 2424). 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":"ui/settings.html"},"region":{"startLine":2392}}}],"partialFingerprints":{"codehealthFindingId/v1":"392e5cc4d826cda84d875b3e41e6dd0ed5e8c03958c094447d42712baff50087"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopAnchor::ensure_anchored (cyclomatic 27): DesktopAnchor::ensure_anchored has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/anchor.rs"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0fb8df1da5db52676ed62e7d429295d5ad3142f9ade6e9d232db9c1e9a1e79f"}},{"ruleId":"D1","level":"warning","message":{"text":"App::show_tray_menu (cyclomatic 27): App::show_tray_menu has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/menus.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b03b129f8619dee603a02bdc5236a926996bf170805609c169c8ce2d4271cab"}},{"ruleId":"D1","level":"warning","message":{"text":"FenceWindow::set_search_marks (cyclomatic 27): FenceWindow::set_search_marks has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/api.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9a9144fd78b7632c44d60a0ac985be8981fd14ab0ac47b18a18d1723a32166"}},{"ruleId":"D1","level":"warning","message":{"text":"PeekOverlay::show (cyclomatic 27): PeekOverlay::show has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/peek.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2db926d5ecad7ae6005a43879bfd28fd1943f86f84f7867717334b5d34761bc"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::fence_window::handler::nc::on_exitsizemove (cyclomatic 27): pecofence::fence_window::handler::nc::on_exitsizemove has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/nc.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b05973b035d3192705e63ee4276cd1ab13400404c9917165d4e292601c3009"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::marquee_offer::handle (cyclomatic 27): pecofence::marquee_offer::handle has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/marquee_offer.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"0755c05c2494eabd5bf185c116b397a0ee95c0e5e5eff8b8e113aa7016dd25b5"}},{"ruleId":"D1","level":"warning","message":{"text":"usage.validate (cyclomatic 27): usage.validate 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":"services/usage/src/usage.mjs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2791e85b8d0de55358430b4a87956c8c65677ab1f8ad06e5ea3c38a95f791d0"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.html.seRender (cyclomatic 27): settings.html.seRender has cyclomatic complexity 27 (threshold 15). Of this number, 25 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":"ui/settings.html"},"region":{"startLine":3440}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bbaf52d00f49acafe92a225278f12fa97521e66c3abeb6fc382dece9ffb127f"}},{"ruleId":"D1","level":"warning","message":{"text":"App::finish_live_capture (cyclomatic 26): App::finish_live_capture has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/live_wallpaper.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"952e6c561abc048b04178af30da7de01dce8c8c6b0f7c106a07f68c5d5049b73"}},{"ruleId":"D1","level":"warning","message":{"text":"IWICImagingFactory_Vtbl::new (cyclomatic 26): IWICImagingFactory_Vtbl::new has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 1 of the 26 points is its own statement and the rest belongs to 25 function items inside it that branch (CreateDecoderFromFilename, CreateDecoderFromStream, CreateDecoderFromFileHandle, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":17141}}}],"partialFingerprints":{"codehealthFindingId/v1":"292b7b82465de32f894862cf424db50bb5d3d0a0fe371b81b05dbf3687a2019b"}},{"ruleId":"D1","level":"warning","message":{"text":"manual.boot (cyclomatic 26): manual.boot has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 5 of the 26 points are its own statements and the rest belongs to 11 function items inside it that branch (a function literal at line 539, a function literal at line 555, a function literal at line 564, \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":"site/manual/manual.js"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c895d75599baf9a50b0624932daf9f97e24f9e9ab843857583db43fec44ad9f"}},{"ruleId":"D1","level":"warning","message":{"text":"App::on_fs_changed (cyclomatic 25): App::on_fs_changed 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/app/src/app/sync.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"577d8d53f3e7ee011953ae242ffa5999e15f742ef0c5381c1e37362502af4701"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::fence_window::handler::nc::hit_code (cyclomatic 25): pecofence::fence_window::handler::nc::hit_code has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/nc.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"886340a911848be97881d48cddbe5502a45b2f3d063ff8a3598ecbc6b7b6dc9d"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::rename::begin_rename_at (cyclomatic 25): pecofence::rename::begin_rename_at 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/app/src/rename.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8078dfec52661c4a6838fc9c1e2c1456f1604a17729c96591e8910146a1a35"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.html.searchSettings (cyclomatic 25): settings.html.searchSettings has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 4 of the 25 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1495, 1526). 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":"ui/settings.html"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b05c374e84cedfee4b5e20889f8cc7c5155763aafd68d9c88f77da134f77e1"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.html.renderUpdate (cyclomatic 25): settings.html.renderUpdate 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":"ui/settings.html"},"region":{"startLine":2836}}}],"partialFingerprints":{"codehealthFindingId/v1":"100404bab1ed31ae12e2a5fb2521b9607d5d5eb3d64c636ea4d2b73cad27fe46"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.html.seValues (cyclomatic 25): settings.html.seValues has cyclomatic complexity 25 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 7 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":"ui/settings.html"},"region":{"startLine":3177}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4aea322fc383330107ae3b7abe546c4861ad7416963732277a76ff3e36ed94"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.html.seSpec (cyclomatic 25): settings.html.seSpec has cyclomatic complexity 25 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 9 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":"ui/settings.html"},"region":{"startLine":3248}}}],"partialFingerprints":{"codehealthFindingId/v1":"6491afdad9fb5e383b5dca1b9a4aaab421961744da797ae6b763994f771942f2"}},{"ruleId":"D1","level":"warning","message":{"text":"App::apply_cell_snap (cyclomatic 24): App::apply_cell_snap has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/fences.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf3ce2631f6bd3a82bbb813e7e2756db7f22c815ec0321be4ba838161f3ceee"}},{"ruleId":"D1","level":"warning","message":{"text":"FenceViewState::tip_text (cyclomatic 24): FenceViewState::tip_text has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/tooltip.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"e450ef136266ba03be5e77b1a8bf7e28daf6202d871ca66744a0b97cdcf2cab5"}},{"ruleId":"D1","level":"warning","message":{"text":"SettingsHost::open (cyclomatic 24): SettingsHost::open has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/settings_host.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5420595e4a8d629205c82c733247305b91fe2508f77cc0eb9181bdd5c0e11c9"}},{"ruleId":"D1","level":"warning","message":{"text":"FenceChrome::draw_script (cyclomatic 24): FenceChrome::draw_script has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/fence_chrome.rs"},"region":{"startLine":5314}}}],"partialFingerprints":{"codehealthFindingId/v1":"356d51b99a2474ca68c90ee9d9de4684e18c5e0c14152f3b3b0a4d7c77389ff3"}},{"ruleId":"D1","level":"warning","message":{"text":"index.validate (cyclomatic 24): index.validate 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":"services/feedback/src/index.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe447ba917d1db2f4e20147d737ce1ee509327da65fb32ba8e835867bfbc1a8"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.html.condLabel (cyclomatic 24): settings.html.condLabel has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":2301}}}],"partialFingerprints":{"codehealthFindingId/v1":"540a976d17d1cdec4732cb0648b4315116ae4fedb910205447c440c4e10333e5"}},{"ruleId":"D1","level":"warning","message":{"text":"App::ipc_events_tick (cyclomatic 23): App::ipc_events_tick has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/ipc.rs"},"region":{"startLine":2989}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8fc6e4dde3e1321bf28ca6eb32c5ae9a19b55bf737127b0f7eb4d8c59ab3c3"}},{"ruleId":"D1","level":"warning","message":{"text":"FenceDropHandler::feedback (cyclomatic 23): FenceDropHandler::feedback has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/dnd.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef18913a87e99867ee186e596cc98130c624b8864497ed0cb8e1fc657bcff5d"}},{"ruleId":"D1","level":"warning","message":{"text":"FenceViewState::draw_chrome_panel (cyclomatic 23): FenceViewState::draw_chrome_panel 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":"crates/app/src/fence_window/render.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab41ebc84ee4f6c9095a8aeba3d3b386e6fb10dea742f86e666452a941b6a59"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::app::ipc::patch_settings_path (cyclomatic 23): pecofence::app::ipc::patch_settings_path has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/ipc.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9d8aba28090fb57d018fb35e7ee930f4417bdf43ed718be082782a6b062c25"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::app::push::stack (cyclomatic 23): pecofence::app::push::stack has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/push.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0615312b391fb014922f8f32ce87baa103f99602ad130a36b175d9f24636b7"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::fence_window::handler::mouse::on_mousewheel (cyclomatic 23): pecofence::fence_window::handler::mouse::on_mousewheel has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/mouse.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"435f4d1ae8ca6cecb52485ef88ae162f32c24eaf86d16c6755b0ef19eff8919f"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::note_edit::tell_fence (cyclomatic 23): pecofence::note_edit::tell_fence has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/note_edit.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e3d2ed5e99448ac4d7f7fd00c150d06cec897734cd64265e6a9ea7887c71e5d"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence_core::smart::everything_term (cyclomatic 23): pecofence_core::smart::everything_term has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/smart.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"9adbcc0fc64013c9278a00fa7980a004290252a4fc7bae0eb8dfeb345375cc64"}},{"ruleId":"D1","level":"warning","message":{"text":"FrameClock::start (cyclomatic 23): FrameClock::start has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/frameclock.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9544b396c31c6e0727b2cfcbb0c7b1008006c392bb98460cf2820f2899b076"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::fence_window::handler::nc::on_ncmousemove (cyclomatic 22): pecofence::fence_window::handler::nc::on_ncmousemove has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/nc.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c96911b4ef8ab8107d935b54f744c7d1ca77a4ce15208a8c08bbefd6831dc1"}},{"ruleId":"D1","level":"warning","message":{"text":"Layout::normalize_tabs (cyclomatic 22): Layout::normalize_tabs has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/model.rs"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"39fb46cbc06e427973dc7e08d3f2ec34a33a4374e6720fcffcaac77a10296403"}},{"ruleId":"D1","level":"warning","message":{"text":"FenceViewState::start_roll_anim (cyclomatic 21): FenceViewState::start_roll_anim has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/roll.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea6945967cdabfa64f39a19e7d49a044907d6372e2b2232a95180dcd0dc0ebc"}},{"ruleId":"D1","level":"warning","message":{"text":"ShadowWindow::update (cyclomatic 21): ShadowWindow::update has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/shadow.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d255621ab33fb90ef9a26e2d9d36c2bc63264487e346f347eed53aefdb8a97"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::fence_window::hit::resize_edge_at (cyclomatic 21): pecofence::fence_window::hit::resize_edge_at 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":"crates/app/src/fence_window/hit.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"65340f79e2f7248442b8614d0b7797453f3598159aeb96c660940774be3db7d9"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::fence_window::window_drag::flush_window_drag (cyclomatic 21): pecofence::fence_window::window_drag::flush_window_drag has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/window_drag.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d0801acdc2a0f460d04348d7bfc629314ca74120c517c3b1fbd91fbef57aefe"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence_core::rules::cond_matches (cyclomatic 21): pecofence_core::rules::cond_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":"crates/core/src/rules.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90bcf9967fabb7612a0d78793307ee63130336cf772ced5c8dbfe48f75d82d7"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.html.pinyinRun (cyclomatic 21): settings.html.pinyinRun 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":"ui/settings.html"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe2556674f03aa2a8510ea46f28769c8969a93d968b1785691ae38abd5128a8"}},{"ruleId":"D1","level":"warning","message":{"text":"App::on_desktop_marquee (cyclomatic 20): App::on_desktop_marquee has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/group.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"baed89c9c526af906416133ca29f25118c6ed1c0f7c78f9a2904404210dba65c"}},{"ruleId":"D1","level":"warning","message":{"text":"App::plan_item_move (cyclomatic 20): App::plan_item_move has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/ipc.rs"},"region":{"startLine":2590}}}],"partialFingerprints":{"codehealthFindingId/v1":"38423bfef0530d85b39e295a5722ade66feeb45f0bba6734bca60ff5606212e0"}},{"ruleId":"D1","level":"warning","message":{"text":"App::on_editor_message (cyclomatic 20): App::on_editor_message has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/smart_editor.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"d691042bedc0f8bd9c77167d1a221bd132d88401c965b1139692fde6d26b8dc6"}},{"ruleId":"D1","level":"warning","message":{"text":"App::detach_tab (cyclomatic 20): App::detach_tab has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/tabs.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad68a942e68a0370495c6f1e48f6db37aef1678ed4efbe2cf8eee42350fb980"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::fence_window::handler::mouse::on_lbuttondblclk (cyclomatic 20): pecofence::fence_window::handler::mouse::on_lbuttondblclk has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/mouse.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"935fe6e7c5ac7f1173190549a277486b8d6c91d05df81f9833578ea69e4bc349"}},{"ruleId":"D1","level":"warning","message":{"text":"FenceChrome::draw_content (cyclomatic 20): FenceChrome::draw_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":"crates/render/src/fence_chrome.rs"},"region":{"startLine":4422}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a88b96f2d1325adae16f1236438b65cd1e80047a7039be663be9bd1dc47f0b"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.html.seRowsOf (cyclomatic 20): settings.html.seRowsOf 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":"ui/settings.html"},"region":{"startLine":3106}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b6ada8d12db7c2e1b72f66c6fdb389586ab4315be5e29a8f04405a94877599"}},{"ruleId":"D1","level":"warning","message":{"text":"App::build_item_menu (cyclomatic 19): App::build_item_menu has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/menus.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa357dfda904b9e463eea9b5b8a0a528d5ad46e06e82e8bbde6c7d059aa82a3a"}},{"ruleId":"D1","level":"warning","message":{"text":"App::show_search_actions (cyclomatic 19): App::show_search_actions has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/search.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"33edfa4c76cb5f55813c0af6bca39c54086aa00c4762d17616ec424219670e20"}},{"ruleId":"D1","level":"warning","message":{"text":"App::run_smart (cyclomatic 19): App::run_smart has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/smart.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92a8d36d93d58724f0654bc0398b7ec19c4c0687b1c61c99ce1fd9a86f00f84"}},{"ruleId":"D1","level":"warning","message":{"text":"App::welcome_texts (cyclomatic 19): App::welcome_texts has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/welcome.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb6b902183c45299c5d3e13001abc3af0df38b6dd17d7f3fa3150100da4ab66"}},{"ruleId":"D1","level":"warning","message":{"text":"FenceViewState::tick (cyclomatic 19): FenceViewState::tick has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/frame.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"231679e0f07c81e4cb0b85de46563b04a1a53c096f6b5b14d9b2b97a85340a4a"}},{"ruleId":"D1","level":"warning","message":{"text":"IconCache::new (cyclomatic 19): IconCache::new has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/icons.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fa9d998c9b343713f1865ee73406f7c53d6d4f92efa1d33ecdf3df8516b668"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence_core::geometry::keep_groups_together (cyclomatic 19): pecofence_core::geometry::keep_groups_together has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/geometry.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6455c87805aa5d5dd2de5019dfea48b858d5ef71e5da248b8650224830e8da3"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.html.fbSend.onclick (cyclomatic 19): settings.html.fbSend.onclick 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":"ui/settings.html"},"region":{"startLine":2982}}}],"partialFingerprints":{"codehealthFindingId/v1":"604049970fed69d040e112416b0b5ce7965ffc12e7314238f848c011d0230270"}},{"ruleId":"D1","level":"warning","message":{"text":"DesktopAnchor::on_foreground (cyclomatic 18): DesktopAnchor::on_foreground 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/app/src/anchor.rs"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"af424062744eecb9f62cf4a9ec5678e0a52252376407e6f3e875434996aa471f"}},{"ruleId":"D1","level":"warning","message":{"text":"App::capture_live_wallpapers (cyclomatic 18): App::capture_live_wallpapers has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/live_wallpaper.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"253ba0dfc2e9eb4c3c8b3b47beccbc6ad6a1b22412417b97ce852805665e6efb"}},{"ruleId":"D1","level":"warning","message":{"text":"App::show_update_card (cyclomatic 18): App::show_update_card has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/updates.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5cbb8b6dfabd298496b54c137364496d3b5ccf04a83f423639bea0f2d2f975"}},{"ruleId":"D1","level":"warning","message":{"text":"App::refresh_visuals (cyclomatic 18): App::refresh_visuals has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/visuals.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c754df0be8cd1633e8ba6ac4ca71e62048028c2029ea74645240fd3188894f3"}},{"ruleId":"D1","level":"warning","message":{"text":"FenceWindow::test_input (cyclomatic 18): FenceWindow::test_input has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/api.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"50edac21afcc0c3de17ee12b7648c2c1698e18c3331a3c1559b5bc25e2e6c856"}},{"ruleId":"D1","level":"warning","message":{"text":"FenceViewState::ensure_icons_and_labels (cyclomatic 18): FenceViewState::ensure_icons_and_labels 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/app/src/fence_window/render.rs"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a3453570a559e8e1a4d794d4e270201f6ae0e6d38e2ca4a2426cb9e7f78e8e"}},{"ruleId":"D1","level":"warning","message":{"text":"FenceViewState::redraw_content (cyclomatic 18): FenceViewState::redraw_content has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/render.rs"},"region":{"startLine":1961}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d72b42d0493c89f35e1025f9fcbd3f217f24bc96b0c2a3897e9ac714d9f0265"}},{"ruleId":"D1","level":"warning","message":{"text":"Values::apply (cyclomatic 18): Values::apply 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: Values::parse (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/custom_theme.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"53212554ac19ae5e10b49699c4f64069e2a76f0dcd52549e587aca4cc8198b68"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence_render::liquid_glass::displacement_field (cyclomatic 18): pecofence_render::liquid_glass::displacement_field 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/render/src/liquid_glass.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cf4d99d5f4fcb5d3bc3269228a8ddd076247f57b452cbd8dee1c27e08936ab"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.html.renderSwatches (cyclomatic 18): settings.html.renderSwatches has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 7 of the 18 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 1987, 2009, 1981, \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":"ui/settings.html"},"region":{"startLine":1980}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad8d0046079777becb2ae9a3e57229f32836b5e04849f594915b3be8e75a9ec"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.html.newCond (cyclomatic 18): settings.html.newCond has cyclomatic complexity 18 (threshold 15). Of this number, 16 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":"ui/settings.html"},"region":{"startLine":2565}}}],"partialFingerprints":{"codehealthFindingId/v1":"a676a56cd69e19aab119a01554ef72575aa4c491b0a0e6a3df5b25e96833a52f"}},{"ruleId":"D1","level":"warning","message":{"text":"App::follow_desktops (cyclomatic 17): App::follow_desktops has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/vdesktops.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"3964b2703b177a2bbe77e7ea5d3e506497387c658be261c82c6616b882b704af"}},{"ruleId":"D1","level":"warning","message":{"text":"FenceViewState::reflow_items (cyclomatic 17): FenceViewState::reflow_items 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/app/src/fence_window/items.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"da5fd4a224e42950c00ac14c9b3acdcd88eecbaa395045609f2cc4e3615b1a3d"}},{"ruleId":"D1","level":"warning","message":{"text":"FenceViewState::update_backdrop_at (cyclomatic 17): FenceViewState::update_backdrop_at has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/render.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4492829acd17a886fdd02a0fdc8647dec1216c57784930c9c7dc1972da83bc"}},{"ruleId":"D1","level":"warning","message":{"text":"AppState::load (cyclomatic 17): AppState::load has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/state.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c65741f8709f59cb02bd42856e22794561476d04c59e024ad78d876b92ab7e"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::app::visuals::monitor_recipes (cyclomatic 17): pecofence::app::visuals::monitor_recipes 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/app/src/app/visuals.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"493048a3acd63ab024379deea9be50a1627e3bff6eaaa7b6f1a59a890dfa9f47"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::fence_window::handler::mouse::on_mouseleave (cyclomatic 17): pecofence::fence_window::handler::mouse::on_mouseleave 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/app/src/fence_window/handler/mouse.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e8ec58146f5619ac6eaacf4d1d07914d2c616c23c0a695d5e2c45ea19e17514"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::fence_window::handler::nc::on_sizing (cyclomatic 17): pecofence::fence_window::handler::nc::on_sizing has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/nc.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"24d80f1fe71222253683892871fe286fb588861a45c3d36214ad5a08b016477b"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::share_log::numeric_shape (cyclomatic 17): pecofence::share_log::numeric_shape 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/app/src/share_log.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ba7a2234356598690a6c6a79a9a13c3b93b420860d237d9e0c5e48e5798c15"}},{"ruleId":"D1","level":"warning","message":{"text":"App::open_search_row (cyclomatic 16): App::open_search_row 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/app/src/app/search.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"18db2fec99f7fb807096bd38a95e0fb2bd40a69aafaff7149afc969eb4eae0d5"}},{"ruleId":"D1","level":"warning","message":{"text":"FenceViewState::up_button_at (cyclomatic 16): FenceViewState::up_button_at has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/hit.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e5ecc006a8e0e8c0f5132c2a5291b5f0a17fc015492cc9a8091a776274827b"}},{"ruleId":"D1","level":"warning","message":{"text":"AppState::plan_rules (cyclomatic 16): AppState::plan_rules 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/app/src/state.rs"},"region":{"startLine":2683}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a68215931da5e42dac0ada06cb4be0d742d164be4c4c085e8826e313eadc76"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::fence_window::handler::timers::on_timer_hover_select (cyclomatic 16): pecofence::fence_window::handler::timers::on_timer_hover_select 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/app/src/fence_window/handler/timers.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"04dc0017fbef3dcdf0620f44fd03d8b520e5a362ec9d4e8054ec60934ea2117f"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence::ipc_server::read_request (cyclomatic 16): pecofence::ipc_server::read_request has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/ipc_server.rs"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"9effa19841232ab47dd8d0f3bd6b8974eb20673bcd5be115a233174f8fa31933"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence_core::model::pair_monitors (cyclomatic 16): pecofence_core::model::pair_monitors 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/core/src/model.rs"},"region":{"startLine":1944}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbbc4d1c2d850f16ce2b63e3d5f6f42f5c62bdc26df2506f2f98c09de081fd5"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence_core::rules::category_matches (cyclomatic 16): pecofence_core::rules::category_matches has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/rules.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd19ddc6a20adae9328e1298e4dbff0e3818407b57436c03d7b49871b1f8860d"}},{"ruleId":"D1","level":"warning","message":{"text":"NoticeCard::draw (cyclomatic 16): NoticeCard::draw has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/notice.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"652ef3637ed0ff4054ef9746445f36a718d2af83dfc5c549a5a5134d633bad3a"}},{"ruleId":"D1","level":"warning","message":{"text":"pecofence_render::liquid_glass::crop_with_neighbors (cyclomatic 16): pecofence_render::liquid_glass::crop_with_neighbors 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/render/src/liquid_glass.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1952c286b314b74ce6203fed82215de47df57c34d6609fd7a5335523d9464af"}},{"ruleId":"D1","level":"warning","message":{"text":"measure-trailer-targets.tabstrip (cyclomatic 16): measure-trailer-targets.tabstrip 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":"extras/pecofence-promo/scripts/measure-trailer-targets.py"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"c72af2e2b7b0211eafd6770ceb9e3abb1c371531bfcd0ccc9a258431a2f22465"}},{"ruleId":"D1","level":"warning","message":{"text":"settings.html.matchText (cyclomatic 16): settings.html.matchText 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":"ui/settings.html"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"103b399d66be68661e1cad57f4483e204801f99ee85ab669eab648c4252bc5ed"}},{"ruleId":"D1","level":"warning","message":{"text":"fetch (cyclomatic 16): fetch 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":"services/feedback/src/index.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ce8cda1c73aeff3a430984bfc7a6368a206ff302b655caeb6d335a94d537c9"}},{"ruleId":"D2","level":"warning","message":{"text":"App::create (cognitive 355): App::create has cognitive complexity 355 (threshold 15). Drivers by points: if/else 144 (272 pts), boolean chains 57, match/switch 13 (24 pts), loops 2 (nesting depth added 139). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/mod.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea374f9d9a937fc55903bdc468260ffc220482abeb1d52f10045c0a052d7088"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceChrome::draw (cognitive 199): FenceChrome::draw has cognitive complexity 199 (threshold 15). Drivers by points: if/else 87 (169 pts), boolean chains 19, match/switch 4 (6 pts), loops 2 (5 pts) (nesting depth added 87). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/fence_chrome.rs"},"region":{"startLine":2998}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2898304825ce14cb88eb7680a9da2158d8537539a953e009d2d48a586dfaed7"}},{"ruleId":"D2","level":"warning","message":{"text":"App::test_step (cognitive 166): App::test_step has cognitive complexity 166 (threshold 15). Drivers by points: if/else 40 (119 pts), match/switch 6 (20 pts), boolean chains 16, loops 4 (11 pts) (nesting depth added 100). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/testscript.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"77df9ff7d7160856d4fc9f1976c0504ecd806ee4b8364665a6b5b93f9a7db961"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::fence_window::handler::mouse_move::on_mousemove (cognitive 148): pecofence::fence_window::handler::mouse_move::on_mousemove has cognitive complexity 148 (threshold 15). Drivers by points: if/else 67 (104 pts), boolean chains 35, match/switch 4 (9 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":"crates/app/src/fence_window/handler/mouse_move.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"38107674d9f84c9f0cfa51e4154be869ac9017a79469032a990d9e657dbaa3b4"}},{"ruleId":"D2","level":"warning","message":{"text":"App::handle (cognitive 136): App::handle has cognitive complexity 136 (threshold 15). Drivers by points: if/else 44 (97 pts), loops 9 (25 pts), boolean chains 13, match/switch 1 (nesting depth added 69). 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/app/src/app/mod.rs"},"region":{"startLine":2757}}}],"partialFingerprints":{"codehealthFindingId/v1":"9930580c28ec28c87ead5d284b5b780e47d9edf321882e63e68b6f6350f6cfa6"}},{"ruleId":"D2","level":"warning","message":{"text":"make-trailer-audio.compose_music (cognitive 132): make-trailer-audio.compose_music has cognitive complexity 132 (threshold 15). Drivers by points: if/else 23 (62 pts), loops 23 (33 pts), ternaries 11 (32 pts), boolean chains 5 (nesting depth added 70). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extras/pecofence-promo/scripts/make-trailer-audio.py"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"caca8e4152591f5c0b7894f5ab99ddcd937aa8395352561edb5d805b329ee56c"}},{"ruleId":"D2","level":"warning","message":{"text":"App::on_settings_message (cognitive 122): App::on_settings_message has cognitive complexity 122 (threshold 15). Drivers by points: if/else 36 (93 pts), match/switch 8 (23 pts), boolean chains 6 (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":"crates/app/src/app/settings.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b87bb32b94bf95d6a5639cc70165f473142090b5161e9382b11b591759b90d9"}},{"ruleId":"D2","level":"warning","message":{"text":"App::show_fence_menu (cognitive 113): App::show_fence_menu has cognitive complexity 113 (threshold 15). Drivers by points: if/else 53 (88 pts), loops 5 (13 pts), boolean chains 7, match/switch 3 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/menus.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e3b1342b343c033d1056877040b84f16a88bc243c5853e9ea099fd272adad5d"}},{"ruleId":"D2","level":"warning","message":{"text":"App::ipc_dispatch (cognitive 107): App::ipc_dispatch has cognitive complexity 107 (threshold 15). Drivers by points: if/else 45 (91 pts), boolean chains 13, match/switch 2 (3 pts) (nesting depth added 47). 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/app/src/app/ipc.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"48876ffec613fa31e164af929e59c4928506fee5213b4098c5f67ebb8e9e395c"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState::sync_desktop_partly_read (cognitive 100): AppState::sync_desktop_partly_read has cognitive complexity 100 (threshold 15). Drivers by points: if/else 31 (82 pts), boolean chains 9, match/switch 3 (5 pts), loops 4 (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":"crates/app/src/state.rs"},"region":{"startLine":1479}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66e00771a02a94995d868af24b8f27e4409b7bd63c696cffe088e8e5ee53869"}},{"ruleId":"D2","level":"warning","message":{"text":"make-trailer-audio.compose_sfx (cognitive 90): make-trailer-audio.compose_sfx has cognitive complexity 90 (threshold 15). Drivers by points: ternaries 13 (42 pts), if/else 13 (30 pts), loops 6 (15 pts), boolean chains 3 (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extras/pecofence-promo/scripts/make-trailer-audio.py"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"3392ad255b0a9b9e3a979d0cfeeab5a0c7373e4f82468922fa6562bfd263c3fa"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceChrome::draw_tab_list (cognitive 84): FenceChrome::draw_tab_list has cognitive complexity 84 (threshold 15). Drivers by points: if/else 42 (71 pts), boolean chains 7, loops 3 (4 pts), match/switch 2 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/fence_chrome.rs"},"region":{"startLine":3777}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aea0a905854378dc43418fbbcc97427fa2e6ed839cc5f64ab1790aa915c434a"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceDropHandler::drop (cognitive 80): FenceDropHandler::drop has cognitive complexity 80 (threshold 15). Drivers by points: if/else 38 (73 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/dnd.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"3221c316c8c2b44e0a5bdc1d9a60116b52aacc0ef7d7a03f1258bf3a0e8ec771"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceViewState::replace_items (cognitive 79): FenceViewState::replace_items has cognitive complexity 79 (threshold 15). Drivers by points: if/else 33 (47 pts), boolean chains 25, loops 3 (5 pts), match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/items.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"939c6467814a9aabfb699cce6df40ed567d1c7f8bf3886eb18139a6a1e40f94b"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::peek_search::paint_box (cognitive 79): pecofence::peek_search::paint_box has cognitive complexity 79 (threshold 15). Drivers by points: if/else 41 (62 pts), boolean chains 6, loops 5 (6 pts), match/switch 3 (5 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/peek_search.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a9e4adcee772dab122dfc520209db6197eca1c5171851074f9612d75711665"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceChrome::draw_note (cognitive 73): FenceChrome::draw_note has cognitive complexity 73 (threshold 15). Drivers by points: if/else 24 (50 pts), loops 5 (15 pts), match/switch 4 (6 pts), boolean chains 2 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/fence_chrome.rs"},"region":{"startLine":4876}}}],"partialFingerprints":{"codehealthFindingId/v1":"172b2289507bd6c8df11452974a3f63e2b22aa8add5d24f3af43c12b476c66ae"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::app::fence_options::parse_fence_prop (cognitive 67): pecofence::app::fence_options::parse_fence_prop has cognitive complexity 67 (threshold 15). Drivers by points: match/switch 21 (43 pts), if/else 11 (21 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 33). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own 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/app/src/app/fence_options.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"32066aee004f5b3c848f9daf7f22f62e528294a75f15c26220ac5d3970ee296d"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceChrome::draw_rows (cognitive 66): FenceChrome::draw_rows has cognitive complexity 66 (threshold 15). Drivers by points: if/else 31 (51 pts), loops 4 (7 pts), boolean chains 6, match/switch 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/fence_chrome.rs"},"region":{"startLine":4051}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d71a6187905f7622d0761afc8990426f09a850a6904f33d21301fc19246242"}},{"ruleId":"D2","level":"warning","message":{"text":"App::apply_undo (cognitive 62): App::apply_undo has cognitive complexity 62 (threshold 15). Drivers by points: if/else 16 (38 pts), loops 5 (13 pts), match/switch 3 (6 pts), boolean chains 5 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/undo.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c7ab397d55df73e0c1d1125a8c0aedc25118bf2e3125fb1af985d7a37834b9"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::fence_window::handler::keyboard::on_keydown (cognitive 60): pecofence::fence_window::handler::keyboard::on_keydown has cognitive complexity 60 (threshold 15). Drivers by points: if/else 25 (40 pts), boolean chains 15, match/switch 2 (3 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":"crates/app/src/fence_window/handler/keyboard.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"99edcdf61c74c23839676e40848970b19db26101353c8a515a3c7e4b60465a98"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::fence_window::handler::mouse::on_lbuttondown (cognitive 60): pecofence::fence_window::handler::mouse::on_lbuttondown has cognitive complexity 60 (threshold 15). Drivers by points: if/else 30 (44 pts), boolean chains 13, match/switch 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/mouse.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb049b578dd70969f0395e77be45633c5956d7be22451dcdd032ae23c2af17da"}},{"ruleId":"D2","level":"warning","message":{"text":"App::reflow_pushed_once (cognitive 59): App::reflow_pushed_once has cognitive complexity 59 (threshold 15). Drivers by points: if/else 25 (40 pts), boolean chains 13, loops 5 (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":"crates/app/src/app/push.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf817bb6a774fb5b37b24f6072c3bdf4eb5fe758abea74155550888992a0459"}},{"ruleId":"D2","level":"warning","message":{"text":"settings.html.seRead (cognitive 58): settings.html.seRead has cognitive complexity 58 (threshold 15). Drivers by points: ternaries 11 (24 pts), if/else 11 (23 pts), boolean chains 10, match/switch 1 (nesting depth added 25). Of this number, 56 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":"ui/settings.html"},"region":{"startLine":3203}}}],"partialFingerprints":{"codehealthFindingId/v1":"48e3193e37859c9d120beb338aa69c5df56d3740268476c48469224037c2fdb2"}},{"ruleId":"D2","level":"warning","message":{"text":"App::apply_settings (cognitive 57): App::apply_settings has cognitive complexity 57 (threshold 15). Drivers by points: if/else 28 (35 pts), boolean chains 10, loops 4 (8 pts), match/switch 2 (4 pts) (nesting depth added 13). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/settings.rs"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8744c925fcfda1fe6d78e5c80837b40278a60a3f6aa157464b842d07b89bd5"}},{"ruleId":"D2","level":"warning","message":{"text":"settings.html.readCond (cognitive 56): settings.html.readCond has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (27 pts), ternaries 9 (18 pts), boolean chains 11 (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":"ui/settings.html"},"region":{"startLine":2682}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d7e4bc190ace8d395455be3037724a11f9a2e3942285d8317dd8b9de4dcf21"}},{"ruleId":"D2","level":"warning","message":{"text":"measure-trailer-targets.main (cognitive 55): measure-trailer-targets.main has cognitive complexity 55 (threshold 15). Drivers by points: if/else 12 (33 pts), loops 14 (21 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":"extras/pecofence-promo/scripts/measure-trailer-targets.py"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ecbba3479d1a6809581675dd169cbb5963616de02410a2d4f0f34627c8302e"}},{"ruleId":"D2","level":"warning","message":{"text":"settings.html.renderFences (cognitive 55): settings.html.renderFences has cognitive complexity 55 (threshold 15). Drivers by points: boolean chains 28, if/else 15 (18 pts), ternaries 4 (8 pts), loops 1 (nesting depth added 7). Of this number, 30 points are the body\u0027s own statements and 25 belong to 6 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":"ui/settings.html"},"region":{"startLine":2108}}}],"partialFingerprints":{"codehealthFindingId/v1":"efadc335567c05c2d39f6b36a274ccd91bb398c115d63e77623d809707b6a32b"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceWindow::set_tabs (cognitive 51): FenceWindow::set_tabs has cognitive complexity 51 (threshold 15). Drivers by points: if/else 20 (33 pts), boolean chains 13, loops 1 (3 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":"crates/app/src/fence_window/api.rs"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cd6634e2e0896faaa326a19c8daefdd920d1a1ce10ac5d43cde55dd8795a80"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::note_edit::on_key (cognitive 51): pecofence::note_edit::on_key has cognitive complexity 51 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 17, match/switch 3 (7 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/note_edit.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"888bbf599ca044648794548653177d5438b9696e90c97a82e0b83045cafd7c74"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence_render::fence_chrome::draw_plate (cognitive 51): pecofence_render::fence_chrome::draw_plate has cognitive complexity 51 (threshold 15). Drivers by points: if/else 23 (35 pts), loops 2 (7 pts), boolean chains 5, match/switch 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":"crates/render/src/fence_chrome.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a093cad6dab486c49dab2cfa048f8a816f69f9bd3ca1c3e3220261699a86de"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::fence_window::handler::mouse::on_lbuttonup (cognitive 50): pecofence::fence_window::handler::mouse::on_lbuttonup has cognitive complexity 50 (threshold 15). Drivers by points: if/else 25 (39 pts), boolean chains 7, match/switch 3 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/mouse.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"16516dcc81b9a4e4662e5a5f50b90c759a0c57914ff747eae2e3a6c780b7b24e"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::fence_window::handler::mouse::on_mousewheel (cognitive 50): pecofence::fence_window::handler::mouse::on_mousewheel has cognitive complexity 50 (threshold 15). Drivers by points: if/else 19 (40 pts), boolean chains 6, loops 1 (4 pts) (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/mouse.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4cda3edecae407f7d3f1034edb4fbf5daaf09944977c1af336e0721d39030f"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopAnchor::ensure_anchored (cognitive 49): DesktopAnchor::ensure_anchored has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (37 pts), boolean chains 6, match/switch 1 (4 pts), loops 1 (2 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":"crates/app/src/anchor.rs"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"4506be06a8e8be775393d23822be116a55c98671a799def46a4fc1d6664d5ba4"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence_core::config_store::lint (cognitive 48): pecofence_core::config_store::lint has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (29 pts), match/switch 3 (8 pts), loops 4 (6 pts), boolean chains 5 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/config_store.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"2393c35b4e39121307ff2b72b9a798620317ed2558e4d3b13d9ac87f437755da"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::notice::handle (cognitive 47): pecofence::notice::handle has cognitive complexity 47 (threshold 15). Drivers by points: if/else 18 (35 pts), boolean chains 9, match/switch 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":"crates/app/src/notice.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9e598f75465135793440a4b76364bd21ec53ce0611a921f72328a43e48eb88"}},{"ruleId":"D2","level":"warning","message":{"text":"LiveStandIn.Main (cognitive 46): LiveStandIn.Main has cognitive complexity 46 (threshold 15). Of this number, 44 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":"scripts/wintest/assets/live-wallpaper-standin.cs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0f18612ac4f9ae996cb656a57a0aa8025ce78236fa2770fee0c1ec06a85ea2"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopAnchor::on_timer (cognitive 46): DesktopAnchor::on_timer has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (36 pts), boolean chains 9, match/switch 1 (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":"crates/app/src/anchor.rs"},"region":{"startLine":2138}}}],"partialFingerprints":{"codehealthFindingId/v1":"12cbb4ccd313a7971e38c548e00c3b665e657c7db43122ed3d1395f51360cddf"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceWindow::set_search_marks (cognitive 46): FenceWindow::set_search_marks has cognitive complexity 46 (threshold 15). Drivers by points: if/else 24 (39 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/api.rs"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6504e53b9ff923c38dad8193c2579273e3237c12a5ed768865b7cc1e4e549e1"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::app::push::stack (cognitive 45): pecofence::app::push::stack has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 4 (7 pts), match/switch 2 (5 pts), boolean chains 4 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/push.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e63285ed23abb7f55c671a3d8e5edeeabfa502585e5a07052c37a0a0eae080"}},{"ruleId":"D2","level":"warning","message":{"text":"IconCache::new (cognitive 44): IconCache::new has cognitive complexity 44 (threshold 15). Drivers by points: if/else 10 (32 pts), boolean chains 6, loops 2 (3 pts), match/switch 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":"crates/app/src/icons.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dadae37756bd899eb6e5da507436428b32cdaf4d8c54c514f061c365f723200"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceChrome::draw_script (cognitive 44): FenceChrome::draw_script has cognitive complexity 44 (threshold 15). Drivers by points: if/else 21 (37 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/fence_chrome.rs"},"region":{"startLine":5314}}}],"partialFingerprints":{"codehealthFindingId/v1":"b129d67b6d557bac8e2113ee558837d2243b067aed096b6b8deef8b5e38c5c68"}},{"ruleId":"D2","level":"warning","message":{"text":"App::on_fileop_done (cognitive 41): App::on_fileop_done has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 9 (14 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/fileops.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0027e10fda61417b56b383e1fae0e8924776e111ebbb983dbf6a1e9239e6686"}},{"ruleId":"D2","level":"warning","message":{"text":"App::on_fs_changed (cognitive 41): App::on_fs_changed has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 5 (9 pts), boolean chains 6, match/switch 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":"crates/app/src/app/sync.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d48dbd179da7b58116850c2d51dadcbdd0545f6d54757ccd79c15a26387f7d"}},{"ruleId":"D2","level":"warning","message":{"text":"App::finish_live_capture (cognitive 38): App::finish_live_capture has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 8, loops 4 (5 pts), match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/live_wallpaper.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ebc2f88cd655e0c81caad364fcb670633eb806710b99451491a3bde4b943bf"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence_render::liquid_glass::displacement_field (cognitive 38): pecofence_render::liquid_glass::displacement_field has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (27 pts), loops 4 (6 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":"crates/render/src/liquid_glass.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2ac95872d9220a7df7802d2c60dac2ff6716f81db4c37ee6e1d262dc392014"}},{"ruleId":"D2","level":"warning","message":{"text":"settings.html.pinyinRun (cognitive 38): settings.html.pinyinRun has cognitive complexity 38 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 4 (10 pts), boolean chains 8 (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":"ui/settings.html"},"region":{"startLine":1429}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1e69fcbeeffb5ae53ba3dbc4e744b37b7db59f75ac6e5f78e1d4d689ec21fb"}},{"ruleId":"D2","level":"warning","message":{"text":"FrameClock::start (cognitive 37): FrameClock::start has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 5, match/switch 2 (5 pts), loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/frameclock.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4dab8417f5aa65898f1a94858df0d14e42becdc836590190df3131637a1dc7f"}},{"ruleId":"D2","level":"warning","message":{"text":"settings.html.slider (cognitive 37): settings.html.slider has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (19 pts), ternaries 5 (8 pts), boolean chains 7, loops 3 (nesting depth added 7). Most of this is not in the body itself: 5 of the 37 points are its own statements and the rest belongs to 11 function items inside it that branch (a function literal at line 1104, fit, finish, \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":"ui/settings.html"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9b3a764340edda2f04fef8d5618f3a0a28507c39ee3fadc05b43a67436c6d1"}},{"ruleId":"D2","level":"warning","message":{"text":"App::ipc_events_tick (cognitive 36): App::ipc_events_tick has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 7 (8 pts), match/switch 3 (7 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/app/src/app/ipc.rs"},"region":{"startLine":2989}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b55d09262d228355ce7d6f4ca73086d76cd98686007848ca9aa3ab5ad69815"}},{"ruleId":"D2","level":"warning","message":{"text":"App::script_row_clicked (cognitive 36): App::script_row_clicked has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 5 (7 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/tools.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b64eb1124eebc6747f4363be1f441939b466c5017bea9dbbc584cd1cdd5bdc1"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::fence_window::snap::size_among (cognitive 35): pecofence::fence_window::snap::size_among has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (23 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":"crates/app/src/fence_window/snap.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c3cc7d450e11090a763495e6b9d6e71a2fa0f72fe65b04c164887bad4778b9"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence_cli::run::run_fence (cognitive 35): pecofence_cli::run::run_fence has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 4, match/switch 2 (4 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":"crates/cli/src/run.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"021360f0e174733d3973a264307da5ef988d7e7ef8ade67742550627594093c9"}},{"ruleId":"D2","level":"warning","message":{"text":"Layout::normalize_tabs (cognitive 35): Layout::normalize_tabs has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 7, loops 6 (7 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/model.rs"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a03034f358bad32994793b8bdeaab605ec46d968f481d9e0378ebbda644a61"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::fence_window::handler::nc::on_exitsizemove (cognitive 34): pecofence::fence_window::handler::nc::on_exitsizemove has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 10, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/nc.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b9dc7b0405964c37463f821e7a2d7ac269746f8d2b2855dc52a9df7dd47225"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence_render::liquid_glass::crop_with_neighbors (cognitive 34): pecofence_render::liquid_glass::crop_with_neighbors has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 3 (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":"crates/render/src/liquid_glass.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd2f97a5b3e9578337df798a5f77e7a1a71d0c5a36016ff8e9bf1931a376e5f3"}},{"ruleId":"D2","level":"warning","message":{"text":"App::detach_tab (cognitive 32): App::detach_tab has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 3 (8 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":"crates/app/src/app/tabs.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1dfe9766f5879ce5849ab9a4c5828699704d31a35439176aff1a2752e0f9da"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::fence_window::handler::mouse::on_lbuttondblclk (cognitive 32): pecofence::fence_window::handler::mouse::on_lbuttondblclk has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 5 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/mouse.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f4ac382c1e93a8adbecb917c4420d942cebc368899751570ee80c7fd1d441f"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::note_edit::tell_fence (cognitive 32): pecofence::note_edit::tell_fence has cognitive complexity 32 (threshold 15). Drivers by points: if/else 19 (27 pts), boolean chains 5 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/note_edit.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"75664b12ec92a243b5697aded3983323985329db05cfd3d2de0c22c45dbaf326"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence_core::geometry::keep_groups_together (cognitive 32): pecofence_core::geometry::keep_groups_together has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 5 (10 pts), boolean chains 8 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/geometry.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff00d8b1f3a132bb69fd8f59a616623867bb9cc0e09e3d10b993fad852b90414"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence_platform::edit::handle (cognitive 32): pecofence_platform::edit::handle has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 13, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/edit.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cfa609f9ff0878693bcc8c7498fc1058a4359ffed426f9e00bd1f5ed76fc3fb"}},{"ruleId":"D2","level":"warning","message":{"text":"App::build_item_menu (cognitive 31): App::build_item_menu has cognitive complexity 31 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/menus.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"cecd803d9058361acda564b8e7ff9b2080fddf02ecc4fdff8d5e54ded8567200"}},{"ruleId":"D2","level":"warning","message":{"text":"App::drain_smart_reads (cognitive 31): App::drain_smart_reads has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (24 pts), match/switch 1 (4 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":"crates/app/src/app/smart.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"14607a3524e810ab93c7758e69ce62d36120f6e5e4482b0050ff34fbb324aad7"}},{"ruleId":"D2","level":"warning","message":{"text":"PeekOverlay::show (cognitive 31): PeekOverlay::show has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 4, 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":"crates/app/src/peek.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0ed290abdabbe75e46805c73492dec84f8f8ae07b60f742e63b03dcbd11ffce"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::marquee_offer::handle (cognitive 31): pecofence::marquee_offer::handle has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 13). 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/app/src/marquee_offer.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a59bd9d762f5c72ee24d67b94b80fbf0da4aa1aa230d7b468390e8d1d40102"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::peek_search::on_key (cognitive 31): pecofence::peek_search::on_key has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 8, match/switch 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/peek_search.rs"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56368c7a4ce2584673b22ad9bca87c9487975f81e9da42580915bf18ac201d1"}},{"ruleId":"D2","level":"warning","message":{"text":"App::on_desktop_marquee (cognitive 30): App::on_desktop_marquee has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (26 pts), boolean chains 3, 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":"crates/app/src/app/group.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26547d19577d6d06a5d6ed1c41a0147f83dcc2387b27b13864b3c844863e3f8"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceViewState::ensure_icons_and_labels (cognitive 30): FenceViewState::ensure_icons_and_labels has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/render.rs"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"2648520edda8b77d82d8afac682c70c9c938d9ec9443889959c71fdd4abb58ce"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceViewState::start_roll_anim (cognitive 30): FenceViewState::start_roll_anim has cognitive complexity 30 (threshold 15). Drivers by points: if/else 23 (27 pts), boolean chains 3 (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/app/src/fence_window/roll.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f77577e214c3960bf3d0587413f3f46a847b006994f849a14e53c599fa6132"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::fence_window::handler::nc::hit_code (cognitive 30): pecofence::fence_window::handler::nc::hit_code has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (19 pts), boolean chains 10, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/nc.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ec31d5440edbb15ca5249745b169da20ac538da0f65f3594fa7a10b92bf780"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::share_log::numeric_shape (cognitive 30): pecofence::share_log::numeric_shape has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (7 pts), boolean chains 4 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/share_log.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"4988e48e1752e5f885b034e2900d2441b5608df6c5df4d695d0c868947a162ef"}},{"ruleId":"D2","level":"warning","message":{"text":"App::run_smart (cognitive 29): App::run_smart has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (24 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":"crates/app/src/app/smart.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"b347b90af29818f199d78bc9b6ec3296d99bfc9531eb729eb4256fd084ac286e"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::fence_window::handler::nc::on_ncmousemove (cognitive 29): pecofence::fence_window::handler::nc::on_ncmousemove has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 9 (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/app/src/fence_window/handler/nc.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde50209c8f6494ff57cb5d0eb2f0641554ed8fb67d249a3fcee29cb56ca278e"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence_core::script_output::params (cognitive 29): pecofence_core::script_output::params has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 5 (11 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":"crates/core/src/script_output.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbea9f0bb46812baa317a07406446cd16b7665562e6d9178665064463cfc70ed"}},{"ruleId":"D2","level":"warning","message":{"text":"usage.validate (cognitive 29): usage.validate has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 10, 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":"services/usage/src/usage.mjs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a540e62ab2dae9a9cdc11770ec3c49d26ca9724ff49c68135b1eab5d4856e005"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopAnchor::set_peek (cognitive 28): DesktopAnchor::set_peek has cognitive complexity 28 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 6 (12 pts), boolean chains 2 (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":"crates/app/src/anchor.rs"},"region":{"startLine":1493}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c049a738322be50e280bd0b339f9cc93ae2c3152c48ddb4c9cb0cc2d7306f1"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::fence_window::handler::mouse::on_capturechanged (cognitive 28): pecofence::fence_window::handler::mouse::on_capturechanged has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 4, loops 1 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/mouse.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39b43dd8bf039122c663fee08d2d9d981ef2148d44feb17834966e59bc1f8c5"}},{"ruleId":"D2","level":"warning","message":{"text":"measure-trailer-targets.tabstrip (cognitive 28): measure-trailer-targets.tabstrip has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 3, 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":"extras/pecofence-promo/scripts/measure-trailer-targets.py"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a48228c8ad95c8ca69a4145c3640c81094ec06002a67347972f27b0905935d"}},{"ruleId":"D2","level":"warning","message":{"text":"settings.html.searchSettings (cognitive 28): settings.html.searchSettings has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 9, loops 4 (5 pts) (nesting depth added 7). Most of this is not in the body itself: 4 of the 28 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1495, 1526). 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":"ui/settings.html"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"f644d668ad65c947c9882bf2190225ac3cd98984644eb96143fa7a09e6ff08c7"}},{"ruleId":"D2","level":"warning","message":{"text":"App::apply_cell_snap (cognitive 27): App::apply_cell_snap has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (19 pts), boolean chains 8 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/fences.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef6fa0e604c443cb2b439e6247fd930825db344a9972a19d9570b2eccd4138a"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::peek_search::build (cognitive 27): pecofence::peek_search::build has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (22 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":"crates/app/src/peek_search.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7ecd7bcbd7dcb57fe9cbc67869ffaf4e350ed2b1eba9538440806aba4d5242"}},{"ruleId":"D2","level":"warning","message":{"text":"manual.boot (cognitive 27): manual.boot has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 6, loops 2, error handling 1 (nesting depth added 2). Most of this is not in the body itself: 4 of the 27 points are its own statements and the rest belongs to 11 function items inside it that branch (a function literal at line 539, a function literal at line 555, a function literal at line 568, \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":"site/manual/manual.js"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd4e9e6f161b5e981f5a19e3a619d352e91a2ee65508b284b680078d980ab00"}},{"ruleId":"D2","level":"warning","message":{"text":"settings.html.seSpec (cognitive 27): settings.html.seSpec has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 9, loops 1 (nesting depth added 5). Of this number, 20 points are the body\u0027s own statements and 7 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":"ui/settings.html"},"region":{"startLine":3248}}}],"partialFingerprints":{"codehealthFindingId/v1":"de93d0f36ccb18ff48eed652efddb34c6f12b23afd34909ba69565305df11450"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopAnchor::on_foreground (cognitive 26): DesktopAnchor::on_foreground has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/anchor.rs"},"region":{"startLine":1261}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff4b0e7ac3e46479de87eda7f0c2dbce47cea32cb149c7f7f6316bc4a952086"}},{"ruleId":"D2","level":"warning","message":{"text":"App::process_commands (cognitive 26): App::process_commands has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 2 (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":"crates/app/src/app/mod.rs"},"region":{"startLine":2696}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ece8b4397a07edae9fa64ddb8848c6d2865cc9df6e5315dc9d073693400ad76"}},{"ruleId":"D2","level":"warning","message":{"text":"App::drain_scripts (cognitive 26): App::drain_scripts has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 3 (8 pts), loops 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/tools.rs"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd45ab2f56cbf3d5b70de08a5e9dca5416060110229f82ca782d9f1dfd2c0ff"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceDropHandler::feedback (cognitive 26): FenceDropHandler::feedback has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 4, match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/dnd.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d691217cbad0c853cfd612202637309c3f37d13995f5f4d7f4a342ceac27b71"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState::plan_rules (cognitive 26): AppState::plan_rules has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 5, match/switch 1 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/state.rs"},"region":{"startLine":2683}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f9ef17a5415db1f05442d17a64f93b5ad45b2446cebb1cfa6016b8b798ac26"}},{"ruleId":"D2","level":"warning","message":{"text":"App::plan_item_move (cognitive 25): App::plan_item_move has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (17 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":"crates/app/src/app/ipc.rs"},"region":{"startLine":2590}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3e011ed5d42eca9798976d9ab42965b9fdb3e21335ef701332e9311561b622"}},{"ruleId":"D2","level":"warning","message":{"text":"App::rank_fence_matches_now (cognitive 25): App::rank_fence_matches_now has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 3 (9 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/search.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"31a8261130c2dd7dbc658b7012e1be7dc20ef2a7af3ab76f71d13d0ef6455d18"}},{"ruleId":"D2","level":"warning","message":{"text":"App::follow_desktops (cognitive 25): App::follow_desktops has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 5 (10 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":"crates/app/src/app/vdesktops.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"42faf43334468d6b12c87441617c4b5d924e6fb9f1ccaed25fb9d3eb0e163aa7"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::app::ipc::patch_settings_path (cognitive 25): pecofence::app::ipc::patch_settings_path has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 10 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/ipc.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"694fc18ceacd2187a292acf417d7d4b852d5288b9612e81127c1a2b348d27c4f"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::app::visuals::tray_icon_image (cognitive 25): pecofence::app::visuals::tray_icon_image has cognitive complexity 25 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 6 (11 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":"crates/app/src/app/visuals.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef1a6c335834be7f6452a60d082ab5004600d8328da335fa877e14887f3a2ad8"}},{"ruleId":"D2","level":"warning","message":{"text":"IWICImagingFactory_Vtbl::new (cognitive 25): IWICImagingFactory_Vtbl::new has cognitive complexity 25 (threshold 15). Drivers by points: match/switch 25. None of this is in the body itself: all 25 points belong to 25 function items inside it that branch (CreateDecoderFromFilename, CreateDecoderFromStream, CreateDecoderFromFileHandle, \u2026). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":17141}}}],"partialFingerprints":{"codehealthFindingId/v1":"545828f57535d3e1da34dd00019aeecbbdc5b882cae1d2a25feb77401e4bc301"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceChrome::draw_content (cognitive 25): FenceChrome::draw_content has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 6, loops 2 (3 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/fence_chrome.rs"},"region":{"startLine":4422}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea8ba53a87c95c59a5859dff18c6381de55ea4ff773ebe1a1c16e3307e6e40c"}},{"ruleId":"D2","level":"warning","message":{"text":"validate (cognitive 25): validate has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 12 (nesting depth added 2). Of this number, 24 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"services/feedback/src/index.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"503636206c65c39d54534c1086e35bcc8eb088a029e6ad3d139fdef4c486c7f0"}},{"ruleId":"D2","level":"warning","message":{"text":"App::show_item_menu (cognitive 24): App::show_item_menu has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/menus.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"710592f48f27e397cf7c117261ad1def6f89d317de2076b13083e87884bfe532"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceViewState::tip_text (cognitive 24): FenceViewState::tip_text has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 5, match/switch 3 (4 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":"crates/app/src/fence_window/tooltip.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"23880ad8d6977667007ccccfb51c55209dee91930e53f4cc40bdc68ced1282ac"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze-trailer-takes.main (cognitive 24): analyze-trailer-takes.main has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (7 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":"extras/pecofence-promo/scripts/analyze-trailer-takes.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c799aa47c0dcd5aa5cbb66b2a966adfd1c855bb085f859a70eca07f948a849e"}},{"ruleId":"D2","level":"warning","message":{"text":"measure-trailer-targets.snapshots (cognitive 24): measure-trailer-targets.snapshots has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 6 (15 pts), loops 4 (5 pts), if/else 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":"extras/pecofence-promo/scripts/measure-trailer-targets.py"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afc9c14c16db34670c43d0aaed6d1ccc6bdefb4ef1784f8c95bdab0eff9e652"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceViewState::tick (cognitive 23): FenceViewState::tick has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/frame.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"95aef0651304e4524397ecc84adced0bda2c6f72edf00d2474b6dd08e16fd328"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceViewState::up_button_at (cognitive 23): FenceViewState::up_button_at has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/hit.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"151aac6de8fe61e71f04700ee6845e2c59963c67363f4e46477624a814d2e554"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceViewState::reflow_items (cognitive 23): FenceViewState::reflow_items has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 2 (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":"crates/app/src/fence_window/items.rs"},"region":{"startLine":787}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c91c1f63d0ea75ddce1909dedb5a295746a22db82047ac3fd63f85103bdf9c"}},{"ruleId":"D2","level":"warning","message":{"text":"IconCache::drain_results (cognitive 23): IconCache::drain_results has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/icons.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e179bb1114a5eb3bd7c752849bec3e9a99021567338dd788dd5b1ca0b96013"}},{"ruleId":"D2","level":"warning","message":{"text":"SettingsHost::open (cognitive 23): SettingsHost::open has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, match/switch 3 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/settings_host.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c45e38d3f885e0411790ebf349a83038245b7628ea6a7057891b8e9f119eb79"}},{"ruleId":"D2","level":"warning","message":{"text":"ShadowWindow::update (cognitive 23): ShadowWindow::update has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 4, match/switch 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":"crates/app/src/shadow.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5b5b1a2b574b3ef85b8fa2abe3641dcdb2923b5960ef772dd20a5075058fe4"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::fence_window::handler::mouse::on_mouseleave (cognitive 23): pecofence::fence_window::handler::mouse::on_mouseleave has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 7 (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/app/src/fence_window/handler/mouse.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"549bb47d574b210aa1a1d5becd8533dfcf493521cd43a5278c443e339aeeab19"}},{"ruleId":"D2","level":"warning","message":{"text":"App::drain_updates (cognitive 22): App::drain_updates has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (7 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/updates.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8ab05ee0704291ca5fced913346fc11919f5268347d2eff6432e6277062d23"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::app::live_wallpaper::capture_and_build (cognitive 22): pecofence::app::live_wallpaper::capture_and_build has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 3 (13 pts), if/else 3 (8 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":"crates/app/src/app/live_wallpaper.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c34c0ccbdddbf9380a4d33f4b72742da5ba20a759fa9f74724ec1b0dd187083"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::app::visuals::monitor_recipes (cognitive 22): pecofence::app::visuals::monitor_recipes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/visuals.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b27b500d53abe3ea2e86bb5a8d154b100779d0425c840ee05958550df86ea68"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::fence_window::handler::nc::on_nclbuttondown (cognitive 22): pecofence::fence_window::handler::nc::on_nclbuttondown has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/nc.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"f934bcb2c257d2a83c762d04ccc9c1dab9d34a2490394f38ddc652be757e0b15"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::rename::begin_rename_at (cognitive 22): pecofence::rename::begin_rename_at has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 3, 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":"crates/app/src/rename.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"f180ec87cebdf6c3ce3e0bde18f47049660d5aaa2072477987a3ebe1a4e7d06d"}},{"ruleId":"D2","level":"warning","message":{"text":"Image::blur_alpha (cognitive 22): Image::blur_alpha has cognitive complexity 22 (threshold 15). Drivers by points: loops 9 (20 pts), boolean chains 1, if/else 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":"crates/render/src/backdrop.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb34fc94718017e664373a35d7f98c91731f27d1b41fed56682962e286f48bf2"}},{"ruleId":"D2","level":"warning","message":{"text":"settings.html.matchText (cognitive 22): settings.html.matchText has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, ternaries 1 (3 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":"ui/settings.html"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"79785ffc3e86ad25d7f911b68f502213e1e7f7cfc05f3535d817f2ebc8587665"}},{"ruleId":"D2","level":"warning","message":{"text":"App::housekeeping (cognitive 21): App::housekeeping has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/mod.rs"},"region":{"startLine":2562}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5717193d207051e6d5f7e5c58aa93313a33d8137cc5b9f302ddcf46dee260f1"}},{"ruleId":"D2","level":"warning","message":{"text":"App::sync_peek_hotkey (cognitive 21): App::sync_peek_hotkey has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/peek.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32dd76856a8dde2242af788e57326ef7fa92503245566f14920002920e28a60"}},{"ruleId":"D2","level":"warning","message":{"text":"App::show_update_card (cognitive 21): App::show_update_card has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (15 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/updates.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71af6378869bae3e3f7003922bcd1980d41eb6c2f40825a13efe8950c07b787"}},{"ruleId":"D2","level":"warning","message":{"text":"App::welcome_texts (cognitive 21): App::welcome_texts has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 4 (8 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":"crates/app/src/app/welcome.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5cea482b77f783670b6645921c6a09ce93388ee1f42d23a9d3774840c6a8eab"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceViewState::remap_item_state (cognitive 21): FenceViewState::remap_item_state has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/items.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03ecde207ad9b2453ef296f80ff002a2346d0ec1f037f0a88724c8f56e62c6f"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceViewState::item_alphas (cognitive 21): FenceViewState::item_alphas has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (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":"crates/app/src/fence_window/render.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b10b85db3222b0b1228f4982dd5f5e45a679e46cdaeb1d7a65cbcb5eb57c44"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceViewState::draw_chrome_panel (cognitive 21): FenceViewState::draw_chrome_panel has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 11, if/else 6, match/switch 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":"crates/app/src/fence_window/render.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed78fd5222cc788ecad89373b061ed8877bcd577b9340f5dc45c9201d32713e9"}},{"ruleId":"D2","level":"warning","message":{"text":"ItemLayout::insertion_caret (cognitive 21): ItemLayout::insertion_caret has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 1, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/layout.rs"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00046ffe4f722e7028edd79be15f6cd33032142af5783c8e74825b4bc74239c"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::fence_window::hit::resize_edge_at (cognitive 21): pecofence::fence_window::hit::resize_edge_at has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 12, if/else 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":"crates/app/src/fence_window/hit.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4cf03a3ca9ad9f221a884f99c3cc71f2f0d0aa5626acbc2669eea823f928d2"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::fence_window::window_drag::flush_window_drag (cognitive 21): pecofence::fence_window::window_drag::flush_window_drag has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14, boolean chains 5, match/switch 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/window_drag.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f943d775b1e3913a8e097e08713a6056205c21a1e0eeaef608693803828e74"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::ipc_server::listen_loop (cognitive 21): pecofence::ipc_server::listen_loop has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/ipc_server.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c6e0d276c5991da5037faa6b25b4c98994fd68480a269d21855c8ca42ac4e1"}},{"ruleId":"D2","level":"warning","message":{"text":"settings.html.updateLiquidMap (cognitive 21): settings.html.updateLiquidMap has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (14 pts), if/else 3, 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":"ui/settings.html"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77d92a916a1dac56724b368a6e741a8fde521171392839ba19cdb41486d558e"}},{"ruleId":"D2","level":"warning","message":{"text":"settings.html.seValues (cognitive 21): settings.html.seValues has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 8 (16 pts), if/else 2 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 9). Of this number, 11 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":"ui/settings.html"},"region":{"startLine":3177}}}],"partialFingerprints":{"codehealthFindingId/v1":"294ec2aa641070cfdababe5667ac9240f2afae4dc1d1e8fdf76d4d5647c41507"}},{"ruleId":"D2","level":"warning","message":{"text":"App::capture_live_wallpapers (cognitive 20): App::capture_live_wallpapers has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 7, 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":"crates/app/src/app/live_wallpaper.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da5c034ac8f97c81d282bf72771eb2a44c3dd329a43337f4014b22191194fc8"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceViewState::redraw_content (cognitive 20): FenceViewState::redraw_content has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, boolean chains 5, match/switch 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/render.rs"},"region":{"startLine":1961}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f65b06135823c456e3b4b95a777234e18c769dc8ccacd4912ebceead7c0f899"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::fence_window::snap::alignment_guides (cognitive 20): pecofence::fence_window::snap::alignment_guides has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (5 pts), boolean chains 3, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/snap.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b23ceec08d83863bc51dcf780062827172b244700e74e1c78bae2f45787669a"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::filter_box::on_key (cognitive 20): pecofence::filter_box::on_key has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (3 pts), boolean chains 2, match/switch 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/filter_box.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfabec1d61e0e55702f4afa6a8232bb720cd1584d1aa4e9ca838a8d64c5b3512"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::scripts::run_within (cognitive 20): pecofence::scripts::run_within has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 3 (6 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/scripts.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80f1cc43d919069d7a3f5c19c5f4d68fac82231ef0dd2d88a4b7e22b71e685f"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence_core::model::pair_monitors (cognitive 20): pecofence_core::model::pair_monitors has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 6, 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/core/src/model.rs"},"region":{"startLine":1944}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb94cc695b6804fd989b8b39d781cb50e6a16b2815c2872e976bc7b9763e9a4"}},{"ruleId":"D2","level":"warning","message":{"text":"DesktopAnchor::on_raw_input (cognitive 19): DesktopAnchor::on_raw_input has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/anchor.rs"},"region":{"startLine":1667}}}],"partialFingerprints":{"codehealthFindingId/v1":"523e98f38a844550054c84a69ded4cb90f266c76bd71ebbe84b64e284ccfcdd1"}},{"ruleId":"D2","level":"warning","message":{"text":"App::create_desktop_item (cognitive 19): App::create_desktop_item has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/items.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df2e5b7ddb5539523cb7a23ba65f4688cbba720766440d0ce3b6bb406b0d472"}},{"ruleId":"D2","level":"warning","message":{"text":"App::open_smart_editor (cognitive 19): App::open_smart_editor has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/smart_editor.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a490335575ed6836dc74fbeadba8638189a1cd595aba698fc62595eab411c1"}},{"ruleId":"D2","level":"warning","message":{"text":"App::refresh_visuals (cognitive 19): App::refresh_visuals has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6, 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":"crates/app/src/app/visuals.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffcd804e172500e7a535c09af1bdaec43676c2f6f6382a1c93085808015d224"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceWindow::make_handler (cognitive 19): FenceWindow::make_handler has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 8, match/switch 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/mod.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30182deba96c4d7510c8716b4e3b004519d47ecb530224b932c68a011a24ab0"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceViewState::update_backdrop_at (cognitive 19): FenceViewState::update_backdrop_at has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 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":"crates/app/src/fence_window/render.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e41d8ba79ad315e59d645d6f9697a15645386ef40cbfefc8db38b6508ee43c"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::app::push::rooms_below (cognitive 19): pecofence::app::push::rooms_below has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/push.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bdfbf90b1e8b2e8bfd54fc9c9efd34869bad523b2c01053309c398ba0e265c8"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::dialog_jump::on_foreground (cognitive 19): pecofence::dialog_jump::on_foreground has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/dialog_jump.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"866af7be1d5201d0fa32abe204799d83c4df40f6aa4c57ccbcc1ba7f54c75538"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::fence_window::handler::nc::on_sizing (cognitive 19): pecofence::fence_window::handler::nc::on_sizing has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/nc.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"9153f61ca028be9f0a7b9bb607a229c794c8e3713a7ce2352b3cd05f5573550e"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::fence_window::handler::timers::on_timer_active_sync (cognitive 19): pecofence::fence_window::handler::timers::on_timer_active_sync has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 4 (nesting depth added 8). 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/app/src/fence_window/handler/timers.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c00a8083cf0046024a32010cc344057ebf6b40400b7dab3ad63ccd794ac5036"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::fence_window::handler::timers::on_timer_hover_select (cognitive 19): pecofence::fence_window::handler::timers::on_timer_hover_select has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 9 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/timers.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d64416215a09aa120cf93966ded2a2b61cbda23dbd9d281ff48aa798b7458e3"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::shadow::draw_ring (cognitive 19): pecofence::shadow::draw_ring has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (7 pts), boolean chains 2 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/shadow.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf524d5611e5bb645223e873da1e166ad3db52812a824b8a384823bec2881677"}},{"ruleId":"D2","level":"warning","message":{"text":"Config::merge_layout_fences (cognitive 19): Config::merge_layout_fences has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/model.rs"},"region":{"startLine":2279}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1318098ec807404f38c3001440083a602eb42e122ba2d12bfe60903c1abed98"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence_platform::desktop::describe_desktop_windows (cognitive 19): pecofence_platform::desktop::describe_desktop_windows has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 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":"crates/platform/src/desktop.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef5a614ba984f6d803f784a3cf846288068d51f6df855627dcea4b1953a1c27"}},{"ruleId":"D2","level":"warning","message":{"text":"settings.html.seCounted (cognitive 19): settings.html.seCounted has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 4, 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":"ui/settings.html"},"region":{"startLine":3400}}}],"partialFingerprints":{"codehealthFindingId/v1":"08cb38def5ac398720b40fa8b2d73c9841771ae8296896ad2b16b078652176a5"}},{"ruleId":"D2","level":"warning","message":{"text":"App::offer_crash_feedback (cognitive 18): App::offer_crash_feedback has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/feedback.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f951fdd0205c9e3ab9a0669ae811f8ee5156d7f98a8543397531019b8d2512"}},{"ruleId":"D2","level":"warning","message":{"text":"App::on_set_fences (cognitive 18): App::on_set_fences has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (3 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":"crates/app/src/app/fence_options.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"df41ba8ae65e624aa04d989613806a4642391da62baf5507a0267049b383965d"}},{"ruleId":"D2","level":"warning","message":{"text":"App::paste_into (cognitive 18): App::paste_into has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 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":"crates/app/src/app/items.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"234516ea5df1b1b26778916a42e4da42936bd78b27e49369f64b361581035f33"}},{"ruleId":"D2","level":"warning","message":{"text":"App::record_bounds_quietly (cognitive 18): App::record_bounds_quietly has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 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":"crates/app/src/app/push.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3c928d5a519ea24c01537905870b385a240bac6c0883bea6c85bdb89b5558f"}},{"ruleId":"D2","level":"warning","message":{"text":"App::open_search_row (cognitive 18): App::open_search_row has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/search.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab0e31615faba2a0e75f12525b53437f5ac207e8437e9b524db89d3c61f9c3f"}},{"ruleId":"D2","level":"warning","message":{"text":"App::prewarm_wallpapers (cognitive 18): App::prewarm_wallpapers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/visuals.rs"},"region":{"startLine":1043}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a1ab352145cc66391cd99f7d6d5b4115edfc3de1f7e887e739ae387992479b"}},{"ruleId":"D2","level":"warning","message":{"text":"FrameHandle::land (cognitive 18): FrameHandle::land has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/frame.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b97c81ed6a7c7c07c828e8c7cdcdb4706ea763352e1b06cdf85045d4ba14da"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceViewState::material_foreground (cognitive 18): FenceViewState::material_foreground has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/render.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cf09523bb423bfb7a986a0767eca3937e86738b35ac83c48fce4e92f77b2d0"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceViewState::tab_rects_with_gap (cognitive 18): FenceViewState::tab_rects_with_gap has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 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":"crates/app/src/fence_window/tabs.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"77962041ec8806950d0c8447dfa4fe3d33c4974fc1dfe6d01a88028b1707a095"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceViewState::sync_tab_slides (cognitive 18): FenceViewState::sync_tab_slides has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/tabs.rs"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80828a997deb893eaae0a8dc8969f10a2570c79ebdee36c41ea7ba3bc5ae10c"}},{"ruleId":"D2","level":"warning","message":{"text":"MarqueeBand::show (cognitive 18): MarqueeBand::show has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 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":"crates/app/src/marquee_band.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ac8e9322842b6fc6ae8d6626ebd7e0d62742c6f4e34099eed9a68831a3448e"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence_platform::shell_menu::desktop_children (cognitive 18): pecofence_platform::shell_menu::desktop_children has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 3, loops 2 (3 pts), match/switch 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":"crates/platform/src/shell_menu.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2bf610271df4c375af398910fa732ff2bcec6ab6e7d66f5209a72d6f280ed1"}},{"ruleId":"D2","level":"warning","message":{"text":"NoticeCard::draw (cognitive 18): NoticeCard::draw has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 2, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/notice.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a0726c90d72581c5ae88537e0f4cf22288f1b881870811d10f7cf4f8519c61"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence_render::fence_chrome::draw_scrollbar (cognitive 18): pecofence_render::fence_chrome::draw_scrollbar has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 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":"crates/render/src/fence_chrome.rs"},"region":{"startLine":1840}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff21cd6fefe3c1d2272c1fa46a1ed56158cf3ea6fbf3f2380c3b60a0aa0d28a4"}},{"ruleId":"D2","level":"warning","message":{"text":"settings.html.hotkeyRecorder (cognitive 18): settings.html.hotkeyRecorder has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, if/else 8. Most of this is not in the body itself: 8 of the 18 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 1876, waitForKeys, a function literal at line 1875, \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":"ui/settings.html"},"region":{"startLine":1820}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b0aafab7609fec4a35c1bef1d9d0c1a6a38e35f262ce31f079bb3a701baff8"}},{"ruleId":"D2","level":"warning","message":{"text":"settings.html.fbSend.onclick (cognitive 18): settings.html.fbSend.onclick has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9, boolean chains 5, ternaries 3, error handling 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":"ui/settings.html"},"region":{"startLine":2982}}}],"partialFingerprints":{"codehealthFindingId/v1":"934b4b2d1be69d1022eeab9f84dfb55fd417c585048c4dd45796adbe22607f97"}},{"ruleId":"D2","level":"warning","message":{"text":"settings.html.seVal (cognitive 18): settings.html.seVal has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 11, ternaries 2 (4 pts), if/else 1 (2 pts), match/switch 1 (nesting depth added 3). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":3137}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fc2efca1c5ae6bdd4385a2b0eed4afb49a287c774c906d3fe04dff96e23217"}},{"ruleId":"D2","level":"warning","message":{"text":"App::drain_ipc (cognitive 17): App::drain_ipc has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/ipc.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"0094005bba61ed00b37b0340644999123ba54e3f030cc37aef36bca01402b0cb"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceViewState::set_drop_feedback (cognitive 17): FenceViewState::set_drop_feedback has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 6, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/dnd.rs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9003e6d74308ca4a614a6afe63c6736b3e8ac171cd8613dded85387274ae09"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceViewState::set_scrollbar_zone (cognitive 17): FenceViewState::set_scrollbar_zone has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/scroll.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"10613cd39afd3aaf3e1a6520c07bc68bf704d8318b2a2bce65bc6fc1fef59e82"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState::load (cognitive 17): AppState::load has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10, boolean chains 4, match/switch 2 (3 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/state.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"479248a56f6728027eccf2a071226a516fb33d0afcb746aba1f1869d4f8465f4"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState::ensure_layout (cognitive 17): AppState::ensure_layout has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, 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":"crates/app/src/state.rs"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa6919e0406f044d18bf03adc72a2ae93f4d9a175fb516e040cf6efe4d184854"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::fence_window::handler::nc::on_ncmouseleave (cognitive 17): pecofence::fence_window::handler::nc::on_ncmouseleave has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/nc.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"376a866a765a6bf78d263cb1091acb3b6a840dea6c37c667ed374b07c94f3f8f"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::layout::clearance::sizing_limits (cognitive 17): pecofence::layout::clearance::sizing_limits has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/layout.rs"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b30edf86f3a7e18e34f576b99e4c556eb397e6f5c3e1895d23171a52967465"}},{"ruleId":"D2","level":"warning","message":{"text":"Layout::detach_tab (cognitive 17): Layout::detach_tab has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/model.rs"},"region":{"startLine":1650}}}],"partialFingerprints":{"codehealthFindingId/v1":"212fa5c12cd8b9e4f68c13c01251cec20903024a07d8639038f1c084fd4b96d6"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence_core::config_store::validate (cognitive 17): pecofence_core::config_store::validate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/config_store.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2b2c1fb70f54fcdfb802b1db2c1ce1d6c5eca066a661d2eb48a2fc5a0fe2e9"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence_platform::shell::transfer_to_folder (cognitive 17): pecofence_platform::shell::transfer_to_folder has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/shell.rs"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f0213c1751abdd6f7b8a5ccd94ba19d14f848c40641b04a6d80dc95a1a2699"}},{"ruleId":"D2","level":"warning","message":{"text":"Values::apply (cognitive 17): Values::apply has cognitive complexity 17 (threshold 15). Drivers by points: if/else 16, loops 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/custom_theme.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"a029c03d67b8fb7d304c473b9fe0f33f0f9c88fe15ef97879706f8305abb1b19"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence_render::liquid_glass::refracted_overlay (cognitive 17): pecofence_render::liquid_glass::refracted_overlay has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/liquid_glass.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"d530535e0c89e12e0236f4ae97f414925c8c54bd25b16e802e7d4ce917cf1403"}},{"ruleId":"D2","level":"warning","message":{"text":"make-trailer-audio.chord_report (cognitive 17): make-trailer-audio.chord_report has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (9 pts), loops 3 (6 pts), if/else 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":"extras/pecofence-promo/scripts/make-trailer-audio.py"},"region":{"startLine":1698}}}],"partialFingerprints":{"codehealthFindingId/v1":"803969debb5a5d91a22084b27e57e9a0ace10023fd8b2490ad4753a6c0f7acca"}},{"ruleId":"D2","level":"warning","message":{"text":"make-trailer-clutter.shot_chat (cognitive 17): make-trailer-clutter.shot_chat has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (10 pts), loops 3 (4 pts), if/else 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":"extras/pecofence-promo/scripts/make-trailer-clutter.py"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"387b0322d4aa57d53f64d9bdcf72e6413ba4b36d30e3c754c896d1264d872039"}},{"ruleId":"D2","level":"warning","message":{"text":"measure-trailer-targets.find_items (cognitive 17): measure-trailer-targets.find_items has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 4 (6 pts), ternaries 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":"extras/pecofence-promo/scripts/measure-trailer-targets.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"de872a059afae5775fa1834fba765725ee22cbdc41288056ddbb810967e48278"}},{"ruleId":"D2","level":"warning","message":{"text":"settings.html.renderRules (cognitive 17): settings.html.renderRules has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6, ternaries 1 (nesting depth added 1). Of this number, 12 points are the body\u0027s own statements and 5 belong to 3 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":"ui/settings.html"},"region":{"startLine":2392}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af7b8e1aeac90ae45a2e6c6139a135d1378878cce58e1ca0e596692453f2f79"}},{"ruleId":"D2","level":"warning","message":{"text":"settings.html.newCond (cognitive 17): settings.html.newCond has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 7, ternaries 3. Of this number, 15 points are the body\u0027s own statements and 2 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":"ui/settings.html"},"region":{"startLine":2565}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0eb39c2d9f35558c244225a42ba09de571d2d93e5d21e3a2acba14a2aaf818e"}},{"ruleId":"D2","level":"warning","message":{"text":"settings.html.seRow (cognitive 17): settings.html.seRow has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 7, ternaries 1. Of this number, 14 points are the body\u0027s own statements and 3 belong to 8 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":"ui/settings.html"},"region":{"startLine":3277}}}],"partialFingerprints":{"codehealthFindingId/v1":"029f372489e43efd99ec9c4ab08d0996b195711dd9c951fc71a02e3334323f3d"}},{"ruleId":"D2","level":"warning","message":{"text":"settings.html.seRender (cognitive 17): settings.html.seRender has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, ternaries 5 (6 pts), if/else 3 (nesting depth added 1). Of this number, 15 points are the body\u0027s own statements and 2 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":"ui/settings.html"},"region":{"startLine":3440}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a8cd942f1034515743534b2721230eb5d44d365832fbd0623ecee153a1ec93"}},{"ruleId":"D2","level":"warning","message":{"text":"App::set_bounds_from_cli (cognitive 16): App::set_bounds_from_cli has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 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":"crates/app/src/app/ipc.rs"},"region":{"startLine":2402}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0780efd03cf9a8f6fa32d4803b154459cf02363fa74ea27a1ce36e4edc63429"}},{"ruleId":"D2","level":"warning","message":{"text":"App::route_pending_creation (cognitive 16): App::route_pending_creation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 2, loops 2, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/items.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84847a37a7dfb428922f2d4e7736acc640da7287e02e39d7b3d08aca9f9cc64"}},{"ruleId":"D2","level":"warning","message":{"text":"App::rename_item_to (cognitive 16): App::rename_item_to has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: 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/app/src/app/items.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"142c788b29d1824c93ee12fed8ffc308df5260652418ee2ffc2ed81564f415df"}},{"ruleId":"D2","level":"warning","message":{"text":"App::detect_live_wallpapers (cognitive 16): App::detect_live_wallpapers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/live_wallpaper.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fb2bc78efdae5c4611fe4e82483e603ff086a28faac4f4af9e2330be4d447f"}},{"ruleId":"D2","level":"warning","message":{"text":"App::look_for_everything (cognitive 16): App::look_for_everything has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, boolean chains 5, loops 2 (4 pts), match/switch 1 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/smart.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"127d3d4e974a1f9b62c0b1df64989c1f04a4a6c230958beb0e42392660c9da99"}},{"ruleId":"D2","level":"warning","message":{"text":"App::resolve_desktop_specs (cognitive 16): App::resolve_desktop_specs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/vdesktops.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"f264e2c15047299ca03fb28390eb2fca06671f9ba0c5cca8620b8e77964f3ec9"}},{"ruleId":"D2","level":"warning","message":{"text":"FenceViewState::redraw_rows (cognitive 16): FenceViewState::redraw_rows has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6, boolean chains 5, match/switch 3, loops 1 (2 pts) (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":"crates/app/src/fence_window/render.rs"},"region":{"startLine":2207}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2dbaa070fd8825bcbd5fb26b1ba117bae2d628b863db7ac7e8c6cc8ceeef152"}},{"ruleId":"D2","level":"warning","message":{"text":"IoDeadline::arm (cognitive 16): IoDeadline::arm has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/ipc_server.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f318b4953cfd689626b871bc4b747a18a9322c7ceecce24ba46753aceb907f5"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::layout::clearance::nearest_spot (cognitive 16): pecofence::layout::clearance::nearest_spot has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (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/app/src/layout.rs"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"50bb189ad167e54d1c4c21a5e4e62a691ee520a14d3365c16eeca8e778a486a9"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence::state::natural_cmp_lowered (cognitive 16): pecofence::state::natural_cmp_lowered has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (7 pts), if/else 2 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/state.rs"},"region":{"startLine":3535}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9efc3d57ed2910a5806094375b2d85d25b18970c45469630a4e6968a117330"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence_cli::local::print_log (cognitive 16): pecofence_cli::local::print_log has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/local.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"91bf6bf4d58a628835ce2b1a0862ea952fa1c38d529a043beeea7f5be25f7e69"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence_core::matcher::match_term (cognitive 16): pecofence_core::matcher::match_term has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/matcher.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3307268d8adcb51dc69627effa12aeade05baeb981082127f793f91673d955c"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence_core::note::links (cognitive 16): pecofence_core::note::links has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), boolean chains 3, loops 2 (3 pts), match/switch 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":"crates/core/src/note.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c63245aa8f4648c25d4fa198358ce2bb28c8a0d3ac7f1edbc4a8a5653354058"}},{"ruleId":"D2","level":"warning","message":{"text":"pecofence_platform::wallpaper::watch_registry_key (cognitive 16): pecofence_platform::wallpaper::watch_registry_key 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":"crates/platform/src/wallpaper.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c96d78318456732331dcd3aafb09c498422d86e37f2385acb194774ed1cc4e0"}},{"ruleId":"D2","level":"warning","message":{"text":"measure-trailer-targets.search_radius (cognitive 16): measure-trailer-targets.search_radius has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 2 (6 pts), if/else 3 (5 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":"extras/pecofence-promo/scripts/measure-trailer-targets.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"2549e2dbda262dbc998177b8f033e52cd2780cf99a42d0e3d77d32a566066dd6"}},{"ruleId":"D2","level":"warning","message":{"text":"fetch (cognitive 16): fetch has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 4, error handling 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":"services/feedback/src/index.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aad4810474d7f1f36ac6ee2cc3dbec7de1110f967a263a5dcf4a9a988129e0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/bindings.rs: FileTooLong \u2014 16859 significant 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 292 free functions. The bar is 500 significant lines; this is 16359 over it, 33.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":"crates/platform/src/bindings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0873fd0c731b59f56386560c8d4b5fc90d6bf0a306cc12737b9ad2b58642cf2a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/comp.rs: FileTooLong \u2014 16745 significant 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 16245 over it, 33.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":"crates/render/src/comp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1671e909f95041dfca1d7b72787ca46344e775734967736a6afd23f2e4c42567"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: App: TooManyMethods \u2014 660 methods, declared across 38 files: app/ipc.rs (55), app/fences.rs (50), app/tools.rs (42), app/smart.rs (38), \u002B34 more file(s). The bar is 30 methods; this is 630 over it, 22.00\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/mod.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a0a19a44a01404ba57dd13aec781f6ede2f008ef4b97882577659dee276f703"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/gpu_bindings.rs: FileTooLong \u2014 7654 significant 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 7154 over it, 15.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/gpu_bindings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d195f27f20dbe343a0de2b61177713a016dea3d8dfd3190c05623da675bf3e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FenceViewState: TooManyMethods \u2014 339 methods, declared across 13 files: fence_window/render.rs (55), fence_window/hit.rs (49), fence_window/tabs.rs (37), fence_window/scroll.rs (36), \u002B9 more file(s). The bar is 30 methods; this is 309 over it, 11.30\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/state.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ba18f37bcdb41a95f33be5cccc18de0be1d363a49f7c068f506c63710837b4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: FenceViewState: TooManyFields \u2014 265 stored fields beside 339 methods. The bar is 30 stored fields; this is 235 over it, 8.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":"crates/app/src/fence_window/state.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b865e3ecf26e05bfa0feff15589619f263066c8de78e87424c3df8b085fb973"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/fence_chrome.rs: FileTooLong \u2014 4085 significant 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: FenceChrome (6 blocks, 87-5911), declaring 42 free functions. The bar is 500 significant lines; this is 3585 over it, 8.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":"crates/render/src/fence_chrome.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d556428a48ebf95020fa222d753c0ca4c3cc981b008db6af96b9a92ff7be35"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ID3D11Device_Vtbl.new: MethodTooLong \u2014 new runs 726 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 626 over it, 7.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/gpu_bindings.rs"},"region":{"startLine":5485}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a202a00304de16b232a848a6de653ac42d6ec752ba14a9991c5c6326c139df"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FenceChrome: ClassTooLong \u2014 2722 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 74 methods, 6 blocks, lines 87-5911. The bar is 400 significant lines; this is 2322 over it, 6.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":"crates/render/src/fence_chrome.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd994cc15f07b27cdbe82335f51d4057efa38206a8c6450ff7f5c273573e9e0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.show_fence_menu: MethodTooLong \u2014 show_fence_menu runs 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) in one body. The bar is 100 significant lines; this is 517 over it, 6.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/menus.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d6a6745ebc750e1fb3824db80541acd905377e4743c92b54df398561c6835a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: AppState: TooManyMethods \u2014 170 methods. The bar is 30 methods; this is 140 over it, 5.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":"crates/app/src/state.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d3e9d88992f6539f3f212f008b8258c15f8b62789c800a8c7fa6b6d5126c09"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FenceWindow: ClassTooLong \u2014 2134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 156 methods, 3 blocks, lines 5-3334. The bar is 400 significant lines; this is 1734 over it, 5.34\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/api.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61c2a29b039bb394aa8a0a52a3d5527addffd6e83001b036aec70f003de193b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FenceWindow: TooManyMethods \u2014 156 methods, declared across 3 files: fence_window/api.rs (153), fence_window/frame.rs (2), handler/mod.rs (1). The bar is 30 methods; this is 126 over it, 5.20\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/api.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c5e0d8b0828eb2328e8e7465cc55c5c5914f6951b1e41abbde79b4f13aab61"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IWICImagingFactory_Vtbl.new: MethodTooLong \u2014 new runs 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) in one body. The bar is 100 significant lines; this is 414 over it, 5.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":17141}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5971952f8480ec55da23a4134fa1a41c4f02cf26459597510418784b2fdd274"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.ipc_dispatch: MethodTooLong \u2014 ipc_dispatch runs 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) in one body. The bar is 100 significant lines; this is 405 over it, 5.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/ipc.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"303132ec6cfb71c0a417947b6abf7c30a150376ff43b42239f5f0d2d17a14971"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FenceChrome.draw: MethodTooLong \u2014 draw runs 498 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 398 over it, 4.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/fence_chrome.rs"},"region":{"startLine":2998}}}],"partialFingerprints":{"codehealthFindingId/v1":"815860116818a1c49286bcddff56953e50b0a5de147e9a372c63d7832103224d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/state.rs: FileTooLong \u2014 2374 significant 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 1874 over it, 4.75\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file 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/app/src/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d77f66f5a4a31fa3210d4f318e2eff2eb44ff30a92e98f740d01ade37defc8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/mod.rs: FileTooLong \u2014 2354 significant 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 1854 over it, 4.71\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"705673cc6f14b9d4f3ce3b275f006e783e6e464bd2b6620a3c4e6ccdbaecfaab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/ipc.rs: FileTooLong \u2014 2290 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 83% of them inside a single declaration: App (617-3182). The bar is 500 significant lines; this is 1790 over it, 4.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":"crates/app/src/app/ipc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c2639954675fcaed4bd2b457413905152494ad89e749a6a3d88f8008281586"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: App: TooManyFields \u2014 133 stored fields beside 660 methods. The bar is 30 stored fields; this is 103 over it, 4.43\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/mod.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccb8c4622836322b8fbc40b146c07b740b8761646b441671b3cea017288e73c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fence_window/api.rs: FileTooLong \u2014 2146 significant 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: FenceWindow (3 blocks, 5-3334). The bar is 500 significant lines; this is 1646 over it, 4.29\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/app/src/fence_window/api.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"51b16ad1943de7e8fa338df2e0b4a786b28765a4c8399153d9b8cf98eecac9c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/settings.html: FileTooLong \u2014 2057 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1557 over it, 4.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":"ui/settings.html"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"526989c27c8bf876f0ff4825ca5d1f24ee43d60ec386cc03a34c0cac56270b5c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pecofence::fence_window::handler::mouse_move::on_mousemove: FunctionTooLong \u2014 pecofence::fence_window::handler::mouse_move::on_mousemove runs 405 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 305 over it, 4.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/mouse_move.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b87f3d81754f7bf31a3b20d7db41e41bc58b5a95a8350b5d080be6ccedd7ef"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FenceWindow.create: MethodTooLong \u2014 create runs 372 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 272 over it, 3.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":"crates/app/src/fence_window/api.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d2c917fdb3b9314f06b1027d1387106d8e4a71f8c40acdde6fe218fa987d53"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.test_step: MethodTooLong \u2014 test_step runs 364 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 264 over it, 3.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/testscript.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"42559a6c21091229ec35330674e06815d8b4723d5e80ec994d886142bf81a8b8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ID3D11DeviceContext_Vtbl: TooManyFields \u2014 109 stored fields. The bar is 30 stored fields; this is 79 over it, 3.63\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/gpu_bindings.rs"},"region":{"startLine":7965}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6af26efb83db09a9dacac51fcf9588bc66499d6d1663c657bcd5686d7bdb632"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fence_window/render.rs: FileTooLong \u2014 1750 significant 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: FenceViewState (234-2446). The bar is 500 significant lines; this is 1250 over it, 3.50\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/render.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24178b9ebd5dec0853a4a9563ca9a6975d30b4abbb2cf58f43b236565a4123c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: settings.html.esc: FunctionTooLong \u2014 esc runs 333 significant lines (blank, comment-only and punctuation-only lines excluded) 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":"ui/settings.html"},"region":{"startLine":2469}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0f2d8f853ee9db5d3a92d8eda4e79e6997e032876d3d130fb52ffe13c2f030"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FenceViewState.replace_items: MethodTooLong \u2014 replace_items runs 330 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 230 over it, 3.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/items.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd567939aa38dcfaa57e72c9a232e8da5ebeec4de9127ff14dc286612eacbb7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.on_settings_message: MethodTooLong \u2014 on_settings_message 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":"crates/app/src/app/settings.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e06bb13645def930d6170ff3f016ee5befc077711f2e69a28c7c21a486ab182"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/model.rs: FileTooLong \u2014 1576 significant 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 1076 over it, 3.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/model.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76d4077c443cc59760a02f68cdd15bdc12b941453b2c0f7534679fcdc5c4c12"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DesktopAnchor: ClassTooLong \u2014 1260 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 71 methods, 3 blocks, lines 338-2359. The bar is 400 significant lines; this is 860 over it, 3.15\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/app/src/anchor.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4046c0fa375a51e4596914731eb30cbae3dec674c57542d23f7a45d106b886"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/make-trailer-audio.py: FileTooLong \u2014 1564 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1064 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":"extras/pecofence-promo/scripts/make-trailer-audio.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9b72fa1ef58d93e23eb9da073dcdbe000d5bfd348965ea74b8fa213ee8f568"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IFileOperation_Vtbl.new: MethodTooLong \u2014 new runs 293 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 193 over it, 2.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":9647}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e8dea84415a599bda05cecb7270eb91627c27292d31de38f8da54856ba4b91"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/anchor.rs: FileTooLong \u2014 1458 significant 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: DesktopAnchor (3 blocks, 338-2359). The bar is 500 significant lines; this is 958 over it, 2.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":"crates/app/src/anchor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d54785e0f676799b15305f5486af1f4e59113341ac5632d6c5ba44c9caa374f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FenceChrome.draw_rows: MethodTooLong \u2014 draw_rows runs 290 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 190 over it, 2.90\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/fence_chrome.rs"},"region":{"startLine":4051}}}],"partialFingerprints":{"codehealthFindingId/v1":"527a985045b413639c422acff54de527f39d694c1798315da2194a682268b9df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/peek_search.rs: FileTooLong \u2014 1416 significant 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 916 over it, 2.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file 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/app/src/peek_search.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd4eb35d62a62b8555a67cce53d0b53a3d2dd809670ea44b09781e454f56ead"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IFileDialog_Vtbl.new: MethodTooLong \u2014 new 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":"crates/platform/src/bindings.rs"},"region":{"startLine":8711}}}],"partialFingerprints":{"codehealthFindingId/v1":"13bf56f279b7428f5e242a3c25f08e8933ca87db6a219b0357d0e0debf5349bf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IDesktopWallpaper_Vtbl.new: MethodTooLong \u2014 new runs 251 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 151 over it, 2.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/platform/src/bindings.rs"},"region":{"startLine":7111}}}],"partialFingerprints":{"codehealthFindingId/v1":"930959baa077b42996fc9482fc65677f4ec430e9ca0d42c8c6fd4a9129cb3692"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fence_window/dnd.rs: FileTooLong \u2014 1253 significant 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 753 over it, 2.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/dnd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45119c4bcd48b1813d70647d29e2db086ea35a1d7d8a41e3557926f1529d5c02"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FenceDropHandler.drop: MethodTooLong \u2014 drop runs 248 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 148 over it, 2.48\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/dnd.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d291610bf357b228d2e2d03bfc7f33300162d4a06f126dda8138bce5f9a59a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/menus.rs: FileTooLong \u2014 1239 significant 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: App (267-1693). The bar is 500 significant lines; this is 739 over it, 2.48\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/app/src/app/menus.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d77431a944311f58f1159f8412a5ac174b259f8145ca08c956e96d050a3d0a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: FenceChrome: TooManyMethods \u2014 74 methods. The bar is 30 methods; this is 44 over it, 2.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":"crates/render/src/fence_chrome.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"67471463dd2c7c38bb78ba88641ddcfd92b6c95a339bb651e84f257883c4c2c6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IShellLinkW_Vtbl.new: MethodTooLong \u2014 new 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":"crates/platform/src/bindings.rs"},"region":{"startLine":14061}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3b24f91b29b31d687a83310b4235708f438a0d34f2a2880f0ffbc7c5d91f24"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ID3D11Device_Vtbl: ClassTooLong \u2014 948 significant 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 5056-6337. The bar is 400 significant lines; this is 548 over it, 2.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/gpu_bindings.rs"},"region":{"startLine":5056}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e737d726606273c93a6e64259e47f442a8d2d89f95069861bc09bee74c88e2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DesktopAnchor: TooManyMethods \u2014 71 methods. The bar is 30 methods; this is 41 over it, 2.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/anchor.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd408dc384be83c2a027f2cd309b9ffc0999260c097fed15ec63c4fac7de09e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/settings.rs: FileTooLong \u2014 1167 significant 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: App (2 blocks, 196-1754). The bar is 500 significant lines; this is 667 over it, 2.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":"crates/app/src/app/settings.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e8207b68048c0780ee680bb7a96760f337bf43015a65160d21503639c7968a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pecofence::app::fence_options::parse_fence_prop: FunctionTooLong \u2014 pecofence::app::fence_options::parse_fence_prop 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":"crates/app/src/app/fence_options.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"204402146e8d946fb4d5981fe3a5ec000cdd307d3bce723c81d385e287f1ff09"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/fences.rs: FileTooLong \u2014 1102 significant 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: App (71-1664). The bar is 500 significant lines; this is 602 over it, 2.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":"crates/app/src/app/fences.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb5f793d3f700154cf4218739c8d89767ffcf1678b031121e38a19c0ecc6197"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/visuals.rs: FileTooLong \u2014 1086 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 586 over it, 2.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/visuals.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7439e51329844eade2700ee849847d03de7d35027551b0f6f4b25b576ac86c6a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/shell.rs: FileTooLong \u2014 1082 significant 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 88 free functions. The bar is 500 significant lines; this is 582 over it, 2.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/shell.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c31bdaaf2cf06296b5022b1371ce15a69a65fcb5aa24eff810fcd0e023a491d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IShellBrowser_Vtbl.new: MethodTooLong \u2014 new 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":"crates/platform/src/bindings.rs"},"region":{"startLine":12217}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52e9148c9620a1dabee890e4c72f32c2016caf5b68f458fb742412cf918b66f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FenceViewState.render_drag_image: MethodTooLong \u2014 render_drag_image runs 212 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 112 over it, 2.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/dnd.rs"},"region":{"startLine":1587}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8d25dd65cf43b7f924d2ec6954bc39575d5794a4e57a043a053f31f702f84d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IFolderView_Vtbl.new: MethodTooLong \u2014 new runs 210 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/platform/src/bindings.rs"},"region":{"startLine":10511}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eec8ab97aae78959890546767e599cc41cb2546fd87f07e2a5f1b5527e74432"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FenceViewState.redraw_rows: MethodTooLong \u2014 redraw_rows 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":"crates/app/src/fence_window/render.rs"},"region":{"startLine":2207}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e7676314e66ba29e64ef6e57c7206e38cf51b13e9adca565b470af80039e501"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IShellFolder_Vtbl.new: MethodTooLong \u2014 new runs 205 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 105 over it, 2.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":12819}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a43efa719110e371a23ec4e5c35ccf76f5cc40d029edd70f92331d3b50e42ce"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FenceChrome.draw_tab_list: MethodTooLong \u2014 draw_tab_list runs 204 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 104 over it, 2.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/fence_chrome.rs"},"region":{"startLine":3777}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ec8a93c11886807918a8056deb10dd9f5ee5e1d76220013bca64f72b396308"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pecofence::fence_window::handler::keyboard::on_keydown: FunctionTooLong \u2014 pecofence::fence_window::handler::keyboard::on_keydown runs 199 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 99 over it, 1.99\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/keyboard.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fc9b45fd44e95db991840597f981ddca0d3b591b84332d2e6f3c63fd01e16b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pecofence::fence_window::handler::mouse::on_lbuttondown: FunctionTooLong \u2014 pecofence::fence_window::handler::mouse::on_lbuttondown runs 198 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 98 over it, 1.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/mouse.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5cc4667f148f4bb0dda17551c02e08ba5bad3f3781660eeaafe14f6460e99c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pecofence_render::fence_chrome::draw_plate: FunctionTooLong \u2014 pecofence_render::fence_chrome::draw_plate runs 194 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 94 over it, 1.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/fence_chrome.rs"},"region":{"startLine":1122}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7db5823259f1f450e0e96bee54fbe2fc33257ccfb5a743cdf805b5b82314ac5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/smart.rs: FileTooLong \u2014 957 significant 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 84% of them inside a single declaration: App (2 blocks, 208-1410). The bar is 500 significant lines; this is 457 over it, 1.91\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/app/src/app/smart.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e5088559e535cf59014bb2ebf147efe849131e67eec97beaa9218ab08f9667"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FenceViewState.redraw_content: MethodTooLong \u2014 redraw_content runs 190 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/app/src/fence_window/render.rs"},"region":{"startLine":1961}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0051d30451f379a94c489950034ab8ea448cb964a4a7503532f3986416f6298"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/items.rs: FileTooLong \u2014 939 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 91% of them inside a single declaration: App (72-1378). The bar is 500 significant lines; this is 439 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":"crates/app/src/app/items.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c000a26a6adf2c68df7ff0a0e11c4c842e0025f613a1ea898ab9e807e886ed70"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.build_item_menu: MethodTooLong \u2014 build_item_menu 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":"crates/app/src/app/menus.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf9b488fdd322aa8487aa368f02d99b0753cd6dffa2c7b287e3bb228912c35be"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IWICBitmapDecoder_Vtbl.new: MethodTooLong \u2014 new 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":"crates/platform/src/bindings.rs"},"region":{"startLine":15482}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ced1b4f65b826345f674adc67cf7854d9ff0d70d2c03fe6a51f991d442e306f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: handler/nc.rs: FileTooLong \u2014 918 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 418 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":"crates/app/src/fence_window/handler/nc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b26f225e4d05c026f316a93c9ec0f514658f2a1c0e7cd38654ea3d329cf3e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/fence_options.rs: FileTooLong \u2014 915 significant 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 415 over it, 1.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file 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/app/src/app/fence_options.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c9e10bfc0194468faedffb75ad5dbd6983059ad3fa584b856a39e0c2c7e572"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pecofence::fence_window::handler::mouse::on_lbuttonup: FunctionTooLong \u2014 pecofence::fence_window::handler::mouse::on_lbuttonup runs 182 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/mouse.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"240d25930af62b82ece4a8ab90d901bed8221f44f6a03fefde110e134be44021"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/layout.rs: FileTooLong \u2014 905 significant 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 405 over it, 1.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":"crates/app/src/layout.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4163be1247c3ada22b363eacd7c673235ea2f0e9ba237e0c03e0e0a9311b9f7a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ID2D1RenderTarget_Vtbl: TooManyFields \u2014 54 stored fields. The bar is 30 stored fields; this is 24 over it, 1.80\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/platform/src/bindings.rs"},"region":{"startLine":5993}}}],"partialFingerprints":{"codehealthFindingId/v1":"37cd7a9309238fb28f056d29cd4ddd403d69cbc3e33f5b8ca09127860b304762"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ID2D1RenderTarget_Vtbl: TooManyFields \u2014 54 stored fields. The bar is 30 stored fields; this is 24 over it, 1.80\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/render/src/gpu_bindings.rs"},"region":{"startLine":3914}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a5c3ac4f265b459fe86945b6fc3f7ecfc8fdef13846cd1776bffafe8b32a51"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SpriteVisual: TooManyMethods \u2014 53 methods. The bar is 30 methods; this is 23 over it, 1.77\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":17887}}}],"partialFingerprints":{"codehealthFindingId/v1":"a00bc116c57e3ae1ed62a4e895bbcc18245d8180a29626f8ae8a7b15223eca48"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ID2D1Properties_Vtbl.new: MethodTooLong \u2014 new runs 175 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/gpu_bindings.rs"},"region":{"startLine":2925}}}],"partialFingerprints":{"codehealthFindingId/v1":"87354f172a7d47e0e59e50196d482f5e591a0d6f659e17ada4723a373c7af566"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FenceChrome.draw_note: MethodTooLong \u2014 draw_note runs 174 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 74 over it, 1.74\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/fence_chrome.rs"},"region":{"startLine":4876}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9bceb97055bcb28fb4e3cc6cd45ddc130ff74711cd2449cf05f0dd374efe48"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: handler/mouse.rs: FileTooLong \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). The bar is 500 significant lines; this is 368 over it, 1.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":"crates/app/src/fence_window/handler/mouse.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb38119da16967c5337e4bb5320379473bff4e7c5969f8f6cd0ed92d8a157908"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ContainerVisual: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\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/render/src/comp.rs"},"region":{"startLine":7692}}}],"partialFingerprints":{"codehealthFindingId/v1":"08159dd8d9a46a2c474c94d8ba59688bd6fef5dcd215b5cbf5988ce686551eb3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LayerVisual: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\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/render/src/comp.rs"},"region":{"startLine":13512}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc06820f11a69a52b66a95bdf359e0ecd9acad5068793433334bb8a648be6a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/tools.rs: FileTooLong \u2014 850 significant 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: App (93-1264). The bar is 500 significant lines; this is 350 over it, 1.70\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/app/src/app/tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2984e098672ed9ebc5baec5fe9b12eb28a34a924409c7d5f30919f1d4694b5a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pecofence_cli::run::run_fence: FunctionTooLong \u2014 pecofence_cli::run::run_fence runs 170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/run.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d227dfb14df508f2b102871e1badc7c19c6a1887c3602dd743dcbf3df06cdf69"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: FenceDto: TooManyFields \u2014 51 stored fields. The bar is 30 stored fields; this is 21 over it, 1.70\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/ipc/src/dto.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9cfe62724cb460f89101b2eada1dac83a4dd2d122e23b4f12d8c1b3d4a0415b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dragdrop.rs: FileTooLong \u2014 849 significant 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 349 over it, 1.70\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/dragdrop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45b38628e23c6c10261ec106f8f292592611cc5dbd8369725862355e34de5475"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Compositor: 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":"crates/render/src/comp.rs"},"region":{"startLine":7057}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04b08e6a53c9f43fe23065de02184710bb5b72e7efaffada03625e2a2f61c1a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Visual: 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":"crates/render/src/comp.rs"},"region":{"startLine":21255}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a36c7cfe92460ab4a459ebb54835630773545cbc9eee537f9a0857fffdc095f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IWICImagingFactory_Vtbl: ClassTooLong \u2014 664 significant 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 16889-17777. The bar is 400 significant lines; this is 264 over it, 1.66\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/platform/src/bindings.rs"},"region":{"startLine":16889}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4328dd9c7e5c97006bcc17d0dcc065ed3a2b1fa2d0000fdbda074de21feae42"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FenceWindow.make_handler: MethodTooLong \u2014 make_handler runs 163 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/mod.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb54c8ed7d69bd0d43666cc8713f28862ab9dc55184ec0a4168fbb5d0ee61f6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ShadowWindow.update: MethodTooLong \u2014 update runs 161 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/shadow.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d796a150dd8e62e4d47c689524e0ccabe125b1b5bee64c54eaccb807e0f0e0c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.feedback_info_json: MethodTooLong \u2014 feedback_info_json runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/feedback.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"342d82783a44147e7f091a529c1a63110ace745bf7df27beffcad67c332e9980"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.apply_settings: MethodTooLong \u2014 apply_settings runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/settings.rs"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7aa5e788330183058806902d1e2e8e8316806e1ddf291bb02c28bf77674c256"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SettingsHost.open: MethodTooLong \u2014 open runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/settings_host.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbf75b6cfe4a1b747bffa14eda43f394827b87305885f8d7c83e1074ee132e08"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ColorKeyFrameAnimation: TooManyMethods \u2014 46 methods. The bar is 30 methods; this is 16 over it, 1.53\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/render/src/comp.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1c8753868fb5d57a59ba466e9a43eac85134ce7fff4f306e60839e459429c7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: CONTEXT: TooManyFields \u2014 46 stored fields. The bar is 30 stored fields; this is 16 over it, 1.53\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":3396}}}],"partialFingerprints":{"codehealthFindingId/v1":"b267919c26ed6e650075b339157b68ac619698e1a6c93638b17e821be570430e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FenceViewState.draw_chrome_panel: MethodTooLong \u2014 draw_chrome_panel runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/render.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"164dd5f6249616bdf7a11f043bb5fa8b17badff9db34864ee7f8be0a4fd080e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pecofence_core::config_store::lint: FunctionTooLong \u2014 pecofence_core::config_store::lint runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/config_store.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"504d1d3c75e190ade135db417e743a9f7a49af7ba981537576bfaaa500d56369"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fence_window/tabs.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 80% of them inside a single declaration: FenceViewState (268-1203). 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":"crates/app/src/fence_window/tabs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adca633f18a08b498e25c029451b2df811733f962dfaaeb2be9ad8c74b5c482d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.show_tray_menu: MethodTooLong \u2014 show_tray_menu runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/menus.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7089ce9b20527228b79de4a9e25efcbc93fe955f1232a0c67c796a1f95ac960"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IShellView_Vtbl.new: MethodTooLong \u2014 new runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":14570}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d7714b4f46a7a4ce1e71faabb0adc83188ff3b9c988c7fc61e2a0e667cfe6c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ScalarKeyFrameAnimation: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":15540}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8f0431e3472257561d758bfa56f347a341e3f11120de36f83fa4f179603792"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Vector2KeyFrameAnimation: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":18801}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb114ec2dba5859d6da39e840d37bedd3b8fc237bbba2c812ba85a557fa1867"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Vector3KeyFrameAnimation: TooManyMethods \u2014 44 methods. The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":19750}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2f1a7bc41ebaa90265e0dc4d5b55b528749f65c971ae45d660b8aa27bb29921"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Session: TooManyFields \u2014 43 stored fields beside 7 methods. The bar is 30 stored fields; this is 13 over it, 1.43\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/peek_search.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a269de38fcafac38718584bd9d6bbda513906dc54b414205a888a96045c58b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: KeyFrameAnimation: 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":"crates/render/src/comp.rs"},"region":{"startLine":12968}}}],"partialFingerprints":{"codehealthFindingId/v1":"766ce04ac904e7a3c00ebfb1697d4295fd9860cbd7c553c6b5db42f274513acd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: QuaternionKeyFrameAnimation: 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":"crates/render/src/comp.rs"},"region":{"startLine":14984}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed067bb4ddf189ce93ad4810665791bf013b07617dac1f8bc223564ba58cda4f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Vector4KeyFrameAnimation: 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":"crates/render/src/comp.rs"},"region":{"startLine":20699}}}],"partialFingerprints":{"codehealthFindingId/v1":"431789dc6686790be4f8fbcc2f4ad752cd81ec01e7d78181a99277ee47fe760d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/search.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), about 88% of them inside a single declaration: App (83-926). The bar is 500 significant lines; this is 192 over it, 1.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":"crates/app/src/app/search.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cefb6d3110a8b54afe5ea98a8151873bdd6ae7d594f90e798e875c6f67a875"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/run.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":"crates/cli/src/run.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e716d1ecc5671083f25765defd0cb5810eab31597b7340bacd9286eedbb704c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ID3D11Device_Vtbl: TooManyFields \u2014 41 stored fields beside 2 methods. The bar is 30 stored fields; this is 11 over it, 1.37\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/gpu_bindings.rs"},"region":{"startLine":5056}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b18e961ea09d6399f6379ae67317a07f9afc7ed48f10b5109d4a04b563b64ae"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: MIB_IF_ROW2: TooManyFields \u2014 41 stored fields. The bar is 30 stored fields; this is 11 over it, 1.37\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":18058}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfd26e7f8812e481548fefcab305701a3f558048e5b0a40b3433c30050fb400"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.reflow_pushed_once: MethodTooLong \u2014 reflow_pushed_once runs 136 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 36 over it, 1.36\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/push.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"731cf8ac567217b26450ed0372129c6e850521a88da0d1530ae05314c2ba72b0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/theme.rs: FileTooLong \u2014 677 significant 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: Theme (2 blocks, 20-1059). The bar is 500 significant lines; this is 177 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":"crates/render/src/theme.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e4bc2da95dec3ae31a6f1501124ca4c1ffcbc3d9a6102eadf2eb5ea9b52349"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PeekOverlay.show: MethodTooLong \u2014 show runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/peek.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9c7f32af2eb9109a855b2b0fb45f4b5017e0e8e13c2e4e2757200ef992257d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: pecofence_platform::desktop: TooManyFunctions \u2014 40 free functions. The bar is 30 free functions; this is 10 over it, 1.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":"crates/platform/src/desktop.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed8695d62b88dd6b31eaaaae212605f295800967ec64737ed338bbbaf2862699"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: DWM_TIMING_INFO: TooManyFields \u2014 40 stored fields. 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":"crates/platform/src/bindings.rs"},"region":{"startLine":4145}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafdb5e8063ef0e7dd21d45b8d2339933337b9cf8fe44b3ac53fca9fa8b866e0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: IDWriteTextLayout_Vtbl: TooManyFields \u2014 40 stored fields. 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":"crates/platform/src/bindings.rs"},"region":{"startLine":6387}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc92bcfc905475a5b56fcff862c7df53b7268e76f4f589c017eb0c9fb7ae54ba"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: IDWriteTextLayout_Vtbl: TooManyFields \u2014 40 stored fields. 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":"crates/render/src/gpu_bindings.rs"},"region":{"startLine":8808}}}],"partialFingerprints":{"codehealthFindingId/v1":"816c67a1241583b7624994d1f163594c28d0d391a52eebdd1fa6537c6e9192c7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.show_search_rows: MethodTooLong \u2014 show_search_rows runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/search.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a8638f973a93ed7ac23909a085d082bee05595e5012f7da3625099a597445f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IMap_Vtbl.new: MethodTooLong \u2014 new runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":11545}}}],"partialFingerprints":{"codehealthFindingId/v1":"341e7bea794935ac1fb9573a152d00d41540691aa5e3fe42c572ea2b5623167b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.fence_dto_with: MethodTooLong \u2014 fence_dto_with runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/ipc.rs"},"region":{"startLine":1692}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f5e6c80352f753d8cc6451c8fbfc20e7d7efd2821afa7535f6f5e60f56e6c0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IDataObject_Vtbl.new: MethodTooLong \u2014 new 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/platform/src/bindings.rs"},"region":{"startLine":6634}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1a51c7d655aa99e02472ab534304d845cac7ae3f7ad078a1bf6d9e10340d83"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FenceDropHandler: ClassTooLong \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), 6 methods, 3 blocks, lines 373-1153. The bar is 400 significant lines; this is 115 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":"crates/app/src/fence_window/dnd.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e88166b032ac630397cd59b5a6bf0d48fc9f7118d536e54ccb39bbf72b1b42"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pecofence::notice::handle: FunctionTooLong \u2014 pecofence::notice::handle runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/notice.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c7c23d437db56dc89ba41b434bba657eac2c250a2e592b8dcc61091dbcac2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pecofence::rename::begin_rename_at: FunctionTooLong \u2014 pecofence::rename::begin_rename_at runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/rename.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d31327ee685d5c261238cdf788232b0e6b7c7a1c356a48cc7b0aa3a9e67014"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fence_window/items.rs: FileTooLong \u2014 636 significant 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: FenceViewState (198-996). The bar is 500 significant lines; this is 136 over it, 1.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":"crates/app/src/fence_window/items.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da9179697c8fd7c8d59dc76df578b20980540320a243cbe889974c4b5143d24c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: DesktopAnchor: TooManyFields \u2014 38 stored fields beside 71 methods. 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":"crates/app/src/anchor.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"5348676383a2d42a44296d2e51a228b52d6a6494422f04306bf86ab18a952e76"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Theme: ClassTooLong \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), 36 methods, 2 blocks, lines 20-1059. The bar is 400 significant lines; this is 104 over it, 1.26\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/theme.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce69a6193a1ecc90e931b147ecb7db4be2c4bd97be4b7473c7beb7e815aa8d3a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: FenceViewState: ClassTooLong \u2014 497 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 339 methods, 2 blocks, lines 99-1091. The bar is 400 significant lines; this is 97 over it, 1.24\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/app/src/fence_window/state.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d34e8a20dce8a9111df9ebf08cf35ac9145c51a200d83d1f744c22873f8479c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fence_window/hit.rs: FileTooLong \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), about 92% of them inside a single declaration: FenceViewState (64-964). The bar is 500 significant lines; this is 118 over it, 1.24\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/hit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"22e02b822861a107de23474bce3c207985c0e7c8890e847de66b51d8eaa99ec2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Theme: TooManyFields \u2014 37 stored fields beside 36 methods. The bar is 30 stored fields; this is 7 over it, 1.23\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/theme.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b85b09b76975a9117602e1b2a50099acf95808314473a75aee9d94933454d9e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IShellItemArray_Vtbl.new: MethodTooLong \u2014 new runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":13482}}}],"partialFingerprints":{"codehealthFindingId/v1":"55467246346ce7f52cab869fa0f2b17b40e9a11e01b4009892f47e06651ee4da"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FenceChrome.draw_script: MethodTooLong \u2014 draw_script runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/fence_chrome.rs"},"region":{"startLine":5314}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c4740ddf29538f6d0d9418c6df56a462735b2c31a4380a9f078aabcc7331b3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.on_fileop_done: MethodTooLong \u2014 on_fileop_done runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/fileops.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec48f7513ce551416464e352fbf453dcac07ac7e4f68e728aa3d53e9b6a7b211"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.apply_undo: MethodTooLong \u2014 apply_undo runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/undo.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"625c79008b58229d27df71ca10cdbb08c0c4f852bb7cbe843c57e3d661cbf5b1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FenceWindow.set_tabs: MethodTooLong \u2014 set_tabs runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/api.rs"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"796759f3c7337ca4af640c7137d00ca1bdd14b10cacd23a07f87275b449a775d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Theme: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/theme.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb0494d2142df9aab039dfed066daa20195e8633d224db83da479342e69b7ce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pecofence::fence_window::window_drag::flush_window_drag: FunctionTooLong \u2014 pecofence::fence_window::window_drag::flush_window_drag runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/window_drag.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2005cc068e80b21ab1873b844423925ad4693a2752a3dd5033c0330c81039ba4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: IP_ADAPTER_ADDRESSES_LH: TooManyFields \u2014 36 stored fields. The bar is 30 stored fields; this is 6 over it, 1.20\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/platform/src/bindings.rs"},"region":{"startLine":10983}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fd80442647e0e39ded4b4ad57133a6832fa6b30084ae1c0146e39ff04d8dc9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ID2D1DeviceContext_Vtbl: TooManyFields \u2014 36 stored fields. The bar is 30 stored fields; this is 6 over it, 1.20\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/render/src/gpu_bindings.rs"},"region":{"startLine":1999}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48726ca2a4d3041764c183d2841fe0264e21e44cd568df72b95d42bc229ecdb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/edit.rs: FileTooLong \u2014 598 significant 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 98 over it, 1.20\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/edit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d147a89db36564950968635fb314da0a082bd779c9e1fdccfdf8b14bc780110c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/welcome.rs: FileTooLong \u2014 596 significant 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: App (168-931). 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":"crates/app/src/app/welcome.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1fdc3cba0d8c28293c98bcdf1edb49e8b8695818fb58360b2c9d23915ec2a31"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DesktopAnchor.create: MethodTooLong \u2014 create 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/app/src/anchor.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a1e28bf2f744f398ceb169c169b8d411f987f7329d10f0d0c97f5dac3537d7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.welcome_texts: MethodTooLong \u2014 welcome_texts 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/app/src/app/welcome.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"c953cee7faa3898916ef7009266da99bca04af8ad2d2247e53cabaa535789372"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tray.rs: FileTooLong \u2014 593 significant 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 93 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/tray.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"940f4b1f23a955eaa0e0ac7477e6b1990aac560cfb6084d475c06a4bb1d9acc2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Compositor: ClassTooLong \u2014 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), 50 methods, 4 blocks, lines 7063-7687. The bar is 400 significant lines; this is 73 over it, 1.18\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":7057}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f932adf04831391b97e01c90cf469fc9da35b81002367a9ebe1bc6cc4c4364e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.detach_tab: MethodTooLong \u2014 detach_tab 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/app/src/app/tabs.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"83fa3f5258967f812458cfd5e6b293da8f74ae2a42316a8160ce6e6cf3444cc8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fence_window/scroll.rs: FileTooLong \u2014 587 significant 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 73% of them inside a single declaration: FenceViewState (294-978). The bar is 500 significant lines; this is 87 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":"crates/app/src/fence_window/scroll.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6196dff770a15776b03be6f8d7194d4d65e92067054c6fc6e82a869831729dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/testscript.rs: FileTooLong \u2014 584 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 75% of them inside a single declaration: App (102-724). 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":"crates/app/src/app/testscript.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8644b1b20b1f8d095d8db1350c577b4c3f7c41c7a2c115a69a9ef56e743de02"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/peek.rs: FileTooLong \u2014 581 significant 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: App (132-929). The bar is 500 significant lines; this is 81 over it, 1.16\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/peek.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50dcec455c76902ffc888b2c2a33b119fd1d029eb4076f79f10a303888eb0aec"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fence_window/roll.rs: FileTooLong \u2014 575 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 87% of them inside a single declaration: FenceViewState (157-956). The bar is 500 significant lines; this is 75 over it, 1.15\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/app/src/fence_window/roll.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c78ac641d59bfb6df364e5ba9c096242738ab4e866d79138388daedf0c62a61b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NoticeCard.draw: MethodTooLong \u2014 draw runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/notice.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c89bbc4af2ae4c44ca61ac91de6f4ac838cdc3fcd3d7191fc98640eaa106b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/window.rs: FileTooLong \u2014 573 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 49 free functions. The bar is 500 significant lines; this is 73 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/window.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5104a3fc0a7cdb10d0911b4a7d662ae809dc0df443166f81d091551b1412073a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: IVisual_Vtbl: TooManyFields \u2014 34 stored fields. The bar is 30 stored fields; this is 4 over it, 1.13\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/render/src/comp.rs"},"region":{"startLine":12075}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69566d46712225197f0746ed43ca6410ec4d7a301f52441a84681c5600be3fb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SpriteVisual: ClassTooLong \u2014 453 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 53 methods, 4 blocks, lines 17900-18522. The bar is 400 significant lines; this is 53 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":17887}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b9381a066f7bb531a3784567db253a4d1ef26629ff28cab7c0d0f9c4db6a57"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/scripts.rs: FileTooLong \u2014 565 significant 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 65 over it, 1.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/scripts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5748f6a4c79c9ab8ad1c18e577652d72fb39066673dc310a28a29d18180c4734"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/config_store.rs: FileTooLong \u2014 560 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 60 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/config_store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"953d7ee748fe509e7973d08798eb1d347db734bfc3b858d55838df191f16d9c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/gpu_glass.rs: FileTooLong \u2014 558 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 58 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/gpu_glass.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe09f84b61608b963259419a50fc62f70d685635a109ed3110d69191e09dbe7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ColorKeyFrameAnimation: ClassTooLong \u2014 446 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 46 methods, 4 blocks, lines 755-1349. The bar is 400 significant lines; this is 46 over it, 1.12\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dae257bab9ecacbf4252b41e185b3d16995df0f561e6468e4635e30c84831a2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InsetClip: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":12572}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd4978b3b0cf191b6880850664e79e2573742c2ff7bc4a8d3bc649e1e3d59a67"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FenceViewState.start_roll_anim: MethodTooLong \u2014 start_roll_anim runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/roll.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea96d9bb8e438fa59274d65e17c6b57b89be1740b554bfbe9e509c807d5f1e1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IQueryAssociations_Vtbl.new: MethodTooLong \u2014 new runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":11697}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a19339141f7828635923d064c91ee591fa06d24dc8e2f40dca4b4acda80a83"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LayerVisual: ClassTooLong \u2014 438 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 51 methods, 4 blocks, lines 13519-14119. 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":"crates/render/src/comp.rs"},"region":{"startLine":13512}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce47af2b52ac4f10c98f3d4f7401d3eb956bc64745b8c467e266d0121d8ff88"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ContainerVisual: ClassTooLong \u2014 437 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 51 methods, 4 blocks, lines 7704-8303. 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":"crates/render/src/comp.rs"},"region":{"startLine":7692}}}],"partialFingerprints":{"codehealthFindingId/v1":"f546f93aa6406fd58a356d33c45c77fc7b795a564f36df8ce216d2bd48fe5344"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: pecofence::filter_box::open: FunctionTooLong \u2014 pecofence::filter_box::open runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/filter_box.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae4e72f8749b9295a00e454a39992f9f0ca4687b3d54b4123073f93ddc0dc01"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fence_window/state.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 92% of them inside a single declaration: FenceViewState (2 blocks, 99-1091). 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":"crates/app/src/fence_window/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c25f581cf8d368b31f44a58db8abdd823700238b4017532dc115a7adeb2e8a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/settings_host.rs: FileTooLong \u2014 540 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 65% of them inside a single declaration: SettingsHost (2 blocks, 110-660). The bar is 500 significant lines; this is 40 over it, 1.08\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/settings_host.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"656e8ab49500e04d78161ff4e9ccd777d37bdcb3492f54ee6d15493aa5af63d9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Notice.show_card: MethodTooLong \u2014 show_card runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/notice.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b87a2cfb11516be452270f33401f9123abef800f81efbc9a5bf0883133c942"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/backdrop.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). The bar is 500 significant lines; this is 39 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/backdrop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ac7b5bb017cf7aa18189ce29002beca6f56184658f170e2b793ab64f5126d5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ScalarKeyFrameAnimation: ClassTooLong \u2014 430 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 44 methods, 4 blocks, lines 15554-16126. The bar is 400 significant lines; this is 30 over it, 1.08\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":15540}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c48cc5746ed04fe97f47725cfc18ab84a1c9a4f42e4c3fb09c73697084fc44"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Vector2KeyFrameAnimation: ClassTooLong \u2014 430 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 44 methods, 4 blocks, lines 18815-19387. The bar is 400 significant lines; this is 30 over it, 1.08\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":18801}}}],"partialFingerprints":{"codehealthFindingId/v1":"613b6aad6db9fa06d2922217ae3ce636bbf974384e18ae53ddc51b3e0b38cb81"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Vector3KeyFrameAnimation: ClassTooLong \u2014 430 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 44 methods, 4 blocks, lines 19764-20336. The bar is 400 significant lines; this is 30 over it, 1.08\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":19750}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe184889224e761eb6c3011fc871f6374d50a21603a585cd55f4ca604fd234a3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.apply_fence_prop: MethodTooLong \u2014 apply_fence_prop runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/fence_options.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"645c8958d4782d57349d8838ba7bc10968ad44635a9f5970de9363d051b60f07"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FenceChrome.draw_content: MethodTooLong \u2014 draw_content runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/fence_chrome.rs"},"region":{"startLine":4422}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd822dc47d7139d3df7d152230a83738d9de3d63f0e0cc148a62f46b877a2632"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: fence_window/desktop_layout.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), about 70% of them inside a single declaration: FenceViewState (260-775). The bar is 500 significant lines; this is 19 over it, 1.04\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/desktop_layout.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04c1b652c00fa27915c927be22daa9c575307a1a80b2dfb0ff4662fb4db2eff"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Behavior: TooManyFields \u2014 31 stored fields beside 10 methods. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/mod.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5f02165d60bd2fb22336fc3d8d213cd2dc69b77c88db57314349004d73e02c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ARM64_NT_CONTEXT_0_0: TooManyFields \u2014 31 stored fields. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":3056}}}],"partialFingerprints":{"codehealthFindingId/v1":"63601f6097fbd595ae5309c13f9ad11ae2a1d0f43bb115df17dddd5a8c65e67c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: ARM64_NT_CONTEXT_0_0: TooManyFields \u2014 31 stored fields. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":3128}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a82348f5dede390a232276269cdbdbdcb0a849e7b68c47888ee1acf8791050"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.script_row_clicked: MethodTooLong \u2014 script_row_clicked runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/tools.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f8d8d2c6516c134d0d164f271f2638e336e45f5db238d09a17874a582aedb4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: QuaternionKeyFrameAnimation: ClassTooLong \u2014 404 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 42 methods, 4 blocks, lines 14996-15535. The bar is 400 significant lines; this is 4 over it, 1.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":14984}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d471208479159dcd405f18ad896d56226bc19e3282cec8079dab911a23d70b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Vector4KeyFrameAnimation: ClassTooLong \u2014 404 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 42 methods, 4 blocks, lines 20711-21250. The bar is 400 significant lines; this is 4 over it, 1.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":20699}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0caa04db0a5b3a224f3b586282a38060ec7038931cfe0262261344502318c2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FenceChrome.new: MethodTooLong \u2014 new runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/fence_chrome.rs"},"region":{"startLine":2077}}}],"partialFingerprints":{"codehealthFindingId/v1":"94854f2a9031a094f48c522a567ee8c187d7171b7e41ecd740d157afec4917d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/icons.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), about 64% of them inside a single declaration: IconCache (2 blocks, 235-724). The bar is 500 significant lines; this is 4 over it, 1.01\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/app/src/icons.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cf1e0dabbd6240b3a2b9319b3307adf3c903345552712d9f6798fd31ababdeb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/measure-trailer-targets.py: FileTooLong \u2014 502 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2 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":"extras/pecofence-promo/scripts/measure-trailer-targets.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4390ff6663f8580c5493d4d5a098821cb67c8e9cd3e0b4f7e055e07c20b93f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/note_edit.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":"crates/app/src/note_edit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1920a02d58d3078e1e5bb61678dbbf48ac272fa06347064b6f3c86f12b5a497"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (63 members, 50\u002B identical tokens): crates/render/src/comp.rs:75-85 | crates/render/src/comp.rs:311-321 | crates/render/src/comp.rs:474-484 | crates/render/src/comp.rs:637-647 | crates/render/src/comp.rs:1068-1078 | crates/render/src/comp.rs:1613-1623 | crates/render/src/comp.rs:1772-1782 | crates/render/src/comp.rs:1962-1972 | crates/render/src/comp.rs:2144-2154 | crates/render/src/comp.rs:2375-2385 | crates/render/src/comp.rs:2690-2700 | crates/render/src/comp.rs:2873-2883 | crates/render/src/comp.rs:3032-3042 | crates/render/src/comp.rs:3221-3231 | crates/render/src/comp.rs:3614-3624 | crates/render/src/comp.rs:3804-3814 | crates/render/src/comp.rs:4168-4178 | crates/render/src/comp.rs:4384-4394 | crates/render/src/comp.rs:4566-4576 | crates/render/src/comp.rs:4725-4735 | crates/render/src/comp.rs:4889-4899 | crates/render/src/comp.rs:5049-5059 | crates/render/src/comp.rs:5212-5222 | crates/render/src/comp.rs:5366-5376 | crates/render/src/comp.rs:5573-5583 | crates/render/src/comp.rs:6040-6050 | crates/render/src/comp.rs:6260-6270 | crates/render/src/comp.rs:6489-6499 | crates/render/src/comp.rs:6652-6662 | crates/render/src/comp.rs:6811-6821 | crates/render/src/comp.rs:6970-6980 | crates/render/src/comp.rs:7769-7779 | crates/render/src/comp.rs:8406-8416 | crates/render/src/comp.rs:8565-8575 | crates/render/src/comp.rs:8724-8734 | crates/render/src/comp.rs:8887-8897 | crates/render/src/comp.rs:9050-9060 | crates/render/src/comp.rs:9408-9418 | crates/render/src/comp.rs:12341-12351 | crates/render/src/comp.rs:12805-12815 | crates/render/src/comp.rs:13239-13249 | crates/render/src/comp.rs:13584-13594 | crates/render/src/comp.rs:14201-14211 | crates/render/src/comp.rs:14557-14567 | crates/render/src/comp.rs:14716-14726 | crates/render/src/comp.rs:14879-14889 | crates/render/src/comp.rs:15254-15264 | crates/render/src/comp.rs:15812-15822 | crates/render/src/comp.rs:16401-16411 | crates/render/src/comp.rs:16564-16574 | crates/render/src/comp.rs:16723-16733 | crates/render/src/comp.rs:17081-17091 | crates/render/src/comp.rs:17440-17450 | crates/render/src/comp.rs:17799-17809 | crates/render/src/comp.rs:17965-17975 | crates/render/src/comp.rs:18603-18613 | crates/render/src/comp.rs:19073-19083 | crates/render/src/comp.rs:19662-19672 | crates/render/src/comp.rs:20022-20032 | crates/render/src/comp.rs:20611-20621 | crates/render/src/comp.rs:20969-20979 | crates/render/src/comp.rs:21323-21333 | crates/render/src/comp.rs:21896-21906 \u2014 These 63 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 63 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 63 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2b4cb2f18fbb94ccfeb69345545362e5091cc745c78469d28a4e7149be9f44"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (63 members, 50\u002B identical tokens): crates/render/src/comp.rs:96-106 | crates/render/src/comp.rs:332-342 | crates/render/src/comp.rs:495-505 | crates/render/src/comp.rs:658-668 | crates/render/src/comp.rs:1089-1099 | crates/render/src/comp.rs:1634-1644 | crates/render/src/comp.rs:1793-1803 | crates/render/src/comp.rs:1983-1993 | crates/render/src/comp.rs:2165-2175 | crates/render/src/comp.rs:2396-2406 | crates/render/src/comp.rs:2711-2721 | crates/render/src/comp.rs:2894-2904 | crates/render/src/comp.rs:3053-3063 | crates/render/src/comp.rs:3242-3252 | crates/render/src/comp.rs:3635-3645 | crates/render/src/comp.rs:3825-3835 | crates/render/src/comp.rs:4189-4199 | crates/render/src/comp.rs:4405-4415 | crates/render/src/comp.rs:4587-4597 | crates/render/src/comp.rs:4746-4756 | crates/render/src/comp.rs:4910-4920 | crates/render/src/comp.rs:5070-5080 | crates/render/src/comp.rs:5233-5243 | crates/render/src/comp.rs:5387-5397 | crates/render/src/comp.rs:5594-5604 | crates/render/src/comp.rs:6061-6071 | crates/render/src/comp.rs:6281-6291 | crates/render/src/comp.rs:6510-6520 | crates/render/src/comp.rs:6673-6683 | crates/render/src/comp.rs:6832-6842 | crates/render/src/comp.rs:6991-7001 | crates/render/src/comp.rs:7790-7800 | crates/render/src/comp.rs:8427-8437 | crates/render/src/comp.rs:8586-8596 | crates/render/src/comp.rs:8745-8755 | crates/render/src/comp.rs:8908-8918 | crates/render/src/comp.rs:9071-9081 | crates/render/src/comp.rs:9429-9439 | crates/render/src/comp.rs:12362-12372 | crates/render/src/comp.rs:12826-12836 | crates/render/src/comp.rs:13260-13270 | crates/render/src/comp.rs:13605-13615 | crates/render/src/comp.rs:14222-14232 | crates/render/src/comp.rs:14578-14588 | crates/render/src/comp.rs:14737-14747 | crates/render/src/comp.rs:14900-14910 | crates/render/src/comp.rs:15275-15285 | crates/render/src/comp.rs:15833-15843 | crates/render/src/comp.rs:16422-16432 | crates/render/src/comp.rs:16585-16595 | crates/render/src/comp.rs:16744-16754 | crates/render/src/comp.rs:17102-17112 | crates/render/src/comp.rs:17461-17471 | crates/render/src/comp.rs:17820-17830 | crates/render/src/comp.rs:17986-17996 | crates/render/src/comp.rs:18624-18634 | crates/render/src/comp.rs:19094-19104 | crates/render/src/comp.rs:19683-19693 | crates/render/src/comp.rs:20043-20053 | crates/render/src/comp.rs:20632-20642 | crates/render/src/comp.rs:20990-21000 | crates/render/src/comp.rs:21344-21354 | crates/render/src/comp.rs:21917-21927 \u2014 These 63 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 63 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 63 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf592f495c9660e2010ca0f0069c225ff7f4dedbff534b507bfc677b2fbff56"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (63 members, 50\u002B identical tokens): crates/render/src/comp.rs:110-119 | crates/render/src/comp.rs:346-355 | crates/render/src/comp.rs:509-518 | crates/render/src/comp.rs:672-681 | crates/render/src/comp.rs:1103-1112 | crates/render/src/comp.rs:1648-1657 | crates/render/src/comp.rs:1807-1816 | crates/render/src/comp.rs:1997-2006 | crates/render/src/comp.rs:2179-2188 | crates/render/src/comp.rs:2410-2419 | crates/render/src/comp.rs:2725-2734 | crates/render/src/comp.rs:2908-2917 | crates/render/src/comp.rs:3067-3076 | crates/render/src/comp.rs:3256-3265 | crates/render/src/comp.rs:3649-3658 | crates/render/src/comp.rs:3839-3848 | crates/render/src/comp.rs:4203-4212 | crates/render/src/comp.rs:4419-4428 | crates/render/src/comp.rs:4601-4610 | crates/render/src/comp.rs:4760-4769 | crates/render/src/comp.rs:4924-4933 | crates/render/src/comp.rs:5084-5093 | crates/render/src/comp.rs:5247-5256 | crates/render/src/comp.rs:5401-5410 | crates/render/src/comp.rs:5608-5617 | crates/render/src/comp.rs:6075-6084 | crates/render/src/comp.rs:6295-6304 | crates/render/src/comp.rs:6524-6533 | crates/render/src/comp.rs:6687-6696 | crates/render/src/comp.rs:6846-6855 | crates/render/src/comp.rs:7005-7014 | crates/render/src/comp.rs:7804-7813 | crates/render/src/comp.rs:8441-8450 | crates/render/src/comp.rs:8600-8609 | crates/render/src/comp.rs:8759-8768 | crates/render/src/comp.rs:8922-8931 | crates/render/src/comp.rs:9085-9094 | crates/render/src/comp.rs:9443-9452 | crates/render/src/comp.rs:12376-12385 | crates/render/src/comp.rs:12840-12849 | crates/render/src/comp.rs:13274-13283 | crates/render/src/comp.rs:13619-13628 | crates/render/src/comp.rs:14236-14245 | crates/render/src/comp.rs:14592-14601 | crates/render/src/comp.rs:14751-14760 | crates/render/src/comp.rs:14914-14923 | crates/render/src/comp.rs:15289-15298 | crates/render/src/comp.rs:15847-15856 | crates/render/src/comp.rs:16436-16445 | crates/render/src/comp.rs:16599-16608 | crates/render/src/comp.rs:16758-16767 | crates/render/src/comp.rs:17116-17125 | crates/render/src/comp.rs:17475-17484 | crates/render/src/comp.rs:17834-17843 | crates/render/src/comp.rs:18000-18009 | crates/render/src/comp.rs:18638-18647 | crates/render/src/comp.rs:19108-19117 | crates/render/src/comp.rs:19697-19706 | crates/render/src/comp.rs:20057-20066 | crates/render/src/comp.rs:20646-20655 | crates/render/src/comp.rs:21004-21013 | crates/render/src/comp.rs:21358-21367 | crates/render/src/comp.rs:21931-21940 \u2014 These 63 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 63 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 63 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"98113c36be5276fdac54a8c5fe20be9fd2abe96ff89c809d3be76b2ddefd3ea6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (63 members, 50\u002B identical tokens): crates/render/src/comp.rs:123-132 | crates/render/src/comp.rs:359-368 | crates/render/src/comp.rs:522-531 | crates/render/src/comp.rs:685-694 | crates/render/src/comp.rs:1116-1125 | crates/render/src/comp.rs:1661-1670 | crates/render/src/comp.rs:1820-1829 | crates/render/src/comp.rs:2010-2019 | crates/render/src/comp.rs:2192-2201 | crates/render/src/comp.rs:2423-2432 | crates/render/src/comp.rs:2738-2747 | crates/render/src/comp.rs:2921-2930 | crates/render/src/comp.rs:3080-3089 | crates/render/src/comp.rs:3269-3278 | crates/render/src/comp.rs:3662-3671 | crates/render/src/comp.rs:3852-3861 | crates/render/src/comp.rs:4216-4225 | crates/render/src/comp.rs:4432-4441 | crates/render/src/comp.rs:4614-4623 | crates/render/src/comp.rs:4773-4782 | crates/render/src/comp.rs:4937-4946 | crates/render/src/comp.rs:5097-5106 | crates/render/src/comp.rs:5260-5269 | crates/render/src/comp.rs:5414-5423 | crates/render/src/comp.rs:5621-5630 | crates/render/src/comp.rs:6088-6097 | crates/render/src/comp.rs:6308-6317 | crates/render/src/comp.rs:6537-6546 | crates/render/src/comp.rs:6700-6709 | crates/render/src/comp.rs:6859-6868 | crates/render/src/comp.rs:7018-7027 | crates/render/src/comp.rs:7817-7826 | crates/render/src/comp.rs:8454-8463 | crates/render/src/comp.rs:8613-8622 | crates/render/src/comp.rs:8772-8781 | crates/render/src/comp.rs:8935-8944 | crates/render/src/comp.rs:9098-9107 | crates/render/src/comp.rs:9456-9465 | crates/render/src/comp.rs:12389-12398 | crates/render/src/comp.rs:12853-12862 | crates/render/src/comp.rs:13287-13296 | crates/render/src/comp.rs:13632-13641 | crates/render/src/comp.rs:14249-14258 | crates/render/src/comp.rs:14605-14614 | crates/render/src/comp.rs:14764-14773 | crates/render/src/comp.rs:14927-14936 | crates/render/src/comp.rs:15302-15311 | crates/render/src/comp.rs:15860-15869 | crates/render/src/comp.rs:16449-16458 | crates/render/src/comp.rs:16612-16621 | crates/render/src/comp.rs:16771-16780 | crates/render/src/comp.rs:17129-17138 | crates/render/src/comp.rs:17488-17497 | crates/render/src/comp.rs:17847-17856 | crates/render/src/comp.rs:18013-18022 | crates/render/src/comp.rs:18651-18660 | crates/render/src/comp.rs:19121-19130 | crates/render/src/comp.rs:19710-19719 | crates/render/src/comp.rs:20070-20079 | crates/render/src/comp.rs:20659-20668 | crates/render/src/comp.rs:21017-21026 | crates/render/src/comp.rs:21371-21380 | crates/render/src/comp.rs:21944-21953 \u2014 These 63 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 63 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 63 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"28281f8d2ff1497b9d4fa2b35f07384f91805440c54638a48c2328cf468acd06"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (63 members, 50\u002B identical tokens): crates/render/src/comp.rs:136-145 | crates/render/src/comp.rs:372-381 | crates/render/src/comp.rs:535-544 | crates/render/src/comp.rs:698-707 | crates/render/src/comp.rs:1129-1138 | crates/render/src/comp.rs:1674-1683 | crates/render/src/comp.rs:1833-1842 | crates/render/src/comp.rs:2023-2032 | crates/render/src/comp.rs:2205-2214 | crates/render/src/comp.rs:2436-2445 | crates/render/src/comp.rs:2751-2760 | crates/render/src/comp.rs:2934-2943 | crates/render/src/comp.rs:3093-3102 | crates/render/src/comp.rs:3282-3291 | crates/render/src/comp.rs:3675-3684 | crates/render/src/comp.rs:3865-3874 | crates/render/src/comp.rs:4229-4238 | crates/render/src/comp.rs:4445-4454 | crates/render/src/comp.rs:4627-4636 | crates/render/src/comp.rs:4786-4795 | crates/render/src/comp.rs:4950-4959 | crates/render/src/comp.rs:5110-5119 | crates/render/src/comp.rs:5273-5282 | crates/render/src/comp.rs:5427-5436 | crates/render/src/comp.rs:5634-5643 | crates/render/src/comp.rs:6101-6110 | crates/render/src/comp.rs:6321-6330 | crates/render/src/comp.rs:6550-6559 | crates/render/src/comp.rs:6713-6722 | crates/render/src/comp.rs:6872-6881 | crates/render/src/comp.rs:7031-7040 | crates/render/src/comp.rs:7830-7839 | crates/render/src/comp.rs:8467-8476 | crates/render/src/comp.rs:8626-8635 | crates/render/src/comp.rs:8785-8794 | crates/render/src/comp.rs:8948-8957 | crates/render/src/comp.rs:9111-9120 | crates/render/src/comp.rs:9469-9478 | crates/render/src/comp.rs:12402-12411 | crates/render/src/comp.rs:12866-12875 | crates/render/src/comp.rs:13300-13309 | crates/render/src/comp.rs:13645-13654 | crates/render/src/comp.rs:14262-14271 | crates/render/src/comp.rs:14618-14627 | crates/render/src/comp.rs:14777-14786 | crates/render/src/comp.rs:14940-14949 | crates/render/src/comp.rs:15315-15324 | crates/render/src/comp.rs:15873-15882 | crates/render/src/comp.rs:16462-16471 | crates/render/src/comp.rs:16625-16634 | crates/render/src/comp.rs:16784-16793 | crates/render/src/comp.rs:17142-17151 | crates/render/src/comp.rs:17501-17510 | crates/render/src/comp.rs:17860-17869 | crates/render/src/comp.rs:18026-18035 | crates/render/src/comp.rs:18664-18673 | crates/render/src/comp.rs:19134-19143 | crates/render/src/comp.rs:19723-19732 | crates/render/src/comp.rs:20083-20092 | crates/render/src/comp.rs:20672-20681 | crates/render/src/comp.rs:21030-21039 | crates/render/src/comp.rs:21384-21393 | crates/render/src/comp.rs:21957-21966 \u2014 These 63 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 63 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 63 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38116cc21d2c93e6d00b3ef4a08d3d080d76d75550c0e3eafb6739c7e1e70da"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (62 members, 50\u002B identical tokens): crates/render/src/comp.rs:11-21 | crates/render/src/comp.rs:247-257 | crates/render/src/comp.rs:410-420 | crates/render/src/comp.rs:573-583 | crates/render/src/comp.rs:1004-1014 | crates/render/src/comp.rs:1549-1559 | crates/render/src/comp.rs:1708-1718 | crates/render/src/comp.rs:1898-1908 | crates/render/src/comp.rs:2080-2090 | crates/render/src/comp.rs:2311-2321 | crates/render/src/comp.rs:2626-2636 | crates/render/src/comp.rs:2809-2819 | crates/render/src/comp.rs:2968-2978 | crates/render/src/comp.rs:3157-3167 | crates/render/src/comp.rs:3550-3560 | crates/render/src/comp.rs:3740-3750 | crates/render/src/comp.rs:4104-4114 | crates/render/src/comp.rs:4320-4330 | crates/render/src/comp.rs:4502-4512 | crates/render/src/comp.rs:4661-4671 | crates/render/src/comp.rs:4825-4835 | crates/render/src/comp.rs:4985-4995 | crates/render/src/comp.rs:5148-5158 | crates/render/src/comp.rs:5509-5519 | crates/render/src/comp.rs:5976-5986 | crates/render/src/comp.rs:6196-6206 | crates/render/src/comp.rs:6425-6435 | crates/render/src/comp.rs:6588-6598 | crates/render/src/comp.rs:6747-6757 | crates/render/src/comp.rs:6906-6916 | crates/render/src/comp.rs:7705-7715 | crates/render/src/comp.rs:8342-8352 | crates/render/src/comp.rs:8501-8511 | crates/render/src/comp.rs:8660-8670 | crates/render/src/comp.rs:8823-8833 | crates/render/src/comp.rs:8986-8996 | crates/render/src/comp.rs:9344-9354 | crates/render/src/comp.rs:12277-12287 | crates/render/src/comp.rs:12741-12751 | crates/render/src/comp.rs:13175-13185 | crates/render/src/comp.rs:13520-13530 | crates/render/src/comp.rs:14137-14147 | crates/render/src/comp.rs:14493-14503 | crates/render/src/comp.rs:14652-14662 | crates/render/src/comp.rs:14815-14825 | crates/render/src/comp.rs:15190-15200 | crates/render/src/comp.rs:15748-15758 | crates/render/src/comp.rs:16337-16347 | crates/render/src/comp.rs:16500-16510 | crates/render/src/comp.rs:16659-16669 | crates/render/src/comp.rs:17017-17027 | crates/render/src/comp.rs:17376-17386 | crates/render/src/comp.rs:17735-17745 | crates/render/src/comp.rs:17901-17911 | crates/render/src/comp.rs:18539-18549 | crates/render/src/comp.rs:19009-19019 | crates/render/src/comp.rs:19598-19608 | crates/render/src/comp.rs:19958-19968 | crates/render/src/comp.rs:20547-20557 | crates/render/src/comp.rs:20905-20915 | crates/render/src/comp.rs:21259-21269 | crates/render/src/comp.rs:21832-21842 \u2014 These 62 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 62 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 62 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd1ba3aff8b1786ce89b0cc7279b97d214219f6bb9443926ad470cbb65558e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (62 members, 50\u002B identical tokens): crates/render/src/comp.rs:22-32 | crates/render/src/comp.rs:258-268 | crates/render/src/comp.rs:421-431 | crates/render/src/comp.rs:584-594 | crates/render/src/comp.rs:1015-1025 | crates/render/src/comp.rs:1560-1570 | crates/render/src/comp.rs:1719-1729 | crates/render/src/comp.rs:1909-1919 | crates/render/src/comp.rs:2091-2101 | crates/render/src/comp.rs:2322-2332 | crates/render/src/comp.rs:2637-2647 | crates/render/src/comp.rs:2820-2830 | crates/render/src/comp.rs:2979-2989 | crates/render/src/comp.rs:3168-3178 | crates/render/src/comp.rs:3561-3571 | crates/render/src/comp.rs:3751-3761 | crates/render/src/comp.rs:4115-4125 | crates/render/src/comp.rs:4331-4341 | crates/render/src/comp.rs:4513-4523 | crates/render/src/comp.rs:4672-4682 | crates/render/src/comp.rs:4836-4846 | crates/render/src/comp.rs:4996-5006 | crates/render/src/comp.rs:5159-5169 | crates/render/src/comp.rs:5520-5530 | crates/render/src/comp.rs:5987-5997 | crates/render/src/comp.rs:6207-6217 | crates/render/src/comp.rs:6436-6446 | crates/render/src/comp.rs:6599-6609 | crates/render/src/comp.rs:6758-6768 | crates/render/src/comp.rs:6917-6927 | crates/render/src/comp.rs:7716-7726 | crates/render/src/comp.rs:8353-8363 | crates/render/src/comp.rs:8512-8522 | crates/render/src/comp.rs:8671-8681 | crates/render/src/comp.rs:8834-8844 | crates/render/src/comp.rs:8997-9007 | crates/render/src/comp.rs:9355-9365 | crates/render/src/comp.rs:12288-12298 | crates/render/src/comp.rs:12752-12762 | crates/render/src/comp.rs:13186-13196 | crates/render/src/comp.rs:13531-13541 | crates/render/src/comp.rs:14148-14158 | crates/render/src/comp.rs:14504-14514 | crates/render/src/comp.rs:14663-14673 | crates/render/src/comp.rs:14826-14836 | crates/render/src/comp.rs:15201-15211 | crates/render/src/comp.rs:15759-15769 | crates/render/src/comp.rs:16348-16358 | crates/render/src/comp.rs:16511-16521 | crates/render/src/comp.rs:16670-16680 | crates/render/src/comp.rs:17028-17038 | crates/render/src/comp.rs:17387-17397 | crates/render/src/comp.rs:17746-17756 | crates/render/src/comp.rs:17912-17922 | crates/render/src/comp.rs:18550-18560 | crates/render/src/comp.rs:19020-19030 | crates/render/src/comp.rs:19609-19619 | crates/render/src/comp.rs:19969-19979 | crates/render/src/comp.rs:20558-20568 | crates/render/src/comp.rs:20916-20926 | crates/render/src/comp.rs:21270-21280 | crates/render/src/comp.rs:21843-21853 \u2014 These 62 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 62 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 62 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"313fc38829017be41e46f2647c2192bb18acd79faf423373dbb04b8fab07638b"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (62 members, 50\u002B identical tokens): crates/render/src/comp.rs:33-43 | crates/render/src/comp.rs:269-279 | crates/render/src/comp.rs:432-442 | crates/render/src/comp.rs:595-605 | crates/render/src/comp.rs:1026-1036 | crates/render/src/comp.rs:1571-1581 | crates/render/src/comp.rs:1730-1740 | crates/render/src/comp.rs:1920-1930 | crates/render/src/comp.rs:2102-2112 | crates/render/src/comp.rs:2333-2343 | crates/render/src/comp.rs:2648-2658 | crates/render/src/comp.rs:2831-2841 | crates/render/src/comp.rs:2990-3000 | crates/render/src/comp.rs:3179-3189 | crates/render/src/comp.rs:3572-3582 | crates/render/src/comp.rs:3762-3772 | crates/render/src/comp.rs:4126-4136 | crates/render/src/comp.rs:4342-4352 | crates/render/src/comp.rs:4524-4534 | crates/render/src/comp.rs:4683-4693 | crates/render/src/comp.rs:4847-4857 | crates/render/src/comp.rs:5007-5017 | crates/render/src/comp.rs:5170-5180 | crates/render/src/comp.rs:5531-5541 | crates/render/src/comp.rs:5998-6008 | crates/render/src/comp.rs:6218-6228 | crates/render/src/comp.rs:6447-6457 | crates/render/src/comp.rs:6610-6620 | crates/render/src/comp.rs:6769-6779 | crates/render/src/comp.rs:6928-6938 | crates/render/src/comp.rs:7727-7737 | crates/render/src/comp.rs:8364-8374 | crates/render/src/comp.rs:8523-8533 | crates/render/src/comp.rs:8682-8692 | crates/render/src/comp.rs:8845-8855 | crates/render/src/comp.rs:9008-9018 | crates/render/src/comp.rs:9366-9376 | crates/render/src/comp.rs:12299-12309 | crates/render/src/comp.rs:12763-12773 | crates/render/src/comp.rs:13197-13207 | crates/render/src/comp.rs:13542-13552 | crates/render/src/comp.rs:14159-14169 | crates/render/src/comp.rs:14515-14525 | crates/render/src/comp.rs:14674-14684 | crates/render/src/comp.rs:14837-14847 | crates/render/src/comp.rs:15212-15222 | crates/render/src/comp.rs:15770-15780 | crates/render/src/comp.rs:16359-16369 | crates/render/src/comp.rs:16522-16532 | crates/render/src/comp.rs:16681-16691 | crates/render/src/comp.rs:17039-17049 | crates/render/src/comp.rs:17398-17408 | crates/render/src/comp.rs:17757-17767 | crates/render/src/comp.rs:17923-17933 | crates/render/src/comp.rs:18561-18571 | crates/render/src/comp.rs:19031-19041 | crates/render/src/comp.rs:19620-19630 | crates/render/src/comp.rs:19980-19990 | crates/render/src/comp.rs:20569-20579 | crates/render/src/comp.rs:20927-20937 | crates/render/src/comp.rs:21281-21291 | crates/render/src/comp.rs:21854-21864 \u2014 These 62 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 62 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 62 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0912d03c6714e1423ee8d9d64da2e70c916aac4d58dce1c9f34bb19a26fe270"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (62 members, 50\u002B identical tokens): crates/render/src/comp.rs:51-61 | crates/render/src/comp.rs:287-297 | crates/render/src/comp.rs:450-460 | crates/render/src/comp.rs:613-623 | crates/render/src/comp.rs:1044-1054 | crates/render/src/comp.rs:1589-1599 | crates/render/src/comp.rs:1748-1758 | crates/render/src/comp.rs:1938-1948 | crates/render/src/comp.rs:2120-2130 | crates/render/src/comp.rs:2351-2361 | crates/render/src/comp.rs:2666-2676 | crates/render/src/comp.rs:2849-2859 | crates/render/src/comp.rs:3008-3018 | crates/render/src/comp.rs:3197-3207 | crates/render/src/comp.rs:3590-3600 | crates/render/src/comp.rs:3780-3790 | crates/render/src/comp.rs:4144-4154 | crates/render/src/comp.rs:4360-4370 | crates/render/src/comp.rs:4542-4552 | crates/render/src/comp.rs:4701-4711 | crates/render/src/comp.rs:4865-4875 | crates/render/src/comp.rs:5025-5035 | crates/render/src/comp.rs:5188-5198 | crates/render/src/comp.rs:5549-5559 | crates/render/src/comp.rs:6016-6026 | crates/render/src/comp.rs:6236-6246 | crates/render/src/comp.rs:6465-6475 | crates/render/src/comp.rs:6628-6638 | crates/render/src/comp.rs:6787-6797 | crates/render/src/comp.rs:6946-6956 | crates/render/src/comp.rs:7745-7755 | crates/render/src/comp.rs:8382-8392 | crates/render/src/comp.rs:8541-8551 | crates/render/src/comp.rs:8700-8710 | crates/render/src/comp.rs:8863-8873 | crates/render/src/comp.rs:9026-9036 | crates/render/src/comp.rs:9384-9394 | crates/render/src/comp.rs:12317-12327 | crates/render/src/comp.rs:12781-12791 | crates/render/src/comp.rs:13215-13225 | crates/render/src/comp.rs:13560-13570 | crates/render/src/comp.rs:14177-14187 | crates/render/src/comp.rs:14533-14543 | crates/render/src/comp.rs:14692-14702 | crates/render/src/comp.rs:14855-14865 | crates/render/src/comp.rs:15230-15240 | crates/render/src/comp.rs:15788-15798 | crates/render/src/comp.rs:16377-16387 | crates/render/src/comp.rs:16540-16550 | crates/render/src/comp.rs:16699-16709 | crates/render/src/comp.rs:17057-17067 | crates/render/src/comp.rs:17416-17426 | crates/render/src/comp.rs:17775-17785 | crates/render/src/comp.rs:17941-17951 | crates/render/src/comp.rs:18579-18589 | crates/render/src/comp.rs:19049-19059 | crates/render/src/comp.rs:19638-19648 | crates/render/src/comp.rs:19998-20008 | crates/render/src/comp.rs:20587-20597 | crates/render/src/comp.rs:20945-20955 | crates/render/src/comp.rs:21299-21309 | crates/render/src/comp.rs:21872-21882 \u2014 These 62 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 62 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 62 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"81feb13f385b2a4f521b18ba10c9e52456641da6ce67d1582ee3cc6f34c393d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (17 members, 50\u002B identical tokens): crates/platform/src/bindings.rs:6634-6795 | crates/platform/src/bindings.rs:7111-7417 | crates/platform/src/bindings.rs:7953-8014 | crates/platform/src/bindings.rs:8094-8155 | crates/platform/src/bindings.rs:8250-8311 | crates/platform/src/bindings.rs:8711-9051 | crates/platform/src/bindings.rs:9132-9176 | crates/platform/src/bindings.rs:10164-10260 | crates/platform/src/bindings.rs:12217-12473 | crates/platform/src/bindings.rs:13193-13294 | crates/platform/src/bindings.rs:13482-13632 | crates/platform/src/bindings.rs:15482-15708 | crates/platform/src/bindings.rs:15866-15932 | crates/platform/src/bindings.rs:17141-17773 | crates/render/src/comp.rs:11153-11180 | crates/render/src/comp.rs:11545-11702 | crates/render/src/gpu_bindings.rs:5485-6333 \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":"crates/platform/src/bindings.rs"},"region":{"startLine":6634}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36829fe41777afad9f946f124e864e4f510fcc3253879b8112b3b2c436c1685"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (16 members, 50\u002B identical tokens): crates/render/src/comp.rs:972-982 | crates/render/src/comp.rs:1517-1527 | crates/render/src/comp.rs:9312-9322 | crates/render/src/comp.rs:13143-13153 | crates/render/src/comp.rs:14461-14471 | crates/render/src/comp.rs:15158-15168 | crates/render/src/comp.rs:15716-15726 | crates/render/src/comp.rs:16305-16315 | crates/render/src/comp.rs:16985-16995 | crates/render/src/comp.rs:17344-17354 | crates/render/src/comp.rs:17703-17713 | crates/render/src/comp.rs:18977-18987 | crates/render/src/comp.rs:19566-19576 | crates/render/src/comp.rs:19926-19936 | crates/render/src/comp.rs:20515-20525 | crates/render/src/comp.rs:20873-20883 \u2014 These 16 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 16 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 16 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b2d5194f666c44cb183292f6715168d17f869fa7ef5e1490b2b34e2d833cdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (16 members, 50\u002B identical tokens): crates/render/src/comp.rs:983-993 | crates/render/src/comp.rs:1528-1538 | crates/render/src/comp.rs:9323-9333 | crates/render/src/comp.rs:13154-13164 | crates/render/src/comp.rs:14472-14482 | crates/render/src/comp.rs:15169-15179 | crates/render/src/comp.rs:15727-15737 | crates/render/src/comp.rs:16316-16326 | crates/render/src/comp.rs:16996-17006 | crates/render/src/comp.rs:17355-17365 | crates/render/src/comp.rs:17714-17724 | crates/render/src/comp.rs:18988-18998 | crates/render/src/comp.rs:19577-19587 | crates/render/src/comp.rs:19937-19947 | crates/render/src/comp.rs:20526-20536 | crates/render/src/comp.rs:20884-20894 \u2014 These 16 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 16 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 16 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab8d7c7fbd9719987f48a53828c13189df85c2e4675c0ab1c3807c6373705d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): crates/render/src/comp.rs:834-844 | crates/render/src/comp.rs:9174-9184 | crates/render/src/comp.rs:13005-13015 | crates/render/src/comp.rs:14323-14333 | crates/render/src/comp.rs:15020-15030 | crates/render/src/comp.rs:15578-15588 | crates/render/src/comp.rs:16167-16177 | crates/render/src/comp.rs:16847-16857 | crates/render/src/comp.rs:17206-17216 | crates/render/src/comp.rs:17565-17575 | crates/render/src/comp.rs:18839-18849 | crates/render/src/comp.rs:19428-19438 | crates/render/src/comp.rs:19788-19798 | crates/render/src/comp.rs:20377-20387 | crates/render/src/comp.rs:20735-20745 \u2014 These 15 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 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":"crates/render/src/comp.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1d9b4e80e9b384221efe1665e4fb2bd28dbbcd6e0689ded772173452c3fa1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): crates/render/src/comp.rs:849-859 | crates/render/src/comp.rs:9189-9199 | crates/render/src/comp.rs:13020-13030 | crates/render/src/comp.rs:14338-14348 | crates/render/src/comp.rs:15035-15045 | crates/render/src/comp.rs:15593-15603 | crates/render/src/comp.rs:16182-16192 | crates/render/src/comp.rs:16862-16872 | crates/render/src/comp.rs:17221-17231 | crates/render/src/comp.rs:17580-17590 | crates/render/src/comp.rs:18854-18864 | crates/render/src/comp.rs:19443-19453 | crates/render/src/comp.rs:19803-19813 | crates/render/src/comp.rs:20392-20402 | crates/render/src/comp.rs:20750-20760 \u2014 These 15 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 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":"crates/render/src/comp.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d77987bb78d6cc84cc9a15958e91bbf312c1e4feb1b476ccf6907913256707"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): crates/render/src/comp.rs:864-874 | crates/render/src/comp.rs:9204-9214 | crates/render/src/comp.rs:13035-13045 | crates/render/src/comp.rs:14353-14363 | crates/render/src/comp.rs:15050-15060 | crates/render/src/comp.rs:15608-15618 | crates/render/src/comp.rs:16197-16207 | crates/render/src/comp.rs:16877-16887 | crates/render/src/comp.rs:17236-17246 | crates/render/src/comp.rs:17595-17605 | crates/render/src/comp.rs:18869-18879 | crates/render/src/comp.rs:19458-19468 | crates/render/src/comp.rs:19818-19828 | crates/render/src/comp.rs:20407-20417 | crates/render/src/comp.rs:20765-20775 \u2014 These 15 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 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":"crates/render/src/comp.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"43dcdd4c44f6da336c90ed9127d62fa7499f6b53cc523b565fdc4f86ac23bab8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): crates/render/src/comp.rs:879-889 | crates/render/src/comp.rs:9219-9229 | crates/render/src/comp.rs:13050-13060 | crates/render/src/comp.rs:14368-14378 | crates/render/src/comp.rs:15065-15075 | crates/render/src/comp.rs:15623-15633 | crates/render/src/comp.rs:16212-16222 | crates/render/src/comp.rs:16892-16902 | crates/render/src/comp.rs:17251-17261 | crates/render/src/comp.rs:17610-17620 | crates/render/src/comp.rs:18884-18894 | crates/render/src/comp.rs:19473-19483 | crates/render/src/comp.rs:19833-19843 | crates/render/src/comp.rs:20422-20432 | crates/render/src/comp.rs:20780-20790 \u2014 These 15 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 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":"crates/render/src/comp.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcbaff8a71018f821088abe44137639774de94f56c694e35b1f9c93fa071814e"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): crates/render/src/comp.rs:897-907 | crates/render/src/comp.rs:9237-9247 | crates/render/src/comp.rs:13068-13078 | crates/render/src/comp.rs:14386-14396 | crates/render/src/comp.rs:15083-15093 | crates/render/src/comp.rs:15641-15651 | crates/render/src/comp.rs:16230-16240 | crates/render/src/comp.rs:16910-16920 | crates/render/src/comp.rs:17269-17279 | crates/render/src/comp.rs:17628-17638 | crates/render/src/comp.rs:18902-18912 | crates/render/src/comp.rs:19491-19501 | crates/render/src/comp.rs:19851-19861 | crates/render/src/comp.rs:20440-20450 | crates/render/src/comp.rs:20798-20808 \u2014 These 15 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 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":"crates/render/src/comp.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a4d65ed051e18831d177c3a7d966f6f036d4a33964cc877b5904909c36d00f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): crates/render/src/comp.rs:912-922 | crates/render/src/comp.rs:9252-9262 | crates/render/src/comp.rs:13083-13093 | crates/render/src/comp.rs:14401-14411 | crates/render/src/comp.rs:15098-15108 | crates/render/src/comp.rs:15656-15666 | crates/render/src/comp.rs:16245-16255 | crates/render/src/comp.rs:16925-16935 | crates/render/src/comp.rs:17284-17294 | crates/render/src/comp.rs:17643-17653 | crates/render/src/comp.rs:18917-18927 | crates/render/src/comp.rs:19506-19516 | crates/render/src/comp.rs:19866-19876 | crates/render/src/comp.rs:20455-20465 | crates/render/src/comp.rs:20813-20823 \u2014 These 15 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 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":"crates/render/src/comp.rs"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b68f9840b7afd6f9d6236ac0906f1cc9bf597706aad8723ebe4ef4e3838303"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): crates/render/src/comp.rs:927-937 | crates/render/src/comp.rs:9267-9277 | crates/render/src/comp.rs:13098-13108 | crates/render/src/comp.rs:14416-14426 | crates/render/src/comp.rs:15113-15123 | crates/render/src/comp.rs:15671-15681 | crates/render/src/comp.rs:16260-16270 | crates/render/src/comp.rs:16940-16950 | crates/render/src/comp.rs:17299-17309 | crates/render/src/comp.rs:17658-17668 | crates/render/src/comp.rs:18932-18942 | crates/render/src/comp.rs:19521-19531 | crates/render/src/comp.rs:19881-19891 | crates/render/src/comp.rs:20470-20480 | crates/render/src/comp.rs:20828-20838 \u2014 These 15 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 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":"crates/render/src/comp.rs"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee798e9f4410aad6182a6fa062e8f3baba4b5d5054e8adb19e5d2220aff6bd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): crates/render/src/comp.rs:942-952 | crates/render/src/comp.rs:9282-9292 | crates/render/src/comp.rs:13113-13123 | crates/render/src/comp.rs:14431-14441 | crates/render/src/comp.rs:15128-15138 | crates/render/src/comp.rs:15686-15696 | crates/render/src/comp.rs:16275-16285 | crates/render/src/comp.rs:16955-16965 | crates/render/src/comp.rs:17314-17324 | crates/render/src/comp.rs:17673-17683 | crates/render/src/comp.rs:18947-18957 | crates/render/src/comp.rs:19536-19546 | crates/render/src/comp.rs:19896-19906 | crates/render/src/comp.rs:20485-20495 | crates/render/src/comp.rs:20843-20853 \u2014 These 15 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 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":"crates/render/src/comp.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"cffca2ebeb58ae751f68b693db6b8385af0a46b9f48cb726ce9536dba2230417"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (15 members, 50\u002B identical tokens): crates/render/src/comp.rs:957-967 | crates/render/src/comp.rs:9297-9307 | crates/render/src/comp.rs:13128-13138 | crates/render/src/comp.rs:14446-14456 | crates/render/src/comp.rs:15143-15153 | crates/render/src/comp.rs:15701-15711 | crates/render/src/comp.rs:16290-16300 | crates/render/src/comp.rs:16970-16980 | crates/render/src/comp.rs:17329-17339 | crates/render/src/comp.rs:17688-17698 | crates/render/src/comp.rs:18962-18972 | crates/render/src/comp.rs:19551-19561 | crates/render/src/comp.rs:19911-19921 | crates/render/src/comp.rs:20500-20510 | crates/render/src/comp.rs:20858-20868 \u2014 These 15 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 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":"crates/render/src/comp.rs"},"region":{"startLine":957}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eead5af8d37b0f7f6737ad9f929ca1d2a64e1fda58fd5c619d79f3513b4f79c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): crates/platform/src/bindings.rs:6634-6795 | crates/platform/src/bindings.rs:12819-13059 | crates/platform/src/bindings.rs:13193-13294 | crates/platform/src/bindings.rs:13482-13632 | crates/platform/src/bindings.rs:13689-13719 | crates/platform/src/bindings.rs:14570-14748 | crates/platform/src/bindings.rs:16144-16248 | crates/platform/src/bindings.rs:16420-16478 | crates/render/src/comp.rs:11545-11702 | crates/render/src/gpu_bindings.rs:5485-6333 \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":"crates/platform/src/bindings.rs"},"region":{"startLine":6634}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c049c4e73a9eee371f81c9d2d52825bbba6ea1604364944fc1c16244f68fd05"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (9 members, 50\u002B identical tokens): crates/platform/src/bindings.rs:6634-6795 | crates/platform/src/bindings.rs:7953-8014 | crates/platform/src/bindings.rs:8094-8155 | crates/platform/src/bindings.rs:8250-8311 | crates/platform/src/bindings.rs:12819-13059 | crates/platform/src/bindings.rs:13482-13632 | crates/platform/src/bindings.rs:15482-15708 | crates/platform/src/bindings.rs:17141-17773 | crates/render/src/gpu_bindings.rs:2925-3131 \u2014 These 9 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 9 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 9 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":6634}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71cd781f3d897ce9bb23e2ba371638bd68c9db9c4d18869e6a14333f48bb804"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): crates/platform/src/bindings.rs:7111-7417 | crates/platform/src/bindings.rs:8711-9051 | crates/platform/src/bindings.rs:9647-9996 | crates/platform/src/bindings.rs:10164-10260 | crates/platform/src/bindings.rs:12217-12473 | crates/platform/src/bindings.rs:15482-15708 | crates/platform/src/bindings.rs:16144-16248 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":7111}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b940ec958be31851e990512105ae11f4a0bd5991be293d83270642bb5837223"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): crates/platform/src/bindings.rs:10511-10768 | crates/platform/src/bindings.rs:11916-11942 | crates/platform/src/bindings.rs:12819-13059 | crates/platform/src/bindings.rs:13193-13294 | crates/platform/src/bindings.rs:13482-13632 | crates/platform/src/bindings.rs:14570-14748 | crates/platform/src/bindings.rs:17141-17773 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":10511}}}],"partialFingerprints":{"codehealthFindingId/v1":"40259c4a5087736514a99266321e6fe4dbd9e52123b7dd98991e3027a51ae2de"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): crates/render/src/comp.rs:1293-1303 | crates/render/src/comp.rs:13451-13461 | crates/render/src/comp.rs:15479-15489 | crates/render/src/comp.rs:16037-16047 | crates/render/src/comp.rs:19298-19308 | crates/render/src/comp.rs:20247-20257 | crates/render/src/comp.rs:21194-21204 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":1293}}}],"partialFingerprints":{"codehealthFindingId/v1":"e358a2abba429d6225ea614ca4cd784b2e1c5f7cb55a7c4b02d57195e71f218d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): crates/render/src/comp.rs:1314-1324 | crates/render/src/comp.rs:13472-13482 | crates/render/src/comp.rs:15500-15510 | crates/render/src/comp.rs:16058-16068 | crates/render/src/comp.rs:19319-19329 | crates/render/src/comp.rs:20268-20278 | crates/render/src/comp.rs:21215-21225 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":1314}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8da949235ef9f3addf248352432a9bd8e56b6b37099bb997ab1c383dd1f605"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/platform/src/bindings.rs:6634-6795 | crates/platform/src/bindings.rs:12217-12473 | crates/platform/src/bindings.rs:13482-13632 | crates/platform/src/bindings.rs:15482-15708 | crates/render/src/gpu_bindings.rs:2925-3131 | crates/render/src/gpu_bindings.rs:5485-6333 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":6634}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8d3204c37c9c531cc277243b779efd379598c321e0721d2f718f71705f1ef6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/render/src/comp.rs:1139-1149 | crates/render/src/comp.rs:15325-15335 | crates/render/src/comp.rs:15883-15893 | crates/render/src/comp.rs:19144-19154 | crates/render/src/comp.rs:20093-20103 | crates/render/src/comp.rs:21040-21050 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":1139}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25deade96386e1e9c1344ed60f36fd6da09a05228ba7740185768dcbaf8e41c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/render/src/comp.rs:1160-1170 | crates/render/src/comp.rs:15346-15356 | crates/render/src/comp.rs:15904-15914 | crates/render/src/comp.rs:19165-19175 | crates/render/src/comp.rs:20114-20124 | crates/render/src/comp.rs:21061-21071 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"064c3509a342ae5e64f84f25f11856c7ecaa42d16d0fa6002aeb27874dbaf93a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/render/src/comp.rs:1181-1191 | crates/render/src/comp.rs:15367-15377 | crates/render/src/comp.rs:15925-15935 | crates/render/src/comp.rs:19186-19196 | crates/render/src/comp.rs:20135-20145 | crates/render/src/comp.rs:21082-21092 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a39b715d45bf3afa6bfb578ce1708e4a61e3e4cba4ff881bbd48d301020cc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/render/src/comp.rs:1205-1215 | crates/render/src/comp.rs:15391-15401 | crates/render/src/comp.rs:15949-15959 | crates/render/src/comp.rs:19210-19220 | crates/render/src/comp.rs:20159-20169 | crates/render/src/comp.rs:21106-21116 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":1205}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc847719ee75d587d94615374355a1010f75a297ef73f98729e926585157196"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/render/src/comp.rs:1226-1236 | crates/render/src/comp.rs:15412-15422 | crates/render/src/comp.rs:15970-15980 | crates/render/src/comp.rs:19231-19241 | crates/render/src/comp.rs:20180-20190 | crates/render/src/comp.rs:21127-21137 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"874436cb78ca59d80973879f37625c5b088c3e469df53bee26e919fb168e0d5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/render/src/comp.rs:1237-1247 | crates/render/src/comp.rs:15423-15433 | crates/render/src/comp.rs:15981-15991 | crates/render/src/comp.rs:19242-19252 | crates/render/src/comp.rs:20191-20201 | crates/render/src/comp.rs:21138-21148 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"932274e568e76114a4c6e2089a85d87b0989488c461c01b327ea7f592dc0964f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/render/src/comp.rs:1262-1272 | crates/render/src/comp.rs:15448-15458 | crates/render/src/comp.rs:16006-16016 | crates/render/src/comp.rs:19267-19277 | crates/render/src/comp.rs:20216-20226 | crates/render/src/comp.rs:21163-21173 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc05782e337ff1a959e67c4d687fb990648441c07ac3fe5bc55c05648635d8e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/render/src/comp.rs:1281-1292 | crates/render/src/comp.rs:15467-15478 | crates/render/src/comp.rs:16025-16036 | crates/render/src/comp.rs:19286-19297 | crates/render/src/comp.rs:20235-20246 | crates/render/src/comp.rs:21182-21193 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cff24c39272ca5a8dfdad78a952a9a0ea7700ecff8324df8dd0278b8c21d1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/platform/src/bindings.rs:7111-7417 | crates/platform/src/bindings.rs:8711-9051 | crates/platform/src/bindings.rs:10511-10768 | crates/platform/src/bindings.rs:15482-15708 | crates/render/src/comp.rs:11545-11702 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":7111}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa70f9afcc0bb475140f702fa31e42c6a328a8938f2d0df86ca5b3b650bcb7d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/platform/src/bindings.rs:8711-9051 | crates/platform/src/bindings.rs:9647-9996 | crates/platform/src/bindings.rs:12217-12473 | crates/platform/src/bindings.rs:14061-14356 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":8711}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c9e96c0e2c7432f39c5dbb5a919da547936035b7ac0fed0f2abd732a39c101f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/platform/src/bindings.rs:8711-9051 | crates/platform/src/bindings.rs:9647-9996 | crates/platform/src/bindings.rs:10511-10768 | crates/render/src/gpu_bindings.rs:5485-6333 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":8711}}}],"partialFingerprints":{"codehealthFindingId/v1":"823b1eae5d96fff237a3f3044b834138934b09c464fba23e84d7c4a58efe9102"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/render/src/comp.rs:1845-1855 | crates/render/src/comp.rs:11486-11498 | crates/render/src/comp.rs:12418-12435 | crates/render/src/comp.rs:21967-21977 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":1845}}}],"partialFingerprints":{"codehealthFindingId/v1":"e824ba0f8c0dc596187472f8a9b7445072b1b305120e55af1befb75e58a23102"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/render/src/comp.rs:8218-8228 | crates/render/src/comp.rs:14034-14044 | crates/render/src/comp.rs:18437-18447 | crates/render/src/comp.rs:21729-21739 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":8218}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d0877e473b93556578ab2608ac6b2d9a068034fba11528b0cd5e046e0aed20"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/render/src/comp.rs:8232-8241 | crates/render/src/comp.rs:14048-14057 | crates/render/src/comp.rs:18451-18460 | crates/render/src/comp.rs:21743-21752 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":8232}}}],"partialFingerprints":{"codehealthFindingId/v1":"6089d88dd933ab10315ac962e7a7b03a89b64c7462bedba2929bd0060d80da17"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/render/src/comp.rs:8244-8254 | crates/render/src/comp.rs:14060-14070 | crates/render/src/comp.rs:18463-18473 | crates/render/src/comp.rs:21755-21765 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":8244}}}],"partialFingerprints":{"codehealthFindingId/v1":"287c7041e1ed6952dea02db812f0ee9a0da02444dd81f93d7631b9e43ba46ce5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/render/src/comp.rs:8268-8278 | crates/render/src/comp.rs:14084-14094 | crates/render/src/comp.rs:18487-18497 | crates/render/src/comp.rs:21779-21789 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":8268}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde771174f7a4f441052c72d7a68cf70f26964647b7cbf5aa5c2036dd4e98950"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/render/src/fence_chrome.rs:510-543 | crates/render/src/fence_chrome.rs:552-584 | crates/render/src/fence_chrome.rs:594-623 | crates/render/src/fence_chrome.rs:633-677 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/fence_chrome.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed730020eecf6634dfcae3de54012dd006986692a57781d05825a29e9e20f339"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (76 corresponding lines): crates/platform/src/bindings.rs:7583-7658 | crates/platform/src/bindings.rs:7782-7873 \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":"crates/platform/src/bindings.rs"},"region":{"startLine":7583}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba39da52ef621ed3fecb2dfc6d240294a99c2879143154d1892f48023c4bccc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/render/src/theme.rs:355-395 | crates/render/src/theme.rs:397-437 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/theme.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c92f8662d52c44bf6046f37512264fba13b081441e5a2f7a43a942bbca9ad0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): crates/platform/src/fileinfo.rs:13-65 | crates/platform/src/fileinfo.rs:137-186 \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":"crates/platform/src/fileinfo.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f8ee7ecc9e231304e219d3a1a0720e8965230f045e8ce8c00afe709a7f276c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/render/src/backdrop.rs:372-396 | crates/render/src/backdrop.rs:398-423 \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/render/src/backdrop.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0fcb9906ebb79c770d682eddd0dc1542942810eabfd645cd4f0ffc7343f1f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/app/src/drag_guides.rs:88-108 | crates/app/src/drop_preview.rs:81-110 \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":"crates/app/src/drag_guides.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"c152d34b8d975363dcf29654b6f677762e040d1967256ff136aa5723925f560b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/app/src/fence_window/dnd.rs:1230-1256 | crates/app/src/fence_window/dnd.rs:1263-1291 \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":"crates/app/src/fence_window/dnd.rs"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edf3274504a4629fca015da2a07ea11ffb741f47937bce38d39ecf94b3f1138"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/platform/src/dragdrop.rs:1057-1096 | crates/platform/src/dragdrop.rs:1488-1518 \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":"crates/platform/src/dragdrop.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"196d9b00fc51a29586cd34d5d02ecbaefda06f4df23edf40572650c3fdaa1072"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/render/src/backdrop.rs:131-145 | crates/render/src/backdrop.rs:149-160 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/backdrop.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab4183995f62ec4250b2094a457bee97d9aa28927c6df798c7f64367bbc742c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): crates/platform/src/filedialog.rs:28-55 | crates/platform/src/filedialog.rs:58-80 | crates/platform/src/filedialog.rs:84-106 \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":"crates/platform/src/filedialog.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e3c282d5d911756b608550b486ea4b9abef803237cc907e31921fb54536561"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/platform/src/autostart.rs:141-163 | crates/platform/src/autostart.rs:167-190 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/autostart.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bbb815be5e95dcc31eeb9ae2eaee66308705e7bc64d5e5a842b5c512273281"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/app/src/app/undo.rs:656-677 | crates/app/src/app/undo.rs:682-708 \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":"crates/app/src/app/undo.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"8389c58465bc237942d67430e75f959395dfedbf06f5a4449c7fbcd1e6b7d9a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): extras/pecofence-promo/scripts/make-trailer-audio.py:578-588 | extras/pecofence-promo/scripts/make-trailer-audio.py:625-635 \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":"extras/pecofence-promo/scripts/make-trailer-audio.py"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"83fbba438dae6fcfbeb7695dcbb77dba78ad2e05faf00f6faede8128a4efe1e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): extras/pecofence-promo/scripts/make-trailer-audio.py:641-650 | extras/pecofence-promo/scripts/make-trailer-audio.py:676-683 \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":"extras/pecofence-promo/scripts/make-trailer-audio.py"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d1ca0fb6a5e18f4652f00cdc78168b295bc0b4833b069d076803a9c20bdc004"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/platform/src/autostart.rs:198-221 | crates/platform/src/shell.rs:898-925 \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":"crates/platform/src/autostart.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"981bd1cfccecc6ec803c19f17b129c03dfd3480bec2a66029850dc6ffcc0562a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/platform/src/bindings.rs:4815-4841 | crates/platform/src/bindings.rs:4905-4933 \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":"crates/platform/src/bindings.rs"},"region":{"startLine":4815}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb75ae43d5f5d0cc4944e5ae5cb7742f9b8683448dc19dabef47f8c21b4f762"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/app/src/fence_window/handler/timers.rs:270-307 | crates/app/src/fence_window/handler/timers.rs:318-344 \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":"crates/app/src/fence_window/handler/timers.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"5707891764b50c56f54672a4ffe400f97b445c41b9cb126411647eb072cc6ce5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/platform/src/rawinput.rs:38-69 | crates/platform/src/rawinput.rs:97-118 \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":"crates/platform/src/rawinput.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d1a866e95d2b4df50bb06401fc57b3b27125c40e7a43cda49f7bd0499dd811"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/app/src/app/ipc.rs:1399-1423 | crates/app/src/app/ipc.rs:1536-1556 \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":"crates/app/src/app/ipc.rs"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4af063a99a7c8becdd78fc345050053c14a9cbf049ef041ef8930ce3389eb3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/platform/src/shell.rs:838-854 | crates/platform/src/wide.rs:16-40 \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":"crates/platform/src/shell.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f00433d1f5a6522a4077749bcf47b8d793d4b3fbd9b746cd6cd56ea2083bf2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/app/src/fence_window/hit.rs:431-454 | crates/app/src/fence_window/hit.rs:478-496 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/hit.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"9766e927f7209bafb210a07a951f2081fe76df4eb2bf4c2ff3731fa8eb338465"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/app/src/fence_window/state.rs:901-915 | crates/app/src/fence_window/state.rs:939-956 | crates/app/src/fence_window/state.rs:959-970 \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":"crates/app/src/fence_window/state.rs"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed077d01fb7835f646cd851993b7646b830d3c4259f2516463435a8dae3e991"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/app/src/fence_window/roll.rs:494-505 | crates/app/src/fence_window/roll.rs:513-528 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/roll.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e24853a4af4eac8a473bd9948b5cb8e71ddb4e937dc9404ed4cde8b29f8e6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/app/src/anchor.rs:1197-1214 | crates/app/src/anchor.rs:1240-1259 \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":"crates/app/src/anchor.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"0768f0bf3bc730a0e1687369cb23cad96fd9cb3b9f59329ae16b60ad9bc83d65"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/platform/src/bindings.rs:10800-10815 | crates/platform/src/store_bindings.rs:45-64 \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":"crates/platform/src/bindings.rs"},"region":{"startLine":10800}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a07009485837e84d4f9cf72c0da8ff244f57012372107bc1eca6b0465310bc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): extras/pecofence-promo/scripts/make-trailer-audio.py:667-672 | extras/pecofence-promo/scripts/make-trailer-audio.py:1182-1187 | extras/pecofence-promo/scripts/make-trailer-audio.py:1217-1223 \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":"extras/pecofence-promo/scripts/make-trailer-audio.py"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b009ba73359cd8ada01fbec2a22cbf027ca7a86d0da6f68f44fef3b2e3e7cd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/platform/src/bindings.rs:951-964 | crates/platform/src/bindings.rs:1326-1338 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2adb7295cb373930fb9e45aae9b76b0abb99277d32a5390f540613c6105bc43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/platform/src/shell.rs:1656-1676 | crates/platform/src/shell.rs:1679-1694 \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":"crates/platform/src/shell.rs"},"region":{"startLine":1656}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f878ce1e690609c4533b83caa30621a9ed5846db6bfd135964b58e6683db69e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/app/src/fence_window/hit.rs:609-621 | crates/app/src/fence_window/hit.rs:624-636 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/hit.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c3a60314ecd8b9d2cbbcb3eb43a879c9c598a3c4be6a0095be7201431b4d84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/platform/src/autostart.rs:231-249 | crates/platform/src/theme.rs:48-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":"crates/platform/src/autostart.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e0e668aee1cebe28bb9922808c64324b62e9349761d6d3f7478b3f86fdd55b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): crates/app/src/state.rs:2884-2905 | crates/app/src/state.rs:3099-3120 | crates/app/src/state.rs:3132-3153 \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":"crates/app/src/state.rs"},"region":{"startLine":2884}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3a6223fc79dcbb8406aeff4e4032ee9cd613a3a89eb5bd8a4c293a4df107ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/app/src/app/ipc.rs:501-512 | crates/app/src/app/ipc.rs:2971-2983 | crates/app/src/app/settings.rs:183-194 \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":"crates/app/src/app/ipc.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b741107bbc25908d90ced3cbe506c17c799b27df1b1fdfdab58e5b1e5c6ed27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/app/src/app/tools.rs:1178-1195 | crates/app/src/app/tools.rs:1199-1208 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/tools.rs"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda6d3dfabb12d68d73a54f6cf148785ed9fa563c4d3587dde6dbafbda38c132"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/platform/src/bindings.rs:297-310 | crates/platform/src/bindings.rs:2252-2264 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6d6a525a5427a3b4421c07aa2439eed486eaf52a2793cf2b1dff2c20647ae3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/app/src/fence_window/note_text.rs:515-523 | crates/app/src/fence_window/note_text.rs:527-537 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/note_text.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8e6e4e4316030e4393a96943235917a4778f58bd801fed52cbdd96f360585b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/platform/src/bindings.rs:979-989 | crates/platform/src/bindings.rs:1595-1608 | crates/platform/src/bindings.rs:1926-1939 \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":"crates/platform/src/bindings.rs"},"region":{"startLine":979}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e50da914c98015d3208456386ee436634f7c6ecbd9d8e17a9b9cf5541fb20e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 8\u002B corresponding lines): crates/platform/src/bindings.rs:23-30 | crates/platform/src/bindings.rs:141-154 | crates/platform/src/bindings.rs:2132-2139 | crates/platform/src/bindings.rs:2183-2190 | crates/platform/src/bindings.rs:2200-2212 | crates/platform/src/bindings.rs:2233-2240 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"da48b3c2830864e2e4441bf2fe2b2a93510e48e51bb51132d09bfb92a13e2839"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/app/src/filter_box.rs:366-380 | crates/app/src/peek_search.rs:1846-1859 \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/app/src/filter_box.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb360f2110f91ba73a22e2e74fc9a0bab4cf85b14f45b531f197a22bcb95ba21"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 13\u002B corresponding lines): crates/render/src/comp.rs:3347-3359 | crates/render/src/comp.rs:3417-3429 | crates/render/src/comp.rs:3438-3451 | crates/render/src/comp.rs:3478-3491 | crates/render/src/comp.rs:3499-3511 | crates/render/src/comp.rs:3519-3531 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":3347}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae220e8a983d442df572d5653c6504256aafd68b15d0f63525da5db026bea43"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/platform/src/edit.rs:626-647 | crates/platform/src/paint.rs:13-35 \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":"crates/platform/src/edit.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3faede771a82288889ebcfed76af39665ef48305a14c67997294eb80d81a45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 11\u002B corresponding lines): crates/render/src/comp.rs:7538-7548 | crates/render/src/comp.rs:7553-7565 | crates/render/src/comp.rs:7568-7578 | crates/render/src/comp.rs:7581-7591 | crates/render/src/comp.rs:7594-7604 | crates/render/src/comp.rs:7607-7617 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":7538}}}],"partialFingerprints":{"codehealthFindingId/v1":"6233b44fea4d7db9a8b4a9a4526466aa1f6d6552db6b1bc626d78a5b5e4fbedc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 13\u002B corresponding lines): crates/render/src/comp.rs:12439-12452 | crates/render/src/comp.rs:12453-12465 | crates/render/src/comp.rs:12466-12479 | crates/render/src/comp.rs:12484-12496 | crates/render/src/comp.rs:12504-12518 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":12439}}}],"partialFingerprints":{"codehealthFindingId/v1":"991f8653fa49df056a6bd1b0bd593a9677a7be041b9c539bad0dbfa54081f57b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/render/src/theme.rs:536-547 | crates/render/src/theme.rs:586-601 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/theme.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"549d351e3e1131323437e1d479abd2e27c8429267184855482417a368b54c589"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/app/src/app/arrange.rs:112-123 | crates/app/src/app/arrange.rs:128-138 \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":"crates/app/src/app/arrange.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb3dba2b6c43cefd04214818ceab374f6d6ba82e9d49c3f3327eee820ad215a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): crates/platform/src/dragdrop.rs:293-309 | crates/platform/src/dragdrop.rs:316-329 | crates/platform/src/dragdrop.rs:345-361 \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":"crates/platform/src/dragdrop.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3e0695f635beb86e82ac64c8cdd102b1f9ca26e751059b3cd0d3b5657674a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/app/src/fence_window/mod.rs:245-258 | crates/app/src/fence_window/snap.rs:145-157 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/mod.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"065b1b92b46f2b92f2c077f39f3c8cf2ab0f431d9830b7b36312364c15c8dd30"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/core/src/model.rs:1740-1751 | crates/core/src/model.rs:1806-1817 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/model.rs"},"region":{"startLine":1740}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ba76c37ae473fc08d86b533f947780f75a47b7d72966d8fa1478f54f1d2d51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/platform/src/bindings.rs:1857-1868 | crates/platform/src/bindings.rs:2377-2388 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":1857}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae154ad6f70952026838f218ec25a79ac7dc401d60dd969fec2f863faa39ebd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/platform/src/bindings.rs:274-284 | crates/platform/src/bindings.rs:380-389 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"821f7a11c3585f4eedf834c3a336e83752771e079bbf3f4b37db7eaef707413d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/app/src/fence_window/handler/timers.rs:234-245 | crates/app/src/fence_window/handler/timers.rs:252-263 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/timers.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"19498803fdfcc5a50221a9f7bffbcb5898dafb2a1e422a1da554dbffeb5d4368"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/render/src/comp.rs:5913-5923 | crates/render/src/comp.rs:5934-5944 | crates/render/src/comp.rs:5955-5965 \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":"crates/render/src/comp.rs"},"region":{"startLine":5913}}}],"partialFingerprints":{"codehealthFindingId/v1":"83d7e675af9eb7663a07852336b9b44171da6bddf6a1249e2589d3acc6b8527a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (7 members, 11\u002B corresponding lines): crates/render/src/comp.rs:3365-3375 | crates/render/src/comp.rs:3381-3391 | crates/render/src/comp.rs:7147-7157 | crates/render/src/comp.rs:7166-7177 | crates/render/src/comp.rs:7316-7326 | crates/render/src/comp.rs:7637-7648 | crates/render/src/comp.rs:11403-11413 \u2014 These 7 members are one piece of code written 7 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 7 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":3365}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d6c89c65825c060d4df8a259373a49bc0a17b35b23e104ba1d60d2c5f28de6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/app/src/fence_window/selection.rs:466-472 | crates/app/src/fence_window/selection.rs:744-750 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/selection.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e6a47377ac82a178376728307b63160529d3a49d7cfd78f00339174fac9dc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/app/src/marquee_offer.rs:86-96 | crates/app/src/notice.rs:119-127 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/marquee_offer.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"162fb0fb6d38ee8e58c393f6c466d450680948987d248a2d022afb5b06fd9e51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/platform/src/store_bindings.rs:245-255 | crates/render/src/comp.rs:7191-7201 \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":"crates/platform/src/store_bindings.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e96bb0f42869c91018c7e150fe09247668e7d49a63d0a40ef3917fa46d5aaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/platform/src/bindings.rs:758-768 | crates/platform/src/bindings.rs:812-822 | crates/platform/src/bindings.rs:1470-1479 \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":"crates/platform/src/bindings.rs"},"region":{"startLine":758}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f5c58af7e1a75ef4b6de52e6c3866b1662579e10d245673218a578a6cfe55d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/platform/src/bindings.rs:849-860 | crates/platform/src/bindings.rs:1236-1247 | crates/platform/src/bindings.rs:1346-1357 \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":"crates/platform/src/bindings.rs"},"region":{"startLine":849}}}],"partialFingerprints":{"codehealthFindingId/v1":"e87d1a53808f2b18f58ab8598b1510c9aabf76d0780428edfa75d74112760c41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/platform/src/crashlog.rs:45-57 | crates/platform/src/crashlog.rs:61-73 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/crashlog.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c406e7ced6893909c7a3ccc64bcd563d67197129e5e5c36f52b4088bcff338a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/platform/src/dragdrop.rs:213-229 | crates/platform/src/dragdrop.rs:1147-1163 \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":"crates/platform/src/dragdrop.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"222a8f6d93c505df0aad248257856434397fe9fdb3dcee1c289aff6dc84b0853"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/app/src/app/feedback.rs:325-342 | crates/app/src/app/updates.rs:292-301 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/feedback.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3d2e82407044ba7b8b351cfacf433fc348dc21257b91b7680f4ff46defd775"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): crates/platform/src/bindings.rs:623-638 | crates/platform/src/bindings.rs:2428-2441 | crates/platform/src/bindings.rs:2882-2894 \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":"crates/platform/src/bindings.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1fe8ff9aa8a082b4ab0933b2b048013e6661242a2f63b614336df72d43278b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/app/src/app/items.rs:595-606 | crates/app/src/app/items.rs:1276-1290 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/items.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"485c2143adc6847ad8d17d850ea59f88fc5de505dce35feaa900be3dfee86f8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/platform/src/bindings.rs:257-264 | crates/platform/src/bindings.rs:1677-1683 | crates/platform/src/bindings.rs:2308-2314 \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":"crates/platform/src/bindings.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"11e0de6ac3db7d3543ce0ab707a3d7cc7a4a59b3f8ab49782447be5f4938f06e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/app/src/fence_window/selection.rs:228-237 | crates/app/src/fence_window/selection.rs:242-252 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/selection.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c934dc995b3c29e65eae42e561322de880abc5133ccf2aa1b734771cf0602e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/app/src/layout.rs:376-380 | crates/app/src/layout.rs:462-467 \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/app/src/layout.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"f780f1912c89ed1bea683ae5114436b602eeb817e65639877df2d30ae34cb98a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 12\u002B corresponding lines): crates/render/src/comp.rs:5760-5771 | crates/render/src/comp.rs:5776-5787 | crates/render/src/comp.rs:5792-5803 | crates/render/src/comp.rs:5808-5819 | crates/render/src/comp.rs:5824-5835 | crates/render/src/comp.rs:5840-5851 | crates/render/src/comp.rs:5856-5867 | crates/render/src/comp.rs:5872-5883 \u2014 These 8 members are one piece of code written 8 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 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":5760}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3ffd86d51f890bb1e450a5b8b25a55b258bd1d7ee863c0a6a9da425bf2e5051"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/render/src/gpu_glass.rs:55-74 | crates/render/src/text_shadow.rs:170-186 \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":"crates/render/src/gpu_glass.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dda2d1d9238139a727600935c250de3024bdbe00d186b0ae4b366e266356918"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/app/src/anchor.rs:1024-1037 | crates/app/src/anchor.rs:1040-1048 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/anchor.rs"},"region":{"startLine":1024}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f96c37b3ccf68d67a86794fa83f04e96a3d1d32fd1e1be17b3cebfd12b672a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/render/src/comp.rs:11427-11437 | crates/render/src/comp.rs:11452-11463 \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":"crates/render/src/comp.rs"},"region":{"startLine":11427}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1eb90d98fd0b58167ac108f13748352677918e18368caf3b6bc3cc94ad53c58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): crates/render/src/motion.rs:207-216 | crates/render/src/motion.rs:219-228 | crates/render/src/motion.rs:231-240 \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":"crates/render/src/motion.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"be25bd08912e48d17d0fac629973c2afd8d4c55b55aa59429a44c59795b06d4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 11\u002B corresponding lines): crates/render/src/comp.rs:3398-3409 | crates/render/src/comp.rs:3458-3469 | crates/render/src/comp.rs:3538-3549 | crates/render/src/comp.rs:7104-7114 | crates/render/src/comp.rs:7279-7289 | crates/render/src/comp.rs:7376-7386 \u2014 These 6 members are one piece of code written 6 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 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":3398}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d1c8bbeda474f1676a5c81f9e5afe73552eaf1b074201db7e78c96cbe48f0ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/render/src/comp.rs:5445-5455 | crates/render/src/comp.rs:5463-5472 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":5445}}}],"partialFingerprints":{"codehealthFindingId/v1":"918f72f9a644bc394c3a3ffb7ab4e920ae56bc8710d84cd4615eb7f064e0ab3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/platform/src/bindings.rs:198-208 | crates/platform/src/bindings.rs:2109-2119 | crates/platform/src/bindings.rs:2146-2156 \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":"crates/platform/src/bindings.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"366879e7cb5a92712d84ca3bb05d58cbc5c1fce909a92e8fd9300f9f58a11fea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): crates/platform/src/bindings.rs:216-227 | crates/platform/src/bindings.rs:1663-1675 | crates/platform/src/bindings.rs:2605-2617 \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":"crates/platform/src/bindings.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94938062b4d5c17437ec126e9ef07b10d53c6687d092db1521892d0f6cad0bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): crates/platform/src/bindings.rs:470-480 | crates/platform/src/bindings.rs:792-801 | crates/platform/src/bindings.rs:1575-1585 | crates/platform/src/bindings.rs:2297-2306 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"93345a66065351a0edabe84187fb007238865554906b8de74e0934489c596399"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 12\u002B corresponding lines): crates/platform/src/bindings.rs:538-552 | crates/platform/src/bindings.rs:1741-1752 | crates/platform/src/bindings.rs:2474-2485 | crates/platform/src/bindings.rs:2627-2640 | crates/platform/src/bindings.rs:2667-2680 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"6920e8e7fa3b09b1ab3fe5c8ee06eb2ae1f94226e09a7c6bc10d6aa530acfc5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/platform/src/bindings.rs:1535-1544 | crates/platform/src/bindings.rs:1969-1980 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9b9e679f5e77fa180468b473b41af42d159214cf905010065a2a26f5569ab0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/platform/src/edit.rs:408-422 | crates/platform/src/edit.rs:525-538 \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/platform/src/edit.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"680056c29000268d2d7ad69355aeca4e6e4fd577c1d2e8626091ec5a402b1f5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/platform/src/store_bindings.rs:369-378 | crates/render/src/comp.rs:9479-9488 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/store_bindings.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"466bc1b3a7e40c52ae123a0c539a89c090687867d36ee59928fec8fb565313db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/app/src/app/fence_options.rs:588-596 | crates/app/src/app/fence_options.rs:624-633 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/fence_options.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"020df9d62a7cfe4560b07d7a6d43cd96a9e2d7daedc879cb6683caebfe4e162f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): crates/platform/src/bindings.rs:1117-1127 | crates/platform/src/bindings.rs:1759-1769 | crates/platform/src/bindings.rs:2031-2041 \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":"crates/platform/src/bindings.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfdc168e49b63622807a8bdc7025baaeccb1bf2c3ebe06e14bc89ff937884338"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/platform/src/dialogs.rs:169-187 | crates/platform/src/shell_icons.rs:132-150 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/dialogs.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6e4c6458a39a2036dd1c5e0176c21cd755e130f4bc70101933435f5d9eab456"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/platform/src/bindings.rs:1134-1144 | crates/platform/src/bindings.rs:2790-2799 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb23b6d1977be44e3125d59a503a7894a9931645cd01146878b9fb055eb7d7f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/render/src/fence_chrome.rs:2473-2477 | crates/render/src/fence_chrome.rs:2883-2888 \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/render/src/fence_chrome.rs"},"region":{"startLine":2473}}}],"partialFingerprints":{"codehealthFindingId/v1":"3514ea517eacef1b9119f2d779e40e88560ce03e9bc43039287d15fbc611271a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/app/src/fence_window/group.rs:80-91 | crates/app/src/fence_window/snap.rs:160-166 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/group.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3d681ec694dccf341641adf5a69e29212012bb41f92fb9d457c095d0fd0bbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): crates/render/src/custom_theme.rs:293-296 | crates/render/src/theme.rs:1055-1058 \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":"crates/render/src/custom_theme.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0dbdaf5fb97bd1fe63b23c7f326255e04c8133465a7f26b3aabe781e3e98c45"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/app/src/marquee_offer.rs:205-212 | crates/app/src/notice.rs:547-552 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/marquee_offer.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"805f8c92d2e014a63393754e1c3c257c279595d54811fe6fa5f049dda1001d19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/platform/src/rawinput.rs:130-135 | crates/platform/src/tray.rs:899-903 \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/platform/src/rawinput.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"44179fe05aaf66229dfdf036ac89851907200394420f8cde23184a22afec4c4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 5\u002B corresponding lines): crates/app/src/app/feedback.rs:505-509 | crates/app/src/app/fence_options.rs:898-902 | crates/app/src/app/settings.rs:906-910 | crates/app/src/app/updates.rs:338-344 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/feedback.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5df074a64bf1f51285abf2938bf1d7858a9f41f8336c16fbd4825a8ddbeb39b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/app/src/app/ipc.rs:217-224 | crates/ipc/src/dto.rs:22-29 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/ipc.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c224888dc6bea16d4d5ef6b761606cf4a1c9a8f7cd334c8d8146e2d3ecb80c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/app/src/app/ipc.rs:226-233 | crates/ipc/src/dto.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":"crates/app/src/app/ipc.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"780b9ba34c7f3b4b19a1f1c56e6a818e4c81f8dedd4c54f44de0c9e3fa02afcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/app/src/filter_box.rs:455-457 | crates/app/src/note_edit.rs:67-69 \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":"crates/app/src/filter_box.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c16ff8f8b0646e324ac8e2a7466a5a0d99a609b23cf3622745f3e0c114090cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/app/src/app/updates.rs:80-84 | crates/core/src/model.rs:2434-2439 \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/app/src/app/updates.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef1b7459f0567448eec24e9dd7305c2f6aa3bd4952c389fa0dd9dfe343e17bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/app/src/fence_window/api.rs:2206-2211 | crates/app/src/fence_window/handler/nc.rs:1332-1336 \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/app/src/fence_window/api.rs"},"region":{"startLine":2206}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7fb4a759a4e014eb8a3bceed9e845b41e2fa54db05f6f4bdb20b63681540f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/app/src/app/items.rs:922-926 | crates/app/src/fence_window/api.rs:2663-2667 \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/app/src/app/items.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35ccaef49b34fc0327cf24c8a0ee54d5cccbbd34d325af9e20944106555fac0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201320 lines \u00D7 2): crates/app/src/fence_window/tabs.rs:477-492 | crates/app/src/fence_window/tabs.rs:514-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 \u0060crates/app/src/fence_window/tabs.rs:477\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/app/src/fence_window/tabs.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b08559adbd62407c06698f0f22829d26ac1e0abe6b4da9eb3a3ed6dcd5d18ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201319 lines \u00D7 3): crates/platform/src/layered.rs:41-59 | crates/platform/src/live_wallpaper.rs:108-120 | crates/platform/src/tray.rs:362-374 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060crates/platform/src/layered.rs:41\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/layered.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3226c07fc818e76f0787c5f470bfdc71f71a508e21f1a1b2b8172c6f2ffd9ab1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): crates/app/src/app/menus.rs:319-335 | crates/app/src/app/menus.rs:1356-1373 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/app/src/app/menus.rs:319\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/app/src/app/menus.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4371fe3f11e58ced64be0a12740f3f94142101d6c279af25b729c009c7dfad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): crates/platform/src/bindings.rs:7999-8014 | crates/platform/src/bindings.rs:8140-8155 | crates/platform/src/bindings.rs:8296-8311 \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 \u0060crates/platform/src/bindings.rs:7999\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/platform/src/bindings.rs"},"region":{"startLine":7999}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc71ad57a482c79da68989f68f4cd4dfb66ac38a46f5dc1f4d14609eb45df50e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/platform/src/autostart.rs:199-214 | crates/platform/src/autostart.rs:232-247 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/autostart.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e6f1d977a396959b447c4cf9998ecdc335ca2635fd040f4e431bde0b5733a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/platform/src/fileinfo.rs:16-31 | crates/platform/src/fileinfo.rs:141-156 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/platform/src/fileinfo.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":"crates/platform/src/fileinfo.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8625a016372fe7bcac7a517db7d5989e311747aed088b20729f3d37a5df6750"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/render/src/fence_chrome.rs:5006-5021 | crates/render/src/fence_chrome.rs:5393-5408 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/render/src/fence_chrome.rs:5006\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/render/src/fence_chrome.rs"},"region":{"startLine":5006}}}],"partialFingerprints":{"codehealthFindingId/v1":"e620c9fe670f6d953d7104d98a3ffc0a90dc3eb41bd995c66f6448fa20010b4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/app/src/app/mod.rs:1075-1089 | crates/app/src/app/mod.rs:1097-1111 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/app/src/app/mod.rs:1075\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/mod.rs"},"region":{"startLine":1075}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb41b1acb9da16d9b3fcf5d48543862ba8cf178e70b9082bd8d006e98f6bbb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/app/src/fence_window/handler/mouse.rs:80-93 | crates/app/src/fence_window/handler/nc.rs:293-307 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/app/src/fence_window/handler/nc.rs:311\u0060 calls \u0060set\u0060, \u0060get_capture\u0060 and \u0060crates/app/src/fence_window/handler/mouse.rs:94\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":"crates/app/src/fence_window/handler/mouse.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd8da030adc9175f421eb84ceeecb3a04f9675f2338978dd86d85073a608ef83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/app/src/fence_window/handler/mouse.rs:313-326 | crates/app/src/fence_window/handler/mouse.rs:843-857 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/app/src/fence_window/handler/mouse.rs:313\u0060 it begins part-way through the construct above it, so those exact 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":"crates/app/src/fence_window/handler/mouse.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"66adf6a23a5bc95eadc2a3ac24b51ed87e03ad5eb0fb65dce1be5037229b203b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/platform/src/filedialog.rs:63-77 | crates/platform/src/filedialog.rs:89-103 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/platform/src/filedialog.rs:63\u0060 it does not close everything it opens, so those exact 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":"crates/platform/src/filedialog.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e444e001b6ce65c18e92be1cda480afe1ec5be723d72ee7489c7a21df94301"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 3): crates/render/src/fence_chrome.rs:519-530 | crates/render/src/fence_chrome.rs:600-610 | crates/render/src/fence_chrome.rs:651-664 \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 \u0060crates/render/src/fence_chrome.rs:519\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/fence_chrome.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb39cc1fe7ba6f8ff1ac159ded33f7635e6c9d6282cfd8e38d61dc9c7c883ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/platform/src/rawinput.rs:39-52 | crates/platform/src/rawinput.rs:98-111 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/rawinput.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6a46c28731e8a1c1dfd62874042a49247c6f9e7d32e1dbc08298f0dfa4c792"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/platform/src/shell.rs:1239-1252 | crates/platform/src/wallpaper.rs:605-618 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/platform/src/shell.rs:1235\u0060 calls \u0060cast\u0060 and \u0060crates/platform/src/wallpaper.rs:604\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/shell.rs"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"35921a25a562f64dd07920a0d90af237d9883b8509b20148949cf486db5c484e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/render/src/fence_chrome.rs:3477-3490 | crates/render/src/fence_chrome.rs:4030-4043 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/render/src/fence_chrome.rs:3477\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/fence_chrome.rs"},"region":{"startLine":3477}}}],"partialFingerprints":{"codehealthFindingId/v1":"8363aacdafcf541df30877e5d4378a0da4b74876301538a826d293557143eb25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/platform/src/bindings.rs:13274-13286 | crates/platform/src/bindings.rs:16461-16473 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/platform/src/bindings.rs:13274\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":13274}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0df57a312e2da73041e72706a94df95886bd3a621378eddbcbd5c9200e1bdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): crates/platform/src/bindings.rs:13036-13047 | crates/platform/src/bindings.rs:13276-13287 | crates/platform/src/bindings.rs:13705-13716 | crates/platform/src/bindings.rs:16230-16241 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/platform/src/bindings.rs:13036\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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, \u0060crates/platform/src/bindings.rs:13034\u0060 calls \u0060transmute_copy\u0060, \u0060transmute\u0060 and \u0060crates/platform/src/bindings.rs:13275\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":13036}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb1dc714dc425684234db89528f07d1ff31156cdc66e076ca66ac8c2a5059cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/platform/src/bindings.rs:6745-6756 | crates/platform/src/bindings.rs:14630-14641 | crates/platform/src/bindings.rs:16228-16239 \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 \u0060crates/platform/src/bindings.rs:6745\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/platform/src/bindings.rs"},"region":{"startLine":6745}}}],"partialFingerprints":{"codehealthFindingId/v1":"965589cb4e299d1a72278456ffa1554cf8cc23c270a59df07467f65a877ccf0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/platform/src/bindings.rs:13275-13286 | crates/platform/src/bindings.rs:16229-16240 | crates/platform/src/bindings.rs:16462-16473 \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 \u0060crates/platform/src/bindings.rs:13275\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":13275}}}],"partialFingerprints":{"codehealthFindingId/v1":"289d0f72cffd6e48e96b639d2123d53454adcd5f4047e828effa03036eb52e2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/platform/src/bindings.rs:13561-13572 | crates/render/src/comp.rs:11649-11660 | crates/render/src/gpu_bindings.rs:6072-6083 \u2014 before extracting anything, compare \u0060crates/platform/src/bindings.rs\u0060 and \u0060crates/render/src/comp.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 \u0060crates/platform/src/bindings.rs:13561\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/platform/src/bindings.rs"},"region":{"startLine":13561}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c7c684c2dc05bcb3870170c2a431aebfc3a5802482cc0934fa088856b59f180"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/render/src/fence_chrome.rs:3325-3336 | crates/render/src/fence_chrome.rs:3877-3888 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/render/src/fence_chrome.rs:3325\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/fence_chrome.rs"},"region":{"startLine":3325}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a366ab2ba179eca17b38f845c18ae42e8eb454ac15458286c98b79af70eca53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/render/src/gpu_glass.rs:272-283 | crates/render/src/gpu_glass.rs:311-322 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/gpu_glass.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"9409b8d4cda73f6a12df919ebf7c32e202ec56b9b6acf41f68701da08bdaf250"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 14): crates/platform/src/bindings.rs:12858-12868 | crates/platform/src/bindings.rs:17160-17170 | crates/platform/src/bindings.rs:17187-17197 | crates/platform/src/bindings.rs:17214-17224 | crates/platform/src/bindings.rs:17262-17272 | crates/platform/src/bindings.rs:17287-17297 | crates/platform/src/bindings.rs:17468-17478 | crates/platform/src/bindings.rs:17493-17503 | crates/platform/src/bindings.rs:17524-17534 | crates/platform/src/bindings.rs:17557-17567 | crates/platform/src/bindings.rs:17584-17594 | crates/platform/src/bindings.rs:17632-17642 | crates/platform/src/bindings.rs:17703-17713 | crates/platform/src/bindings.rs:17728-17738 \u2014 all 14 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/platform/src/bindings.rs:12858\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/platform/src/bindings.rs"},"region":{"startLine":12858}}}],"partialFingerprints":{"codehealthFindingId/v1":"c320e910eb9d943265954176ccce7f153b1f2cafcfafbafa542a8f498c5cdc46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 8): crates/platform/src/bindings.rs:6775-6784 | crates/platform/src/bindings.rs:7999-8008 | crates/platform/src/bindings.rs:8140-8149 | crates/platform/src/bindings.rs:8296-8305 | crates/platform/src/bindings.rs:13614-13623 | crates/platform/src/bindings.rs:15686-15695 | crates/platform/src/bindings.rs:17730-17740 | crates/render/src/gpu_bindings.rs:3108-3118 \u2014 before extracting anything, compare \u0060crates/platform/src/bindings.rs\u0060 and \u0060crates/render/src/gpu_bindings.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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/platform/src/bindings.rs:6775\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":6775}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae651e32c52c1a5b1b2e5d101bb1c3de09d61ca692d25a0bf511df3d37680ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): crates/render/src/comp.rs:1282-1292 | crates/render/src/comp.rs:15468-15478 | crates/render/src/comp.rs:16026-16036 | crates/render/src/comp.rs:19287-19297 | crates/render/src/comp.rs:20236-20246 | crates/render/src/comp.rs:21183-21193 \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":"crates/render/src/comp.rs"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab11cfc9539f402e4097135de7a4788bf077417f28c30dd2671caf6abd8e1cc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 6): crates/render/src/gpu_bindings.rs:5677-5687 | crates/render/src/gpu_bindings.rs:5700-5710 | crates/render/src/gpu_bindings.rs:5756-5766 | crates/render/src/gpu_bindings.rs:5779-5789 | crates/render/src/gpu_bindings.rs:5802-5812 | crates/render/src/gpu_bindings.rs:5825-5835 \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 \u0060crates/render/src/gpu_bindings.rs:5677\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/render/src/gpu_bindings.rs"},"region":{"startLine":5677}}}],"partialFingerprints":{"codehealthFindingId/v1":"3296f58c1158e563d631da54ff23a4f92f7ae3fb4a1d8e04cb2105c738c3879a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): crates/platform/src/bindings.rs:6746-6756 | crates/platform/src/bindings.rs:13562-13572 | crates/platform/src/bindings.rs:14631-14641 | crates/render/src/comp.rs:11650-11660 | crates/render/src/gpu_bindings.rs:6073-6083 \u2014 before extracting anything, compare \u0060crates/platform/src/bindings.rs\u0060 and \u0060crates/render/src/comp.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 \u0060crates/platform/src/bindings.rs:6746\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/platform/src/bindings.rs"},"region":{"startLine":6746}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef88a0d9714f54a407fbe7f892df9d0e83c7a33d43b834a880e1a7d5614adaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): crates/platform/src/bindings.rs:12347-12357 | crates/platform/src/bindings.rs:17237-17247 | crates/platform/src/bindings.rs:17607-17617 | crates/platform/src/bindings.rs:17655-17665 | crates/platform/src/bindings.rs:17678-17688 \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 \u0060crates/platform/src/bindings.rs:12347\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/platform/src/bindings.rs"},"region":{"startLine":12347}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c8305ce8d35f6c3ac64373eae1ee736802329b506dd5bed85f5911f0ef981f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/render/src/fence_chrome.rs:519-529 | crates/render/src/fence_chrome.rs:560-570 | crates/render/src/fence_chrome.rs:651-663 \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 \u0060crates/render/src/fence_chrome.rs:519\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/fence_chrome.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c737a91432294622d088f0bcdfea68d5781ff9d3f731a1b5a38c52bc2a7fc9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/app/src/fence_window/handler/mouse_move.rs:608-618 | crates/app/src/fence_window/handler/nc.rs:267-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/mouse_move.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"4373aa3cd97369818ec8145fd32f578776483b7d7529126a48176c3284fa8106"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/platform/src/autostart.rs:207-217 | crates/platform/src/shell.rs:908-918 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/platform/src/autostart.rs:207\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/autostart.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e31da7a9051f42932ce878822aad74564f15d62f6fa8374fcc421a42184707"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): crates/platform/src/clipboard.rs:128-137 | crates/platform/src/dragdrop.rs:1079-1089 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"crates/platform/src/clipboard.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ad30d98ab0d39facfcdfeb025e33d171e9c53035a9c6b3dfed884dc4385f86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/platform/src/dragdrop.rs:961-971 | crates/platform/src/shell_menu.rs:479-489 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/dragdrop.rs"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2759280dfbbaeb8fddbbbc52f4d5955d7a0e174dce60d7b90de821db060bb83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 63): crates/render/src/comp.rs:76-85 | crates/render/src/comp.rs:312-321 | crates/render/src/comp.rs:475-484 | crates/render/src/comp.rs:638-647 | crates/render/src/comp.rs:1069-1078 | crates/render/src/comp.rs:1614-1623 | crates/render/src/comp.rs:1773-1782 | crates/render/src/comp.rs:1963-1972 | crates/render/src/comp.rs:2145-2154 | crates/render/src/comp.rs:2376-2385 | crates/render/src/comp.rs:2691-2700 | crates/render/src/comp.rs:2874-2883 | crates/render/src/comp.rs:3033-3042 | crates/render/src/comp.rs:3222-3231 | crates/render/src/comp.rs:3615-3624 | crates/render/src/comp.rs:3805-3814 | crates/render/src/comp.rs:4169-4178 | crates/render/src/comp.rs:4385-4394 | crates/render/src/comp.rs:4567-4576 | crates/render/src/comp.rs:4726-4735 | crates/render/src/comp.rs:4890-4899 | crates/render/src/comp.rs:5050-5059 | crates/render/src/comp.rs:5213-5222 | crates/render/src/comp.rs:5367-5376 | crates/render/src/comp.rs:5574-5583 | crates/render/src/comp.rs:6041-6050 | crates/render/src/comp.rs:6261-6270 | crates/render/src/comp.rs:6490-6499 | crates/render/src/comp.rs:6653-6662 | crates/render/src/comp.rs:6812-6821 | crates/render/src/comp.rs:6971-6980 | crates/render/src/comp.rs:7770-7779 | crates/render/src/comp.rs:8407-8416 | crates/render/src/comp.rs:8566-8575 | crates/render/src/comp.rs:8725-8734 | crates/render/src/comp.rs:8888-8897 | crates/render/src/comp.rs:9051-9060 | crates/render/src/comp.rs:9409-9418 | crates/render/src/comp.rs:12342-12351 | crates/render/src/comp.rs:12806-12815 | crates/render/src/comp.rs:13240-13249 | crates/render/src/comp.rs:13585-13594 | crates/render/src/comp.rs:14202-14211 | crates/render/src/comp.rs:14558-14567 | crates/render/src/comp.rs:14717-14726 | crates/render/src/comp.rs:14880-14889 | crates/render/src/comp.rs:15255-15264 | crates/render/src/comp.rs:15813-15822 | crates/render/src/comp.rs:16402-16411 | crates/render/src/comp.rs:16565-16574 | crates/render/src/comp.rs:16724-16733 | crates/render/src/comp.rs:17082-17091 | crates/render/src/comp.rs:17441-17450 | crates/render/src/comp.rs:17800-17809 | crates/render/src/comp.rs:17966-17975 | crates/render/src/comp.rs:18604-18613 | crates/render/src/comp.rs:19074-19083 | crates/render/src/comp.rs:19663-19672 | crates/render/src/comp.rs:20023-20032 | crates/render/src/comp.rs:20612-20621 | crates/render/src/comp.rs:20970-20979 | crates/render/src/comp.rs:21324-21333 | crates/render/src/comp.rs:21897-21906 \u2014 all 63 copies are in the same file, so extract the block into one function there and call it 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":"crates/render/src/comp.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8717bd8c9faf35855bbd3478fee4852583a144c786d3248b0df625b66ee7ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 63): crates/render/src/comp.rs:97-106 | crates/render/src/comp.rs:333-342 | crates/render/src/comp.rs:496-505 | crates/render/src/comp.rs:659-668 | crates/render/src/comp.rs:1090-1099 | crates/render/src/comp.rs:1635-1644 | crates/render/src/comp.rs:1794-1803 | crates/render/src/comp.rs:1984-1993 | crates/render/src/comp.rs:2166-2175 | crates/render/src/comp.rs:2397-2406 | crates/render/src/comp.rs:2712-2721 | crates/render/src/comp.rs:2895-2904 | crates/render/src/comp.rs:3054-3063 | crates/render/src/comp.rs:3243-3252 | crates/render/src/comp.rs:3636-3645 | crates/render/src/comp.rs:3826-3835 | crates/render/src/comp.rs:4190-4199 | crates/render/src/comp.rs:4406-4415 | crates/render/src/comp.rs:4588-4597 | crates/render/src/comp.rs:4747-4756 | crates/render/src/comp.rs:4911-4920 | crates/render/src/comp.rs:5071-5080 | crates/render/src/comp.rs:5234-5243 | crates/render/src/comp.rs:5388-5397 | crates/render/src/comp.rs:5595-5604 | crates/render/src/comp.rs:6062-6071 | crates/render/src/comp.rs:6282-6291 | crates/render/src/comp.rs:6511-6520 | crates/render/src/comp.rs:6674-6683 | crates/render/src/comp.rs:6833-6842 | crates/render/src/comp.rs:6992-7001 | crates/render/src/comp.rs:7791-7800 | crates/render/src/comp.rs:8428-8437 | crates/render/src/comp.rs:8587-8596 | crates/render/src/comp.rs:8746-8755 | crates/render/src/comp.rs:8909-8918 | crates/render/src/comp.rs:9072-9081 | crates/render/src/comp.rs:9430-9439 | crates/render/src/comp.rs:12363-12372 | crates/render/src/comp.rs:12827-12836 | crates/render/src/comp.rs:13261-13270 | crates/render/src/comp.rs:13606-13615 | crates/render/src/comp.rs:14223-14232 | crates/render/src/comp.rs:14579-14588 | crates/render/src/comp.rs:14738-14747 | crates/render/src/comp.rs:14901-14910 | crates/render/src/comp.rs:15276-15285 | crates/render/src/comp.rs:15834-15843 | crates/render/src/comp.rs:16423-16432 | crates/render/src/comp.rs:16586-16595 | crates/render/src/comp.rs:16745-16754 | crates/render/src/comp.rs:17103-17112 | crates/render/src/comp.rs:17462-17471 | crates/render/src/comp.rs:17821-17830 | crates/render/src/comp.rs:17987-17996 | crates/render/src/comp.rs:18625-18634 | crates/render/src/comp.rs:19095-19104 | crates/render/src/comp.rs:19684-19693 | crates/render/src/comp.rs:20044-20053 | crates/render/src/comp.rs:20633-20642 | crates/render/src/comp.rs:20991-21000 | crates/render/src/comp.rs:21345-21354 | crates/render/src/comp.rs:21918-21927 \u2014 all 63 copies are in the same file, so extract the block into one function there and call it 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":"crates/render/src/comp.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b70b11bf4f5081185de9c6fbc1bed6a84f63c0ef7d465038b53675bf60a835"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 62): crates/render/src/comp.rs:12-21 | crates/render/src/comp.rs:248-257 | crates/render/src/comp.rs:411-420 | crates/render/src/comp.rs:574-583 | crates/render/src/comp.rs:1005-1014 | crates/render/src/comp.rs:1550-1559 | crates/render/src/comp.rs:1709-1718 | crates/render/src/comp.rs:1899-1908 | crates/render/src/comp.rs:2081-2090 | crates/render/src/comp.rs:2312-2321 | crates/render/src/comp.rs:2627-2636 | crates/render/src/comp.rs:2810-2819 | crates/render/src/comp.rs:2969-2978 | crates/render/src/comp.rs:3158-3167 | crates/render/src/comp.rs:3551-3560 | crates/render/src/comp.rs:3741-3750 | crates/render/src/comp.rs:4105-4114 | crates/render/src/comp.rs:4321-4330 | crates/render/src/comp.rs:4503-4512 | crates/render/src/comp.rs:4662-4671 | crates/render/src/comp.rs:4826-4835 | crates/render/src/comp.rs:4986-4995 | crates/render/src/comp.rs:5149-5158 | crates/render/src/comp.rs:5510-5519 | crates/render/src/comp.rs:5977-5986 | crates/render/src/comp.rs:6197-6206 | crates/render/src/comp.rs:6426-6435 | crates/render/src/comp.rs:6589-6598 | crates/render/src/comp.rs:6748-6757 | crates/render/src/comp.rs:6907-6916 | crates/render/src/comp.rs:7706-7715 | crates/render/src/comp.rs:8343-8352 | crates/render/src/comp.rs:8502-8511 | crates/render/src/comp.rs:8661-8670 | crates/render/src/comp.rs:8824-8833 | crates/render/src/comp.rs:8987-8996 | crates/render/src/comp.rs:9345-9354 | crates/render/src/comp.rs:12278-12287 | crates/render/src/comp.rs:12742-12751 | crates/render/src/comp.rs:13176-13185 | crates/render/src/comp.rs:13521-13530 | crates/render/src/comp.rs:14138-14147 | crates/render/src/comp.rs:14494-14503 | crates/render/src/comp.rs:14653-14662 | crates/render/src/comp.rs:14816-14825 | crates/render/src/comp.rs:15191-15200 | crates/render/src/comp.rs:15749-15758 | crates/render/src/comp.rs:16338-16347 | crates/render/src/comp.rs:16501-16510 | crates/render/src/comp.rs:16660-16669 | crates/render/src/comp.rs:17018-17027 | crates/render/src/comp.rs:17377-17386 | crates/render/src/comp.rs:17736-17745 | crates/render/src/comp.rs:17902-17911 | crates/render/src/comp.rs:18540-18549 | crates/render/src/comp.rs:19010-19019 | crates/render/src/comp.rs:19599-19608 | crates/render/src/comp.rs:19959-19968 | crates/render/src/comp.rs:20548-20557 | crates/render/src/comp.rs:20906-20915 | crates/render/src/comp.rs:21260-21269 | crates/render/src/comp.rs:21833-21842 \u2014 all 62 copies are in the same file, so extract the block into one function there and call it 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":"crates/render/src/comp.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bae48b1804827fffdcda198a3726963d5a9703e809a18661bed31eed873d779"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 62): crates/render/src/comp.rs:23-32 | crates/render/src/comp.rs:259-268 | crates/render/src/comp.rs:422-431 | crates/render/src/comp.rs:585-594 | crates/render/src/comp.rs:1016-1025 | crates/render/src/comp.rs:1561-1570 | crates/render/src/comp.rs:1720-1729 | crates/render/src/comp.rs:1910-1919 | crates/render/src/comp.rs:2092-2101 | crates/render/src/comp.rs:2323-2332 | crates/render/src/comp.rs:2638-2647 | crates/render/src/comp.rs:2821-2830 | crates/render/src/comp.rs:2980-2989 | crates/render/src/comp.rs:3169-3178 | crates/render/src/comp.rs:3562-3571 | crates/render/src/comp.rs:3752-3761 | crates/render/src/comp.rs:4116-4125 | crates/render/src/comp.rs:4332-4341 | crates/render/src/comp.rs:4514-4523 | crates/render/src/comp.rs:4673-4682 | crates/render/src/comp.rs:4837-4846 | crates/render/src/comp.rs:4997-5006 | crates/render/src/comp.rs:5160-5169 | crates/render/src/comp.rs:5521-5530 | crates/render/src/comp.rs:5988-5997 | crates/render/src/comp.rs:6208-6217 | crates/render/src/comp.rs:6437-6446 | crates/render/src/comp.rs:6600-6609 | crates/render/src/comp.rs:6759-6768 | crates/render/src/comp.rs:6918-6927 | crates/render/src/comp.rs:7717-7726 | crates/render/src/comp.rs:8354-8363 | crates/render/src/comp.rs:8513-8522 | crates/render/src/comp.rs:8672-8681 | crates/render/src/comp.rs:8835-8844 | crates/render/src/comp.rs:8998-9007 | crates/render/src/comp.rs:9356-9365 | crates/render/src/comp.rs:12289-12298 | crates/render/src/comp.rs:12753-12762 | crates/render/src/comp.rs:13187-13196 | crates/render/src/comp.rs:13532-13541 | crates/render/src/comp.rs:14149-14158 | crates/render/src/comp.rs:14505-14514 | crates/render/src/comp.rs:14664-14673 | crates/render/src/comp.rs:14827-14836 | crates/render/src/comp.rs:15202-15211 | crates/render/src/comp.rs:15760-15769 | crates/render/src/comp.rs:16349-16358 | crates/render/src/comp.rs:16512-16521 | crates/render/src/comp.rs:16671-16680 | crates/render/src/comp.rs:17029-17038 | crates/render/src/comp.rs:17388-17397 | crates/render/src/comp.rs:17747-17756 | crates/render/src/comp.rs:17913-17922 | crates/render/src/comp.rs:18551-18560 | crates/render/src/comp.rs:19021-19030 | crates/render/src/comp.rs:19610-19619 | crates/render/src/comp.rs:19970-19979 | crates/render/src/comp.rs:20559-20568 | crates/render/src/comp.rs:20917-20926 | crates/render/src/comp.rs:21271-21280 | crates/render/src/comp.rs:21844-21853 \u2014 all 62 copies are in the same file, so extract the block into one function there and call it 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":"crates/render/src/comp.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"166611ef1f272c624721b576a0bbe67b88de4840a05c3646edc4b2f5eb017ef1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 62): crates/render/src/comp.rs:34-43 | crates/render/src/comp.rs:270-279 | crates/render/src/comp.rs:433-442 | crates/render/src/comp.rs:596-605 | crates/render/src/comp.rs:1027-1036 | crates/render/src/comp.rs:1572-1581 | crates/render/src/comp.rs:1731-1740 | crates/render/src/comp.rs:1921-1930 | crates/render/src/comp.rs:2103-2112 | crates/render/src/comp.rs:2334-2343 | crates/render/src/comp.rs:2649-2658 | crates/render/src/comp.rs:2832-2841 | crates/render/src/comp.rs:2991-3000 | crates/render/src/comp.rs:3180-3189 | crates/render/src/comp.rs:3573-3582 | crates/render/src/comp.rs:3763-3772 | crates/render/src/comp.rs:4127-4136 | crates/render/src/comp.rs:4343-4352 | crates/render/src/comp.rs:4525-4534 | crates/render/src/comp.rs:4684-4693 | crates/render/src/comp.rs:4848-4857 | crates/render/src/comp.rs:5008-5017 | crates/render/src/comp.rs:5171-5180 | crates/render/src/comp.rs:5532-5541 | crates/render/src/comp.rs:5999-6008 | crates/render/src/comp.rs:6219-6228 | crates/render/src/comp.rs:6448-6457 | crates/render/src/comp.rs:6611-6620 | crates/render/src/comp.rs:6770-6779 | crates/render/src/comp.rs:6929-6938 | crates/render/src/comp.rs:7728-7737 | crates/render/src/comp.rs:8365-8374 | crates/render/src/comp.rs:8524-8533 | crates/render/src/comp.rs:8683-8692 | crates/render/src/comp.rs:8846-8855 | crates/render/src/comp.rs:9009-9018 | crates/render/src/comp.rs:9367-9376 | crates/render/src/comp.rs:12300-12309 | crates/render/src/comp.rs:12764-12773 | crates/render/src/comp.rs:13198-13207 | crates/render/src/comp.rs:13543-13552 | crates/render/src/comp.rs:14160-14169 | crates/render/src/comp.rs:14516-14525 | crates/render/src/comp.rs:14675-14684 | crates/render/src/comp.rs:14838-14847 | crates/render/src/comp.rs:15213-15222 | crates/render/src/comp.rs:15771-15780 | crates/render/src/comp.rs:16360-16369 | crates/render/src/comp.rs:16523-16532 | crates/render/src/comp.rs:16682-16691 | crates/render/src/comp.rs:17040-17049 | crates/render/src/comp.rs:17399-17408 | crates/render/src/comp.rs:17758-17767 | crates/render/src/comp.rs:17924-17933 | crates/render/src/comp.rs:18562-18571 | crates/render/src/comp.rs:19032-19041 | crates/render/src/comp.rs:19621-19630 | crates/render/src/comp.rs:19981-19990 | crates/render/src/comp.rs:20570-20579 | crates/render/src/comp.rs:20928-20937 | crates/render/src/comp.rs:21282-21291 | crates/render/src/comp.rs:21855-21864 \u2014 all 62 copies are in the same file, so extract the block into one function there and call it 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":"crates/render/src/comp.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9e0971492c12e9cd7e6c33a1a467cb0ef3e6c57f7615e201e01029b0cff777"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 62): crates/render/src/comp.rs:52-61 | crates/render/src/comp.rs:288-297 | crates/render/src/comp.rs:451-460 | crates/render/src/comp.rs:614-623 | crates/render/src/comp.rs:1045-1054 | crates/render/src/comp.rs:1590-1599 | crates/render/src/comp.rs:1749-1758 | crates/render/src/comp.rs:1939-1948 | crates/render/src/comp.rs:2121-2130 | crates/render/src/comp.rs:2352-2361 | crates/render/src/comp.rs:2667-2676 | crates/render/src/comp.rs:2850-2859 | crates/render/src/comp.rs:3009-3018 | crates/render/src/comp.rs:3198-3207 | crates/render/src/comp.rs:3591-3600 | crates/render/src/comp.rs:3781-3790 | crates/render/src/comp.rs:4145-4154 | crates/render/src/comp.rs:4361-4370 | crates/render/src/comp.rs:4543-4552 | crates/render/src/comp.rs:4702-4711 | crates/render/src/comp.rs:4866-4875 | crates/render/src/comp.rs:5026-5035 | crates/render/src/comp.rs:5189-5198 | crates/render/src/comp.rs:5550-5559 | crates/render/src/comp.rs:6017-6026 | crates/render/src/comp.rs:6237-6246 | crates/render/src/comp.rs:6466-6475 | crates/render/src/comp.rs:6629-6638 | crates/render/src/comp.rs:6788-6797 | crates/render/src/comp.rs:6947-6956 | crates/render/src/comp.rs:7746-7755 | crates/render/src/comp.rs:8383-8392 | crates/render/src/comp.rs:8542-8551 | crates/render/src/comp.rs:8701-8710 | crates/render/src/comp.rs:8864-8873 | crates/render/src/comp.rs:9027-9036 | crates/render/src/comp.rs:9385-9394 | crates/render/src/comp.rs:12318-12327 | crates/render/src/comp.rs:12782-12791 | crates/render/src/comp.rs:13216-13225 | crates/render/src/comp.rs:13561-13570 | crates/render/src/comp.rs:14178-14187 | crates/render/src/comp.rs:14534-14543 | crates/render/src/comp.rs:14693-14702 | crates/render/src/comp.rs:14856-14865 | crates/render/src/comp.rs:15231-15240 | crates/render/src/comp.rs:15789-15798 | crates/render/src/comp.rs:16378-16387 | crates/render/src/comp.rs:16541-16550 | crates/render/src/comp.rs:16700-16709 | crates/render/src/comp.rs:17058-17067 | crates/render/src/comp.rs:17417-17426 | crates/render/src/comp.rs:17776-17785 | crates/render/src/comp.rs:17942-17951 | crates/render/src/comp.rs:18580-18589 | crates/render/src/comp.rs:19050-19059 | crates/render/src/comp.rs:19639-19648 | crates/render/src/comp.rs:19999-20008 | crates/render/src/comp.rs:20588-20597 | crates/render/src/comp.rs:20946-20955 | crates/render/src/comp.rs:21300-21309 | crates/render/src/comp.rs:21873-21882 \u2014 all 62 copies are in the same file, so extract the block into one function there and call it 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":"crates/render/src/comp.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb2878e06c12eddb5b2fbb1674ee96f1e9b7c4aa5c24ce555a98ad2746f8ad0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 16): crates/render/src/comp.rs:973-982 | crates/render/src/comp.rs:1518-1527 | crates/render/src/comp.rs:9313-9322 | crates/render/src/comp.rs:13144-13153 | crates/render/src/comp.rs:14462-14471 | crates/render/src/comp.rs:15159-15168 | crates/render/src/comp.rs:15717-15726 | crates/render/src/comp.rs:16306-16315 | crates/render/src/comp.rs:16986-16995 | crates/render/src/comp.rs:17345-17354 | crates/render/src/comp.rs:17704-17713 | crates/render/src/comp.rs:18978-18987 | crates/render/src/comp.rs:19567-19576 | crates/render/src/comp.rs:19927-19936 | crates/render/src/comp.rs:20516-20525 | crates/render/src/comp.rs:20874-20883 \u2014 all 16 copies are in the same file, so extract the block into one function there and call it 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":"crates/render/src/comp.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"25fc88dc8c65faaec7a38225645f2770cf38f357edef65989012268732c32e01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 16): crates/render/src/comp.rs:984-993 | crates/render/src/comp.rs:1529-1538 | crates/render/src/comp.rs:9324-9333 | crates/render/src/comp.rs:13155-13164 | crates/render/src/comp.rs:14473-14482 | crates/render/src/comp.rs:15170-15179 | crates/render/src/comp.rs:15728-15737 | crates/render/src/comp.rs:16317-16326 | crates/render/src/comp.rs:16997-17006 | crates/render/src/comp.rs:17356-17365 | crates/render/src/comp.rs:17715-17724 | crates/render/src/comp.rs:18989-18998 | crates/render/src/comp.rs:19578-19587 | crates/render/src/comp.rs:19938-19947 | crates/render/src/comp.rs:20527-20536 | crates/render/src/comp.rs:20885-20894 \u2014 all 16 copies are in the same file, so extract the block into one function there and call it 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":"crates/render/src/comp.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"25175e795b37372db85bb157cbb745a557d8bb0ec3cd1ac0d4717013076b6cb1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 15): crates/render/src/comp.rs:835-844 | crates/render/src/comp.rs:9175-9184 | crates/render/src/comp.rs:13006-13015 | crates/render/src/comp.rs:14324-14333 | crates/render/src/comp.rs:15021-15030 | crates/render/src/comp.rs:15579-15588 | crates/render/src/comp.rs:16168-16177 | crates/render/src/comp.rs:16848-16857 | crates/render/src/comp.rs:17207-17216 | crates/render/src/comp.rs:17566-17575 | crates/render/src/comp.rs:18840-18849 | crates/render/src/comp.rs:19429-19438 | crates/render/src/comp.rs:19789-19798 | crates/render/src/comp.rs:20378-20387 | crates/render/src/comp.rs:20736-20745 \u2014 all 15 copies are in the same file, so extract the block into one function there and call it 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":"crates/render/src/comp.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"395aeab20fd4a366243613b986fd89a3ad1cdf072ed743dbe3afe993d3d7164d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 15): crates/render/src/comp.rs:850-859 | crates/render/src/comp.rs:9190-9199 | crates/render/src/comp.rs:13021-13030 | crates/render/src/comp.rs:14339-14348 | crates/render/src/comp.rs:15036-15045 | crates/render/src/comp.rs:15594-15603 | crates/render/src/comp.rs:16183-16192 | crates/render/src/comp.rs:16863-16872 | crates/render/src/comp.rs:17222-17231 | crates/render/src/comp.rs:17581-17590 | crates/render/src/comp.rs:18855-18864 | crates/render/src/comp.rs:19444-19453 | crates/render/src/comp.rs:19804-19813 | crates/render/src/comp.rs:20393-20402 | crates/render/src/comp.rs:20751-20760 \u2014 all 15 copies are in the same file, so extract the block into one function there and call it 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":"crates/render/src/comp.rs"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6f04192e2f10447749e8aa6e2abb4f78a27fb3e565f5652ef459d6124d25e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 15): crates/render/src/comp.rs:865-874 | crates/render/src/comp.rs:9205-9214 | crates/render/src/comp.rs:13036-13045 | crates/render/src/comp.rs:14354-14363 | crates/render/src/comp.rs:15051-15060 | crates/render/src/comp.rs:15609-15618 | crates/render/src/comp.rs:16198-16207 | crates/render/src/comp.rs:16878-16887 | crates/render/src/comp.rs:17237-17246 | crates/render/src/comp.rs:17596-17605 | crates/render/src/comp.rs:18870-18879 | crates/render/src/comp.rs:19459-19468 | crates/render/src/comp.rs:19819-19828 | crates/render/src/comp.rs:20408-20417 | crates/render/src/comp.rs:20766-20775 \u2014 all 15 copies are in the same file, so extract the block into one function there and call it 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":"crates/render/src/comp.rs"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d05bf680b48175fc7f19c930df30bb86ec882f988185995c7af81d6ee2bafd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 15): crates/render/src/comp.rs:880-889 | crates/render/src/comp.rs:9220-9229 | crates/render/src/comp.rs:13051-13060 | crates/render/src/comp.rs:14369-14378 | crates/render/src/comp.rs:15066-15075 | crates/render/src/comp.rs:15624-15633 | crates/render/src/comp.rs:16213-16222 | crates/render/src/comp.rs:16893-16902 | crates/render/src/comp.rs:17252-17261 | crates/render/src/comp.rs:17611-17620 | crates/render/src/comp.rs:18885-18894 | crates/render/src/comp.rs:19474-19483 | crates/render/src/comp.rs:19834-19843 | crates/render/src/comp.rs:20423-20432 | crates/render/src/comp.rs:20781-20790 \u2014 all 15 copies are in the same file, so extract the block into one function there and call it 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":"crates/render/src/comp.rs"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"12c7efb27c305f26a418ccb0d7357546bf06d78501e61e6c6e65695dd44324d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 15): crates/render/src/comp.rs:898-907 | crates/render/src/comp.rs:9238-9247 | crates/render/src/comp.rs:13069-13078 | crates/render/src/comp.rs:14387-14396 | crates/render/src/comp.rs:15084-15093 | crates/render/src/comp.rs:15642-15651 | crates/render/src/comp.rs:16231-16240 | crates/render/src/comp.rs:16911-16920 | crates/render/src/comp.rs:17270-17279 | crates/render/src/comp.rs:17629-17638 | crates/render/src/comp.rs:18903-18912 | crates/render/src/comp.rs:19492-19501 | crates/render/src/comp.rs:19852-19861 | crates/render/src/comp.rs:20441-20450 | crates/render/src/comp.rs:20799-20808 \u2014 all 15 copies are in the same file, so extract the block into one function there and call it 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":"crates/render/src/comp.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"84fe1e27c799899b3072de30bdfb4fd37c68f2c41b0c8e06afca28c84b86e621"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 15): crates/render/src/comp.rs:913-922 | crates/render/src/comp.rs:9253-9262 | crates/render/src/comp.rs:13084-13093 | crates/render/src/comp.rs:14402-14411 | crates/render/src/comp.rs:15099-15108 | crates/render/src/comp.rs:15657-15666 | crates/render/src/comp.rs:16246-16255 | crates/render/src/comp.rs:16926-16935 | crates/render/src/comp.rs:17285-17294 | crates/render/src/comp.rs:17644-17653 | crates/render/src/comp.rs:18918-18927 | crates/render/src/comp.rs:19507-19516 | crates/render/src/comp.rs:19867-19876 | crates/render/src/comp.rs:20456-20465 | crates/render/src/comp.rs:20814-20823 \u2014 all 15 copies are in the same file, so extract the block into one function there and call it 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":"crates/render/src/comp.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"5908abe2b32022361a4556934ed7c4057ea71d923200a8b9b0abe4e7e5e75f67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 15): crates/render/src/comp.rs:928-937 | crates/render/src/comp.rs:9268-9277 | crates/render/src/comp.rs:13099-13108 | crates/render/src/comp.rs:14417-14426 | crates/render/src/comp.rs:15114-15123 | crates/render/src/comp.rs:15672-15681 | crates/render/src/comp.rs:16261-16270 | crates/render/src/comp.rs:16941-16950 | crates/render/src/comp.rs:17300-17309 | crates/render/src/comp.rs:17659-17668 | crates/render/src/comp.rs:18933-18942 | crates/render/src/comp.rs:19522-19531 | crates/render/src/comp.rs:19882-19891 | crates/render/src/comp.rs:20471-20480 | crates/render/src/comp.rs:20829-20838 \u2014 all 15 copies are in the same file, so extract the block into one function there and call it 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":"crates/render/src/comp.rs"},"region":{"startLine":928}}}],"partialFingerprints":{"codehealthFindingId/v1":"1744059aaba6e97497c5598265160ac13528f7a76d0142432fb9174c91c304b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 15): crates/render/src/comp.rs:943-952 | crates/render/src/comp.rs:9283-9292 | crates/render/src/comp.rs:13114-13123 | crates/render/src/comp.rs:14432-14441 | crates/render/src/comp.rs:15129-15138 | crates/render/src/comp.rs:15687-15696 | crates/render/src/comp.rs:16276-16285 | crates/render/src/comp.rs:16956-16965 | crates/render/src/comp.rs:17315-17324 | crates/render/src/comp.rs:17674-17683 | crates/render/src/comp.rs:18948-18957 | crates/render/src/comp.rs:19537-19546 | crates/render/src/comp.rs:19897-19906 | crates/render/src/comp.rs:20486-20495 | crates/render/src/comp.rs:20844-20853 \u2014 all 15 copies are in the same file, so extract the block into one function there and call it 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":"crates/render/src/comp.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"80a1af80df0a37454b64470aab53c163c531b05d3f8feb859d2c682090db0af8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 15): crates/render/src/comp.rs:958-967 | crates/render/src/comp.rs:9298-9307 | crates/render/src/comp.rs:13129-13138 | crates/render/src/comp.rs:14447-14456 | crates/render/src/comp.rs:15144-15153 | crates/render/src/comp.rs:15702-15711 | crates/render/src/comp.rs:16291-16300 | crates/render/src/comp.rs:16971-16980 | crates/render/src/comp.rs:17330-17339 | crates/render/src/comp.rs:17689-17698 | crates/render/src/comp.rs:18963-18972 | crates/render/src/comp.rs:19552-19561 | crates/render/src/comp.rs:19912-19921 | crates/render/src/comp.rs:20501-20510 | crates/render/src/comp.rs:20859-20868 \u2014 all 15 copies are in the same file, so extract the block into one function there and call it 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":"crates/render/src/comp.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca99cdc1d4eda01af9882fa2123987721fb408e070dde7b351915ca64a1e1f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 7): crates/render/src/comp.rs:1294-1303 | crates/render/src/comp.rs:13452-13461 | crates/render/src/comp.rs:15480-15489 | crates/render/src/comp.rs:16038-16047 | crates/render/src/comp.rs:19299-19308 | crates/render/src/comp.rs:20248-20257 | crates/render/src/comp.rs:21195-21204 \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. 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/render/src/comp.rs"},"region":{"startLine":1294}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a965e0d3f952afbc6d4078cf1055c1870cbff0237f94ef15c3c9e8ca2f3350"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 7): crates/render/src/comp.rs:1315-1324 | crates/render/src/comp.rs:13473-13482 | crates/render/src/comp.rs:15501-15510 | crates/render/src/comp.rs:16059-16068 | crates/render/src/comp.rs:19320-19329 | crates/render/src/comp.rs:20269-20278 | crates/render/src/comp.rs:21216-21225 \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. 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/render/src/comp.rs"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"56e66cb01df90b5e4587a85e1d8ed197fef5d65a2800b534d44e4aaf4d53f81e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): crates/render/src/comp.rs:1140-1149 | crates/render/src/comp.rs:15326-15335 | crates/render/src/comp.rs:15884-15893 | crates/render/src/comp.rs:19145-19154 | crates/render/src/comp.rs:20094-20103 | crates/render/src/comp.rs:21041-21050 \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":"crates/render/src/comp.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c0eea34cccd98366a02b7991683c450339edcba94d20ed8461fcba23bb3108"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): crates/render/src/comp.rs:1161-1170 | crates/render/src/comp.rs:15347-15356 | crates/render/src/comp.rs:15905-15914 | crates/render/src/comp.rs:19166-19175 | crates/render/src/comp.rs:20115-20124 | crates/render/src/comp.rs:21062-21071 \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":"crates/render/src/comp.rs"},"region":{"startLine":1161}}}],"partialFingerprints":{"codehealthFindingId/v1":"133dc665943e63bb185488c0f0b7c169f9a4e7494a9ec92146f5b9ee86e11677"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): crates/render/src/comp.rs:1182-1191 | crates/render/src/comp.rs:15368-15377 | crates/render/src/comp.rs:15926-15935 | crates/render/src/comp.rs:19187-19196 | crates/render/src/comp.rs:20136-20145 | crates/render/src/comp.rs:21083-21092 \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":"crates/render/src/comp.rs"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"0229096db4a30a4c56a7a5c5d82d3d80b83bf1cb5a0c4262289267b9ee0103bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): crates/render/src/comp.rs:1206-1215 | crates/render/src/comp.rs:15392-15401 | crates/render/src/comp.rs:15950-15959 | crates/render/src/comp.rs:19211-19220 | crates/render/src/comp.rs:20160-20169 | crates/render/src/comp.rs:21107-21116 \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":"crates/render/src/comp.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6913565fd3cbbd9605703a0f25c8c83f6b6779770af97753f5d7983e1cead95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): crates/render/src/comp.rs:1227-1236 | crates/render/src/comp.rs:15413-15422 | crates/render/src/comp.rs:15971-15980 | crates/render/src/comp.rs:19232-19241 | crates/render/src/comp.rs:20181-20190 | crates/render/src/comp.rs:21128-21137 \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":"crates/render/src/comp.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"64744ccf63ed9457827a0895961d72277a34960957027ddc2ffe4451c58aabe7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): crates/render/src/comp.rs:1238-1247 | crates/render/src/comp.rs:15424-15433 | crates/render/src/comp.rs:15982-15991 | crates/render/src/comp.rs:19243-19252 | crates/render/src/comp.rs:20192-20201 | crates/render/src/comp.rs:21139-21148 \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":"crates/render/src/comp.rs"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0ae112c856d99c935bc5afd3a08e5ce62c4f2fd0f7a923cf875bfe95c9c007"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): crates/render/src/comp.rs:1263-1272 | crates/render/src/comp.rs:15449-15458 | crates/render/src/comp.rs:16007-16016 | crates/render/src/comp.rs:19268-19277 | crates/render/src/comp.rs:20217-20226 | crates/render/src/comp.rs:21164-21173 \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":"crates/render/src/comp.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"f084e1527e4d49e1208d02b63e3822217cb766c176e872e527b414a97f740b2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/platform/src/bindings.rs:4712-4721 | crates/platform/src/bindings.rs:4750-4759 | crates/platform/src/bindings.rs:12393-12402 | crates/render/src/gpu_bindings.rs:5666-5675 \u2014 before extracting anything, compare \u0060crates/platform/src/bindings.rs\u0060 and \u0060crates/render/src/gpu_bindings.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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/platform/src/bindings.rs:4712\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/platform/src/bindings.rs"},"region":{"startLine":4712}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f41cc4f5d42150ac09ef7595328a9bb6be206adc266783754637d1552184a51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 4): crates/render/src/comp.rs:1847-1855 | crates/render/src/comp.rs:11489-11498 | crates/render/src/comp.rs:12426-12435 | crates/render/src/comp.rs:21969-21977 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/render/src/comp.rs:1847\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/render/src/comp.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"98fe4c190a7cbf064fd4e8c0242498bb2cf39825fe1e9728eada23f29647f9bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/render/src/comp.rs:8219-8228 | crates/render/src/comp.rs:14035-14044 | crates/render/src/comp.rs:18438-18447 | crates/render/src/comp.rs:21730-21739 \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":"crates/render/src/comp.rs"},"region":{"startLine":8219}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf85033bea41c4183edfb4eb88d501e081315205b094d79a23c5e3a638421a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/render/src/comp.rs:8245-8254 | crates/render/src/comp.rs:14061-14070 | crates/render/src/comp.rs:18464-18473 | crates/render/src/comp.rs:21756-21765 \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":"crates/render/src/comp.rs"},"region":{"startLine":8245}}}],"partialFingerprints":{"codehealthFindingId/v1":"767797a9f289dfe0bbebc47f7de849c07a9b922f44afdf40548a9986427d41ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/render/src/comp.rs:8269-8278 | crates/render/src/comp.rs:14085-14094 | crates/render/src/comp.rs:18488-18497 | crates/render/src/comp.rs:21780-21789 \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":"crates/render/src/comp.rs"},"region":{"startLine":8269}}}],"partialFingerprints":{"codehealthFindingId/v1":"377a76d9281ad2973858593a90f2f4f71fc34266c87dad5743fc16d844dd1b94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/render/src/fence_chrome.rs:534-543 | crates/render/src/fence_chrome.rs:575-584 | crates/render/src/fence_chrome.rs:614-623 | crates/render/src/fence_chrome.rs:668-677 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/render/src/fence_chrome.rs:534\u0060 it begins part-way through the construct above it, so those exact 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, \u0060crates/render/src/fence_chrome.rs:666\u0060 calls \u0060width\u0060, \u0060height\u0060 and \u0060crates/render/src/fence_chrome.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":"crates/render/src/fence_chrome.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d64fae5fb07b685a7f67b339cbb44412f2ed90f9f46ecd608967ed2b1b5b3f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/platform/src/bindings.rs:11733-11742 | crates/platform/src/bindings.rs:11782-11791 | crates/platform/src/bindings.rs:11807-11816 \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 \u0060crates/platform/src/bindings.rs:11733\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/platform/src/bindings.rs"},"region":{"startLine":11733}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac45c7a7aca82952869cfba889b4122a19e6097650d2cc1bb1503195fca5b458"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/render/src/comp.rs:2471-2480 | crates/render/src/comp.rs:3905-3914 | crates/render/src/comp.rs:12586-12595 \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":"crates/render/src/comp.rs"},"region":{"startLine":2471}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c48ed82cd8cfe0485fd98e934a4f62e6bd6a91884fa6c534c44adf5cb2a00e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/render/src/comp.rs:2495-2504 | crates/render/src/comp.rs:3929-3938 | crates/render/src/comp.rs:12610-12619 \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":"crates/render/src/comp.rs"},"region":{"startLine":2495}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb358703a85690f4a2fc937d61a193d0e02a6d877b94f41e9a4a083c571f02be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/render/src/comp.rs:2519-2528 | crates/render/src/comp.rs:3953-3962 | crates/render/src/comp.rs:12634-12643 \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":"crates/render/src/comp.rs"},"region":{"startLine":2519}}}],"partialFingerprints":{"codehealthFindingId/v1":"41931a5a2812c5f53153f497bc4914c5c46adbbd75ff21f9b6edee416a317d9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/render/src/comp.rs:2540-2549 | crates/render/src/comp.rs:3974-3983 | crates/render/src/comp.rs:12655-12664 \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":"crates/render/src/comp.rs"},"region":{"startLine":2540}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2534cf50aabbdd1442ae8b46140561c97694cb6530504d04d191b7dd795b9b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/render/src/comp.rs:2561-2570 | crates/render/src/comp.rs:3995-4004 | crates/render/src/comp.rs:12676-12685 \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":"crates/render/src/comp.rs"},"region":{"startLine":2561}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57f4f0dbe49f88743d791d7d71e97e2de8b68f25189b0235e6191e852a7b3c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/render/src/comp.rs:2582-2591 | crates/render/src/comp.rs:4016-4025 | crates/render/src/comp.rs:12697-12706 \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":"crates/render/src/comp.rs"},"region":{"startLine":2582}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6db8b4860875f652538980f1f7886b26eb5519c61a3690bc8892b3de66064aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/render/src/comp.rs:2603-2612 | crates/render/src/comp.rs:4037-4046 | crates/render/src/comp.rs:12718-12727 \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":"crates/render/src/comp.rs"},"region":{"startLine":2603}}}],"partialFingerprints":{"codehealthFindingId/v1":"a225277e724d8f245533f6770dbb69ee6677174a3d04b84a9be892a3d1b321e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/render/src/comp.rs:7851-7860 | crates/render/src/comp.rs:13667-13676 | crates/render/src/comp.rs:18070-18079 \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":"crates/render/src/comp.rs"},"region":{"startLine":7851}}}],"partialFingerprints":{"codehealthFindingId/v1":"897db02ee564fdfb2c7b5026cd8f5ea015c720367760d51cc0ffcae76e2b5bf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/render/src/comp.rs:7875-7884 | crates/render/src/comp.rs:13691-13700 | crates/render/src/comp.rs:18094-18103 \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":"crates/render/src/comp.rs"},"region":{"startLine":7875}}}],"partialFingerprints":{"codehealthFindingId/v1":"495b98c1364ead081e2454828fec887c8d856797ad6ebec0c97a6121e466b5d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/render/src/comp.rs:7899-7908 | crates/render/src/comp.rs:13715-13724 | crates/render/src/comp.rs:18118-18127 \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":"crates/render/src/comp.rs"},"region":{"startLine":7899}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ee87908ee5c1da69bc3d784fab4fb1275dc155561c0dee64def57c638280faf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/render/src/comp.rs:7920-7929 | crates/render/src/comp.rs:13736-13745 | crates/render/src/comp.rs:18139-18148 \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":"crates/render/src/comp.rs"},"region":{"startLine":7920}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f88008c9fb3c2c00f2f4908cfc41dd8e2fc66afb66057c124c8eea37d3e8f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/render/src/comp.rs:7944-7953 | crates/render/src/comp.rs:13760-13769 | crates/render/src/comp.rs:18163-18172 \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":"crates/render/src/comp.rs"},"region":{"startLine":7944}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fa515ae02ba61e9097adfadc3a7230888b38ec79962040e596f5a2f9e83197"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/render/src/comp.rs:7968-7977 | crates/render/src/comp.rs:13784-13793 | crates/render/src/comp.rs:18187-18196 \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":"crates/render/src/comp.rs"},"region":{"startLine":7968}}}],"partialFingerprints":{"codehealthFindingId/v1":"697ad96a76552899055dbe8d09e4b155462461eac212362ca68cbc3866ee4889"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/render/src/comp.rs:7992-8001 | crates/render/src/comp.rs:13808-13817 | crates/render/src/comp.rs:18211-18220 \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":"crates/render/src/comp.rs"},"region":{"startLine":7992}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a66c0f4b26f14ab0de2cf42d63a6ddcab6f7d587dbff4560e0af857b5a7f2fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/render/src/comp.rs:8013-8022 | crates/render/src/comp.rs:13829-13838 | crates/render/src/comp.rs:18232-18241 \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":"crates/render/src/comp.rs"},"region":{"startLine":8013}}}],"partialFingerprints":{"codehealthFindingId/v1":"92465597a4392a80a101eccd0db08476b075c9c9eb3cd6007006f882b4458189"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/render/src/comp.rs:8034-8043 | crates/render/src/comp.rs:13850-13859 | crates/render/src/comp.rs:18253-18262 \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":"crates/render/src/comp.rs"},"region":{"startLine":8034}}}],"partialFingerprints":{"codehealthFindingId/v1":"d033077dbdeffd4519634e910753e26bec2bdd403595f05129bafb7f977593ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/render/src/comp.rs:8055-8064 | crates/render/src/comp.rs:13871-13880 | crates/render/src/comp.rs:18274-18283 \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":"crates/render/src/comp.rs"},"region":{"startLine":8055}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9034c61682696da4778eed0f435a6db1372451abfb135b99f351829f352ff2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/render/src/comp.rs:8076-8085 | crates/render/src/comp.rs:13892-13901 | crates/render/src/comp.rs:18295-18304 \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":"crates/render/src/comp.rs"},"region":{"startLine":8076}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eee479d4f5708d999c22fc683546bd2821055049284223226b057611bd9e756"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/render/src/comp.rs:8087-8096 | crates/render/src/comp.rs:13903-13912 | crates/render/src/comp.rs:18306-18315 \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":"crates/render/src/comp.rs"},"region":{"startLine":8087}}}],"partialFingerprints":{"codehealthFindingId/v1":"605977283efa313c43dad153dc08aae3996a34cfe1b03a5a86162f23c2ebe35e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/render/src/comp.rs:8108-8117 | crates/render/src/comp.rs:13924-13933 | crates/render/src/comp.rs:18327-18336 \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":"crates/render/src/comp.rs"},"region":{"startLine":8108}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96a02821ae6227827f08a9e86503a080a948c6a5bfceed2a18a1ab3fab10f6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/render/src/comp.rs:8129-8138 | crates/render/src/comp.rs:13945-13954 | crates/render/src/comp.rs:18348-18357 \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":"crates/render/src/comp.rs"},"region":{"startLine":8129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d8988305af4a3fe6447b24a9e1023ff9250f803d142b4a6b2af0169d1e8d1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/render/src/comp.rs:8153-8162 | crates/render/src/comp.rs:13969-13978 | crates/render/src/comp.rs:18372-18381 \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":"crates/render/src/comp.rs"},"region":{"startLine":8153}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c253a2c0f1ba263a42a4c5098dd7b53ef6bf6ae90ab6224b13644fa6114f7fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/render/src/comp.rs:8174-8183 | crates/render/src/comp.rs:13990-13999 | crates/render/src/comp.rs:18393-18402 \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":"crates/render/src/comp.rs"},"region":{"startLine":8174}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c93a64c676e926512d1bf8450d4dd477b63d106c7910f58680c4228b2128891"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/render/src/comp.rs:8195-8204 | crates/render/src/comp.rs:14011-14020 | crates/render/src/comp.rs:18414-18423 \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":"crates/render/src/comp.rs"},"region":{"startLine":8195}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2ccade3cc111dacdac649ce822e85d8e391d5f79e5c6ab84da785d873b1500"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/app/src/app/undo.rs:662-671 | crates/app/src/app/undo.rs:689-698 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/app/src/app/undo.rs:662\u0060 it does not close everything it opens, so those exact 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 offer_undo_delete(\u0026mut\u0060 in one and \u0060super) fn offer_undo_refiled(\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":"crates/app/src/app/undo.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"75782e55759118737fdf79906683214611eba1f8ce2204fae6910fd50362b220"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/app/src/fence_window/hit.rs:610-619 | crates/app/src/fence_window/hit.rs:625-634 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/hit.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafeaa8226ffa621d31eb6068d0f84079e6fd43518d57c1d53d117e818c2ceb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/app/src/fence_window/roll.rs:495-505 | crates/app/src/fence_window/roll.rs:518-528 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app/src/fence_window/roll.rs:518\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 \u0060self\u0060 to \u0060super) fn reset_root(\u0026mut\u0060 in one and \u0060super) fn rest_hidden(\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":"crates/app/src/fence_window/roll.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c2809ffbf16705950a7aa1c5359c16044a2fc63ded18f3dc82b16d343fbe1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/app/src/settings_host.rs:809-820 | crates/app/src/settings_host.rs:826-837 \u2014 both copies are in the same file, so extract the block 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":"crates/app/src/settings_host.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a4671ee4b56b470e15df3cbab09a168af9e2fa1f645b2368918f9fa312e7d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/app/src/state.rs:274-283 | crates/app/src/state.rs:609-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/state.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"880569b786926b61cf4c6a64ad316a2690e7d1bedf208d5bc6cd11817a6b47c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/platform/src/bindings.rs:4752-4761 | crates/platform/src/bindings.rs:10743-10752 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/platform/src/bindings.rs:4752\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":4752}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff2b096c62d59f9cd68efd7944dd2dec0c5a2d3b1519d2ab5e3cdefbf641588"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/render/src/comp.rs:13656-13665 | crates/render/src/comp.rs:18037-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. 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/render/src/comp.rs"},"region":{"startLine":13656}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d31ef3e2ffdb5213b0cd428a3e776c6d8409c3ec04652ee6b83ae76460418ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 63): crates/render/src/comp.rs:111-119 | crates/render/src/comp.rs:347-355 | crates/render/src/comp.rs:510-518 | crates/render/src/comp.rs:673-681 | crates/render/src/comp.rs:1104-1112 | crates/render/src/comp.rs:1649-1657 | crates/render/src/comp.rs:1808-1816 | crates/render/src/comp.rs:1998-2006 | crates/render/src/comp.rs:2180-2188 | crates/render/src/comp.rs:2411-2419 | crates/render/src/comp.rs:2726-2734 | crates/render/src/comp.rs:2909-2917 | crates/render/src/comp.rs:3068-3076 | crates/render/src/comp.rs:3257-3265 | crates/render/src/comp.rs:3650-3658 | crates/render/src/comp.rs:3840-3848 | crates/render/src/comp.rs:4204-4212 | crates/render/src/comp.rs:4420-4428 | crates/render/src/comp.rs:4602-4610 | crates/render/src/comp.rs:4761-4769 | crates/render/src/comp.rs:4925-4933 | crates/render/src/comp.rs:5085-5093 | crates/render/src/comp.rs:5248-5256 | crates/render/src/comp.rs:5402-5410 | crates/render/src/comp.rs:5609-5617 | crates/render/src/comp.rs:6076-6084 | crates/render/src/comp.rs:6296-6304 | crates/render/src/comp.rs:6525-6533 | crates/render/src/comp.rs:6688-6696 | crates/render/src/comp.rs:6847-6855 | crates/render/src/comp.rs:7006-7014 | crates/render/src/comp.rs:7805-7813 | crates/render/src/comp.rs:8442-8450 | crates/render/src/comp.rs:8601-8609 | crates/render/src/comp.rs:8760-8768 | crates/render/src/comp.rs:8923-8931 | crates/render/src/comp.rs:9086-9094 | crates/render/src/comp.rs:9444-9452 | crates/render/src/comp.rs:12377-12385 | crates/render/src/comp.rs:12841-12849 | crates/render/src/comp.rs:13275-13283 | crates/render/src/comp.rs:13620-13628 | crates/render/src/comp.rs:14237-14245 | crates/render/src/comp.rs:14593-14601 | crates/render/src/comp.rs:14752-14760 | crates/render/src/comp.rs:14915-14923 | crates/render/src/comp.rs:15290-15298 | crates/render/src/comp.rs:15848-15856 | crates/render/src/comp.rs:16437-16445 | crates/render/src/comp.rs:16600-16608 | crates/render/src/comp.rs:16759-16767 | crates/render/src/comp.rs:17117-17125 | crates/render/src/comp.rs:17476-17484 | crates/render/src/comp.rs:17835-17843 | crates/render/src/comp.rs:18001-18009 | crates/render/src/comp.rs:18639-18647 | crates/render/src/comp.rs:19109-19117 | crates/render/src/comp.rs:19698-19706 | crates/render/src/comp.rs:20058-20066 | crates/render/src/comp.rs:20647-20655 | crates/render/src/comp.rs:21005-21013 | crates/render/src/comp.rs:21359-21367 | crates/render/src/comp.rs:21932-21940 \u2014 all 63 copies are in the same file, so extract the block into one function there and call it 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":"crates/render/src/comp.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"66266659e49c93e028e1f51f7beeb587f52397df165e8d2b08c1f9ec5bbc33eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 63): crates/render/src/comp.rs:124-132 | crates/render/src/comp.rs:360-368 | crates/render/src/comp.rs:523-531 | crates/render/src/comp.rs:686-694 | crates/render/src/comp.rs:1117-1125 | crates/render/src/comp.rs:1662-1670 | crates/render/src/comp.rs:1821-1829 | crates/render/src/comp.rs:2011-2019 | crates/render/src/comp.rs:2193-2201 | crates/render/src/comp.rs:2424-2432 | crates/render/src/comp.rs:2739-2747 | crates/render/src/comp.rs:2922-2930 | crates/render/src/comp.rs:3081-3089 | crates/render/src/comp.rs:3270-3278 | crates/render/src/comp.rs:3663-3671 | crates/render/src/comp.rs:3853-3861 | crates/render/src/comp.rs:4217-4225 | crates/render/src/comp.rs:4433-4441 | crates/render/src/comp.rs:4615-4623 | crates/render/src/comp.rs:4774-4782 | crates/render/src/comp.rs:4938-4946 | crates/render/src/comp.rs:5098-5106 | crates/render/src/comp.rs:5261-5269 | crates/render/src/comp.rs:5415-5423 | crates/render/src/comp.rs:5622-5630 | crates/render/src/comp.rs:6089-6097 | crates/render/src/comp.rs:6309-6317 | crates/render/src/comp.rs:6538-6546 | crates/render/src/comp.rs:6701-6709 | crates/render/src/comp.rs:6860-6868 | crates/render/src/comp.rs:7019-7027 | crates/render/src/comp.rs:7818-7826 | crates/render/src/comp.rs:8455-8463 | crates/render/src/comp.rs:8614-8622 | crates/render/src/comp.rs:8773-8781 | crates/render/src/comp.rs:8936-8944 | crates/render/src/comp.rs:9099-9107 | crates/render/src/comp.rs:9457-9465 | crates/render/src/comp.rs:12390-12398 | crates/render/src/comp.rs:12854-12862 | crates/render/src/comp.rs:13288-13296 | crates/render/src/comp.rs:13633-13641 | crates/render/src/comp.rs:14250-14258 | crates/render/src/comp.rs:14606-14614 | crates/render/src/comp.rs:14765-14773 | crates/render/src/comp.rs:14928-14936 | crates/render/src/comp.rs:15303-15311 | crates/render/src/comp.rs:15861-15869 | crates/render/src/comp.rs:16450-16458 | crates/render/src/comp.rs:16613-16621 | crates/render/src/comp.rs:16772-16780 | crates/render/src/comp.rs:17130-17138 | crates/render/src/comp.rs:17489-17497 | crates/render/src/comp.rs:17848-17856 | crates/render/src/comp.rs:18014-18022 | crates/render/src/comp.rs:18652-18660 | crates/render/src/comp.rs:19122-19130 | crates/render/src/comp.rs:19711-19719 | crates/render/src/comp.rs:20071-20079 | crates/render/src/comp.rs:20660-20668 | crates/render/src/comp.rs:21018-21026 | crates/render/src/comp.rs:21372-21380 | crates/render/src/comp.rs:21945-21953 \u2014 all 63 copies are in the same file, so extract the block into one function there and call it 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":"crates/render/src/comp.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8b7141221e24c92efe559f1e5e0aa4a22a9c318654c855cd45b3d0c129c0fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 63): crates/render/src/comp.rs:137-145 | crates/render/src/comp.rs:373-381 | crates/render/src/comp.rs:536-544 | crates/render/src/comp.rs:699-707 | crates/render/src/comp.rs:1130-1138 | crates/render/src/comp.rs:1675-1683 | crates/render/src/comp.rs:1834-1842 | crates/render/src/comp.rs:2024-2032 | crates/render/src/comp.rs:2206-2214 | crates/render/src/comp.rs:2437-2445 | crates/render/src/comp.rs:2752-2760 | crates/render/src/comp.rs:2935-2943 | crates/render/src/comp.rs:3094-3102 | crates/render/src/comp.rs:3283-3291 | crates/render/src/comp.rs:3676-3684 | crates/render/src/comp.rs:3866-3874 | crates/render/src/comp.rs:4230-4238 | crates/render/src/comp.rs:4446-4454 | crates/render/src/comp.rs:4628-4636 | crates/render/src/comp.rs:4787-4795 | crates/render/src/comp.rs:4951-4959 | crates/render/src/comp.rs:5111-5119 | crates/render/src/comp.rs:5274-5282 | crates/render/src/comp.rs:5428-5436 | crates/render/src/comp.rs:5635-5643 | crates/render/src/comp.rs:6102-6110 | crates/render/src/comp.rs:6322-6330 | crates/render/src/comp.rs:6551-6559 | crates/render/src/comp.rs:6714-6722 | crates/render/src/comp.rs:6873-6881 | crates/render/src/comp.rs:7032-7040 | crates/render/src/comp.rs:7831-7839 | crates/render/src/comp.rs:8468-8476 | crates/render/src/comp.rs:8627-8635 | crates/render/src/comp.rs:8786-8794 | crates/render/src/comp.rs:8949-8957 | crates/render/src/comp.rs:9112-9120 | crates/render/src/comp.rs:9470-9478 | crates/render/src/comp.rs:12403-12411 | crates/render/src/comp.rs:12867-12875 | crates/render/src/comp.rs:13301-13309 | crates/render/src/comp.rs:13646-13654 | crates/render/src/comp.rs:14263-14271 | crates/render/src/comp.rs:14619-14627 | crates/render/src/comp.rs:14778-14786 | crates/render/src/comp.rs:14941-14949 | crates/render/src/comp.rs:15316-15324 | crates/render/src/comp.rs:15874-15882 | crates/render/src/comp.rs:16463-16471 | crates/render/src/comp.rs:16626-16634 | crates/render/src/comp.rs:16785-16793 | crates/render/src/comp.rs:17143-17151 | crates/render/src/comp.rs:17502-17510 | crates/render/src/comp.rs:17861-17869 | crates/render/src/comp.rs:18027-18035 | crates/render/src/comp.rs:18665-18673 | crates/render/src/comp.rs:19135-19143 | crates/render/src/comp.rs:19724-19732 | crates/render/src/comp.rs:20084-20092 | crates/render/src/comp.rs:20673-20681 | crates/render/src/comp.rs:21031-21039 | crates/render/src/comp.rs:21385-21393 | crates/render/src/comp.rs:21958-21966 \u2014 all 63 copies are in the same file, so extract the block into one function there and call it 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":"crates/render/src/comp.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"39aa7478a6ae468b4d79c6e2d4c2ee2b68ccf13e3ab9fb15b9d051af05b530cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7): crates/platform/src/bindings.rs:4713-4721 | crates/platform/src/bindings.rs:12394-12402 | crates/platform/src/bindings.rs:12990-12998 | crates/platform/src/bindings.rs:16439-16447 | crates/render/src/gpu_bindings.rs:5667-5675 | crates/render/src/gpu_bindings.rs:5746-5754 | crates/render/src/gpu_bindings.rs:6118-6126 \u2014 before extracting anything, compare \u0060crates/platform/src/bindings.rs\u0060 and \u0060crates/render/src/gpu_bindings.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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/platform/src/bindings.rs:4713\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/platform/src/bindings.rs"},"region":{"startLine":4713}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee17422ad2d5d25b1b15d0f8ceaffea46c99f525575a0b6b0511776602205e60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): crates/platform/src/bindings.rs:9707-9715 | crates/platform/src/bindings.rs:9721-9729 | crates/platform/src/bindings.rs:9749-9757 | crates/platform/src/bindings.rs:9766-9774 | crates/platform/src/bindings.rs:9908-9916 \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 \u0060crates/platform/src/bindings.rs:9707\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/platform/src/bindings.rs"},"region":{"startLine":9707}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04a9d83db03c963790914bf20f256cfcb343d3d89843fd0e6e123f739d2b49c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/platform/src/bindings.rs:11919-11927 | crates/platform/src/bindings.rs:17250-17258 | crates/platform/src/bindings.rs:17275-17283 | crates/platform/src/bindings.rs:17691-17699 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/platform/src/bindings.rs:11919\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/platform/src/bindings.rs"},"region":{"startLine":11919}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e0146b01dbfd7e3099dd38de8c48534b49e5c967b93c3578f4a9e98b223f18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/platform/src/bindings.rs:15545-15553 | crates/platform/src/bindings.rs:15578-15586 | crates/platform/src/bindings.rs:15597-15605 | crates/platform/src/bindings.rs:15637-15645 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/platform/src/bindings.rs:15545\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/platform/src/bindings.rs"},"region":{"startLine":15545}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeac5cd88b6af01a0fa4ec69894e3d41148372ee32d77488c0c74d8bfd91a24f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/render/src/comp.rs:8233-8241 | crates/render/src/comp.rs:14049-14057 | crates/render/src/comp.rs:18452-18460 | crates/render/src/comp.rs:21744-21752 \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":"crates/render/src/comp.rs"},"region":{"startLine":8233}}}],"partialFingerprints":{"codehealthFindingId/v1":"c569c3de85b404ecf913fba847a73061393cc77e6f14c359c9f49b585a5415ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): crates/platform/src/bindings.rs:8252-8259 | crates/platform/src/bindings.rs:15618-15626 | crates/platform/src/bindings.rs:15889-15897 \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 \u0060crates/platform/src/bindings.rs:8252\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":8252}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07af78de9fac302126f8f90561d289638cb91ca320f318eaaca8b67235272f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/platform/src/bindings.rs:8909-8917 | crates/platform/src/bindings.rs:8922-8930 | crates/platform/src/bindings.rs:8967-8975 \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 \u0060crates/platform/src/bindings.rs:8909\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/platform/src/bindings.rs"},"region":{"startLine":8909}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c635d34735852d47fb0b344ccd20ccfec7294cd2b88daab42c46a8be94924a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): crates/platform/src/filedialog.rs:73-80 | crates/platform/src/filedialog.rs:99-106 | crates/platform/src/filedialog.rs:116-124 \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 \u0060crates/platform/src/filedialog.rs:73\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/platform/src/filedialog.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b7d8ae1f9cac5667f6bf139a89f11ad39def831ae63c9c2300c3cc99ed59a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/render/src/comp.rs:7958-7966 | crates/render/src/comp.rs:13774-13782 | crates/render/src/comp.rs:18177-18185 \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":"crates/render/src/comp.rs"},"region":{"startLine":7958}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5588e1935d31ff3e3aa6f1b1339ba6306b51408a78f3d105a74b91ede8e7e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/app/src/app/arrange.rs:204-212 | crates/app/src/app/fences.rs:545-553 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060super) fn move_out_of_overlap(\u0026mut\u0060 in one and \u0060super) fn arrange_desktop_fence(\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":"crates/app/src/app/arrange.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c047f6ce4ad529e02a1ea94cc513e6cf94ae5c841fa59f0ba48e4e7e51abd08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/app/src/fence_window/render.rs:2011-2026 | crates/app/src/fence_window/render.rs:2234-2249 \u2014 both copies are in the same file, so extract the block 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 \u0060self\u0060 to \u0060super) fn redraw_content(\u0026mut\u0060 in one and \u0060super) fn redraw_rows(\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 before the matched lines, \u0060crates/app/src/fence_window/render.rs:2229\u0060 calls \u0060columns_at\u0060, \u0060max\u0060 and \u0060crates/app/src/fence_window/render.rs:2008\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/render.rs"},"region":{"startLine":2011}}}],"partialFingerprints":{"codehealthFindingId/v1":"8916e1a13100ab2de12ee89d5a01f03f5b4532aa29c67f452aed84b10a040c53"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/app/src/scripts.rs:176-184 | crates/app/src/scripts.rs:363-371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/scripts.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9744dc1cc2da4b9d27b55baf2e8c47aade78ad62059a6c674e113ca7a278ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/platform/src/bindings.rs:9134-9142 | crates/platform/src/bindings.rs:9153-9161 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/platform/src/bindings.rs:9134\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/platform/src/bindings.rs"},"region":{"startLine":9134}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b44ee03202cffc9c46d3d2970391cba09cd2c61de73f154352114255502c6de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/platform/src/bindings.rs:10166-10174 | crates/platform/src/bindings.rs:10179-10187 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/platform/src/bindings.rs:10166\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/platform/src/bindings.rs"},"region":{"startLine":10166}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d88d832e7358b462bac67a97dba4aeb735f41e70ac6488a6dca9985860ea7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/platform/src/bindings.rs:10614-10622 | crates/platform/src/bindings.rs:10633-10641 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/platform/src/bindings.rs:10614\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/platform/src/bindings.rs"},"region":{"startLine":10614}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b398f8d4f707dee2d487ca3b16a728c6c749bb8904a11663dd83120f524dcfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/platform/src/bindings.rs:12870-12877 | crates/platform/src/bindings.rs:12892-12900 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/platform/src/bindings.rs:12870\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":12870}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fd73018a1d4a7e2be136a80743824b2f41426407ec2ad19b240b4ec7d09a5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/platform/src/bindings.rs:13195-13202 | crates/platform/src/bindings.rs:13486-13494 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/platform/src/bindings.rs:13195\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":13195}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad5959f91e793d5df7d3b8279d398b620786890b5ae847b2d13176f182d154dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/platform/src/bindings.rs:14109-14117 | crates/platform/src/bindings.rs:14141-14149 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/platform/src/bindings.rs:14109\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/platform/src/bindings.rs"},"region":{"startLine":14109}}}],"partialFingerprints":{"codehealthFindingId/v1":"2092107ae02e7117cb76dcc8373433b529bc2abed67451fc7fd473dea5798276"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/platform/src/bindings.rs:14128-14136 | crates/platform/src/bindings.rs:14160-14168 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/platform/src/bindings.rs:14128\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/platform/src/bindings.rs"},"region":{"startLine":14128}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac17468b70a3f75c351a8cfb605390cb57291acc04e2927fb9d66a43f1247a20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/platform/src/bindings.rs:15868-15876 | crates/platform/src/bindings.rs:15908-15916 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/platform/src/bindings.rs:15868\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/platform/src/bindings.rs"},"region":{"startLine":15868}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac863af7e7687f21c764d22e96736dc997c533a0a0e775e2fc679ece473259d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/platform/src/bindings.rs:17644-17652 | crates/platform/src/bindings.rs:17667-17675 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/platform/src/bindings.rs:17644\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/platform/src/bindings.rs"},"region":{"startLine":17644}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f391fb872a154b7d8cd340e05c0833e04c04a026ec0fbc246286c9e8510ffa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 2): crates/render/src/fence_chrome.rs:4390-4395 | crates/render/src/fence_chrome.rs:4540-4548 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/render/src/fence_chrome.rs:4390\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/render/src/fence_chrome.rs"},"region":{"startLine":4390}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d6fe596cccbeed1c5e76182296a6bd26e00c0bf84f21686fbf6bc9f625359c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/render/src/gpu_bindings.rs:2960-2968 | crates/render/src/gpu_bindings.rs:3082-3090 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/render/src/gpu_bindings.rs:2960\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/render/src/gpu_bindings.rs"},"region":{"startLine":2960}}}],"partialFingerprints":{"codehealthFindingId/v1":"175bfaf8ea5de1496682ebab8488aa246bb00a87645806633078f99b9b992824"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 8): crates/platform/src/bindings.rs:17299-17306 | crates/platform/src/bindings.rs:17318-17325 | crates/platform/src/bindings.rs:17337-17344 | crates/platform/src/bindings.rs:17356-17363 | crates/platform/src/bindings.rs:17375-17382 | crates/platform/src/bindings.rs:17394-17401 | crates/platform/src/bindings.rs:17413-17420 | crates/platform/src/bindings.rs:17432-17439 \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 \u0060crates/platform/src/bindings.rs:17299\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/platform/src/bindings.rs"},"region":{"startLine":17299}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c37cf27370b0151c8cf199f9f22d5f5bc40baad70f5e0208019b151cbd52004"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 7): crates/platform/src/bindings.rs:8910-8917 | crates/platform/src/bindings.rs:8923-8930 | crates/platform/src/bindings.rs:8968-8975 | crates/platform/src/bindings.rs:9694-9701 | crates/platform/src/bindings.rs:12271-12278 | crates/platform/src/bindings.rs:14129-14136 | crates/platform/src/bindings.rs:14161-14168 \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 \u0060crates/platform/src/bindings.rs:8910\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/platform/src/bindings.rs"},"region":{"startLine":8910}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fd11d346ff5d579e3233555dd2f003368fa2cb7c479e5968466049b989e949"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 6): crates/platform/src/bindings.rs:6716-6722 | crates/platform/src/bindings.rs:12338-12345 | crates/platform/src/bindings.rs:13590-13596 | crates/platform/src/bindings.rs:15677-15684 | crates/render/src/gpu_bindings.rs:3097-3104 | crates/render/src/gpu_bindings.rs:5999-6006 \u2014 before extracting anything, compare \u0060crates/platform/src/bindings.rs\u0060 and \u0060crates/render/src/gpu_bindings.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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/platform/src/bindings.rs:6716\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":6716}}}],"partialFingerprints":{"codehealthFindingId/v1":"688461182a2f17834607cf378d5e6636b12edd6ebadc301587026792d64f54b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): crates/platform/src/bindings.rs:11921-11928 | crates/platform/src/bindings.rs:13196-13203 | crates/platform/src/bindings.rs:13488-13495 | crates/platform/src/bindings.rs:17252-17259 | crates/platform/src/bindings.rs:17277-17284 | crates/platform/src/bindings.rs:17693-17700 \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 \u0060crates/platform/src/bindings.rs:11921\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":11921}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6133ed55ff77e05c692a7d04d168aa5f3ca01bfa99a4f7f92654f9dcccea24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): crates/platform/src/bindings.rs:7176-7183 | crates/platform/src/bindings.rs:8744-8751 | crates/platform/src/bindings.rs:10514-10521 | crates/platform/src/bindings.rs:15657-15664 | crates/render/src/comp.rs:11573-11580 \u2014 before extracting anything, compare \u0060crates/platform/src/bindings.rs\u0060 and \u0060crates/render/src/comp.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 \u0060crates/platform/src/bindings.rs:7176\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/platform/src/bindings.rs"},"region":{"startLine":7176}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c711137bdadb414387f4e6917650a7d3e93367b6404a5db41032efb90d59d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/platform/src/bindings.rs:8730-8737 | crates/platform/src/bindings.rs:9677-9684 | crates/platform/src/bindings.rs:10533-10540 | crates/render/src/gpu_bindings.rs:6263-6270 \u2014 before extracting anything, compare \u0060crates/platform/src/bindings.rs\u0060 and \u0060crates/render/src/gpu_bindings.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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/platform/src/bindings.rs:8730\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/platform/src/bindings.rs"},"region":{"startLine":8730}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e73e7bf337d9d0440eabb9cfba210bbd66e609d919c6e38cca307f07c90a721"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/platform/src/bindings.rs:7586-7593 | crates/platform/src/bindings.rs:7605-7612 | crates/platform/src/bindings.rs:7633-7640 \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 \u0060crates/platform/src/bindings.rs:7586\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":7586}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d36483be8a8f0cb59926be988f7fc23a26d2c7bcdc5986d856a2d61945c4b6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 3): crates/platform/src/bindings.rs:8762-8768 | crates/platform/src/bindings.rs:9649-9655 | crates/platform/src/bindings.rs:15486-15493 \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 \u0060crates/platform/src/bindings.rs:8762\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":8762}}}],"partialFingerprints":{"codehealthFindingId/v1":"3841bd0d5be5cfaa2a71ad47a76b46f58f6f97d953f3f85221a53c9cb24f53ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/platform/src/bindings.rs:9783-9790 | crates/platform/src/bindings.rs:9821-9828 | crates/platform/src/bindings.rs:9857-9864 \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 \u0060crates/platform/src/bindings.rs:9783\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":9783}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f7461f782e37c85a07b9396a9950e738a0c4b86bb93773a6e40ce9aec8e6f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/app/src/note_edit.rs:148-155 | crates/app/src/rename.rs:513-519 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app/src/note_edit.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":"crates/app/src/note_edit.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"595521ca3f546572fecad4bb9c009d3ceedf770a3c0908adec4e83594e735476"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/platform/src/bindings.rs:9736-9743 | crates/platform/src/store_bindings.rs: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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/platform/src/bindings.rs:9736\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/platform/src/bindings.rs"},"region":{"startLine":9736}}}],"partialFingerprints":{"codehealthFindingId/v1":"530108251f6b9b819c1db180445eb69ca650934e2d55e9b40b84be3e9ea92c75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/platform/src/bindings.rs:10596-10603 | crates/platform/src/bindings.rs:14717-14724 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/platform/src/bindings.rs:10596\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":10596}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ae72d464572d9e16bec1dcec304aa87b8bf6524fa052a9b57b517c4bd4d7a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/platform/src/bindings.rs:10936-10943 | crates/platform/src/bindings.rs:12285-12292 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/platform/src/bindings.rs:10936\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/platform/src/bindings.rs"},"region":{"startLine":10936}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b2be70aeaf4ce2e563a5ce4373e05c659984eb3ff945952d45ae0ce25159f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/render/src/fence_chrome.rs:2096-2104 | crates/render/src/fence_chrome.rs:2118-2126 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/render/src/fence_chrome.rs:2096\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/render/src/fence_chrome.rs"},"region":{"startLine":2096}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9a89414a046b6a484c6d4cdaebd7d2b646d6f92c3600ca02481b1d4b817536"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/render/src/gpu_bindings.rs:5943-5949 | crates/render/src/gpu_bindings.rs:5961-5968 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/render/src/gpu_bindings.rs:5943\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/gpu_bindings.rs"},"region":{"startLine":5943}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f99ecdc9f65f5e3c2805a19f35d6fe70aa3c5fb40234471d8a01327b5f7435"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/render/src/gpu_bindings.rs:6222-6229 | crates/render/src/gpu_bindings.rs:6276-6283 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/render/src/gpu_bindings.rs:6222\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/render/src/gpu_bindings.rs"},"region":{"startLine":6222}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71c8cd5a28a618803a19c62ecb7e93dc644e6d1c29ef25d4a6a95fba71d8c28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 23): crates/platform/src/bindings.rs:7295-7301 | crates/platform/src/bindings.rs:8855-8861 | crates/platform/src/bindings.rs:9135-9141 | crates/platform/src/bindings.rs:9154-9160 | crates/platform/src/bindings.rs:10212-10218 | crates/platform/src/bindings.rs:12405-12411 | crates/platform/src/bindings.rs:15546-15552 | crates/platform/src/bindings.rs:15579-15585 | crates/platform/src/bindings.rs:15598-15604 | crates/platform/src/bindings.rs:15638-15644 | crates/platform/src/bindings.rs:15869-15875 | crates/platform/src/bindings.rs:15909-15915 | crates/platform/src/bindings.rs:17300-17306 | crates/platform/src/bindings.rs:17319-17325 | crates/platform/src/bindings.rs:17338-17344 | crates/platform/src/bindings.rs:17357-17363 | crates/platform/src/bindings.rs:17376-17382 | crates/platform/src/bindings.rs:17395-17401 | crates/platform/src/bindings.rs:17414-17420 | crates/platform/src/bindings.rs:17433-17439 | crates/render/src/comp.rs:11157-11163 | crates/render/src/comp.rs:11616-11622 | crates/render/src/gpu_bindings.rs:5849-5855 \u2014 before extracting anything, compare \u0060crates/platform/src/bindings.rs\u0060 and \u0060crates/render/src/comp.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 \u0060crates/platform/src/bindings.rs:7295\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/platform/src/bindings.rs"},"region":{"startLine":7295}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a31697f431356c2364fe0f963cc8dab67f041b5e90716a9331cb6e7715e1e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 12): crates/platform/src/bindings.rs:7282-7288 | crates/platform/src/bindings.rs:8816-8822 | crates/platform/src/bindings.rs:9708-9714 | crates/platform/src/bindings.rs:9722-9728 | crates/platform/src/bindings.rs:9750-9756 | crates/platform/src/bindings.rs:9767-9773 | crates/platform/src/bindings.rs:9909-9915 | crates/platform/src/bindings.rs:10167-10173 | crates/platform/src/bindings.rs:10180-10186 | crates/platform/src/bindings.rs:12424-12430 | crates/platform/src/bindings.rs:15565-15571 | crates/platform/src/bindings.rs:16201-16207 \u2014 all 12 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/platform/src/bindings.rs:7282\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/platform/src/bindings.rs"},"region":{"startLine":7282}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3a86aab2181d31c8034a519d878f3f82c0af9908bfc30399f4090c5bb4e6c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): crates/platform/src/bindings.rs:10546-10552 | crates/platform/src/bindings.rs:12872-12878 | crates/platform/src/bindings.rs:12895-12901 | crates/platform/src/bindings.rs:17229-17235 | crates/platform/src/bindings.rs:17719-17725 \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 \u0060crates/platform/src/bindings.rs:10546\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":10546}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0facffd81c63560519b9c24d72389bba52ea860d80bb6821d84f4d2d0998a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/platform/src/bindings.rs:7789-7795 | crates/platform/src/bindings.rs:7822-7828 | crates/platform/src/bindings.rs:7839-7845 \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 \u0060crates/platform/src/bindings.rs:7789\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":7789}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c43457c38781072d24bcf9805da830321685ffe53159683d565efa2c0752017"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/platform/src/bindings.rs:9840-9846 | crates/platform/src/bindings.rs:9876-9882 | crates/platform/src/bindings.rs:9892-9898 \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 \u0060crates/platform/src/bindings.rs:9840\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":9840}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14d943e5b6c207887652584351b264c60dd5e21d80623012d8d15e153667bd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/platform/src/bindings.rs:14111-14118 | crates/platform/src/bindings.rs:14143-14150 | crates/platform/src/bindings.rs:14173-14179 \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 \u0060crates/platform/src/bindings.rs:14111\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/platform/src/bindings.rs"},"region":{"startLine":14111}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3d622fb3d0355e789f7e09c3790d13ee75783197426632df2a58050186c595"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/app/src/app/fences.rs:1029-1035 | crates/app/src/app/ipc.rs:2575-2581 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app/src/app/fences.rs:1029\u0060 it begins part-way through the construct above it, so those exact 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 add_template(\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":"crates/app/src/app/fences.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ddcc3a1ce56f14f7a936efc0b3f1ac30f2e70f8257a9464ccbf52b9b1c42a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/app/src/fence_window/render.rs:2078-2084 | crates/app/src/fence_window/render.rs:2307-2313 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/render.rs"},"region":{"startLine":2078}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc608276cfc68459b0eb8f82e635549de20c6d7e9573b8e1829613f398efc9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/app/src/fence_window/roll.rs:410-416 | crates/app/src/fence_window/roll.rs:464-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app/src/fence_window/roll.rs:410\u0060 it does not close everything it opens, so those exact 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 start_fade_in(\u0026mut\u0060 in one and \u0060super) fn begin_fade_out(\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":"crates/app/src/fence_window/roll.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"392a0748bb82b82a8d5e37b4e3dd77e2d9c1c62b3d577cb35b6117dba2bd30b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/platform/src/bindings.rs:6636-6642 | crates/platform/src/bindings.rs:6653-6659 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/platform/src/bindings.rs:6636\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":6636}}}],"partialFingerprints":{"codehealthFindingId/v1":"4623601143bd250011120b66cf0102dbd16ba3e6238586698fd770e969bd29fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/platform/src/bindings.rs:17177-17183 | crates/platform/src/bindings.rs:17204-17210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/platform/src/bindings.rs:17177\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":17177}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d8fa4bb2e3ced90c0ca154db85c61cf791c44020efb750655bdd89b3553e33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/platform/src/bindings.rs:17512-17518 | crates/platform/src/bindings.rs:17623-17629 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/platform/src/bindings.rs:17512\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":17512}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8c564982d3466d677bbb3c36208448e58870ef3f024d187f00149c0980716d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/render/src/comp.rs:11547-11553 | crates/render/src/comp.rs:11591-11597 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/render/src/comp.rs:11547\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/render/src/comp.rs"},"region":{"startLine":11547}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ee6c1b06629b926615e77a9678160b302db70640141fbeecfc04104ecad2c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/render/src/fence_chrome.rs:4907-4913 | crates/render/src/fence_chrome.rs:5339-5345 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/fence_chrome.rs"},"region":{"startLine":4907}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c511bb4a7db7e350fdad13f26ea7a7319d44bb196f6aedcf8d9b3ccd7f428f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 40): crates/platform/src/bindings.rs:6768-6773 | crates/platform/src/bindings.rs:7297-7302 | crates/platform/src/bindings.rs:7992-7997 | crates/platform/src/bindings.rs:8133-8138 | crates/platform/src/bindings.rs:8289-8294 | crates/platform/src/bindings.rs:8838-8843 | crates/platform/src/bindings.rs:8857-8862 | crates/platform/src/bindings.rs:8935-8940 | crates/platform/src/bindings.rs:9137-9142 | crates/platform/src/bindings.rs:9156-9161 | crates/platform/src/bindings.rs:10214-10219 | crates/platform/src/bindings.rs:12407-12412 | crates/platform/src/bindings.rs:13215-13220 | crates/platform/src/bindings.rs:13607-13612 | crates/platform/src/bindings.rs:15548-15553 | crates/platform/src/bindings.rs:15581-15586 | crates/platform/src/bindings.rs:15600-15605 | crates/platform/src/bindings.rs:15640-15645 | crates/platform/src/bindings.rs:15871-15876 | crates/platform/src/bindings.rs:15911-15916 | crates/platform/src/bindings.rs:17302-17307 | crates/platform/src/bindings.rs:17321-17326 | crates/platform/src/bindings.rs:17340-17345 | crates/platform/src/bindings.rs:17359-17364 | crates/platform/src/bindings.rs:17378-17383 | crates/platform/src/bindings.rs:17397-17402 | crates/platform/src/bindings.rs:17416-17421 | crates/platform/src/bindings.rs:17435-17440 | crates/platform/src/bindings.rs:17648-17653 | crates/platform/src/bindings.rs:17671-17676 | crates/render/src/comp.rs:11159-11164 | crates/render/src/comp.rs:11618-11623 | crates/render/src/gpu_bindings.rs:5683-5688 | crates/render/src/gpu_bindings.rs:5706-5711 | crates/render/src/gpu_bindings.rs:5734-5739 | crates/render/src/gpu_bindings.rs:5762-5767 | crates/render/src/gpu_bindings.rs:5785-5790 | crates/render/src/gpu_bindings.rs:5808-5813 | crates/render/src/gpu_bindings.rs:5831-5836 | crates/render/src/gpu_bindings.rs:5851-5856 \u2014 before extracting anything, compare \u0060crates/platform/src/bindings.rs\u0060 and \u0060crates/render/src/comp.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 \u0060crates/platform/src/bindings.rs:6768\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":6768}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e10c3f73a60669e26d2442414ea05d193d073684b8fd1efd3642f349ad872d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 14): crates/platform/src/bindings.rs:7283-7289 | crates/platform/src/bindings.rs:8817-8823 | crates/platform/src/bindings.rs:8828-8833 | crates/platform/src/bindings.rs:9016-9021 | crates/platform/src/bindings.rs:9709-9715 | crates/platform/src/bindings.rs:9723-9729 | crates/platform/src/bindings.rs:9751-9757 | crates/platform/src/bindings.rs:9768-9774 | crates/platform/src/bindings.rs:9910-9916 | crates/platform/src/bindings.rs:10168-10174 | crates/platform/src/bindings.rs:10181-10187 | crates/platform/src/bindings.rs:12425-12431 | crates/platform/src/bindings.rs:15566-15572 | crates/platform/src/bindings.rs:16202-16208 \u2014 all 14 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/platform/src/bindings.rs:7283\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/platform/src/bindings.rs"},"region":{"startLine":7283}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e98ed11a1d169d9edb28d145a8668fa3305b762b009ea073d8db0a0b86525e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8): crates/platform/src/bindings.rs:9710-9715 | crates/platform/src/bindings.rs:9724-9729 | crates/platform/src/bindings.rs:9752-9757 | crates/platform/src/bindings.rs:9769-9774 | crates/platform/src/bindings.rs:9841-9846 | crates/platform/src/bindings.rs:9877-9882 | crates/platform/src/bindings.rs:9893-9898 | crates/platform/src/bindings.rs:9911-9916 \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 \u0060crates/platform/src/bindings.rs:9710\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":9710}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa4ceccd7fd936b74b7cf570272753305e0b2547af750818d92a2f193161cf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): crates/platform/src/bindings.rs:17230-17235 | crates/platform/src/bindings.rs:17254-17259 | crates/platform/src/bindings.rs:17279-17284 | crates/platform/src/bindings.rs:17695-17700 | crates/platform/src/bindings.rs:17720-17725 \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 \u0060crates/platform/src/bindings.rs:17230\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":17230}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b73655aba0d45fcc50c91791441b82a0e12fee417b07910bb47c363635fb5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): crates/platform/src/bindings.rs:8873-8878 | crates/platform/src/bindings.rs:8899-8904 | crates/platform/src/bindings.rs:14189-14194 | crates/platform/src/bindings.rs:14326-14331 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/platform/src/bindings.rs:8873\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":8873}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee7af3c7c1bce51f9db5d02f52ae0f45d02d125a75b1a7b807f42a71e0b386d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/platform/src/bindings.rs:7389-7394 | crates/platform/src/bindings.rs:7856-7861 | crates/platform/src/bindings.rs:14585-14590 \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 \u0060crates/platform/src/bindings.rs:7389\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":7389}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ec87c71e3b7b809be04811e4cde5a5bc3153ffd3b8a62e3deeb69ed88602f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/platform/src/bindings.rs:12873-12878 | crates/platform/src/bindings.rs:12896-12901 | crates/platform/src/bindings.rs:12936-12941 \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 \u0060crates/platform/src/bindings.rs:12873\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":12873}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6a2e1955d41b0d3a2fd23cbb7c51ccfcfc9b29acd9c37a681c6b136ddbad882"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/platform/src/bindings.rs:13490-13495 | crates/platform/src/bindings.rs:13512-13517 | crates/platform/src/bindings.rs:13533-13538 \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 \u0060crates/platform/src/bindings.rs:13490\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":13490}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4cdf56810e05d18c74dc3db548454503fb232e61f04498813bb7bc92f916d2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/app/src/app/testscript.rs:166-171 | crates/app/src/app/testscript.rs:196-201 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app/src/app/testscript.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/app/src/app/testscript.rs:173\u0060 calls \u0060display\u0060 and \u0060crates/app/src/app/testscript.rs:203\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":"crates/app/src/app/testscript.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"145772034230a8b802d0deaeaab7fe155c5fb268fb3124236f0776381554ed30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/app/src/fence_window/dnd.rs:1232-1238 | crates/app/src/fence_window/dnd.rs:1272-1278 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/app/src/fence_window/dnd.rs:1232\u0060 it begins part-way through the construct above it, so those exact 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 note_drop_landing(\u0026mut\u0060 in one and \u0060super) fn note_landing_at(\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":"crates/app/src/fence_window/dnd.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a5a43bbbdd3d7851759fbc3fda77fe6ac8dec4ad8f2a08ae2d3011f81a7d07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/app/src/fence_window/render.rs:2040-2052 | crates/app/src/fence_window/render.rs:2264-2276 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/app/src/fence_window/render.rs:2040\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/app/src/fence_window/render.rs"},"region":{"startLine":2040}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35c84b6beb3e0d557e1bb163340de97a7513eb094bf422d8466ba5d7eefe72d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/app/src/fence_window/render.rs:2130-2135 | crates/app/src/fence_window/render.rs:2354-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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/app/src/fence_window/render.rs:2136\u0060 calls \u0060Some\u0060, \u0060label_inset\u0060 and \u0060crates/app/src/fence_window/render.rs:2360\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/render.rs"},"region":{"startLine":2130}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49d3eab76efc3ef03e62c5492bec1992740fa71d52ba390db86a119b599347f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/app/src/marquee_offer.rs:154-159 | crates/app/src/notice.rs:296-301 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/marquee_offer.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"29730f46d4ce2e56f82043cb8d68c8b3e88a2f9eaa2a62949d1a3fd6ec7e5075"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20136 lines \u00D7 2): crates/app/src/state.rs:943-947 | crates/app/src/state.rs:959-964 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/app/src/state.rs:943\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/state.rs"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ad280a5e33d9391cf20cc8aa727edea4c3a2a8ba6fae47f6204476ed458a67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/platform/src/bindings.rs:10547-10552 | crates/platform/src/bindings.rs:10598-10603 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/platform/src/bindings.rs:10547\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":10547}}}],"partialFingerprints":{"codehealthFindingId/v1":"882ec3ec98ebf0f88a35b3eb6ee2c442236686e8e6983d6055c5f635e3c0f366"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/render/src/fence_chrome.rs:1693-1698 | crates/render/src/fence_chrome.rs:1700-1705 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/fence_chrome.rs"},"region":{"startLine":1693}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9f646dc7b079d6e4e9d1976b66db8751f4ab788eae983b10cccf0fd696629b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/render/src/theme.rs:358-384 | crates/render/src/theme.rs:400-426 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/theme.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"78b3091be3b7d2a22288a823fe197eeac67e31bfaa6d9fa21b24067dd5bc589d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/app/src/app/ipc.rs:2429-2434 | crates/app/src/app/undo.rs:605-609 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060super) fn put_fence_at(\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":"crates/app/src/app/ipc.rs"},"region":{"startLine":2429}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d962ee203805436180248a628c3949db0c5b8d18bb86c8f89ee345473903d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/app/src/fence_window/state.rs:903-907 | crates/app/src/fence_window/state.rs:961-965 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/app/src/fence_window/state.rs:903\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/app/src/fence_window/state.rs"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"667e476a4cd11b0f3209f80297e0a00db0e8a704347f20e459a800f7c65a4529"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/app/src/filter_box.rs:282-287 | crates/app/src/rename.rs:466-471 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app/src/filter_box.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":"crates/app/src/filter_box.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"75468e1dbf6a50d9d5e5e5e6b86e18d541ed38216d720bc3b2106ab276dfac2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/app/src/note_edit.rs:490-496 | crates/app/src/note_edit.rs:526-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":"crates/app/src/note_edit.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"1690c6467cd8cd58443d9451219f3da467a315e14797e1720333603bc2886c84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/platform/src/bindings.rs:14605-14609 | crates/platform/src/bindings.rs:14692-14696 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/platform/src/bindings.rs:14605\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/bindings.rs"},"region":{"startLine":14605}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf60aa154c98ccddfd29a25b1f1f60a398c99cce81a28272369551769adaebf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/render/src/fence_chrome.rs:3359-3365 | crates/render/src/fence_chrome.rs:3910-3916 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/render/src/fence_chrome.rs:3359\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/render/src/fence_chrome.rs"},"region":{"startLine":3359}}}],"partialFingerprints":{"codehealthFindingId/v1":"39cd9ad6e12535b370a22deeef61fa407f6bd97fb7efb310ab24ffbf00f4006f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/app/src/app/items.rs:1398-1402 | crates/app/src/fence_window/dnd.rs:122-126 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/items.rs"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a6e803f43c102f0e9c3c52823902b9c505c3696675ae05738a387fae98d6ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/app/src/app/rating.rs:46-50 | crates/watchdog/src/main.rs:54-58 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/rating.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9903b2e983852ff6d8351c9cfca090eb95e7fe9d6231ea6205ab22e2a34118e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/app/src/marquee_offer.rs:79-84 | crates/app/src/notice.rs:150-155 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/marquee_offer.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0515c2c301a4bd47ff9f4c493f7b96ca984bfaf322bfad2476f1187f801f4c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/platform/src/bindings.rs:2402-2408 | crates/platform/src/store_bindings.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":"crates/platform/src/bindings.rs"},"region":{"startLine":2402}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26e386239a96ad6cbc003a3d207b4f0bd9ffbb3ef09db68262f9346a8405277"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/platform/src/dragdrop.rs:1477-1482 | crates/platform/src/tray.rs:323-328 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/dragdrop.rs"},"region":{"startLine":1477}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df8547f7be559959f31e97f83edd2d76d8029a0915cc79f62f4ef29e1ca75b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/app/src/filter_box.rs:201-212 | crates/app/src/note_edit.rs:167-179 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app/src/filter_box.rs:201\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/filter_box.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf8614f44dc66f68401e4ea894e8975f3e2cf9d1f36c1ff05a57658f3a4cb06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/app/src/filter_box.rs:204-213 | crates/app/src/rename.rs:551-561 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app/src/filter_box.rs:204\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/filter_box.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb650b16fe6d698536f5520c22fed289e711a2dedd76aff5b842d6d29011c1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/app/src/filter_box.rs:206-213 | crates/app/src/peek_search.rs:1073-1078 | crates/app/src/rename.rs:553-561 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060crates/app/src/filter_box.rs:206\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/app/src/filter_box.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c98d1cd979e31c907276af44ac1c7629bc53127f490b3f215bcec2011ed771b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/app/src/app/ipc.rs:1417-1423 | crates/app/src/app/ipc.rs:1550-1556 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/app/src/app/ipc.rs:1417\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/app/src/app/ipc.rs"},"region":{"startLine":1417}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a26327844841f6575ff16729e4f5319eb0db3262289098327abbec216795eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/app/src/app/tools.rs:1189-1195 | crates/app/src/app/tools.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 \u0060crates/app/src/app/tools.rs:1189\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 \u0060self\u0060 to \u0060super) fn toggle_note_line(\u0026mut\u0060 in one and \u0060super) fn move_note_line(\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":"crates/app/src/app/tools.rs"},"region":{"startLine":1189}}}],"partialFingerprints":{"codehealthFindingId/v1":"f508df122c01c11a4a736f0ebfe234e52f5d78f0f89aa9f1b10f8fe6433b6402"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/app/src/app/menus.rs:466-471 | crates/app/src/app/menus.rs:1655-1661 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/app/src/app/menus.rs:1655\u0060 it begins part-way through the construct above it, so those exact 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 show_item_menu(\u0026mut\u0060 in one and \u0060super) fn show_header_menu(\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":"crates/app/src/app/menus.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b803f84c4ee2af6447862ae75fb6d6c0aef0b0ea156137a4ddd439f743d714"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/app/src/app/menus.rs:472-476 | crates/app/src/app/search.rs:881-886 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app/src/app/menus.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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn show_item_menu(\u0026mut\u0060 in one and \u0060super) fn show_search_actions(\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":"crates/app/src/app/menus.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"209423f678899c47f2dfb3caabed1a93a45016da583b7af5ae9ec9bbcdbb25b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/app/src/app/live_wallpaper.rs:578-582 | crates/app/src/app/visuals.rs:1091-1095 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/app/src/app/live_wallpaper.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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060self\u0060 to \u0060super) fn capture_live_wallpapers(\u0026mut\u0060 in one and \u0060super) fn prewarm_wallpapers(\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 before the matched lines, \u0060crates/app/src/app/visuals.rs:1089\u0060 calls \u0060clone\u0060 and \u0060crates/app/src/app/live_wallpaper.rs:576\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/live_wallpaper.rs"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00a9c846504df3d4abbcf9c3faf996429300c9d596e7a77feeeaf6b2f52e383"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/app/src/app/testscript.rs:158-162 | crates/app/src/app/testscript.rs:185-189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift 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/app/src/app/testscript.rs:158\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/app/src/app/testscript.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc51bde8331d58dde03d3aaf02817ee420190f94e0e196f16212cebd53233433"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/app/src/fence_window/dnd.rs:1764-1769 | crates/app/src/fence_window/render.rs:2345-2350 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/dnd.rs"},"region":{"startLine":1764}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae8fee5f4a6870f68b6bcdf6fc899ff127d78eac7d99beaa6ca0acc9fd269c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/app/src/note_edit.rs:255-259 | crates/app/src/note_edit.rs:657-661 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/note_edit.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"149e598ba7860d7510753991509c1fb5f4ad8723eb4302fd7f830c55296e1cbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/app/src/rename.rs:106-110 | crates/app/src/rename.rs:365-369 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/rename.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"6327399abfa8d264b71211f546fb937f8b88aff50996edcfd3fc5a482c55c5c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/app/src/state.rs:3544-3548 | crates/app/src/state.rs:3549-3553 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/state.rs"},"region":{"startLine":3544}}}],"partialFingerprints":{"codehealthFindingId/v1":"925ad46d213de9e16e918739482e8dd590c768a4b132ca49273c3b475e2f952c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/cli/src/client.rs:53-58 | crates/cli/src/client.rs:90-95 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/client.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c291629f53cfe6a6408de94af8a10b75c5bf40708efd7af85becdc60e423eaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/render/src/backdrop.rs:61-66 | crates/render/src/backdrop.rs:85-90 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/backdrop.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae239d23707493b51e635ebfc9c647479e9958ae66fb3d25ea11115b7070b37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/render/src/fence_chrome.rs:3317-3321 | crates/render/src/fence_chrome.rs:3869-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 \u0060crates/render/src/fence_chrome.rs:3317\u0060 it does not close everything it opens, so those exact lines cannot be lifted 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/render/src/fence_chrome.rs"},"region":{"startLine":3317}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca56b06333b4b953827100a5e6920ab889180edf38149f78de383605690c7c32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): scripts/wintest/assets/foreground-steal.cs:25-25 | scripts/wintest/assets/live-wallpaper-standin.cs:74-74 \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":"scripts/wintest/assets/foreground-steal.cs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b67ad8828f01db6a1e8875bf4737ee4c59fb81f1e764fca0681848647905da7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): extras/pecofence-promo/scripts/prepare-trailer-fixtures.py:74-79 | scripts/prepare-store-v2.py:154-159 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extras/pecofence-promo/scripts/prepare-trailer-fixtures.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b23ad95e6b8859ca895a1917eb7f28a8689e8631ee5113a3f717c004384f739"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: pecofence-core: pecofence-core: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 6 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"08a3c1694ef85e452176a11898a4ff99c930ff7943ef4a40afa64466dc787f7f"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: pecofence-platform: pecofence-platform: abstractness 0.07, instability 0.20, distance 0.73 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ed63d7f341e59c1bdfe33cce1c1a264d4e023f42b2ad1930d0e77eaf6b8d442d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SpriteVisual (LCOM4 53): SpriteVisual\u0027s methods fall into 53 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 53 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":17887}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea5b5c7d5a87d3a8d687a9151b893f4a1066882fe8e8eee763b6ad68fadac5c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ContainerVisual (LCOM4 51): ContainerVisual\u0027s methods fall into 51 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 51 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":7692}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe1aac61a21eb67e612cf8f023758548afbc42c424ee5f71965c4ee40c5dbef"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LayerVisual (LCOM4 51): LayerVisual\u0027s methods fall into 51 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 51 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":13512}}}],"partialFingerprints":{"codehealthFindingId/v1":"73064046c7a26b9e41c6df29e37709793f59a18830fcfb2f55953d99601339dd"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Visual (LCOM4 50): Visual\u0027s methods fall into 50 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 50 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":21255}}}],"partialFingerprints":{"codehealthFindingId/v1":"575aa180b4c771ec484d28e30c589195ac4892286f781688a05eb093f50119a4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ColorKeyFrameAnimation (LCOM4 46): ColorKeyFrameAnimation\u0027s methods fall into 46 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 46 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccce4e4dc0df9b6f46b91871cf23526cc0f10bd6d2a9134517a1fda6cb45e013"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Compositor (LCOM4 45): Compositor\u0027s methods fall into 45 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 45 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":7057}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba5dd4570e8f9f969c88c8cf97b689ca7d396f72b152567c43328298a5704d3f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ScalarKeyFrameAnimation (LCOM4 44): ScalarKeyFrameAnimation\u0027s methods fall into 44 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 44 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":15540}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec58688db93f498e81c4e1d0b51ac6e834dc0bbc81d339fcd844cdba71e81c28"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Vector2KeyFrameAnimation (LCOM4 44): Vector2KeyFrameAnimation\u0027s methods fall into 44 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 44 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":18801}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2f0aab457f1237bc0fc55640937a7bb0da086fb56c49a3d688194681908c9f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Vector3KeyFrameAnimation (LCOM4 44): Vector3KeyFrameAnimation\u0027s methods fall into 44 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 44 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":19750}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19b6ee14d9034f50a04f99a5e2310508ad40407ffd3e8abc89650515d554cb7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: KeyFrameAnimation (LCOM4 42): KeyFrameAnimation\u0027s methods fall into 42 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 42 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":12968}}}],"partialFingerprints":{"codehealthFindingId/v1":"48cd3ea6cff4048cb377748d929c0805960567973e60baac695cd1e001fb92fb"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: QuaternionKeyFrameAnimation (LCOM4 42): QuaternionKeyFrameAnimation\u0027s methods fall into 42 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 42 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":14984}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dcc726f1456f58971dfdc5ca47e7781d91e300d378db881846fd3477544cc75"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Vector4KeyFrameAnimation (LCOM4 42): Vector4KeyFrameAnimation\u0027s methods fall into 42 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 42 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":20699}}}],"partialFingerprints":{"codehealthFindingId/v1":"b96a8ce7e6977936ee3724424b65ad125593657838745ce448a1dc0d01605332"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: InsetClip (LCOM4 33): InsetClip\u0027s methods fall into 33 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 33 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":12572}}}],"partialFingerprints":{"codehealthFindingId/v1":"a96ebea3a916e6154d90e7b8bc006f9c9ec67e4ef3c8c618c0e950bd4847e674"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompositionGeometricClip (LCOM4 29): CompositionGeometricClip\u0027s methods fall into 29 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 29 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":3891}}}],"partialFingerprints":{"codehealthFindingId/v1":"86686e398f21db469274a94a980d0bb8551baea964f37e5d10060187d8047ae4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompositionPropertySet (LCOM4 27): CompositionPropertySet\u0027s methods fall into 27 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 27 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":5501}}}],"partialFingerprints":{"codehealthFindingId/v1":"49eca0af66f6debf6441bf460c5bd12308da62766be2bb172cbd89fbe5fbee64"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ExpressionAnimation (LCOM4 27): ExpressionAnimation\u0027s methods fall into 27 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 27 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":9137}}}],"partialFingerprints":{"codehealthFindingId/v1":"00946f785a7c729afb3f67fb67af4ea7f4ad3d165d783e6ee4594518c6bea71c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompositionAnimation (LCOM4 25): CompositionAnimation\u0027s methods fall into 25 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 25 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f3db527b3bb1b84e343b9f84a2db8fdf969106e999bcfb18a1185dc72d74eb"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompositionClip (LCOM4 25): CompositionClip\u0027s methods fall into 25 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 25 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":2462}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e47d4b84ac9432e6030ce92ef5dd6bad5dec62a2f6b97095aa839698c125960"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: NaturalMotionAnimation (LCOM4 25): NaturalMotionAnimation\u0027s methods fall into 25 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 25 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":14288}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ab74257fefae343bf689168ff41d2d49217a21f8ee3688403f13f13eb1d9d8f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ScalarNaturalMotionAnimation (LCOM4 25): ScalarNaturalMotionAnimation\u0027s methods fall into 25 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 25 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":16131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d4c44fa7d3dd31442d328803d5d3278a9d958c59e6dd6f1cfa0823554cf250"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SpringScalarNaturalMotionAnimation (LCOM4 25): SpringScalarNaturalMotionAnimation\u0027s methods fall into 25 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 25 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":16810}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3d6d048d0261d4ec4becadd822b6801b47284c9a01994a8f8815237137af00"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SpringVector2NaturalMotionAnimation (LCOM4 25): SpringVector2NaturalMotionAnimation\u0027s methods fall into 25 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 25 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":17169}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bdc29b46ba52b2a5087dfe33fe4140dcf850003dec4067b0c57d3d5d92aeaa"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SpringVector3NaturalMotionAnimation (LCOM4 25): SpringVector3NaturalMotionAnimation\u0027s methods fall into 25 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 25 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":17528}}}],"partialFingerprints":{"codehealthFindingId/v1":"262240607388c886f4d74e5eade0c9cf9e992c5ee5863412809b463fd139b66e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Vector2NaturalMotionAnimation (LCOM4 25): Vector2NaturalMotionAnimation\u0027s methods fall into 25 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 25 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":19392}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03df8abab24a7ea278ff36142e59ca800fdb0c3856a223ba432f6be6c179efb"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Vector3NaturalMotionAnimation (LCOM4 25): Vector3NaturalMotionAnimation\u0027s methods fall into 25 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 25 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":20341}}}],"partialFingerprints":{"codehealthFindingId/v1":"462c4ddbde6baed2510a0eb7af61361440f1eab137b964b87978e287ed0fe30c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompositionRoundedRectangleGeometry (LCOM4 23): CompositionRoundedRectangleGeometry\u0027s methods fall into 23 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 23 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":5900}}}],"partialFingerprints":{"codehealthFindingId/v1":"454462aa66867208de3e5150f47eae2ea071fa867e457a5e32ca17e80d4ef31e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ImplicitAnimationCollection (LCOM4 19): ImplicitAnimationCollection\u0027s methods fall into 19 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 19 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":12269}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7995049ce8cdbe3a1e8ad116866cf63c0c54e9aafd95f4e34b48946209a535"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: VisualCollection (LCOM4 19): VisualCollection\u0027s methods fall into 19 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 19 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":21819}}}],"partialFingerprints":{"codehealthFindingId/v1":"344ba58d10b64e65cc43ddb62ea66f56ca60d7ceb9dc9b7863d29fc07a151aab"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompositionGeometry (LCOM4 17): CompositionGeometry\u0027s methods fall into 17 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 17 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":4255}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f49563e764edf14c8559910a70fac347a445e3ef3740021bb258967ac9fedd5"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompositionScopedBatch (LCOM4 17): CompositionScopedBatch\u0027s methods fall into 17 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 17 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":6188}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b488c4c8d4250b1e061b8d06aac5d042f59d83da34102e7123dd08ecb0b039e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompositionColorBrush (LCOM4 13): CompositionColorBrush\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":"crates/render/src/comp.rs"},"region":{"startLine":2777}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1230c383603f2bb4d83023248553f5435c1bf4860a2bd53e52557d7527ae30"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompositionAnimationGroup (LCOM4 12): CompositionAnimationGroup\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":"crates/render/src/comp.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"371c9a841d3b7c53d6c835988bbc5b61822fccb6313e9c2b582c1dec815dc82d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompositionCommitBatch (LCOM4 12): CompositionCommitBatch\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":"crates/render/src/comp.rs"},"region":{"startLine":3139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4406ffe7bdd90b133395834f0df9d6d06b77f3d4b388a5b1aacf58c1f829518"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: AmbientLight (LCOM4 11): AmbientLight\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d48a0b1f10e26fe9b2efb51f08a84740f015b49f5a95207a932ee93819de4df"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BackEasingFunction (LCOM4 11): BackEasingFunction\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff03776a3efccf9ccb76781953d2234adbd983df79522b4f108ff128d9a2ef13"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: BounceEasingFunction (LCOM4 11): BounceEasingFunction\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea0978f6b80e8d934b6e9556626587db4559f58175a226d44d16a3fd877d1e9"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CircleEasingFunction (LCOM4 11): CircleEasingFunction\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e502dee8895c807d1c5d83523d6972d9c21488a83c628f8b04a88a8097d0f2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompositionBackdropBrush (LCOM4 11): CompositionBackdropBrush\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":1886}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97cd2acdd3f23113c30390b88e6975e4a5a35532de8ccec90180fad39c2da6e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompositionBatchCompletedEventArgs (LCOM4 11): CompositionBatchCompletedEventArgs\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":2068}}}],"partialFingerprints":{"codehealthFindingId/v1":"3761472725d60c5c18d08f370626f80fada29fbdd117d07e4a1692aa311e70a3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompositionBrush (LCOM4 11): CompositionBrush\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"f400589749ce98a790533fff8744d466aed023696a3d1cf6a638153d786336f7"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompositionColorGradientStop (LCOM4 11): CompositionColorGradientStop\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":2960}}}],"partialFingerprints":{"codehealthFindingId/v1":"64cad6c725bcf14ff0c971e09006ae259413f4462d5d29bb83f45ce60811ff07"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompositionEasingFunction (LCOM4 11): CompositionEasingFunction\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":3328}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8e9e908e833806f0b5ae7fc10924720347adf7e3b5903132b2f1f4c4e6b9d3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompositionEffectFactory (LCOM4 11): CompositionEffectFactory\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":3732}}}],"partialFingerprints":{"codehealthFindingId/v1":"401c3cd4bfd69e1cf04f2e36b0c181e16475ff62e185c5031b13ff632ed5c589"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompositionGradientBrush (LCOM4 11): CompositionGradientBrush\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":4490}}}],"partialFingerprints":{"codehealthFindingId/v1":"5872dce32fb018e89e9ae7883fe2e8c84af4e01bdae9a9c7ac66ca3906588ebe"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompositionLight (LCOM4 11): CompositionLight\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":4653}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37423047225947426ad05796569de0895f2ba1dc06e9ec2b15378897f955d16"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompositionLinearGradientBrush (LCOM4 11): CompositionLinearGradientBrush\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":4812}}}],"partialFingerprints":{"codehealthFindingId/v1":"844089e7ee6cf5e7067ebeb583cf956768c9feec8200c69f4c3b7b2de53f7804"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompositionMaskBrush (LCOM4 11): CompositionMaskBrush\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":4977}}}],"partialFingerprints":{"codehealthFindingId/v1":"608282c179323d44df37024c325cd5fefacc164a986fc5dbe01f2ca8ebfaff83"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompositionNineGridBrush (LCOM4 11): CompositionNineGridBrush\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":5136}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b73be18131868e8e5d89ee515bea7a1e36537ab51bece66708e79aed8b0de62"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompositionObject (LCOM4 11): CompositionObject\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":5299}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03418abb37ab8e8e55ddb0855a02b1364082d0ad73530ee68807cb5659e3fcc"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompositionShadow (LCOM4 11): CompositionShadow\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":6417}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde77d9c0b49cff4920e6c27f69d9f1752bc809c2fe9c7187697ac15157ce3ea"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompositionSurfaceBrush (LCOM4 11): CompositionSurfaceBrush\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":6576}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ee6a712d667a1195be544084b987d3800edace8df046d37ce883364443b2ed"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompositionTarget (LCOM4 11): CompositionTarget\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":6739}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f451e1cf8c32e76a22c252da138b7b7789897e73566e853784bd81a79a6c899"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CompositionViewBox (LCOM4 11): CompositionViewBox\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":6898}}}],"partialFingerprints":{"codehealthFindingId/v1":"bced8f3e61a095dd50825303db1253045a917e30719f3992db059d6abb5ee367"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: CubicBezierEasingFunction (LCOM4 11): CubicBezierEasingFunction\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":8329}}}],"partialFingerprints":{"codehealthFindingId/v1":"c021e3cd4e788df6315d6d010dba4c8ef8354d21092be9aa6e49402a7d4faa9c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DistantLight (LCOM4 11): DistantLight\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":8493}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8ad20af943f557c59d1403949f751681c154fb317541ed29f1dd1ee44fe89c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: DropShadow (LCOM4 11): DropShadow\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":8652}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8880866a39a8ad59ea6a944d1c8f3ed144dad2cfdf79f853b46cf6b678d35b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ElasticEasingFunction (LCOM4 11): ElasticEasingFunction\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":8811}}}],"partialFingerprints":{"codehealthFindingId/v1":"b966ed3bfadf688e721d7bb0d8013896f5efb9bb8da9e869acf964e912d208dd"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ExponentialEasingFunction (LCOM4 11): ExponentialEasingFunction\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":8974}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c0073f6daabb605abafff78321bac3c03855188e7053aa97089e37d67dc88c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: LinearEasingFunction (LCOM4 11): LinearEasingFunction\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":14124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13479357f8cb639e7df7ca7e28c03ae4923a2cc5875ad46e09dc1d1cf0e32ed"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PointLight (LCOM4 11): PointLight\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":14644}}}],"partialFingerprints":{"codehealthFindingId/v1":"3babbc585c8a09e4e6c246acf027aab8751b1e72c5f2f69e7476295d025f0498"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PowerEasingFunction (LCOM4 11): PowerEasingFunction\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":14803}}}],"partialFingerprints":{"codehealthFindingId/v1":"76847b5028191c1f2988be8a8f18916f5ed63aa26f78d737c44ab4554e79c70a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SineEasingFunction (LCOM4 11): SineEasingFunction\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":16488}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa4d508197e441ab6588d0ff6de8f63108f632ef90f7203f9000b73abf431e3"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: SpotLight (LCOM4 11): SpotLight\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":16651}}}],"partialFingerprints":{"codehealthFindingId/v1":"525ac31f27c08915d20768fb2e33485ab219e311e97063f742186424cbbcf5b6"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: StepEasingFunction (LCOM4 11): StepEasingFunction\u0027s methods fall into 11 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 11 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":18527}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efd64ba0e1c9f5bb116fe9034080c374ba15bae39cb17ac2f758ba0fe85a817"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: IMap (LCOM4 8): IMap\u0027s methods fall into 8 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 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":11354}}}],"partialFingerprints":{"codehealthFindingId/v1":"2715bb2f57d8e6dfb72d360a6294ed015c3d487e8f841b557db0d833d8e4ede4"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Behavior (LCOM4 4): Behavior\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/mod.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d81dce2056ba9339b980658cb174b0ecda952c7b70340edbce04d09da3c62a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: StoreRateAndReviewResult (LCOM4 4): StoreRateAndReviewResult\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/store_bindings.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29f23334de264f85477888f6c62c2bfa4cf42b7b3c2663e08c33aa9bad29246"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/test-settings-ui.mjs: scripts/test-settings-ui.mjs changed 148 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 795 in test-settings-ui.runTests 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- scripts/test-settings-ui.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/test-settings-ui.mjs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bfff2654d003f9b51bd3fdbecd81855ec7be5b0b4c9c4be551ec75627011257"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/app/mod.rs: crates/app/src/app/mod.rs changed 255 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 291 in App::create at line 851. 8 of those changes were fix/bug commits, and the other 247 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/app/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/mod.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d9b0e81c105a6464276bfed653cd4942692ca885076d8df4121be7401778c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ui/settings.html: ui/settings.html changed 203 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in settings.html.renderFences at line 2108. 3 of those changes were fix/bug commits, and the other 200 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- ui/settings.html\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":2108}}}],"partialFingerprints":{"codehealthFindingId/v1":"850df577d88f1e1da3809229a34c285076bc346452fa7225dc3b2cfe1a03d39e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/app/settings.rs: crates/app/src/app/settings.rs changed 120 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 97 in App::on_settings_message at line 920. 4 of those changes were fix/bug commits, and the other 116 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/app/settings.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/settings.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"411e21c208d16827a09e7fcb883e898617ddf5138702dbc30ee9be2f60642cfd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/app/ipc.rs: crates/app/src/app/ipc.rs changed 100 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 107 in App::ipc_dispatch at line 703. 5 of those changes were fix/bug commits, and the other 95 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/app/ipc.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/ipc.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb93bff17a68fbb796d31950183c8b521c8fc38e53904004190f3e4449400327"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/render/src/fence_chrome.rs: crates/render/src/fence_chrome.rs changed 113 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 88 in FenceChrome::draw at line 2998. 3 of those changes were fix/bug commits, and the other 110 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/render/src/fence_chrome.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/fence_chrome.rs"},"region":{"startLine":2998}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b403a2b6c6e86f2c1abff5ceabace8d3703226c9ade1e39115ebe061278f7f0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/app/menus.rs: crates/app/src/app/menus.rs changed 89 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 110 in App::show_fence_menu at line 836. 4 of those changes were fix/bug commits, and the other 85 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/app/menus.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/menus.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5359adbcba857b54090625d784242bd0549943f02b0f53afa5ca2fd39e7449"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/fence_window/api.rs: crates/app/src/fence_window/api.rs changed 187 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in FenceWindow::set_tabs at line 1403. 4 of those changes were fix/bug commits, and the other 183 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/fence_window/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":"crates/app/src/fence_window/api.rs"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c978d3e058840961de52b7e45e92242de9a8043674602c3ef2593ad69cac7e3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/state.rs: crates/app/src/state.rs changed 116 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in AppState::sync_desktop_partly_read at line 1479. 6 of those changes were fix/bug commits, and the other 110 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/state.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/state.rs"},"region":{"startLine":1479}}}],"partialFingerprints":{"codehealthFindingId/v1":"558d7affb7c9009f9cebb94df1752351a1581295c36eb7532a5d4c5659dac556"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/app/fence_options.rs: crates/app/src/app/fence_options.rs changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 101 in pecofence::app::fence_options::parse_fence_prop at line 267. 3 of those changes were fix/bug commits, and the other 48 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/app/fence_options.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/fence_options.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbc5356e8f21371d5be700514fd4dc2bbc0958a21d7a0c79832795e364eb1be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/fence_window/handler/mouse_move.rs: crates/app/src/fence_window/handler/mouse_move.rs changed 46 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 104 in pecofence::fence_window::handler::mouse_move::on_mousemove 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/fence_window/handler/mouse_move.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/mouse_move.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"657448f4af557440e3a54a0225b1ddcd510a428de23eec702100f26caee5b292"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/app/testscript.rs: crates/app/src/app/testscript.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 117 in App::test_step 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/app/testscript.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/testscript.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e332ac04250285dab4bb4f43b34c15c8d3fd3b3ac3e5eed888b711685dc4e3f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/fence_window/handler/keyboard.rs: crates/app/src/fence_window/handler/keyboard.rs changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in pecofence::fence_window::handler::keyboard::on_keydown at line 68. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/fence_window/handler/keyboard.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/keyboard.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cafc9eb4a64a6c5bbf610113c0ad8613b618a95aaa791c0b30d5d6267ee4b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/fence_window/handler/mouse.rs: crates/app/src/fence_window/handler/mouse.rs changed 61 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in pecofence::fence_window::handler::mouse::on_lbuttondown at line 157. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/fence_window/handler/mouse.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/mouse.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"0756b26832aaf7bb98f524fffa650378fb87f1b1063f9b5bdea60a683a632e2e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/fence_window/handler/mod.rs: crates/app/src/fence_window/handler/mod.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 90 in FenceWindow::make_handler at line 215. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/fence_window/handler/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/mod.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a3cdb7dcf46f7f21a2e1214dc2d3248ba5d52720297669e19dee17e3e377f5b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/fence_window/render.rs: crates/app/src/fence_window/render.rs changed 110 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in FenceViewState::draw_chrome_panel at line 890. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/fence_window/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":"crates/app/src/fence_window/render.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"a664b63fc22d72719db2c3841e4c803de2e43611f634c79ec0aa644693fe8cef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/fence_window/dnd.rs: crates/app/src/fence_window/dnd.rs changed 54 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in FenceDropHandler::drop at line 815. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/fence_window/dnd.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/dnd.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a53115becc52453181d78cee93662c04498b54ccd1e01102789f11ba8edd93a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/app/fences.rs: crates/app/src/app/fences.rs changed 92 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in App::apply_cell_snap at line 387. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/app/fences.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/fences.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d29cce639460458c930ba6d02e43c96a1739ff5865804bbb62414da645311e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/fence_window/items.rs: crates/app/src/fence_window/items.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in FenceViewState::replace_items 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/fence_window/items.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/items.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52d311759db58cfb63ee244e2a32ffbbf547b120f71cb00ace329ea5f0b9e88"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/fence_window/handler/nc.rs: crates/app/src/fence_window/handler/nc.rs changed 68 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in pecofence::fence_window::handler::nc::on_exitsizemove at line 816. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/fence_window/handler/nc.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/nc.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cfe317363c4c07af76f1c55b6001a6a0fedd7126ce6caceede9579e569bdd9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/peek_search.rs: crates/app/src/peek_search.rs changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 48 in pecofence::peek_search::paint_box at line 1157. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/peek_search.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/peek_search.rs"},"region":{"startLine":1157}}}],"partialFingerprints":{"codehealthFindingId/v1":"a787406e8dfcba075f41c9f5d6f23deec9687c97b29fad341514d2e71279ffab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/anchor.rs: crates/app/src/anchor.rs changed 55 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in DesktopAnchor::on_timer at line 2138. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/anchor.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/anchor.rs"},"region":{"startLine":2138}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b214593f3ccaf641de2ab4f10b0402ab4a3c990f4d10564c2dab7f8be8ac1b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/app/tools.rs: crates/app/src/app/tools.rs changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in App::script_row_clicked 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/app/tools.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/tools.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ba3482068b47a2d897742cb78af72bd070949a4f19ea40b5a96b4dd174e0d0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/fence_window/hit.rs: crates/app/src/fence_window/hit.rs changed 61 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in FenceViewState::up_button_at at line 152. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/fence_window/hit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/hit.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e8e4cf9582c43f65fb1dfaecba27d1b8af8fae87a88bfcc00f8661f64f703c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/app/visuals.rs: crates/app/src/app/visuals.rs changed 48 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in App::refresh_visuals at line 1469. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/app/visuals.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/visuals.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe31127c03f9dd5001923233f5a3f53e85c0ec42511956bb5bbede5506d26f6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/cli/src/run.rs: crates/cli/src/run.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in pecofence_cli::run::run_fence at line 206. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/cli/src/run.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/run.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb36b4d7bf0a4f90416a9fe8e7e435c1bc0a4a3a942a62962f49ffbf143a417"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/app/push.rs: crates/app/src/app/push.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in App::reflow_pushed_once at line 322. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/app/push.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/push.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"6052e88d5d7e0209c6e318e7c060a5aa8b6de423fc00c9122043e984fa473e9e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/app/fileops.rs: crates/app/src/app/fileops.rs changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in App::on_fileop_done at line 287. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/app/fileops.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/fileops.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5cfeb6e8afc2f1f2df610786d482df1e2ec6c4f9f3865a780c12210d33ef9d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/config_store.rs: crates/core/src/config_store.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in pecofence_core::config_store::lint at line 684. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/core/src/config_store.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/config_store.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"b997711e36658f9b4936f954b4faf9f3bd963fb929f43e19596d6c00fe1dc88d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/fence_window/roll.rs: crates/app/src/fence_window/roll.rs changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in FenceViewState::start_roll_anim at line 759. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/fence_window/roll.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/roll.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"38aba158789a621f863cfd3b105b2b6bc6a59658aa7e4a13be24799f58180359"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/note_edit.rs: crates/app/src/note_edit.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in pecofence::note_edit::on_key at line 617. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/note_edit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/note_edit.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f4e8d40e6ea43bd421fd285655c0c577c2cb2e9e6857911f44868637e6285b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/app/undo.rs: crates/app/src/app/undo.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in App::apply_undo 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/app/undo.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/undo.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9dee604cbf56652544f7491573ea11825565da6fb7a3012c9bed1b0280e2cb0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/rename.rs: crates/app/src/rename.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in pecofence::rename::begin_rename_at at line 482. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/rename.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/rename.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd44256f64cac00c7138408a6f1586a9b2b50641d39b27fedd30d10e38a3646"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/app/sync.rs: crates/app/src/app/sync.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in App::on_fs_changed at line 245. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/app/sync.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/sync.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e61e43d4bb235cfbd87b047b285715e907396398606ec042ed4f1a058a25638"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/notice.rs: crates/app/src/notice.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in pecofence::notice::handle at line 554. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/notice.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/notice.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d866631441725ff2d11c50121aa5657bc4ff15f4e909cc7b5b8e2063ebf91b9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/app/smart.rs: crates/app/src/app/smart.rs changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in App::run_smart at line 257. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/app/smart.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/smart.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f323fb0a5583aeba09c4d88f6f7d7341a7cfb1513d02d7dfb669cb448b0c02"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/fence_window/tooltip.rs: crates/app/src/fence_window/tooltip.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in FenceViewState::tip_text 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/fence_window/tooltip.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/tooltip.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"30cdc5a41061a7a1d2d4dbd363cd16935856832f0738dec71c14ee381b6f0548"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/platform/src/edit.rs: crates/platform/src/edit.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in pecofence_platform::edit::handle at line 884. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/platform/src/edit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/edit.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1f89327b56ad356fd1fabc4dee0fbfe65acbf28c398e64952ab0ebf6f1c158f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/settings_host.rs: crates/app/src/settings_host.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in SettingsHost::open 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/settings_host.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/settings_host.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a085abf6bcb18ac0a64097e69a44ade607ed9af5f7d10a29fa15cd6f28d816a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/app/welcome.rs: crates/app/src/app/welcome.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in App::welcome_texts at line 296. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/app/welcome.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/welcome.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd0d7b6814fe4592f8264863e8bd57a8e3f7b4648dc5e3c819e6c71edff317f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/build-site.py: scripts/build-site.py changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in build-site.main 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- scripts/build-site.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/build-site.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"cef1107cfeeccea6e913a4670d3df20f40f89c1f2efac4942b116380bf749e2b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/icons.rs: crates/app/src/icons.rs changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in IconCache::new at line 261. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/icons.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/icons.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e004b82a660ef1b8fe5c0ff05e4f8419d9a13e5a5da0e8fb49d6b076aac9a11"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/app/search.rs: crates/app/src/app/search.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in App::show_search_actions 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/app/search.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/search.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"b08f64b8639a67e9b46495b676dfde951ff76955d5572512e4ec5e5a4944396b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/fence_window/handler/timers.rs: crates/app/src/fence_window/handler/timers.rs changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in pecofence::fence_window::handler::timers::on_timer_hover_select 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/fence_window/handler/timers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/handler/timers.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd1adee6e9ae28b6fdf4db86fd67c3c6e72ba29a39496aab28d501dac605b67"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/app/live_wallpaper.rs: crates/app/src/app/live_wallpaper.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in App::finish_live_capture at line 617. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/app/live_wallpaper.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/live_wallpaper.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"337f816467e05a9d1840cd2ebff5f59fec7e9685ee5c224d2147d430857419c9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/fence_window/frame.rs: crates/app/src/fence_window/frame.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in FenceViewState::tick 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/fence_window/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":"crates/app/src/fence_window/frame.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"41427bf228f8055897573b0b2cc44a8da9617f526d892ccae8b461e8e7fc37ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/peek.rs: crates/app/src/peek.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in PeekOverlay::show at line 156. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/peek.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/peek.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"039f53a39be49dc364027a26cfc4bb98da7f604d6e371f8ff4705c5cb5477e10"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/fence_window/snap.rs: crates/app/src/fence_window/snap.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in pecofence::fence_window::snap::size_among 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/fence_window/snap.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/snap.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b78d16826ed162250bea2f273cc47abe2df608ade63f54945beab629eeeb88"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/app/tabs.rs: crates/app/src/app/tabs.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in App::detach_tab 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/app/tabs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/tabs.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"f473b25a8c030bec489dc921075f66b6ae4c1da4b03de331110bbdef1e3520bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/rules.rs: crates/core/src/rules.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in pecofence_core::rules::cond_matches 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/core/src/rules.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/rules.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"20619a2adec26182b55798dc1fec894de3ebbe927015f72d8d6a38abfe376961"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/app/group.rs: crates/app/src/app/group.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in App::on_desktop_marquee 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/app/group.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/group.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"6675bdb12f6ad542cc91c5de103462f6c1d990913b09d7348fed78661e5c862c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: site/manual/demos/tools.js: site/manual/demos/tools.js changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in tools.render at line 171. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- site/manual/demos/tools.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":"site/manual/demos/tools.js"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e154ca434f8d0d7e3b4d453f8b03af55d13bb2e35401d81e9495b0560113b3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/app/updates.rs: crates/app/src/app/updates.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in App::show_update_card at line 594. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/app/updates.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/updates.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d6b25ff85c4f96bcedcd0395d24021cc682ca2d73310345a10451c8a2855fd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/fence_window/window_drag.rs: crates/app/src/fence_window/window_drag.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in pecofence::fence_window::window_drag::flush_window_drag at line 48. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/fence_window/window_drag.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/window_drag.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d37c49b0edffde0b2fe57699a31ed65e8d3f2a698d63e1b92f0014d2b99b62"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/shadow.rs: crates/app/src/shadow.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in ShadowWindow::update at line 456. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/shadow.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/shadow.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"e050f4c19362f8ca021e790c8786100e0d9d0f1770bb86e87cc7dd337e9fb86b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/app/smart_editor.rs: crates/app/src/app/smart_editor.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in App::on_editor_message at line 149. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/app/smart_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":"crates/app/src/app/smart_editor.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5bb58d2d850e9488aced3cc95799ff74d7539db5c1ca482b4ff21f11b563411"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/app/vdesktops.rs: crates/app/src/app/vdesktops.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in App::follow_desktops at line 261. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/app/vdesktops.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/app/vdesktops.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"e852faffed06575f420e38a651e8c95133fa4d80e9aef4be05b7c5f791074bc9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/platform/src/frameclock.rs: crates/platform/src/frameclock.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in FrameClock::start at line 311. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/platform/src/frameclock.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/frameclock.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bf00c1f251328ce4ecc763a6365c4c579c9b14f967bb6201f0fd3f52626454"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/core/src/geometry.rs: crates/core/src/geometry.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in pecofence_core::geometry::keep_groups_together at line 268. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/core/src/geometry.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/geometry.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3ac1b8eb946b4acc282a33e29331eca06467b481034b1480ec22a0afc95268"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/render/src/custom_theme.rs: crates/render/src/custom_theme.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Values::apply at line 220. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/render/src/custom_theme.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/custom_theme.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"66cf7bf113bae0327a9f611433862dda6de6e5f09957951074427bbf09a57f80"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: site/manual/demos/script-rows.js: site/manual/demos/script-rows.js changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in script-rows.render at line 202. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- site/manual/demos/script-rows.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":"site/manual/demos/script-rows.js"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fed99cb00821282da1b33e51160c2b420ca4e7b20c73a4389076f8797c49cd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: site/manual/demos/create.js: site/manual/demos/create.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in create.render at line 86. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- site/manual/demos/create.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":"site/manual/demos/create.js"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2b6642b316b14c2d8e0810e446476ade5e61f85eb260c79fdd878d6f765716"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/render/src/notice.rs: crates/render/src/notice.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in NoticeCard::draw at line 228. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/render/src/notice.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/notice.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c7a864f09c645716adeb8b4c4ba1f3b7051070178a605198e76c788863c6d7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/render/src/liquid_glass.rs: crates/render/src/liquid_glass.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in pecofence_render::liquid_glass::displacement_field at line 304. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/render/src/liquid_glass.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/liquid_glass.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eeaa338b8f0d42c41335c97b3b2033107bc0c08fbfd5a8bfbcd9026b04fbc77"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: site/manual/demos/rules.js: site/manual/demos/rules.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in rules.render 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- site/manual/demos/rules.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":"site/manual/demos/rules.js"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"917eacd6263d85f2b840eac2c318add279599ff2774afbf68c73e2328500454a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: site/manual/demos/first-run.js: site/manual/demos/first-run.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in first-run.render 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-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- site/manual/demos/first-run.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":"site/manual/demos/first-run.js"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8976220d0a6d38d49a89ccf0657806b6ce727c6195cf510601e16d9c85b51cc2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: site/manual/demos/search.js: site/manual/demos/search.js changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in search.render at line 219. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- site/manual/demos/search.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":"site/manual/demos/search.js"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e46affabd8b9a06a9b747128b9b5fb91912fd5b9aa307a39824f4082e194637"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/app/src/marquee_offer.rs: crates/app/src/marquee_offer.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in pecofence::marquee_offer::handle at line 214. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- crates/app/src/marquee_offer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/marquee_offer.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"118fe86be944ab53148767c918c8187d84897f1fa6e072019854f1b5570b7aa4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: site/manual/demos/items.js: site/manual/demos/items.js changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in items.render at line 182. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-17..2026-11-15, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-17 15:30:30 \u002B09:00\u0027 --until=\u00272026-11-15 15:30:30 \u002B09:00\u0027 --full-history --no-merges -- site/manual/demos/items.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":"site/manual/demos/items.js"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"673e840fc3669ffa8bd631bd1a38a80d027730a29f841af99a37b705326bb8ce"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060crates/watchdog/Cargo.toml\u0060 makes this repository a deployable product (line 9)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/watchdog/Cargo.toml"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b92cdaa3346ad1df1ca4b19a25fceda8948b32a09f6b9f5ce5a2c510d956c87"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf64e029cd28905adbbc5a7328f8471ba0c02f8c8d4381e8e4d22735a574d322"},"properties":{"commitSha":"502ca8d8496605cd4b58cf41284de08c1771b1c5"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1f31e3fc38e806c632551480508ae27b2701acddad0a9d80c648ba1fc9463b3"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"866f5db9e17cba13054be81498300d5689d6380b38ab693dd948f99e20adbff5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"54015389eb5f9a0beb6433e209224f32665bbffd45f48b4ac71eacdc7584cddd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"71d409363b55a1d24dc05307b924cc6c6729c6dbea72afa05fed85828fe13b0b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dcfa4da9215284db6a6355a359d46e54ece6d33a8e6548e02570fa88e565fa20"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c1bb7814097052b3b9e49cf20adb5ffa3c94da3abc00863955683dc4725b2e91"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"05dd1cc6a6536213feac72458953b3ecc92da85b7219289a9d2c68054660f8e9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"58416306c1a27a37c4768b939e55dd2865e8672774adab59964be2ffeffdd74f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"493308c88e8c66fcb98ce33fa8a7c07e2fee06375429dcf7629ec741ee5f79d7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2af12478916431f5360463cb80bcf6aca6989a4c0dd87e35163ccf0e245cba40"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46ed5088e372a1645841089d14aca0a25845741310820ce62e7cb1a6cd16763b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e5ce53e95cedee56e83d4ea9027e8e31336b8780411d1098fa8e01b60674c3d6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"29a123e5ded039aafc5f9608aaec5c5e039833e07d8997aa993c9ad344fa17f1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e4cb465e1f0d2eae4c574d9bbda594dca37b461c20ca4391a9a1ab1fb76b76e5"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"34f998d59eaff18b05f62f3ffd53eb1d86ddd758e021a3b06f3dd141181d69a1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"693249723480b7d3690fbc9002e4acaa2fd5c4f5277d52948268b51530c89d1e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"925a1751e8d41c7a13a4890cf62f333e20e1b9979e60753140251f2431b1053b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8018fa76f9798f58c2d54888e01f82e01d93750f0c34580eea02821510c2b5a4"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f61da5ce13fc969d40a77b7889cc4090dc8f0e8130f69c8fd2b646acb753a376"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ef2f51ca09d2a9ab271e056d367495cd8aa1780db4110f9f2cb4c8fc4974431a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5a1913f7d62341fa6bc7ccbf013136f903d2f0a18ba81a157546cb1a92e2dca9"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2db7be9f95d389dbbc93f4e4c3fd320f5b4449054e0ecdc75bd71db0916ebc11"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"486d816062a7f49c9f050ed0317caa48633afc582069a4255ba84c2797900af8"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"60977b94d900bc3c95a0d3de633155373d5559c6d5f437ce07d970247b785ed1"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"291eb8cb970c93af4d07952c7d689c7ac75a34342e24ff57dc897aa076bdc26d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dbbdcd01ba14a20c4f323f861d9b1c6f5c856f31875e90c3f8c5133e3b722c14"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2f1b39bb42881e144ec4e7c659fd8e948f800bc38a38796006705d6afea8a030"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-88","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c146f3b920f9aae539a1791c606a6ed5b4ef782e58e52edae86200fafe633cb8"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-88","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4694c6ece32c1d5b359b58c0f94d337bd4022a8fd506e143d98c1a62c7cca2ff"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-88","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4b020c7903f949c22272073f798d126cc6606940c51d14cefa6a71880de58ee5"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-88","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4813e419d2cd48288121dfe0be01acf665627c71650861d89ed22d65867f9d9f"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-88","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"63778fa624412affc09bbae17ed4e235deee47c1e8fbbd49594e08c2f223c987"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d41ab1515269999f0094bc75dfeb34b39f4f151f26bb090dcdf72fd6ea281fce"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"85977f8e126f8fbcd11540d036062bc8a05de8a1eb7c927089f51e8ce6b53232"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"32dfd4779ab151a8110fde96ae4200270e1291bffa2c558fe6b17879bdf5f911"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"84354cdc61ad3f26ea2ab85a42a2191ad1f5389ca23e6d0f5e4dcea98f0f0055"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"09d8adc6e9eec40d81865eb7d912931bf039457c7e65a3609cc2990d8f23ac3f"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"40e97e8982f009b273954b6fe9f5c577a31fc21bb1c72c93904f6d1c23af2958"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2cae3cf6ed77bf7fbf8d2acb1cdcc18b938c1353156259fc4b287b4de0d8109e"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9e809d123e3e6efa59d523053f7df46d303ebf3ef266c13f4147b972d40d4d4e"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"45ec6154616c77c8baa7cc4f5cd9a7a5352852b9676acdc339e1b82b67f588c0"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8df06882792bf428985dbca11e0700c92a51f6bbfbdc1f8a6fe5daae128bcb90"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bfcb2730c847ba4620b8461d27b5490064edb51801917a7042b8d28d549d56d0"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"b295a7a729239283395129bb41965dcf14c20ca2880721a7833d6233a9a3deb0"},"properties":{"dependency":{"package":"brace-expansion","version":"2.1.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e48a9e8616ec0f225ba060a1c14cf30c71c48b528989311506bd5478b03d2d3"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.18","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a87a4e5cded1ee31c51ede7bef2e74495f7050a6dbb4c87cbcd42b6f16f18a8a"},"properties":{"dependency":{"package":"source-map-js","version":"1.2.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"39d31715d8ed24d1821195d843b45760a24acff0f8ff363a7f13cd82540f3f4d"},"properties":{"dependency":{"package":"zod","version":"4.5.4","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.5","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"747b4a0c3e1e1161a240d07bc42b34afeb8cc4671df48c6b4793c20ba2c8b274"},"properties":{"dependency":{"package":"minimatch","version":"9.0.9","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e323a11404eda3acdf8a385f89d614bc410bbffedf008c86e85d66674ab0639a"},"properties":{"dependency":{"package":"fast-uri","version":"3.1.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"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":"89c665fdc21627368944fbcec2e210136b681ddad58f00cca22d1be9e269ca2d"},"properties":{"dependency":{"package":"@eslint/plugin-kit","version":"0.2.8","advisory":"[GHSA redacted]","reachability":{"kind":"not-imported"}}}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f031145c2f5821144dafe3a3aec7f880fa2de2cdf7a061bcdb38b57c0c1191f0"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eea86f003f40066179060fa68ce6bb2bde95aea907de786a86e3fabec53cd8ca"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"78fdb795e40912f18fa999a90fe136f50c07b490fa1d58b13fe511e8b07410ba"}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"be31b0d0cdd5f92faf16b2b4c2dbd5b27addd55879e2df7bd6f8bbda7e38a5dd"}},{"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":"9676912467923e169f19dc2afb9c5acb2b873b914e11c23444dba9856d505acb"}},{"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":"b7cc7114394c9f8757f3447ad82cb0816f30ddf26fee8e1d44fc68d7ba56c04c"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"14597a955f5cb8fce95eb391e1029de755aa41e81f47cf7f1579cb047bd00cc0"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"47b340aebe6e9080759766884d45f733a27034bda84cf7141405a6d41f953c64"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a2fced4d467d9265d7dff7f22c0b8233e0cd1b28f3255f45b920b9486e3cb9ef"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: cli.rs \u2194 lib.rs: \u0060crates/cli/src/cli.rs\u0060 and \u0060crates/ipc/src/lib.rs\u0060 change together 71% of the time (10 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u006065f14849\u0060 Smart fences: CLI --match and several folders, docs, manual and kit t\u2026; \u00602a7bf981\u0060 Smart fences sample: a fence showing a saved search (Everything or on\u2026; \u006073bafdd6\u0060 CLI: fence open-folder, fence up, fence forward and peek start --search \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/cli.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e78513ffce05d6e8569e3a9e00da0e38d43d924fa7dbcec851710ce995a4ed"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: state.rs \u2194 dto.rs: \u0060crates/app/src/state.rs\u0060 and \u0060crates/ipc/src/dto.rs\u0060 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 \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u006076136139\u0060 \u81EA\u7531\u6446\u653E on in a new configuration, as on a new Windows desktop; \u00602a7bf981\u0060 Smart fences sample: a fence showing a saved search (Everything or on\u2026; \u006058bf539c\u0060 pecofence-cli status reports live wallpaper captures; snapshot restor\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a84f7e53cfb0fa3e4c6ce05c540ad6fab2c748c728a3e114a48e5066d73b1bd"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: consts.rs \u2194 mod.rs: \u0060crates/app/src/fence_window/consts.rs\u0060 and \u0060crates/app/src/fence_window/handler/mod.rs\u0060 change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \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 \u00600015a22d\u0060 Ctrl\u002BV and Delete: the selection no longer turns grey and then blue a\u2026; \u006036fdf1e0\u0060 The name box of a new fence opens as soon as the fence has faded in (\u2026; \u00603efab2b0\u0060 In Fluent, a right click on a resting pointer cancels a title drag too \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/consts.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d4a807fec4b016949767e6acd00350bdc44615d87ca2a5634827892c34c595"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: state.rs \u2194 cli.rs: \u0060crates/app/src/state.rs\u0060 and \u0060crates/cli/src/cli.rs\u0060 change together 53% of the time (8 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u00602a7bf981\u0060 Smart fences sample: a fence showing a saved search (Everything or on\u2026; \u0060b8ae1470\u0060 Tool fences: fixes from review; \u006058bf539c\u0060 pecofence-cli status reports live wallpaper captures; snapshot restor\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"838d31749fa23e7148ebad48b87408fb53264469a862a451c5a80635019981ad"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: model.rs \u2194 lib.rs: \u0060crates/core/src/model.rs\u0060 and \u0060crates/ipc/src/lib.rs\u0060 change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00602be9d004\u0060 Icon alignment \u53F3\u5BF9\u9F50: the rows of a fence fill from the right edge, the\u2026; \u0060a908f186\u0060 Security: the scripts of an imported configuration start only with th\u2026; \u00602a7bf981\u0060 Smart fences sample: a fence showing a saved search (Everything or on\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/core/src/model.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e18b590d31f96b380b03bb48c0f0b43cf67a8b0854a134adbbadcfdbff6079"}},{"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":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"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":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"ui/settings.html"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18c35805d3d9df4c65f8e2287607e167f585bf0e0c22fb68031c814f253fcd6"}},{"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":"ui/settings.html"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"843ddaba8c4296c2cdab39c0f11cfdb01bad86ff7635c78d9df28330ba180cd2"}},{"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":"ui/settings.html"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"98bb0f6401c408b2881af85bd3228452bbb55d37cf35475be247969fb38063ba"}},{"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":"ui/settings.html"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"1844552f26fd6579c84e99d7a5de8265115984362500f33a1cd275456d603632"}},{"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":"ui/settings.html"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad67765032e46ed4ee419e0cc2d1d248ae2620c3d7fa030ac2db0e7fe4ca34d"}},{"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":"ui/settings.html"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"578811421c5024ae66a25d7cedb5a9eff68055c63bd268898f75e10b668e2469"}},{"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":"ui/settings.html"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"b573d15ae2202f1f3541d22f80dfc28599157ae00f1bf91fe72496a932c8d816"}},{"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":"ui/settings.html"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"59912185c568f1665b352005b3e0ad73d07e647c8642281bd993d8cf385d7d3c"}},{"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":"ui/settings.html"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"3002a9bd7647484eaa5b55ea154026d4b98fce63527693a7fa12342371d9562f"}},{"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":"ui/settings.html"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"628e5e74c82d1464576522ee929b61656ae051758d30db6ee4ecd4e11d2aa75b"}},{"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":"ui/settings.html"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"562b413c4b4e7c05281d7ce1137e60064d9e655346ec72a95e4dafa38b855e94"}},{"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":"ui/settings.html"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a06577e8ed8ca2b5b8c6fe4f2d2b42d0da2233f52cd711ad40af5f49411b4b1"}},{"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":"ui/settings.html"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7eb8114112a22bf65c6dca9f684b5562d93fc9048c9bb65e3d1095b9b1c37ba"}},{"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":"ui/settings.html"},"region":{"startLine":793}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0290cfbac3633cb3a0e3a2bdbaeb170de082f259e38862a4819184bf99a3fb0"}},{"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":"ui/settings.html"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"265a6e8a74b420e83dbe4911b46804ec6267c0e1a9687f40e5e7a04c5f4cbca0"}},{"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":"ui/settings.html"},"region":{"startLine":805}}}],"partialFingerprints":{"codehealthFindingId/v1":"223757ea6c2aa3812b4f223a852923972bc05bb7f9193453757197c2817eea4d"}},{"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":"ui/settings.html"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"54779967561a30754eb584d22fbfb3c8a21ea2f1bd68f58b069f266969d3aacb"}},{"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":"ui/settings.html"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5393b0cec2efe4a362be203fd39939a2a128aa3c59526cf34fc179f4a9d9295"}},{"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":"ui/settings.html"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"230c465e926624888c5d2e8a61aedd36030826bbbaa4d9a0f2c78d3f2c4c1de7"}},{"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":"ui/settings.html"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c05b902370a06a8666c032428a13797788c4556abdb1f126eb4c374cc59313"}},{"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":"ui/settings.html"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"085ac56fdf6c40164de264201618a29095a8656e549b4de7be38749c9a0139d4"}},{"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":"ui/settings.html"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"560cfd15b3ac6c7375f2ee7ddae94357562682530d9f4ef33b1bdc6579f47106"}},{"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":"ui/settings.html"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"4359f09fe589b7193c4b69d8677328e1bb1d2cbd58b7bbe9d1c67bac2c904dfc"}},{"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":"ui/settings.html"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"55087f60ea4f648bd121cc89ecb964edcea69c3a33b04f2c057f2a3009e248e3"}},{"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":"ui/settings.html"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f731e3661d9b2c9bd72fdbc6c4beaade78f946738086b1ea6601a51ab821b9"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a78a00e91e561f5e9c5188ed8725e524efdc5de98db991a120701cba71007d"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"107c896938a59fbba5d0018a8185129cedf4f5ab02aae873b5ec71b295783ffc"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"317d480623a8141489abccd8131c9a8b08ca5e17c265e8737876be61b8b0e081"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4699ea54f1a7f6d3f8f4e388f8ec2760ce984e480e4fad8789569605addc019"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd5eea16dbd078341780db3253059c4fbd614b11a64e557b2c8fbbb15e0d72e"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1c2ce31125c4e96e4df3a0045e23fb0d624250e7639df1a98d06e6004be63c"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"14701cad71e893d3eabc790ec89281dac0cfef238ac1557aa20df4d2ad5e28bc"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f985b831add1bad97669416762d538129b82617e46a1fe493660b1b6d0952e"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8f87339867ff7488843c5ddd3f25a24f0c320ffbaf53ad084f30c90c1802c3a"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e8ee4e130aaee34b6c210be76243782f5cdd3b2b4e7d6eb33f79631a30b647"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":735}}}],"partialFingerprints":{"codehealthFindingId/v1":"67849259dc2a23ea8d19d4a1ebcd5884658e20b2ff41d8bcc25e63799efa57e9"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5a2285cd232537d8dcbd6ddd6f1adff27eb2fe3cdcc6ea3520bdd21aa31cf4"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c85fd35fd71b11b0af2843cfefa6453a6328c3b3d5950b55f6d23db90bb228"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"608d89e7588c2808ad9562e1a3dfd6635f265b8550f11f130afad9e6f93d0a03"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1ed6a83cf4d57de608bb71b04651d27f2c24f1300c9d67588d462e93810415"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"9658548bad1e9854846fdb7431359e8589dbc1e80a727a330c732b6d39828610"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae9ab0d1da6207184f0f67865daaa0953703311b2f81570c8569862fc983908"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19bf10a459f4a068d33dc5e5b254d1a3a1a4bcb44cc3da0d09d6fbfdf36039c"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":765}}}],"partialFingerprints":{"codehealthFindingId/v1":"905e377a5716b3de8983d78ac6266a606fd9f97701be04ad7ebc6d1cff9eaac4"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"886e2a185d22ad67c78e5da76624274bb4d07514059ee618e63562aad6aea216"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"872a90c3842a10b4d1dfa4de8b7b91a3a05d4138900a584cfe19585779706da5"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce8bed4bbd40af7ce31ab7a231b333dc702c580db1f34f91842751c98be0670"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf554aaeba1c986197b201ce9188b63aed2081a5c797a6e1d11300a550156448"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a164841d90c4c4325123cd639f5542244ffabd81b1875f7b52e0b2ef5df5c3"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e8e31c04df380faa870a18f3cba18f63022b2b62ea22c0d64e6e528fe85ca5"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4a85cf9edc67bc9bf0059faf2cffc267e63f1e5debfb9e278cd574f558dcd2"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"1adfcbfd6d62e2c35faa0ec1aa56c7617552dbf2cddf171bb2a84aecf8a193ab"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebee8d3d5c72a77f7af087d70b4e2567fccb8c51dc06441288428a5782e6e49"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"d481904d8781be385d30b67c2592bb15a8f09a45ea66725795a3525e149da0c6"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"a97d8c4087b82b7cd566b922317470c26d7be72bc09b52b0b7300dbc358d7b64"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d183967c05445669501fec39b7813579a784e0550959ba8e6eb42267664c1c7"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d16e4febf55ddfac93d1d32bac12d1e40a8970614b6165c514980b65053547"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c790047933a3bb2688b56c1f820e9052336035b7da7e9ef323c8c1df87defa9"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"517bb5e53238b9e6bd086611522e52b0884e5d37073f06c6df7f0e42028e7603"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"5823e2be89206b5324bc8000d91b42442e3bf6cced972ec8333ff80e4f8bebae"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5556ee033bb0675b7fc886d91261cbde07c7c5ce6d4d818a737fa55cb81611b"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be7804f4bf815bd2adfc9e03e0d559afe53175e3086c18e71ed20c94b1662d7"}},{"ruleId":"AC5","level":"error","message":{"text":"role=\u0022switch\u0022 missing required aria-checked: The switch role requires aria-checked to convey its state. Add it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"eacd54490e0f31c069d024154b8ae4bf71ecd7c34f5c903ee28410e752795d73"}},{"ruleId":"AC6","level":"warning","message":{"text":"Focus outline removed in CSS without a :focus replacement: \u0060.hotkey-box.recording:focus-visible\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":"ui/settings.html"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"897f9d3027bf156603fbe94ad123b4951a5aebdd93841c83297adad1c15933e9"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (2.6:1): \u0060.file-icon\u0060 sets color: #eef7ff on background-color: #749cca \u2014 2.6:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ui/settings.html"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"965b3a16c280fc9a73fbed4f1243d5eff9448b7a8f2b8866fb3871d9100126f5"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P10","level":"note","message":{"text":"Implementation type on the public API: 4 public types in \u0060pecofence_render.comp\u0060 are marked as implementation by their own namespace, folder or name: \u0060ICompositionAnimationBase_Impl\u0060 (crates/render/src/comp.rs:9742, name ends in \u0060Impl\u0060), \u0060ICompositionSurface_Impl\u0060 (crates/render/src/comp.rs:10524, name ends in \u0060Impl\u0060), \u0060IIterable_Impl\u0060 (crates/render/src/comp.rs:11146, name ends in \u0060Impl\u0060), \u0060IMap_Impl\u0060 (crates/render/src/comp.rs:11525, name ends in \u0060Impl\u0060). While they are public, every consumer of the library can bind to them, so changing them is a breaking change for those consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/comp.rs"},"region":{"startLine":9742}}}],"partialFingerprints":{"codehealthFindingId/v1":"845444d50624fbec71221500e09067143d04448c3e2f4871dd1df968213f78cb"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 3/5 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060crates/cli\u0060, \u0060crates/watchdog\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060extras/pecofence-promo/package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extras/pecofence-promo/package.json"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"9034531d2feccbb2fca5bf73000e7cef7889eb656d3684e709ebacf96acf3202"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): extras/pecofence-promo/scripts/prepare-autosort-media.mjs:29 \u00B7 extras/pecofence-promo/scripts/prepare-motion-media.mjs:9 \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":"extras/pecofence-promo/scripts/prepare-autosort-media.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1fa913a1cb037e510e5c9b9df2927e1182eef69801b5b48b4868db803a733a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): scripts/test-settings-ui.mjs:71 \u00B7 scripts/test-settings-ui.mjs:240 \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/test-settings-ui.mjs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"816c3328be8afb2df4d61022894b19908b88778e5b7e738a7921cb07d6c6d9f8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): scripts/test-settings-ui.mjs:674 \u00B7 scripts/test-settings-ui.mjs:1373 \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/test-settings-ui.mjs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ec603746e5883bd873cd2d46829bb613f4558dcb59d8bede6064389297333f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): extras/pecofence-promo/src/launch/Beauty.tsx:2 \u00B7 extras/pecofence-promo/src/launch/Closing.tsx:3 \u00B7 extras/pecofence-promo/src/launch/Opening.tsx:2 \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":"extras/pecofence-promo/src/launch/Beauty.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"041f4bce01cf8a9f7772de42523de29ac0759f5ea64749c54d753328048f4a19"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): extras/pecofence-promo/src/motion/Closing.tsx:1 \u00B7 extras/pecofence-promo/src/motion/Hero.tsx:1 \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":"extras/pecofence-promo/src/motion/Closing.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed31ce1c3c061df3f4023ed01e4f310a4ec4a21d3a20709619f22d0639bacfb4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): extras/pecofence-promo/src/motion/NewFiles.tsx:22 \u00B7 extras/pecofence-promo/src/motion/NewFiles.tsx:35 \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":"extras/pecofence-promo/src/motion/NewFiles.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"85fced82c12dcfb7d6251ba05925808606e2434390f078b5ddd85bc3612ddc6c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): scripts/test-settings-ui.mjs:811 \u00B7 scripts/test-settings-ui.mjs:894 \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/test-settings-ui.mjs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"741a75cb39a78c82d02fd5f1fb5184700dcb4ad4ed18c07a24072de9deb40cdf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): extras/pecofence-promo/scripts/make-assets.mjs:2 \u00B7 extras/pecofence-promo/scripts/make-energy-audio.mjs:2 \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":"extras/pecofence-promo/scripts/make-assets.mjs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"e734c7f9a5aa1ff6c949f51b6e833141a949b061e90a73fa8e62d8f6acc0d69a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4 locations): extras/pecofence-promo/src/motion/Closing.tsx:2 \u00B7 extras/pecofence-promo/src/motion/Groups.tsx:4 \u00B7 extras/pecofence-promo/src/motion/Hero.tsx:2 \u00B7 extras/pecofence-promo/src/motion/Tabs.tsx:2 \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":"extras/pecofence-promo/src/motion/Closing.tsx"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"31973b0ee46ad2ac08e12d63c61b0a6d2b91a9091d710c028e0af234c05f11e4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): extras/pecofence-promo/src/reviewed/EndCard.tsx:3 \u00B7 extras/pecofence-promo/src/reviewed/FileAccess.tsx:4 \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":"extras/pecofence-promo/src/reviewed/EndCard.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"83aa79a70a388a1902a29ae89bbbed4210c7a19539002a79e662ca2029856ee5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): extras/pecofence-promo/src/reviewed/EndCard.tsx:1 \u00B7 extras/pecofence-promo/src/reviewed/FileAccess.tsx:2 \u00B7 extras/pecofence-promo/src/reviewed/ProjectTabs.tsx:2 \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":"extras/pecofence-promo/src/reviewed/EndCard.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a5e58365d3549a19507565ed03d1565a7c3a052538ddb805a277bf0336d33b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/test-settings-ui.mjs:356 \u00B7 scripts/test-settings-ui.mjs:1837 \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/test-settings-ui.mjs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fcc4c19a40b44a587a29cd0c7b8546898e1a7f08d60c8c4bbc9d558267940b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): scripts/test-settings-ui.mjs:1595 \u00B7 scripts/test-settings-ui.mjs:1610 \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/test-settings-ui.mjs"},"region":{"startLine":1595}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceb26f3a3ed7a42d348f201f0921ffcc2e6c652123d37cfb7b009bc09f1cb4eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (5 matched lines \u00D7 2 locations): extras/pecofence-promo/scripts/prepare-autosort-media.mjs:5 \u00B7 extras/pecofence-promo/scripts/prepare-reviewed-media.mjs:4 \u2014 the two spans are one implementation copied and then locally edited \u2014 61 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":"extras/pecofence-promo/scripts/prepare-autosort-media.mjs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f627a506445c1e344e99e04266b2e79e3f44b7dc8c913fe9774adcae59b4f6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): scripts/test-settings-ui.mjs:1509 \u00B7 scripts/test-settings-ui.mjs:1549 \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/test-settings-ui.mjs"},"region":{"startLine":1509}}}],"partialFingerprints":{"codehealthFindingId/v1":"16ab4c03d5d6556eab8df114f114f482164befcc1de0b28d2a76fe53d3151aa1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function postMessage (cyclomatic 69, cognitive 99): postMessage has cyclomatic complexity 69 and cognitive complexity 99; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse 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/test-settings-ui.mjs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5552de3378a1b3374cf7bbc70c1e7e8f28d7b9a1fcabc2ca647f2eea522ed6"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validate (cyclomatic 26, cognitive 28): validate has cyclomatic complexity 26 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":"services/usage/src/usage.mjs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76eb4bec18ee6694a10614281b62d2069def45cd70ba460b2236cf2b68f43bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function validate (cyclomatic 23, cognitive 24): validate has cyclomatic complexity 23 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":"services/feedback/src/index.js"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"08e449bf9872790d37f195f5941e1ffe6c9b3c0257295e7e142842c223fee319"}},{"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/test-settings-ui.mjs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"856442ef7044a3ecd4a18a6f285e4abb5ce0516ef6a8902364c9e16fa2a47ff9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 11): (anonymous) has cyclomatic complexity 18 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/test-settings-ui.mjs"},"region":{"startLine":2140}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b810f556898ec492ddbc03ac9f0ba23665bac257730e5d013929fa141aa07bc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 11): (anonymous) 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":"scripts/test-settings-ui.mjs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a6f9bccd8f96c2d580972747682209d79ddd32303c46c788d807dbd4995fae7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 11): (anonymous) 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":"scripts/test-settings-ui.mjs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"4185aa3c6c7ee777573ec3abab5c3a5c8f803db2c10b473662ba2446bfb1e723"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function fetch (cyclomatic 16, cognitive 16): fetch 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":"services/feedback/src/index.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9ded97730524102d868d9eea0c023e47f643b17090cdb302117584892e8b52b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 9): (anonymous) has cyclomatic complexity 16 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/test-settings-ui.mjs"},"region":{"startLine":2347}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f305e9b37b80cd94916426e3fdabe1750e30be60ea25ae891652388e426ae6a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 21): (anonymous) 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":"scripts/test-settings-ui.mjs"},"region":{"startLine":3640}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f5183ddea604d7bc1bb6f04258603e65c9c2608c3d83b43107c98c096d9230"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 14, cognitive 11): (anonymous) 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/test-settings-ui.mjs"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5be9f3d69661330c9351a29a605223f148b4f4284450cbf4e6f23257fafd7c3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function note (cyclomatic 13, cognitive 24): note 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":"extras/pecofence-promo/scripts/make-assets.mjs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"5def324d918730aeba06d7d3808befc96c4ce46129a4889071d880c15ba19362"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DesktopIcon (cyclomatic 13, cognitive 11): DesktopIcon 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":"extras/pecofence-promo/src/trailer/scenes/Opening.tsx"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32253022752c53b951bd1b296c866e9151c0a4989a6e797da110ede8184444d"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 11): (anonymous) 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/test-settings-ui.mjs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97aac77810325780fb050021620d665a926d8b13500b8a0031f0da12d584c69"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 10): (anonymous) 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/test-settings-ui.mjs"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"873388d0752f308a333b64ab0494cda950eacc733dcc1659afd69feb50b84602"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 13, cognitive 9): (anonymous) 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/test-settings-ui.mjs"},"region":{"startLine":2378}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55b504436b1aa45a3de1e8ef2ace9b9dea4d210225d093933ec8bf126b4cfeb"}},{"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":"scripts/test-settings-ui.mjs"},"region":{"startLine":3569}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4023e5a4a5eb9ccdcb676d997d83827a95697fb1d502ed167213b63d684b487"}},{"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":"scripts/test-settings-ui.mjs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"4161f50965ad3784bf12978718734f484814bf667fe713ce9f65ddf20493ef22"}},{"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":"scripts/test-settings-ui.mjs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"53864a7019f2d7e46b044c4d08dfbe316a24d7932e7f253dd85ebf892c1aaca3"}},{"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":"scripts/test-settings-ui.mjs"},"region":{"startLine":2488}}}],"partialFingerprints":{"codehealthFindingId/v1":"97878cb6783d9eca47c6e161a7bcbfc13522d68b3c0044e9ac65c7a86c83f901"}},{"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":"extras/pecofence-promo/src/trailer/scenes/Opening.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f8b51db24052b7183d520497bd056c4047e4fea649aa0317b975ebef16c82e"}},{"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":"extras/pecofence-promo/scripts/make-energy-audio.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64be296c4f745bad4cd400df819baf44bddb4f6be3aa1c821e8717d891ee96b"}},{"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":"extras/pecofence-promo/src/trailer/scenes/Agent.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d70ae9df1ac3161add0354997846cf683e9f46597b7c29c8619c61e8bd8f469"}},{"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":"extras/pecofence-promo/scripts/make-assets.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67bd4ac0f080aa2cedadd86be050ded60f6c2a2e342ec6235dbcc10aee45788"}},{"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":"extras/pecofence-promo/src/trailer/TrailerFilm.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd17498dfb9677a57eaf1595952f0faa723cb4cd3e8045033a123f17abed618"}},{"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":"extras/pecofence-promo/scripts/prepare-isolated-build.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9b7a0ab5ca26780ccb83f65c02e7190e6e4a0a776affc72483fab274afdd3d"}},{"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":"extras/pecofence-promo/src/trailer/scenes/AutoSort.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"19dec1369376cc7ace918aae90c90daee5121832de66deeed4b6bcb2a40ccfb3"}},{"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":"extras/pecofence-promo/src/trailer/Type.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9c678389f21b3cb49e0c0c3b99970423797456b710ef8086fe90f10f41b750"}},{"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":"extras/pecofence-promo/src/design.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97e829942da2be3756e3d6003600b41b58bf09b0fd9c80d1bbf674915c61001"}},{"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":"extras/pecofence-promo/src/trailer/Stage.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da455286118a1d9b9cd75495bcdcbb38416f12df929413b6df62a9d9929c5a6"}},{"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":"extras/pecofence-promo/src/trailer/scenes/Tabs.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"90af21323b8d92e315013b9029fba58cf5e0d409a977792af79c5bac6a511601"}},{"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":"extras/pecofence-promo/scripts/render.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e12d871b4b4f0d986c0b2fae04c041f8e88449d6e4460ba1cdf25e68d3a2394"}},{"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":"extras/pecofence-promo/src/trailer/scenes/EndCard.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfadd75abb5dee0a5ec848f139853e8f96f75ded8f329802f6c0817877a1472c"}},{"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":"extras/pecofence-promo/scripts/prepare-autosort-media.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8442a0410893561304a64edf1d32c0dc3fa7e550f16e78af93d85a9547b94df"}},{"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":"extras/pecofence-promo/src/trailer/timing.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2d8f581c5aa8f79f28d61e4beea741a097caebd42b991105e6619037bacb6b"}},{"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":"extras/pecofence-promo/src/motion/TechField.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ad6ef8436d5103a82bc05947b1f61e69b7615330a7e2f8c4345a5f83417da94"}},{"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":"extras/pecofence-promo/src/features/common.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"650e083cbd3f25309a8404353283e98473dd2a471357ac6ff0ff1f5ad6783617"}},{"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":"extras/pecofence-promo/scripts/finish-trailer.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8adbf15a11f61414a8444f32780f2b64f6e5002e7c0f710be00e05f9b51f2ae"}},{"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":"extras/pecofence-promo/src/motion/Groups.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8094fd9bed9d49f90bbac602e851df52b9a066399a3397dbc17e023bebe2959e"}},{"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":"ui/i18n.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33dabf8b5b7e1aa1a3dbb6bc459559419cb0ed7b867c27d73813fa65a1186443"}},{"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":"extras/pecofence-promo/src/motion/Tabs.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d859f80c01a8d30318b444853f9936efc77a5ec2c8c76a10c82c0296ca30306"}},{"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":"extras/pecofence-promo/src/motion/Closing.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30251982c6e07bc47829bbfe59ee3df4541461f25f2cc2e169c4dbb1cbdeedf"}},{"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":"extras/pecofence-promo/src/motion/Hero.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"618e8015eea6c85c66e28a6e3656401edac1ca2d75b4efc317a16bfde846963a"}},{"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":"extras/pecofence-promo/src/motion/NewFiles.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a312fc377a782f9d2a45087e973c5ed416d50f5c67fa62af3513ef87caff677"}},{"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":"extras/pecofence-promo/src/Root.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"241ca60f18f6f4cdc1f96042070dd78df7e8af5bdf8cc45c27dc7e50ade47419"}},{"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":"extras/pecofence-promo/src/launch/shared.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"767975fe20f06f53e5b3334f241560ce77f36be944fa8e7272d1e5b753abf161"}},{"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":"extras/pecofence-promo/src/reviewed/FileAccess.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad4837fcccdbdc14ff0fef7aed01a05133a4bfbc8d3038113649d8d04bf240c"}},{"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":"extras/pecofence-promo/src/scenes/Organize.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4037cd24fc8290333cdcfa025fe7f139ca24ad3cd8f7b863ad8b873e69b2e8e4"}},{"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":"extras/pecofence-promo/src/scenes/Intro.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba7d9fa846cc33dfe0c5b51c48b3ab32340f97dbe9fa3abe85e566b0aff5f6b"}},{"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":"extras/pecofence-promo/src/motion/Backdrop.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23bebe558a294ace33be59abb71bd0110c05cd918988ee73047c4ea8a977ecc8"}},{"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":"extras/pecofence-promo/src/launch/Closing.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a243e7dfbe8809e66af07ae396d1b70c3f080ea693d56a807df9a8fae7198aa5"}},{"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":"extras/pecofence-promo/scripts/prepare-launch-media.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15529a294f6798ad7eaa865f1c9cd9888e6ab588f54b38c3d0355e92307054ac"}},{"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":"extras/pecofence-promo/src/features/Bookends.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8aac241c815ab86f685b7846e1811f1576de81fd3491a02e044ef1105f60e7"}},{"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":"extras/pecofence-promo/src/launch/WithinReach.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6279100d36d9dae001203767d263daec4c5d12cbd70f1bf55c19ea84df9d4be7"}},{"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":"extras/pecofence-promo/src/scenes/Glass.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c05e0184c4ff01ac09a30bda00a08738619319b11bffbe55f919ca35d7e69df"}},{"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":"extras/pecofence-promo/src/scenes/Outro.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36ded79d59cfa2e4a04d51b8c3552f525d0e68bc40e1dec0d2e1012a9d284544"}},{"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":"extras/pecofence-promo/scripts/prepare-motion-media.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7d337001da4ce302d4322d9d658942cbee5b5f46496116d53d3cc2fbe18d76"}},{"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":"extras/pecofence-promo/scripts/prepare-reviewed-media.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8472343c52d2f42c518b1ead0742aa91890ad9ac96bef1946b5b4378bb5ad1"}},{"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":"extras/pecofence-promo/src/motion/MotionFilm.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1523fa11409248bed0c0e4792f9663cc396201af499cb4602d298014a56fb085"}},{"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":"extras/pecofence-promo/src/reviewed/EndCard.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4c8b01919284e9a0ad120a7974e2f08692d80a12f8207f662419d7d5a24b7d"}},{"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":"extras/pecofence-promo/scripts/prepare-feature-media.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e914c422cb89328ea4be84239e0d5af0a93b7d51b403f5a57348621cd41b114e"}},{"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":"extras/pecofence-promo/src/reviewed/ProjectTabs.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62ffd3be3cd3fe4c71eb940a18fa16143ffb93bd71d22096953402423307e12"}},{"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":"extras/pecofence-promo/src/scenes/Tabs.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e00a9edc8d99536190f06bf766f156a84e238c559399f031ba615074bb2206e"}},{"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":"extras/pecofence-promo/src/launch/LaunchFilm.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7109431792f85f05559fb5553eaa7536b2df63f470c6abce2a78de31ecbc30e2"}},{"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":"extras/pecofence-promo/src/motion/NativePanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bf315743d4e09f9aaf90e9608f5ef95bc4394c2d976d0a5ce91ae903e516e5"}},{"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":"extras/pecofence-promo/src/Promo.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed2d962495379e878a73cebc77fdf16bfc73b6c9b7bc5bc49e81fe576e1451f"}},{"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":"extras/pecofence-promo/src/motion/ScanGate.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2092f8b10284edf972ab9f1486277b5990e0653357f039a018588c492eaa0cc"}},{"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":"extras/pecofence-promo/src/launch/Opening.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1603f27b2550645298db50f5adcc3b47ae5b3a9715f12f5f10785a606b988b"}},{"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":"extras/pecofence-promo/src/scenes/Focus.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f752e98cd9d5e513b7d2ded4bb4bde71d400ce48791609991ff061853001ff04"}},{"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":"extras/pecofence-promo/src/launch/Beauty.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25605c9e36daf232d09e48dbdf309f6c5e1ff4968cbae1edbac317aea34a4dd4"}},{"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":"extras/pecofence-promo/src/motion/FileSignals.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d6bf917f58f170e6c7d9127571bdb09335d188dfa71f3e5e944bd129b0574f"}},{"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":"extras/pecofence-promo/src/features/FeatureFilm.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"692495b2e1a3a3088a39c141bce39ec9c1f264412ddf251c151c7b0f0603b41f"}},{"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":"extras/pecofence-promo/src/reviewed/Grouping.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a781141448329606e40a56ea8568011ad3d5fe1f3eb2d3c736dbe8c78961868f"}},{"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":"extras/pecofence-promo/src/motion/BrandMark.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a12bf2ac13ce9243c8cb3ca06987495c80352dd34901256b69ea1afc1dce4a4"}},{"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":"extras/pecofence-promo/src/motion/InstrumentFrame.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6734749e91171002ab06a8562840cb9a5e376b955eda893de0a7ec7f87adc1ae"}},{"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":"extras/pecofence-promo/src/reviewed/Introduction.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c865a704cccd32277fc2e4dd72f608820dbed7275047a35cdddb60e29137a4f1"}},{"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":"extras/pecofence-promo/src/features/Rules.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ba549e17a95b7fa5fcab894ffe38ce1c3f65b758ae61ac9677c93cdfa252cc"}},{"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":"extras/pecofence-promo/src/trailer/targets.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75de5143f7d11f1e4d0b24a034e985c7d03ac2d9592bb7fcea087caced8c9f4"}},{"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":"services/usage/src/index.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7ba5703c1507e475afea828777a988e9a255c4d3f136121de3789270e1f10a7"}},{"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":"extras/pecofence-promo/src/features/Hide.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2872ef1264733597297b80c960ca780178446c2f77697b5bbbb8aee713b2ae96"}},{"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":"extras/pecofence-promo/src/features/Portal.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c34a051cd28afccd8a66a8244fb0c32224b8da3684f2c01e49b10314bb37d7"}},{"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":"extras/pecofence-promo/src/features/Peek.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ee9ff88c424b868957c8bbd0afcd610793ec08f619c51a65ef55f9d064350a"}},{"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":"extras/pecofence-promo/src/features/Groups.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac7e853f930797f4dd34fcb373555224d942837510590b0e944c67ddab34b8e"}},{"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":"extras/pecofence-promo/src/features/TabsDemo.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a80e35ef06dd820142d6e4520c55ce8fc113c4d8dc74058614a9b189897954"}},{"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":"extras/pecofence-promo/src/launch/Workspaces.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3d098f50c5b8fd172ab6cd219a8ed9030e0b240842334bae04b8dd1366d2bd"}},{"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":"extras/pecofence-promo/src/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6e0bc80d1c07d9e7f44c6668808006c4a4b8a1fd5383c85df1b8716697b966"}},{"ruleId":"R6","level":"warning","message":{"text":"This package\u0027s lint script runs in no CI job: The package in \u0060extras/pecofence-promo\u0060 declares the lint script \u0060lint\u0060 (\u0060eslint src \u0026\u0026 tsc\u0060), but no step of this repository\u0027s CI runs it, by name, through another script, a Makefile target or a workspace runner, and no CI step runs the linter over the package itself. The rules it sets are enforced nowhere a pull request can fail. Run it in CI: a step that runs \u0060npm run lint\u0060 in \u0060extras/pecofence-promo\u0060 (or the workspace\u0027s task runner)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extras/pecofence-promo/package.json"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ce93f0bf005ea2971683fff4f413f168dcc65f0112e31574bf0177b757f8e2"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~101 LoC): no import path from any entry point (17 application, 3 tooling, 3 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":"extras/pecofence-promo/scripts/prepare-isolated-build.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d1d900fc217163ccb124cd37ca3a53cd39407c41824a502710e3905722c9ad"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~38 LoC): no import path from any entry point (17 application, 3 tooling, 3 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":"extras/pecofence-promo/src/reviewed/FileAccess.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd846ae7c9fa8bb9aa0c2872d9376b962604cb7d869d5e3b7bd7ca5b6225c729"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~31 LoC): no import path from any entry point (17 application, 3 tooling, 3 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":"extras/pecofence-promo/src/reviewed/EndCard.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad0c65abf7d5e1a7ddc00930d639aa982ea59dc16cc9f1d687e907619430587"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~30 LoC): no import path from any entry point (17 application, 3 tooling, 3 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":"extras/pecofence-promo/src/reviewed/ProjectTabs.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed86ce165609d6b1551f1aecda6e480d717d5718bac267335d849f4107af01e4"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~19 LoC): no import path from any entry point (17 application, 3 tooling, 3 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":"extras/pecofence-promo/src/reviewed/Grouping.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51675b8e2e3eeb0c9a6bebdc7928e5fdcef1ec03d6dc3c058aff8cef069f97c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~17 LoC): no import path from any entry point (17 application, 3 tooling, 3 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":"extras/pecofence-promo/src/reviewed/Introduction.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4091098cbe1a3e6582abf16ba3915c8597bed054a5a0f702c85cfddaa57d794"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027f\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extras/pecofence-promo/src/trailer/timing.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6645cb67b3405131328d5dec43fe3cfcd6a11464b36a8ce18bba067f030948a"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@remotion/tailwind-v4\u0027: Declared in extras/pecofence-promo/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"extras/pecofence-promo/package.json"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"068eeb540d701cf433a3e398e46a0f36b5d44542a82d21f2383e919932358494"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!front.0.is_null() \u0026\u0026 desktop::window_pid(front) != pecofence_platform::process::current_pid()\u0060 appears character-identically in 2 files \u2014 crates/app/src/app/search.rs, crates/app/src/fence_window/handler/timers.rs. It is one line, so the duplication detector\u0027s token 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/app/src/app/search.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"190a47c42a0c45b10a635b6cf5582084346e026184a9e60b08d3a552adb0039c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(o.x - c.x).abs() \u003E 0.5 || (o.y - c.y).abs() \u003E 0.5\u0060 appears character-identically in 2 files \u2014 crates/app/src/fence_window/desktop_layout.rs, crates/app/src/fence_window/items.rs. It is one line, so the duplication detector\u0027s token 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/app/src/fence_window/desktop_layout.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8c818be9ddd9860020ef71e50557282b746ac3b2a15d4ec9ebe979d14003e4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060a.x \u003C b.x \u002B b.w \u0026\u0026 b.x \u003C a.x \u002B a.w \u0026\u0026 a.y \u003C b.y \u002B b.h \u0026\u0026 b.y \u003C a.y \u002B a.h\u0060 appears character-identically in 2 files \u2014 crates/app/src/layout.rs, crates/cli/src/run.rs. It is one line, so the duplication detector\u0027s token 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/app/src/layout.rs"},"region":{"startLine":2627}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb449ea1f466206a480927b75ffb554a992b6b89043be91d6dcccae67f9c18fa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060progman.0.is_null() || class_name(progman) != \u0022Progman\u0022\u0060 appears character-identically in 2 files \u2014 crates/platform/src/desktop.rs, crates/platform/src/live_wallpaper.rs. It is one line, so the duplication detector\u0027s token 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/platform/src/desktop.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"9231d4e4308c309b6f547f4f925e464bd50366501218453d48065e5b2ced32cc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rect.right - rect.left \u003E= MARQUEE_MIN_PX \u0026\u0026 rect.bottom - rect.top \u003E= MARQUEE_MIN_PX\u0060 appears character-identically in 2 files \u2014 crates/app/src/anchor.rs, crates/app/src/app/group.rs. It is one line, so the duplication detector\u0027s token 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/app/src/anchor.rs"},"region":{"startLine":1840}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a588b33a942b6d117840f1da4e560e8ecb603059e107ab904ee4de9f72d685"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.rolled_up \u0026\u0026 self.roll_anim.is_none()\u0060 appears character-identically in 3 files \u2014 crates/app/src/fence_window/frame.rs, crates/app/src/fence_window/render.rs, crates/app/src/fence_window/scroll.rs. It is one line, so the duplication detector\u0027s token 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/app/src/fence_window/frame.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3464affad322f6b12bd4549fef1537c4043b0deb67b12c766c5862d57e5681a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.state.config.settings.hide_real_icons \u0026\u0026 !self.no_hide_icons\u0060 appears character-identically in 2 files \u2014 crates/app/src/app/mod.rs, crates/app/src/app/sync.rs. It is one line, so the duplication detector\u0027s token 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/app/src/app/mod.rs"},"region":{"startLine":2582}}}],"partialFingerprints":{"codehealthFindingId/v1":"b83c5f884bb83f8d1395a2815e56d2dc1dcd5dfc586f80474f771df18d8dcdf3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.window_for(fence) \u0026\u0026 w.active_fence() == fence\u0060 appears character-identically in 4 files \u2014 crates/app/src/app/fences.rs, crates/app/src/app/menus.rs, crates/app/src/app/portals.rs, crates/app/src/app/tools.rs. It is one line, so the duplication detector\u0027s token 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/app/src/app/fences.rs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"896435096f342249602ad1409dec402a94e3070310fbb0ee005322bc91aae3d2"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060x \u003E= r.left \u0026\u0026 x \u003C r.right \u0026\u0026 y \u003E= r.top \u0026\u0026 y \u003C r.bottom\u0060 appears character-identically in 2 files \u2014 crates/app/src/fence_window/hit.rs, crates/app/src/settings_host.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/app/src/fence_window/hit.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95fdd1ee7536ef84957908b907ccc0fcfe1683221cea1114396c26153ca2d69"}},{"ruleId":"X5","level":"note","message":{"text":"Nullable reference types not enabled everywhere: 0/3 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 Err: \u0060on_getdragimage\u0060 turns every \u0060Err\u0060 into \u0060Some(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":"crates/app/src/fence_window/handler/misc.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef74ae47e96f95e25d74a924efc41a5b81cda5b6206c41479364473c8eaaca9"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060render\u0060 turns every \u0060Err\u0060 into \u0060\u0022null\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/cli/src/output.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"863759082c46a3f8785b6184882d63567bf2585165c690ae934fe4589fe680e7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060describe\u0060 turns every \u0060Err\u0060 into \u0060\u0022unreadable\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/platform/src/clipboard.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dc915e3fc7dfcf878669d753c406b482e6cc9291faf34c5edb1ab13c169a6a5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060fit_lines_counted\u0060 turns every \u0060Err\u0060 into \u0060Some(1)\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/render/src/text.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b38d1f22204b0439ae7494cc82fe24431fa88fb4f708e717d602758922001a"}}],"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-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-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"Files or Directories Accessible to External Parties","shortDescription":{"text":"Files or Directories Accessible to External Parties"},"helpUri":"https://cwe.mitre.org/data/definitions/552.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-88","guid":"32dec161-013d-ac58-8599-1309e12e67f5","name":"Improper Neutralization of Argument Delimiters in a Command (\u0027Argument Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Argument Delimiters in a Command (\u0027Argument Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/88.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"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":66,"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."]}]}