{"$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":"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":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"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":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"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":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"IC1","name":"Incompleteness \u0026 stubs","shortDescription":{"text":"Incompleteness \u0026 stubs"},"helpUri":"https://codehealth.canine.dev/dimensions/IC1"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"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":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"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":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"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":"Buffer::fill (cyclomatic 93): Buffer::fill has cyclomatic complexity 93 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/program.rs"},"region":{"startLine":2931}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2f13ca6eb754b5539c4973a92b514be71806142f7304fd0159695094d0b3a9"}},{"ruleId":"D1","level":"warning","message":{"text":"CharacterBuilder::poll (cyclomatic 81): CharacterBuilder::poll has cyclomatic complexity 81 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/mod.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd8906eaef4b08a31e99d178d18bd018049364e60f45f5e79ed7d74bf6f50c9d"}},{"ruleId":"D1","level":"warning","message":{"text":"Rendered::poll (cyclomatic 71): Rendered::poll has cyclomatic complexity 71 (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":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab8ee6205428441568c3138009665f47ea82518be9b2933558e6d72432e0a80"}},{"ruleId":"D1","level":"warning","message":{"text":"SetupWindow::draw (cyclomatic 70): SetupWindow::draw has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/setup.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"0220d775114be109255d8749a3167563c51cfd8cb67cfa8bce958346c888c006"}},{"ruleId":"D1","level":"warning","message":{"text":"Scene::details_ui (cyclomatic 61): Scene::details_ui has cyclomatic complexity 61 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":4866}}}],"partialFingerprints":{"codehealthFindingId/v1":"082610a8e0b0f39c63d003f68b1934576b22833d0f9662081edb7d7859b981f5"}},{"ruleId":"D1","level":"warning","message":{"text":"Buffers::pass (cyclomatic 61): Buffers::pass has cyclomatic complexity 61 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":4022}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeffebdeed02a4d8c23d12fea01461f281e5fcefc3118b34fe02c36c270d8ab2"}},{"ruleId":"D1","level":"warning","message":{"text":"shadermerge::merge::merge (cyclomatic 56): shadermerge::merge::merge has cyclomatic complexity 56 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shadermerge/src/merge.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f6178dd61ec94dbfbde84c543a6560a0355a71f56eed60da615011ce62ade3"}},{"ruleId":"D1","level":"warning","message":{"text":"Scene::translate (cyclomatic 54): Scene::translate has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":3590}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22e31563359d6bff177bad234866335ec6bc872ffbebf26a0570b0003e37901"}},{"ruleId":"D1","level":"warning","message":{"text":"luadec::read::sticky (cyclomatic 53): luadec::read::sticky has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"luadec/src/read.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4324cc5c04bc6de784729ca03a8e1a6e90d3422a05ec8cd204eb10f6554dc02"}},{"ruleId":"D1","level":"warning","message":{"text":"Preview::info_ui (cyclomatic 53): Preview::info_ui has cyclomatic complexity 53 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mod.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f13c5d59a18ba95e671f175e84c18c7074d9273c7a847d8e5a69e3cec1fc7ea"}},{"ruleId":"D1","level":"warning","message":{"text":"CharacterBuilder::side_panel (cyclomatic 50): CharacterBuilder::side_panel has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/mod.rs"},"region":{"startLine":2637}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2eeee7a0e9288ca686fbb90ca0b636d4585b9fc89ab283539e1e1e586e10f3"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader::walk (cyclomatic 49): Reader::walk has cyclomatic complexity 49 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"luadec/src/read.rs"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"91209d2095412d5070f7b876356024918ea16a42e94c6326b7ce7c3f2111eadb"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer::assets::viewers::layer::payload (cyclomatic 45): viewer::assets::viewers::layer::payload has cyclomatic complexity 45 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/mod.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d21c607076ed800271278bffd4f5a61290e46f48cb8aaf0738038dc887d4ec"}},{"ruleId":"D1","level":"warning","message":{"text":"App::draw_menubar (cyclomatic 41): App::draw_menubar 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":"viewer/src/app.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"432d473585a9bc657a9fdb4296b72f2c4ada021f5dcaac26468c0a264abcad66"}},{"ruleId":"D1","level":"warning","message":{"text":"CharacterBuilder::appearance (cyclomatic 41): CharacterBuilder::appearance 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":"viewer/src/character/mod.rs"},"region":{"startLine":1955}}}],"partialFingerprints":{"codehealthFindingId/v1":"811d1bb1577b9628895cca08814e625fcc1cb3e95871d7f524a1405f871a9c59"}},{"ruleId":"D1","level":"warning","message":{"text":"Builder::step (cyclomatic 40): Builder::step has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shadermerge/src/canon.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"0319803b3b75a86d9232f250208679d607f025dbe1ca5724371d19db7c60ad5f"}},{"ruleId":"D1","level":"warning","message":{"text":"Renderer::render (cyclomatic 40): Renderer::render 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":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb4d5e12710df7c822d86cd695970e525342460a7109fa68a067b594b2eb2a3"}},{"ruleId":"D1","level":"warning","message":{"text":"Rendered::details_ui (cyclomatic 38): Rendered::details_ui 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":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":3697}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfa18268f6e1801c26d9fc24db6a75ccabe32e7218c0f704f525a8dd86ffd98"}},{"ruleId":"D1","level":"warning","message":{"text":"shadermerge::factor::factor (cyclomatic 36): shadermerge::factor::factor has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shadermerge/src/factor.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ff87d1fd73af4874be665b5d9a27c856cc125ac4a286e637d74e794677a2c2"}},{"ruleId":"D1","level":"warning","message":{"text":"Scene::viewport (cyclomatic 36): Scene::viewport has cyclomatic complexity 36 (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":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":4244}}}],"partialFingerprints":{"codehealthFindingId/v1":"254ca9893d55e7c1d0fa3b0467c9c1e63b6b7408ef51d417c5bd8776fd360398"}},{"ruleId":"D1","level":"warning","message":{"text":"EditableSchema::draw_internal (cyclomatic 35): EditableSchema::draw_internal 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":"viewer/src/editable_schema.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"4122cbc62fa76169bdf219de8ae3aa348c22aa81da16a2f62615439cc81de719"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer::assets::viewers::mdl::export::gather (cyclomatic 35): viewer::assets::viewers::mdl::export::gather 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":"viewer/src/assets/viewers/mdl/export.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"efdb685567a81ca895a4fd853d547e709b4ef967ca7863d7ea43ff5e51a77fa0"}},{"ruleId":"D1","level":"warning","message":{"text":"Scene::load_asides (cyclomatic 34): Scene::load_asides has cyclomatic complexity 34 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":2483}}}],"partialFingerprints":{"codehealthFindingId/v1":"95954a1c54b1944408f5a8324228fc0bbd65a88ac8a332b449988d61324fb92a"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer::assets::viewers::layer::ui (cyclomatic 34): viewer::assets::viewers::layer::ui 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":"viewer/src/assets/viewers/layer/mod.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"58b342ab0a23fe057c1c9cf8b786875d0f6ac4363fc3c595c882ad1fa5c3c138"}},{"ruleId":"D1","level":"warning","message":{"text":"smoke.main (cyclomatic 34): smoke.main has cyclomatic complexity 34 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 12 belong to 6 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/smoke.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0fb879a8f2815d99e6542f9713f988fb1df45d46f1b070a07e8bda1336e123"}},{"ruleId":"D1","level":"warning","message":{"text":"AssetBrowser::detail_panel (cyclomatic 33): AssetBrowser::detail_panel 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":"viewer/src/assets/mod.rs"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c74409e415d86212dfca0b9d6b14dcc727594709a34f2a8ea801552eb98240"}},{"ruleId":"D1","level":"warning","message":{"text":"App::draw_sheet_data (cyclomatic 32): App::draw_sheet_data has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc9cf99f79ee39c18465771e5d500ad8bf1eaf2266cc257045970dce4675262"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer::assets::viewers::shpk::list::ui (cyclomatic 32): viewer::assets::viewers::shpk::list::ui 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":"viewer/src/assets/viewers/shpk/list.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d81424c33e7036d2ef701c09fad172e74d858410828368936e466f0ebd0968"}},{"ruleId":"D1","level":"warning","message":{"text":"GoToWindow::draw (cyclomatic 31): GoToWindow::draw 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":"viewer/src/goto.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"05bd5f8202e5197310ebca13980ce2a20a5d49af3e81222b248ce6e3243695df"}},{"ruleId":"D1","level":"warning","message":{"text":"Rendered::viewport (cyclomatic 30): Rendered::viewport has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":2373}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b06c002884efb3be92b1cf56a2f400f5e2a00f7e754804b0db668dbb0cc91a"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer::assets::viewers::uld::canvas (cyclomatic 30): viewer::assets::viewers::uld::canvas 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":"viewer/src/assets/viewers/uld.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7367e95ef4b9e67ebd278d01ca3ce0cca1b05310abf1489e571aba3c5e2686f"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer::assets::viewers::shpk::keys::read (cyclomatic 29): viewer::assets::viewers::shpk::keys::read has cyclomatic complexity 29 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/shpk/keys.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f099462bc3a5b082dea010ab02bc92b4b35d0ee2801fca72080f8b5f15d8b3"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer::character::appearance (cyclomatic 29): viewer::character::appearance 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":"viewer/src/character/mod.rs"},"region":{"startLine":2970}}}],"partialFingerprints":{"codehealthFindingId/v1":"b527e299ebfea14eb5067b2a2354ef31d3e2247c1fce1da6c5400a1e1cee679e"}},{"ruleId":"D1","level":"warning","message":{"text":"shadermerge::merge::preprocess (cyclomatic 28): shadermerge::merge::preprocess 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":"shadermerge/src/merge.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"297889f9d0072497ea0ada7ec31db67ebd1e48addda3f7c12db2605b1a5d431e"}},{"ruleId":"D1","level":"warning","message":{"text":"Renderer::leg (cyclomatic 28): Renderer::leg 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":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"9474915fbf72e1c26c9a82d5c3ba6fc360a929992ad832bb1248c085e536812d"}},{"ruleId":"D1","level":"warning","message":{"text":"Scene::motion (cyclomatic 28): Scene::motion 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":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b1ad48af432babf327b79cb4d4719cea221e5b6e4b6df6fcee0db7d59052b1"}},{"ruleId":"D1","level":"warning","message":{"text":"PrWindow::draw (cyclomatic 28): PrWindow::draw has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/pr_window.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca7fa9bc5671f89e140c8029635204e155f1079c6e308500c6fd4f7cec48631b"}},{"ruleId":"D1","level":"warning","message":{"text":"perf.main (cyclomatic 28): perf.main has cyclomatic complexity 28 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 10 belong to 8 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/perf.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"c454371e426b3d3838aaeb72b1dadff9005126bc9b6c3c71c41a178af94fc601"}},{"ruleId":"D1","level":"warning","message":{"text":"SqpackWorker::received (cyclomatic 27): SqpackWorker::received 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":"viewer/src/worker/sqpack_worker.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"36cbedfbf9a3706b389ff80001f7d4789b7839375369dedb2239d7d1c0da339e"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer::assets::viewers::mdl::ui (cyclomatic 27): viewer::assets::viewers::mdl::ui 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":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a887aa8187cef4d83ab7806ec69c2345a3b504cf741f1b950b2b11bc611f5d8"}},{"ruleId":"D1","level":"warning","message":{"text":"Scene::load_packages (cyclomatic 26): Scene::load_packages 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":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":3136}}}],"partialFingerprints":{"codehealthFindingId/v1":"35191fefd3bdec480af7cf12635f987ad9e59ca9cdf1246f0d418086f5ca10c4"}},{"ruleId":"D1","level":"warning","message":{"text":"Cast::poll (cyclomatic 26): Cast::poll has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/stand.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dea2602ede7a7bf84776a8b5d10e6df555a2886fb06273ea132e74a91236da1"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph::build (cyclomatic 26): Graph::build has cyclomatic complexity 26 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/quests/graph.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d6ccbfcf82ddfcf7bef0c8be81a510a12a6711dadeac2c7731aa1cc821d3d5"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer::assets::viewers::uld::properties (cyclomatic 26): viewer::assets::viewers::uld::properties has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/uld.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"94107aabe0e5ce97cad3652e030eaea9376468aea5f4442090cb4a5a75665ea3"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer::quests::rewards::ui (cyclomatic 26): viewer::quests::rewards::ui 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":"viewer/src/quests/rewards.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"df70e152b8ac7f88d24d78aeaf771c849e1affac8b91a70639b00bfe94e2af93"}},{"ruleId":"D1","level":"warning","message":{"text":"Cue::poll (cyclomatic 25): Cue::poll has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/emote.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"b964ef27ee531d55d3f8029322def3476686fcaa9dd74f1004d576e0ed426c97"}},{"ruleId":"D1","level":"warning","message":{"text":"MusicPlayer::draw_player (cyclomatic 25): MusicPlayer::draw_player 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":"viewer/src/music.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"175e00fa4cf22815739896309d237d22ac447c5b33f65a419d09fc9f4adeb1f1"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer::assets::viewers::cutb::play::ui (cyclomatic 25): viewer::assets::viewers::cutb::play::ui 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":"viewer/src/assets/viewers/cutb/play.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"200564ca902b538e1867e7762c55dafbc18def37827771cd9914cf2c5acbdffe"}},{"ruleId":"D1","level":"warning","message":{"text":"Synth::survey (cyclomatic 24): Synth::survey 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":"shadermerge/src/synth.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcfe2947d323c0b37b80f9c4a0e05c2666f75edbeb402297c46b0002277b99ac"}},{"ruleId":"D1","level":"warning","message":{"text":"Synth::build (cyclomatic 24): Synth::build 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":"shadermerge/src/synth.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffe57fcdd17151007c5c5d1b3bc9c9733d41404d1a4878a60e47c832dbd10128"}},{"ruleId":"D1","level":"warning","message":{"text":"App::draw_sheet_list (cyclomatic 24): App::draw_sheet_list 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":"viewer/src/app.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7e875bfa679e3854e3dbf631ab31e307bbaab3629a13c1947bffdab568f105"}},{"ruleId":"D1","level":"warning","message":{"text":"AssetBrowser::draw_search (cyclomatic 24): AssetBrowser::draw_search 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":"viewer/src/assets/mod.rs"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91d5868a2bb6aab0ca78b2d957df15329c6bfc3afd8ba111c2c7978341d289c"}},{"ruleId":"D1","level":"warning","message":{"text":"Scene::walk (cyclomatic 24): Scene::walk has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":1647}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e7876996ec89129c5a8c4188918e34ba7c42e5a279525f179f809f7c89613a"}},{"ruleId":"D1","level":"warning","message":{"text":"Animation::walked (cyclomatic 24): Animation::walked 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":"viewer/src/assets/viewers/mdl/skin.rs"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"0db90308161b65c3168d3711cdc5fe8d647e4f59dacaa35e148c544ab2962040"}},{"ruleId":"D1","level":"warning","message":{"text":"SmokeApp::ui (cyclomatic 24): SmokeApp::ui 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":"viewer/src/smoke.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"416b885cbc9edc6bdfa457cc59f73f11c56b735e77581e843684b8be1125e087"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer::assets::viewers::mdl::read_level (cyclomatic 24): viewer::assets::viewers::mdl::read_level 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":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98bad932ba42194d65b34b15a69bf8f3485e450ad252c0e810b46e24edcf9b6"}},{"ruleId":"D1","level":"warning","message":{"text":"Synth::value (cyclomatic 23): Synth::value 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":"shadermerge/src/synth.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde927c5186fd7441b6c1f6f26ca4bd36745d1aa8432d73264e149a7f93df90c"}},{"ruleId":"D1","level":"warning","message":{"text":"Worn::shows (cyclomatic 23): Worn::shows 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":"viewer/src/character/gating.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4334044dc3642714a311cdd48b91edf0922501349304324e63effaa7a2d8f30c"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer::assets::hex_dump (cyclomatic 23): viewer::assets::hex_dump 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":"viewer/src/assets/mod.rs"},"region":{"startLine":2763}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f26fb841684e1d9672ea659f473df81d53bf437901bb5f09d6975245409ff1a"}},{"ruleId":"D1","level":"warning","message":{"text":"smoke.decodePng (cyclomatic 23): smoke.decodePng 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":"smoke/smoke.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b0cadcf7f9871145c050888f8402d7b89bd4cafc07e850ee52ed86df0fc3be"}},{"ruleId":"D1","level":"warning","message":{"text":"CharacterBuilder::slot_ui (cyclomatic 22): CharacterBuilder::slot_ui has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/mod.rs"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4276be4254a4edac7fd085d141f704932edfec62eee72dbd319b74f54fa6b4"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer::character::menus::pieces (cyclomatic 22): viewer::character::menus::pieces 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":"viewer/src/character/menus.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e2fe00ec6c10cc599f44d9eac98a297309b35419fba1d5897c48d1379e385c5"}},{"ruleId":"D1","level":"warning","message":{"text":"Rendered::translate (cyclomatic 21): Rendered::translate 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":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":3129}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5d06fd75ccc5104827fcf03348226d6a23b9da3fb7c814804ced25a93b3e67"}},{"ruleId":"D1","level":"warning","message":{"text":"Worn::covers (cyclomatic 21): Worn::covers 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":"viewer/src/character/gating.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"032b2eb1bb64c9793694f02c6e664ea44ce98fc6a8c78fb8ed1ec8fd7eb6bb64"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer::assets::viewers::uld::tree (cyclomatic 21): viewer::assets::viewers::uld::tree 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":"viewer/src/assets/viewers/uld.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e66ac0ba8396ac85ad12ab29fe023a6e6675fb90ff016a924c6477440b92590"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer::assets::viewers::zone::envs::ui (cyclomatic 21): viewer::assets::viewers::zone::envs::ui 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":"viewer/src/assets/viewers/zone/envs.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"38cf800e1f6257e22de3a5020ba26f3359d8a73c1d1cd02ee98de580e394b840"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer::quests::dag::ui (cyclomatic 21): viewer::quests::dag::ui 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":"viewer/src/quests/dag.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae9feb6286000872ce9caf283c9e08708e516e9d533421b068c4780a9496ef3"}},{"ruleId":"D1","level":"warning","message":{"text":"index.pipeline_state (cyclomatic 21): index.pipeline_state 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":"smoke/walk/index.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a7feb55e1da707087913ba4787197e1a0df7e9ad043c23ef97bddc86cce702"}},{"ruleId":"D1","level":"warning","message":{"text":"framediff::run (cyclomatic 20): framediff::run has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"framediff/src/main.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a111f57b4d60c23fbf82e460281680b0d2b8e5781a1755182893c67fb33b218"}},{"ruleId":"D1","level":"warning","message":{"text":"luadec::expr::write_stat (cyclomatic 20): luadec::expr::write_stat 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":"luadec/src/expr.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3032c1c82ec61c3de6f3e75ecd87036bb34c332c6fd4f048c297b84e75fe3fd"}},{"ruleId":"D1","level":"warning","message":{"text":"Renderer::draw (cyclomatic 20): Renderer::draw 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":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3fce95a6e1f18c9e28cae04a0f0d951101113d0195718210b2b91acfe1d9941"}},{"ruleId":"D1","level":"warning","message":{"text":"Scene::load_textures (cyclomatic 20): Scene::load_textures has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":4038}}}],"partialFingerprints":{"codehealthFindingId/v1":"887a8f1f3150230c62ad18692a41086a107cfbb933ad548c450b65674a369c59"}},{"ruleId":"D1","level":"warning","message":{"text":"MusicPlayer::poll (cyclomatic 20): MusicPlayer::poll 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":"viewer/src/music.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"7413eb1d2c22e3c0326ab1bc57e20732d6e2bb033721b464505dd89ec9d2d4e0"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer::assets::viewers::avfx::sim::shading (cyclomatic 20): viewer::assets::viewers::avfx::sim::shading has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/sim.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"18043a6ea4632a010557b4d1b65eb94d09e84a792843481f8abf1796b3a55edd"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::write_bare (cyclomatic 19): Expr::write_bare 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":"luadec/src/expr.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"a878249fe116abdac5c08ad02be3c17d1740eb3d19498e6266ec76a33f7f92cf"}},{"ruleId":"D1","level":"warning","message":{"text":"Ambient::ui (cyclomatic 19): Ambient::ui 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":"viewer/src/assets/viewers/layer/scene/ambient.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7f5a5526aa70f842abc0b291c3dd425579234edc373eab42fba633c4c9ef92b"}},{"ruleId":"D1","level":"warning","message":{"text":"Buffers::attach (cyclomatic 19): Buffers::attach has cyclomatic complexity 19 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This is NOT this file\u0027s highest cyclomatic complexity: Buffers::engine (cyclomatic 22) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cbfcb38601e565a163c4c0658fd9291388fe7da61dc4dc2f33d7020478ecb5e"}},{"ruleId":"D1","level":"warning","message":{"text":"MessageQueue::new (cyclomatic 19): MessageQueue::new 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":"web/src/queue.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cdb633c3fe1aff77042f8647f94e3a3af40471001885f83d81f77bbde1e226"}},{"ruleId":"D1","level":"warning","message":{"text":"AssetBrowser::advance_scan (cyclomatic 18): AssetBrowser::advance_scan 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":"viewer/src/assets/mod.rs"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4bc37b1d87fbab5d5f548e9404b08c2f614be962062c426bd367eb649f29fb"}},{"ruleId":"D1","level":"warning","message":{"text":"Simple::at (cyclomatic 18): Simple::at 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":"viewer/src/assets/viewers/avfx/sim.rs"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ad9540ce2501d219df5209d42c6ad7edeb728cdbdadcfe5936be0b3fbfb487"}},{"ruleId":"D1","level":"warning","message":{"text":"Scene::rebuild (cyclomatic 18): Scene::rebuild 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":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":2263}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e68f2b269beed2ee8c8656070d28d1371e6420cdafca5de718f203fd3216c52"}},{"ruleId":"D1","level":"warning","message":{"text":"Effects::poll (cyclomatic 18): Effects::poll 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":"viewer/src/assets/viewers/mdl/effects.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6cf15b08136594966b72be1e29d5c7ed6d20f549ca11ca22e9ed7fad8d3ea41"}},{"ruleId":"D1","level":"warning","message":{"text":"IconBrowser::draw_detail (cyclomatic 18): IconBrowser::draw_detail 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":"viewer/src/icons/mod.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"938af25f7f53284624f1af441b1b6c99c6589f353e000e98db1c3a383ff328bf"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer::assets::viewers::avfx::tree_ui (cyclomatic 18): viewer::assets::viewers::avfx::tree_ui 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":"viewer/src/assets/viewers/avfx/mod.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"88be2fd0614ee924ed2a0fc0ee87f7234742456c72fd979135be634935b8e08f"}},{"ruleId":"D1","level":"warning","message":{"text":"shadermerge::merge::guards (cyclomatic 17): shadermerge::merge::guards 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":"shadermerge/src/merge.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"4edb757a88e7f9746e2400059c16c871e84988d3f57637bf23e4c07b84e47c30"}},{"ruleId":"D1","level":"warning","message":{"text":"Motion::at (cyclomatic 17): Motion::at has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"75fbaa9bff92f88bc60727866ce8e382989141f6b867616c1bc83fdf6612be60"}},{"ruleId":"D1","level":"warning","message":{"text":"Scene::want_blobs (cyclomatic 17): Scene::want_blobs 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":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":3282}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c31b6b4f99a2ce61d45483a12a87beca9f7c369497f200ccc026fa48c13f26"}},{"ruleId":"D1","level":"warning","message":{"text":"Program::stars (cyclomatic 17): Program::stars has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: viewer::assets::viewers::mdl::program::parameter (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/program.rs"},"region":{"startLine":2377}}}],"partialFingerprints":{"codehealthFindingId/v1":"59357ee5a0992e2e813a50f4ab3b174f0213f2bd4d1beda621d361ea516385fe"}},{"ruleId":"D1","level":"warning","message":{"text":"Program::assemble (cyclomatic 17): Program::assemble has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: viewer::assets::viewers::mdl::program::parameter (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/program.rs"},"region":{"startLine":2713}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d02d93f0f1b71c8341193faa97cd39a678c925ae513a389cfa63c8e01ab09f"}},{"ruleId":"D1","level":"warning","message":{"text":"IconIndex::build (cyclomatic 17): IconIndex::build 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":"viewer/src/data/mod.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72a89e0e1d1d254bee44a89f7663c9a785679f7d6f79ad58bcd17a79e9ea4c5"}},{"ruleId":"D1","level":"warning","message":{"text":"CellValue::show (cyclomatic 17): CellValue::show 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":"viewer/src/sheet/cell.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"577b5121ff345f2f034eb7d42ad1b2de7f337be6dcf8e6e5523476b16846e597"}},{"ruleId":"D1","level":"warning","message":{"text":"SheetTable::cell_ui (cyclomatic 17): SheetTable::cell_ui 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":"viewer/src/sheet/sheet_table.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"01545b6acbd7db73107d8c457faefff77a039e7a9df649d29788a8b77a51f691"}},{"ruleId":"D1","level":"warning","message":{"text":"ZoneBrowser::poll (cyclomatic 17): ZoneBrowser::poll 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":"viewer/src/zones/mod.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c635a9a2ed00a36c374dfd960b7b8acb2b8228acddd448ae37916258bda5a5"}},{"ruleId":"D1","level":"warning","message":{"text":"PathIndex::master (cyclomatic 17): PathIndex::master 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":"web/src/paths/mod.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"f842fb3cc51b9005745949836bea0410c1a92bae157c09e0c55765395079db28"}},{"ruleId":"D1","level":"warning","message":{"text":"probe.main (cyclomatic 17): probe.main has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/probe.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8f63176fe9ff529d29a0b50e23c52fbe05c26bf19c4689bbc9cb52147bce5d"}},{"ruleId":"D1","level":"warning","message":{"text":"Capture::read_xml (cyclomatic 16): Capture::read_xml 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":"framediff/src/capture.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5a32cd171915d25854d88681df59fa4bee993641456f9b506543fb72a867df"}},{"ruleId":"D1","level":"warning","message":{"text":"Reader::shortcut (cyclomatic 16): Reader::shortcut has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: luadec::read::touches (cyclomatic 18) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"luadec/src/read.rs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"070a90635a5fe0608df4e111bae62fea70394296faf0df1edc1eea1fac96608d"}},{"ruleId":"D1","level":"warning","message":{"text":"Effect::step (cyclomatic 16): Effect::step 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":"viewer/src/assets/viewers/avfx/sim.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6cde748a7b73745353850f78060b6a7e3ae3d4aba73f408b966277d1decc30"}},{"ruleId":"D1","level":"warning","message":{"text":"Scene::expand (cyclomatic 16): Scene::expand 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":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":2848}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9850909481b6b3be908396e308adf47e2fa7c8b81788c9688d5a249b7e2bbd"}},{"ruleId":"D1","level":"warning","message":{"text":"Model::draw (cyclomatic 16): Model::draw has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/gpu.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0252ddb3fa3ea4fadb2efdc43309a14544a3cbaea7ec29293dc485c30b641b2"}},{"ruleId":"D1","level":"warning","message":{"text":"Build::poll (cyclomatic 16): Build::poll 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":"viewer/src/character/stand.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"49cc23128e61c0fbef3a01300307418a79e2267a747dee069fdb01a31cd27b13"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer::assets::viewers::cutb::play::perform (cyclomatic 16): viewer::assets::viewers::cutb::play::perform 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":"viewer/src/assets/viewers/cutb/play.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b24fc28435a967d97f910242e53994fa8e7721d231cad224fe615fcce4b265c"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer::assets::viewers::cutb::play::transport (cyclomatic 16): viewer::assets::viewers::cutb::play::transport 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":"viewer/src/assets/viewers/cutb/play.rs"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"52d0b23bf23c49427c99b97e9cb5caabdb1ba3e12b4ea19a34d763df431fdcda"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer::assets::viewers::mdl::export::shade_texel (cyclomatic 16): viewer::assets::viewers::mdl::export::shade_texel 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":"viewer/src/assets/viewers/mdl/export.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4cb4e56ec3cda361bb1a764d4875f49baf47b855fee0e6be48dda001f650a2"}},{"ruleId":"D1","level":"warning","message":{"text":"viewer::character::emotes::read (cyclomatic 16): viewer::character::emotes::read 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":"viewer/src/character/emotes.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"375b391e7a0d556ddd2aa1e1c4f2b8f4894be14f860a8173e598159efd02a66a"}},{"ruleId":"D2","level":"warning","message":{"text":"SetupWindow::draw (cognitive 174): SetupWindow::draw has cognitive complexity 174 (threshold 15). Drivers by points: if/else 49 (100 pts), loops 9 (46 pts), match/switch 9 (22 pts), boolean chains 6 (nesting depth added 101). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/setup.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"8000f3fca673e6c610f045f84134ff4f0b63df35cffee168e18f67e33d001e08"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::render (cognitive 123): Renderer::render has cognitive complexity 123 (threshold 15). Drivers by points: if/else 21 (66 pts), match/switch 8 (30 pts), loops 7 (24 pts), boolean chains 3 (nesting depth added 84). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0eeeafb07bd2e955ddfe070cac52a3397b6e837fa484280c93268a09d93e150"}},{"ruleId":"D2","level":"warning","message":{"text":"Rendered::poll (cognitive 123): Rendered::poll has cognitive complexity 123 (threshold 15). Drivers by points: if/else 26 (53 pts), match/switch 22 (51 pts), loops 10 (12 pts), boolean chains 7 (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"f38b8d28d9e6b2dc8bf8b8f3311ab57d48bcec482135bd1fc503ca9f931f1404"}},{"ruleId":"D2","level":"warning","message":{"text":"Buffer::fill (cognitive 110): Buffer::fill has cognitive complexity 110 (threshold 15). Drivers by points: if/else 52 (56 pts), loops 18 (26 pts), match/switch 11 (17 pts), boolean chains 11 (nesting depth added 18). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/program.rs"},"region":{"startLine":2931}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af980c81fd7f1801f9b4da57c8fb7c4167998ba7df02bbe001c30da6f2994fb"}},{"ruleId":"D2","level":"warning","message":{"text":"luadec::read::sticky (cognitive 105): luadec::read::sticky has cognitive complexity 105 (threshold 15). Drivers by points: if/else 21 (61 pts), loops 7 (16 pts), boolean chains 14, match/switch 6 (14 pts) (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"luadec/src/read.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"51fc3726adbc19c7908b2688f17f4de1df23b149034c30896076a58775463e11"}},{"ruleId":"D2","level":"warning","message":{"text":"shadermerge::factor::factor (cognitive 105): shadermerge::factor::factor has cognitive complexity 105 (threshold 15). Drivers by points: if/else 17 (61 pts), loops 12 (37 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 70). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shadermerge/src/factor.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ec77615ca23ff9c686bada2cf2d706411cf4ab3f4dc220b294980eff9299e2"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::mdl::export::gather (cognitive 96): viewer::assets::viewers::mdl::export::gather has cognitive complexity 96 (threshold 15). Drivers by points: if/else 19 (61 pts), loops 9 (26 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 63). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/export.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"23af86a984049cfff693ba50b94aca5cb862d727c5d4886891f337d256681be4"}},{"ruleId":"D2","level":"warning","message":{"text":"CharacterBuilder::appearance (cognitive 95): CharacterBuilder::appearance has cognitive complexity 95 (threshold 15). Drivers by points: if/else 19 (72 pts), match/switch 4 (10 pts), loops 3 (8 pts), boolean chains 5 (nesting depth added 64). 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":"viewer/src/character/mod.rs"},"region":{"startLine":1955}}}],"partialFingerprints":{"codehealthFindingId/v1":"2116d845cbc2adf5d7bad81b519257d8231009719f25762165510ffb0c70db16"}},{"ruleId":"D2","level":"warning","message":{"text":"shadermerge::merge::merge (cognitive 88): shadermerge::merge::merge has cognitive complexity 88 (threshold 15). Drivers by points: loops 34 (53 pts), if/else 10 (21 pts), match/switch 6 (12 pts), boolean chains 2 (nesting depth added 36). 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":"shadermerge/src/merge.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e526c131a84b2336be9e9d6f00cba2373e6565c5dd142e9b2ff2106081b9697"}},{"ruleId":"D2","level":"warning","message":{"text":"CharacterBuilder::poll (cognitive 88): CharacterBuilder::poll has cognitive complexity 88 (threshold 15). Drivers by points: if/else 30 (38 pts), match/switch 23 (35 pts), loops 4 (9 pts), boolean chains 6 (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":"viewer/src/character/mod.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ab7bf6497cdedeed7a079252d139c758b5f58d666901ed762012fd1558cc5e"}},{"ruleId":"D2","level":"warning","message":{"text":"Scene::details_ui (cognitive 84): Scene::details_ui has cognitive complexity 84 (threshold 15). Drivers by points: if/else 26 (39 pts), match/switch 19 (34 pts), loops 7 (10 pts), boolean chains 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":4866}}}],"partialFingerprints":{"codehealthFindingId/v1":"0669871e6a3639259eef3fd0932e6d211a2f574e66aa048271724a632f484bc4"}},{"ruleId":"D2","level":"warning","message":{"text":"Scene::translate (cognitive 78): Scene::translate has cognitive complexity 78 (threshold 15). Drivers by points: if/else 33 (50 pts), boolean chains 10, match/switch 5 (10 pts), loops 5 (8 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":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":3590}}}],"partialFingerprints":{"codehealthFindingId/v1":"d099ab1571d82c621f5e8ba05e2534ce56c36a26ef6a070b51aed2ebc25a4e45"}},{"ruleId":"D2","level":"warning","message":{"text":"Rendered::details_ui (cognitive 74): Rendered::details_ui has cognitive complexity 74 (threshold 15). Drivers by points: if/else 20 (43 pts), loops 11 (22 pts), match/switch 3 (7 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":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":3697}}}],"partialFingerprints":{"codehealthFindingId/v1":"3737700c15544acee5bba62be020affd85ac1d78ed86e78d8de084f7ff04f888"}},{"ruleId":"D2","level":"warning","message":{"text":"Scene::motion (cognitive 70): Scene::motion has cognitive complexity 70 (threshold 15). Drivers by points: if/else 12 (38 pts), match/switch 6 (18 pts), loops 6 (13 pts), boolean chains 1 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"780878a8a61454f161d25c933488efee3609024dad49dee21d0bb671e566176b"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::leg (cognitive 67): Renderer::leg has cognitive complexity 67 (threshold 15). Drivers by points: if/else 10 (34 pts), match/switch 8 (22 pts), loops 4 (10 pts), boolean chains 1 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"423e6ad34856d31f9c6641e9021f8be97c8af2aeb1f303fa41decd780c6b1d3e"}},{"ruleId":"D2","level":"warning","message":{"text":"CharacterBuilder::side_panel (cognitive 66): CharacterBuilder::side_panel has cognitive complexity 66 (threshold 15). Drivers by points: if/else 17 (41 pts), loops 7 (17 pts), match/switch 3 (6 pts), boolean chains 2 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/mod.rs"},"region":{"startLine":2637}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e32b2c4a57f2477125bece560a4d329abe9b31922fbe953aff1b7dca107897d"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::shpk::keys::read (cognitive 60): viewer::assets::viewers::shpk::keys::read has cognitive complexity 60 (threshold 15). Drivers by points: loops 18 (29 pts), if/else 7 (24 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 32). 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":"viewer/src/assets/viewers/shpk/keys.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03a3c75a544730d7b145f67d60078e9708f4cc29b1c33d2be556e0b183d2ce2"}},{"ruleId":"D2","level":"warning","message":{"text":"Preview::info_ui (cognitive 58): Preview::info_ui has cognitive complexity 58 (threshold 15). Drivers by points: if/else 48 (51 pts), loops 3 (5 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mod.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"af20c7d64464dd6766d9aae040374fcbfc953f6a912dc086a4ae4915ee9ef44d"}},{"ruleId":"D2","level":"warning","message":{"text":"Scene::load_asides (cognitive 55): Scene::load_asides has cognitive complexity 55 (threshold 15). Drivers by points: match/switch 11 (21 pts), loops 9 (20 pts), if/else 8 (11 pts), boolean chains 3 (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":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":2483}}}],"partialFingerprints":{"codehealthFindingId/v1":"14402c1886a67fd8bf1113db4d64c172718cf3d5850e0b87bcf5e3c62a274d2b"}},{"ruleId":"D2","level":"warning","message":{"text":"Builder::step (cognitive 54): Builder::step has cognitive complexity 54 (threshold 15). Drivers by points: match/switch 10 (21 pts), if/else 11 (17 pts), loops 7 (12 pts), boolean chains 4 (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":"shadermerge/src/canon.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56cf142cfe795e28e262533da782a25a5eb42205063cf1a2e04520b2fad6472"}},{"ruleId":"D2","level":"warning","message":{"text":"Synth::build (cognitive 54): Synth::build has cognitive complexity 54 (threshold 15). Drivers by points: if/else 11 (34 pts), loops 5 (10 pts), match/switch 3 (8 pts), boolean chains 2 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shadermerge/src/synth.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c076542710b69a94c6f5eb8efa752648d704da40422ced705441915586c520"}},{"ruleId":"D2","level":"warning","message":{"text":"App::draw_menubar (cognitive 54): App::draw_menubar has cognitive complexity 54 (threshold 15). Drivers by points: if/else 28 (42 pts), loops 6 (8 pts), boolean chains 3, match/switch 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"366873ab72f5ed6ac521614ea5b453e8c3b092eeed660693b030fc5c8743f06d"}},{"ruleId":"D2","level":"warning","message":{"text":"Buffers::pass (cognitive 54): Buffers::pass has cognitive complexity 54 (threshold 15). Drivers by points: match/switch 16 (43 pts), if/else 6 (8 pts), loops 2, boolean chains 1 (nesting depth added 29). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":4022}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8150f21cec08f04c3e66f5e24fca79f5df3eb3b0d135d00c1d1e8f3dbb35396"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::mdl::read_level (cognitive 54): viewer::assets::viewers::mdl::read_level has cognitive complexity 54 (threshold 15). Drivers by points: if/else 10 (23 pts), match/switch 5 (15 pts), loops 5 (13 pts), boolean chains 3 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9d37891467cce01854aaaf01fb27142083e6614879ab20314194c14e7f0d05"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::character::appearance (cognitive 54): viewer::character::appearance has cognitive complexity 54 (threshold 15). Drivers by points: if/else 15 (34 pts), match/switch 3 (11 pts), boolean chains 5, loops 2 (4 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/mod.rs"},"region":{"startLine":2970}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7d827b6a84e84b95df2a2ccf3168a1ab35fb5222f3557331e7554e01f7c339"}},{"ruleId":"D2","level":"warning","message":{"text":"shadermerge::merge::preprocess (cognitive 53): shadermerge::merge::preprocess has cognitive complexity 53 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 7 (15 pts), boolean chains 6, match/switch 2 (3 pts) (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shadermerge/src/merge.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a87e69b7fe047a205c18781533a1f45a52abdfa9f5ded47b913afc78139a610"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::uld::canvas (cognitive 53): viewer::assets::viewers::uld::canvas has cognitive complexity 53 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 6 (12 pts), match/switch 5 (8 pts), boolean chains 4 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/uld.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f398235ed00d3a1135c79e1bc64d45c074f3f22640c9338276fb0651be6cb11"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::layer::ui (cognitive 50): viewer::assets::viewers::layer::ui has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (26 pts), match/switch 5 (11 pts), loops 5 (8 pts), boolean chains 5 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/mod.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba470b0255af43926e1c07f17942b55019ffc58eb11e4044fa732ee7b41b8d6"}},{"ruleId":"D2","level":"warning","message":{"text":"perf.main (cognitive 49): perf.main has cognitive complexity 49 (threshold 15). Drivers by points: ternaries 10 (21 pts), if/else 12 (18 pts), loops 5 (10 pts) (nesting depth added 22). Of this number, 37 points are the body\u0027s own statements and 12 belong to 8 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/perf.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"24870ac6cbed4d4cb5fec24c515e4d8317257e2af4698ce1dd63de02ec09edcb"}},{"ruleId":"D2","level":"warning","message":{"text":"EditableSchema::draw_internal (cognitive 48): EditableSchema::draw_internal has cognitive complexity 48 (threshold 15). Drivers by points: if/else 22 (32 pts), loops 3 (7 pts), match/switch 3 (5 pts), boolean chains 4 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/editable_schema.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"33edc989c4d4172a15b40492cda90de11d90a5796dc9a2b9fc092b77136f317a"}},{"ruleId":"D2","level":"warning","message":{"text":"AssetBrowser::draw_search (cognitive 45): AssetBrowser::draw_search has cognitive complexity 45 (threshold 15). Drivers by points: if/else 22 (38 pts), match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/mod.rs"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f92a5f3a70e17a3ef3582b0f7e8196939f3af6154edfd43e9355b599b190c2"}},{"ruleId":"D2","level":"warning","message":{"text":"GoToWindow::draw (cognitive 44): GoToWindow::draw has cognitive complexity 44 (threshold 15). Drivers by points: if/else 22 (35 pts), boolean chains 3, loops 1 (3 pts), match/switch 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":"viewer/src/goto.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0ab66143474343a98f0ffb5db79ddeaf786f7cbb2e1300efb50bb69818c0bb"}},{"ruleId":"D2","level":"warning","message":{"text":"Scene::viewport (cognitive 43): Scene::viewport has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 11, match/switch 6 (9 pts), loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":4244}}}],"partialFingerprints":{"codehealthFindingId/v1":"918d760d3af5f7559e065f133f0147e343a6e00ffa62aef4379c0ab0600d0200"}},{"ruleId":"D2","level":"warning","message":{"text":"Scene::want_blobs (cognitive 42): Scene::want_blobs has cognitive complexity 42 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 6 (16 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":3282}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c95ba5d7f696b3154aed4c5aada509c5f2b6c5d57f8198129d47176e8e39ee"}},{"ruleId":"D2","level":"warning","message":{"text":"Rendered::translate (cognitive 42): Rendered::translate has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (31 pts), match/switch 3 (7 pts), boolean chains 3, loops 1 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":3129}}}],"partialFingerprints":{"codehealthFindingId/v1":"e094020651bff0006a25825ec8ef50e13a2381a4a9f3345b5b44e927dcddb145"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::shpk::list::ui (cognitive 42): viewer::assets::viewers::shpk::list::ui has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 6 (11 pts), match/switch 4 (5 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/shpk/list.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf08993da9c952d9558ff45287249c59f68a3897aca8b110e06af96c279ec80"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::walk (cognitive 41): Reader::walk has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 8 (14 pts), loops 4 (8 pts), boolean chains 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":"luadec/src/read.rs"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"f306391da19dd6f2aa3fdda1851630bc3cc3eddf40f5f655833e0d0a162ec4ed"}},{"ruleId":"D2","level":"warning","message":{"text":"AssetBrowser::detail_panel (cognitive 41): AssetBrowser::detail_panel has cognitive complexity 41 (threshold 15). Drivers by points: if/else 18 (30 pts), match/switch 5 (7 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":"viewer/src/assets/mod.rs"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1314f436c64d8473f991e6bddd90acbf595dba8b1e685ff4266fdebc6863bf9"}},{"ruleId":"D2","level":"warning","message":{"text":"smoke.main (cognitive 41): smoke.main has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (23 pts), loops 8 (11 pts), boolean chains 5, error handling 1, ternaries 1 (nesting depth added 7). Of this number, 27 points are the body\u0027s own statements and 14 belong to 6 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/smoke.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"388a3e589171657c31ab17c569dd30476a1e74a604cc96c2454c24659ff8c5e4"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph::build (cognitive 40): Graph::build has cognitive complexity 40 (threshold 15). Drivers by points: loops 18 (25 pts), match/switch 4 (10 pts), if/else 2 (5 pts) (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/quests/graph.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb01b5c1d8bdfbd173cbf815941fe21b08273322f43d5e3bd9615a971c415b6"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::quests::rewards::ui (cognitive 39): viewer::quests::rewards::ui has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (27 pts), loops 5 (9 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/quests/rewards.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"e142f843db638ba0dbfd874fc847b09debff65f4bde62110899fa1f465c44900"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::shadow (cognitive 38): Renderer::shadow has cognitive complexity 38 (threshold 15). Drivers by points: if/else 6 (21 pts), loops 4 (10 pts), match/switch 2 (7 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc186f7a008b932f2528d27362014c96c80f6accb4fece0e6d2b762f8c211af"}},{"ruleId":"D2","level":"warning","message":{"text":"Scene::walk (cognitive 38): Scene::walk has cognitive complexity 38 (threshold 15). Drivers by points: match/switch 8 (28 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 23). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":1647}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f65f6e04903831cca435af24b89f50bda04a8f350cfd15c36aa0a3e466ab08"}},{"ruleId":"D2","level":"warning","message":{"text":"Rendered::viewport (cognitive 38): Rendered::viewport has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 12 (14 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":2373}}}],"partialFingerprints":{"codehealthFindingId/v1":"93fd7c7514ac1cec0232189f71b4bba26a19edaad45f851009b95a030827e05c"}},{"ruleId":"D2","level":"warning","message":{"text":"Cast::poll (cognitive 38): Cast::poll has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 5 (11 pts), match/switch 4 (8 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/stand.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"63efbb19e25f72b8dab91c56160d37d35271a56273dd973cb7c38511c8b07f67"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::mdl::ui (cognitive 38): viewer::assets::viewers::mdl::ui has cognitive complexity 38 (threshold 15). Drivers by points: if/else 19 (27 pts), match/switch 2 (5 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":1328}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2bc8d985080afbdbe8d4bb9d5886a05f5af3a0333948acd5c0f35e360279ff8"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::uld::tree (cognitive 38): viewer::assets::viewers::uld::tree has cognitive complexity 38 (threshold 15). Drivers by points: match/switch 9 (21 pts), if/else 5 (10 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 18). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/uld.rs"},"region":{"startLine":1227}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94a6604de81e67e6460cbf9fc6e6b46eb4bfa407890495cce5dab04d2b8ce00"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::zone::envs::ui (cognitive 38): viewer::assets::viewers::zone::envs::ui has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 4 (9 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/zone/envs.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"94013ad924b90dc9eb3e8b1613da5aa20ee142ec340ca0b83593051beece879c"}},{"ruleId":"D2","level":"warning","message":{"text":"Synth::value (cognitive 36): Synth::value has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 4 (10 pts), match/switch 4 (9 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shadermerge/src/synth.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f46e53c4e231c1555bdd54cd6e28d8a21007557092be0d17ecd95ca2aff892"}},{"ruleId":"D2","level":"warning","message":{"text":"App::draw_sheet_list (cognitive 36): App::draw_sheet_list has cognitive complexity 36 (threshold 15). Drivers by points: if/else 19 (31 pts), match/switch 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca39f0779423a6c2566f06ef32b8c74d3144fcdc829a26df197c0749bb3a556"}},{"ruleId":"D2","level":"warning","message":{"text":"Game::fill (cognitive 36): Game::fill has cognitive complexity 36 (threshold 15). Drivers by points: if/else 4 (16 pts), match/switch 4 (13 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/gpu.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"606cd65bf241c17c646fed5adeb91c85683284534c749314babea582a0e832f1"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::character::menus::pieces (cognitive 36): viewer::character::menus::pieces has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 7 (9 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":"viewer/src/character/menus.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"0082e5328dd5a8d8fc2cb94592efc028006cfc4d624988421f38ccbe654bf779"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::quests::dag::ui (cognitive 36): viewer::quests::dag::ui has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (17 pts), match/switch 2 (7 pts), boolean chains 6, loops 4 (6 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/quests/dag.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e535425a95b7569f508492bb6f01eb50909a91ce58f3ac430922031a3b2d4cc3"}},{"ruleId":"D2","level":"warning","message":{"text":"Cue::poll (cognitive 34): Cue::poll has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 7 (15 pts), loops 2, boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/emote.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd3ce2c54624159b39f2781e19918d1d6099e0227b18d19605e50852d3ac8206"}},{"ruleId":"D2","level":"warning","message":{"text":"PrWindow::draw (cognitive 34): PrWindow::draw has cognitive complexity 34 (threshold 15). Drivers by points: if/else 22 (28 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/pr_window.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"7680c8df3c0cc89a6a05fab65c64a050e55afe9206c7400bddf33c71aab66e8e"}},{"ruleId":"D2","level":"warning","message":{"text":"Effect::step (cognitive 33): Effect::step has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 5 (10 pts), boolean chains 1, match/switch 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/sim.rs"},"region":{"startLine":1316}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0205a9a86826df03bc5c9d787afe872494208ec30f862b68dbba95cdcd6c279"}},{"ruleId":"D2","level":"warning","message":{"text":"Scene::load_packages (cognitive 33): Scene::load_packages has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 5, match/switch 3 (5 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":3136}}}],"partialFingerprints":{"codehealthFindingId/v1":"09f0a922fe4ebdc6dfcb77cafc370ccfba23a897c2b69edc9b24fdd8f65fa247"}},{"ruleId":"D2","level":"warning","message":{"text":"IconIndex::build (cognitive 33): IconIndex::build has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 4 (11 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/data/mod.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"681af2f6aa28c690ca54c2b8b6302c9a5f5611efa382db8cff7ccbb137ae0ab1"}},{"ruleId":"D2","level":"warning","message":{"text":"PathIndex::master (cognitive 33): PathIndex::master has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (23 pts), match/switch 2 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/paths/mod.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48623cb4524f69205e1c000d22bce887ea035420ea9718507d871e8b1ecc382"}},{"ruleId":"D2","level":"warning","message":{"text":"Synth::survey (cognitive 32): Synth::survey has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 5 (6 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shadermerge/src/synth.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"a94d0ddca2e68b966edd1a98febb2521c4398aa282bdcb017cfba400fcdbcb13"}},{"ruleId":"D2","level":"warning","message":{"text":"shadermerge::merge::guards (cognitive 32): shadermerge::merge::guards has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 4 (8 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shadermerge/src/merge.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"a807763531b71e2d465a89bc55c2159d27df4e64b861a929ba831c00cbce1483"}},{"ruleId":"D2","level":"warning","message":{"text":"Animation::walked (cognitive 32): Animation::walked has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 5 (8 pts), loops 5 (7 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":"viewer/src/assets/viewers/mdl/skin.rs"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3df5485031a48f8f914bab9b79d2f40feb7c2bbffbea4c0f89407c6a26f221"}},{"ruleId":"D2","level":"warning","message":{"text":"SheetTable::cell_ui (cognitive 32): SheetTable::cell_ui has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (24 pts), match/switch 4 (8 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/sheet_table.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"7970397cada0b81106a2af1fd98e197cf97c0b1030cdaa8fb77a59e7fcca5f00"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::draw (cognitive 31): Renderer::draw has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 7, match/switch 2 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0bd9fb58bca2d797578eeda81ff2dec99d8db2c066e7ad64cadf26fc1fd811"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::mirror_water (cognitive 31): Renderer::mirror_water has cognitive complexity 31 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 4 (10 pts), match/switch 3 (8 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa72cfc9379d03ec8aee7a53f48cc5a3dda2562c14699ffbf722391f54338950"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::hex_dump (cognitive 31): viewer::assets::hex_dump has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 4, loops 2 (3 pts), match/switch 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/mod.rs"},"region":{"startLine":2763}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c04377f3bda6be1c6c5385a3c0afb844546f6ce95dd885eba3b1d0b27a4521"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::cutb::play::ui (cognitive 31): viewer::assets::viewers::cutb::play::ui has cognitive complexity 31 (threshold 15). Drivers by points: if/else 16 (21 pts), match/switch 4 (7 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/cutb/play.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"33865cb3cce436ad41298e298cfbdab845ddc3ba96ab8363858cbde3376326b6"}},{"ruleId":"D2","level":"warning","message":{"text":"Capture::read_xml (cognitive 30): Capture::read_xml has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (25 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"framediff/src/capture.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8a43e11a0b171ab149759d84e58c7f0e430ba695a3bf215f2de48b01e95400"}},{"ruleId":"D2","level":"warning","message":{"text":"App::draw_sheet_data (cognitive 30): App::draw_sheet_data has cognitive complexity 30 (threshold 15). Drivers by points: if/else 19 (22 pts), match/switch 4 (5 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c80ca80ff7ff27816b747c2ef342fc9bc369edf69e2c83134ad65787a7cfea"}},{"ruleId":"D2","level":"warning","message":{"text":"Scene::load_textures (cognitive 30): Scene::load_textures has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 6 (11 pts), loops 4, 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":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":4038}}}],"partialFingerprints":{"codehealthFindingId/v1":"c051c8ec1b9c473901c80f11bd84acb7672383c224d7992646719709b23a9b9f"}},{"ruleId":"D2","level":"warning","message":{"text":"framediff::run (cognitive 29): framediff::run has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 4 (8 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"framediff/src/main.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e39d26fdca41f77ff4993d89a63c4b6722de67195b0777b694273bc65ea58bf"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::layer::payload (cognitive 29): viewer::assets::viewers::layer::payload has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (22 pts), match/switch 4 (7 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/mod.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d996a93ff28544f5abac020dfb6c7b900d32819e56c3ffefb0db8c43d2f84c6"}},{"ruleId":"D2","level":"warning","message":{"text":"MessageQueue::new (cognitive 29): MessageQueue::new has cognitive complexity 29 (threshold 15). Drivers by points: match/switch 11 (25 pts), if/else 1 (3 pts), loops 1 (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/queue.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"28cd06879d92d7616e246a73d9826be0c4183dad99ac01e2bca3c2e150fb95d0"}},{"ruleId":"D2","level":"warning","message":{"text":"probe.main (cognitive 29): probe.main has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 4 (8 pts), ternaries 3 (7 pts), boolean chains 2 (nesting depth added 13). Of this number, 24 points are the body\u0027s own statements and 5 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":"smoke/probe.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"feba83356d6e9ec3f5d0e3319efb96526ccb13e64d9d14303f504599a68d1074"}},{"ruleId":"D2","level":"warning","message":{"text":"Rendered::details_ui (cognitive 28): Rendered::details_ui has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 3 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/mod.rs"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"34010b3d39412de9211ff0a03c637e0fd1e8be4a3c923ca5e05b75927cbbff53"}},{"ruleId":"D2","level":"warning","message":{"text":"Ambient::ui (cognitive 28): Ambient::ui has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 8 (10 pts), loops 4 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/ambient.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e7cc0eaf0d827beebb33aaf3e5fca3d7805f25a1c60e59f3b0cef0f70bd4c7"}},{"ruleId":"D2","level":"warning","message":{"text":"Game::resolve (cognitive 28): Game::resolve has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 5 (11 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/gpu.rs"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd966ad13aad4ef2cdd8585a462d4b5441e780d67138118806ff1d806c0eeea3"}},{"ruleId":"D2","level":"warning","message":{"text":"Program::stars (cognitive 28): Program::stars has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 9 (13 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/program.rs"},"region":{"startLine":2377}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0e6ce3aef13f6f93961342c36283a5d8b24569daaf9602bf386cddd75039a7"}},{"ruleId":"D2","level":"warning","message":{"text":"MusicPlayer::poll (cognitive 28): MusicPlayer::poll has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/music.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82c718574b72c72a3fc8a7313ab2280a66143bde08777a524f1de0da812018f"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::cutb::play::perform (cognitive 28): viewer::assets::viewers::cutb::play::perform has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (21 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":"viewer/src/assets/viewers/cutb/play.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bcddc3b7a688abd61eb17ff7a0a838d6a9104d86fba1a6e4a3829cf7c07ed04"}},{"ruleId":"D2","level":"warning","message":{"text":"smoke.decodePng (cognitive 28): smoke.decodePng has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 5 (12 pts), if/else 4 (5 pts), boolean chains 4, loops 3 (4 pts), match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/smoke.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c9201ee23362cf07445a10b72066e0836b5ccd98d5afcda66546097ba8caaf"}},{"ruleId":"D2","level":"warning","message":{"text":"MusicPlayer::draw_player (cognitive 27): MusicPlayer::draw_player has cognitive complexity 27 (threshold 15). Drivers by points: if/else 19 (24 pts), boolean chains 2, match/switch 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/music.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a380a24130ebe4d58408cf91a064d19b53d7ab302f8057e95d5a54527e38763"}},{"ruleId":"D2","level":"warning","message":{"text":"SqpackWorker::received (cognitive 27): SqpackWorker::received has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 4 (7 pts), loops 1 (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":"viewer/src/worker/sqpack_worker.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2178924b7751be44c95333ce9e566a373e422306a1c1b3200c098ed38ae43fcb"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::quests::cutscenes::load (cognitive 27): viewer::quests::cutscenes::load has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 5 (8 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":"viewer/src/quests/cutscenes.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e55a97eb89600afdd612d72f02457b70956333a74bfc24c5be3b02e4cbf1908"}},{"ruleId":"D2","level":"warning","message":{"text":"index.pipeline_state (cognitive 27): index.pipeline_state has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 6 (11 pts), if/else 7 (8 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/walk/index.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4317c2168b8a12b7896d5e8c043c7630710f9dd232f587f3776b0b9cea71ed22"}},{"ruleId":"D2","level":"warning","message":{"text":"Scene::rebuild (cognitive 26): Scene::rebuild has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 7, match/switch 2 (3 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":2263}}}],"partialFingerprints":{"codehealthFindingId/v1":"f295664c94e3f0f7d220e3db04331d3a1f76a8a2be0a865ce9e9d0be3342e671"}},{"ruleId":"D2","level":"warning","message":{"text":"Program::assemble (cognitive 26): Program::assemble has cognitive complexity 26 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 6 (9 pts), match/switch 3 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/program.rs"},"region":{"startLine":2713}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e00689fff300a77aaa5c707342d5fafebed7d0f76ccf14a65649c57f502ad35"}},{"ruleId":"D2","level":"warning","message":{"text":"CharacterBuilder::slot_ui (cognitive 26): CharacterBuilder::slot_ui has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 7 (12 pts), if/else 8 (10 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/mod.rs"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e105f2b032a75a68fca97ba64044310e76f790866b5ab8604c1f3d8711b2cc0"}},{"ruleId":"D2","level":"warning","message":{"text":"CompiledFilterInput::match_part (cognitive 26): CompiledFilterInput::match_part has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 3 (6 pts), boolean chains 2, match/switch 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/filter/input.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7732257a1fe7f53698660faff0fae80fa595295194e29c198e4276dac107ac3"}},{"ruleId":"D2","level":"warning","message":{"text":"SmokeApp::ui (cognitive 26): SmokeApp::ui has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 3 (5 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/smoke.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed5c1707ecfcfe9c355ae7790687bf8b9ffb54fb91f27a00a343fb6f28a70dc"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::avfx::tree_ui (cognitive 26): viewer::assets::viewers::avfx::tree_ui has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 3 (7 pts), boolean chains 3, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/mod.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f741b585fd341149c281d9a3c05c7a6f6107838a5eeb11e5e812709ca8e3e2a"}},{"ruleId":"D2","level":"warning","message":{"text":"drive.main (cognitive 26): drive.main has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 3 (9 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 13). Of this number, 23 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/drive.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"8227357539381d2bc094626012cac41276cf45cbbc1bdf91c6b0e98857bdbcc8"}},{"ruleId":"D2","level":"warning","message":{"text":"Worn::covers (cognitive 25): Worn::covers has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 6 (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":"viewer/src/character/gating.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a5b213bd5d1d5b7ef5bda43128e656007d66af07350dc142072ee7f53b4de4"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaColumn::get_columns_inner (cognitive 25): SchemaColumn::get_columns_inner has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/schema_column.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"da2cf04f0fb6843e06200dd0f96df51cb7306f77e43dc21fdf46d1ca34385015"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::avfx::sim::shading (cognitive 25): viewer::assets::viewers::avfx::sim::shading has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 5 (7 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/sim.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"d428c08fa65ff32354e4d7bcf151ba4994b1c34c94511e5150b236302b6077db"}},{"ruleId":"D2","level":"warning","message":{"text":"Buffers::attach (cognitive 24): Buffers::attach has cognitive complexity 24 (threshold 15). Drivers by points: loops 9 (13 pts), if/else 8 (10 pts), boolean chains 1 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c132db857c5d1a9eebf74a026d39ae5b3410f322308d14dab8012390c087d45"}},{"ruleId":"D2","level":"warning","message":{"text":"Rendered::posed (cognitive 24): Rendered::posed has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (5 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":2212}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d937324be6443c9419a74be510c733473bcfe9f7def7a23a7163efac516e84f"}},{"ruleId":"D2","level":"warning","message":{"text":"Poses::advance (cognitive 24): Poses::advance has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 5 (15 pts), loops 2 (5 pts), if/else 2 (4 pts) (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/skin.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"af720d0da382117576b6edd619aa7d15fa03d14bf1fa8d92251a6815d0176827"}},{"ruleId":"D2","level":"warning","message":{"text":"Rendered::scene (cognitive 24): Rendered::scene has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 3 (9 pts), boolean chains 2, 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":"viewer/src/assets/viewers/pap.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a4ba873bd8dd9424c88432c86c90194c5885580a896b6631d2ad01162c8594"}},{"ruleId":"D2","level":"warning","message":{"text":"Build::poll (cognitive 24): Build::poll has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (7 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/stand.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b9ba221e4e7bae831a789131f9a38f6c0286d218f0b49b26ceae53a8a3a528"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::icons::refs::walk_sheet (cognitive 24): viewer::icons::refs::walk_sheet has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/icons/refs.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92e97c2940ebbc1540cae78c52cab0b900c92a35c6b2cfb51b22ac90d8df2a9"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::icons::refs::walk (cognitive 24): viewer::icons::refs::walk has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (5 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/icons/refs.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"163e622671cf2d3ed45049e81e9585521603700ebdb0ffe946b4b53b3149bc1b"}},{"ruleId":"D2","level":"warning","message":{"text":"AssetBrowser::draw_tree (cognitive 23): AssetBrowser::draw_tree has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (20 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/mod.rs"},"region":{"startLine":1222}}}],"partialFingerprints":{"codehealthFindingId/v1":"14a18b1b058bb0a370f386e0c54a17ff790e20fca2af5fa886f3d14fb3bf9979"}},{"ruleId":"D2","level":"warning","message":{"text":"AssetBrowser::advance_scan (cognitive 23): AssetBrowser::advance_scan has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (8 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/mod.rs"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"2196e1903edf64819ec588841172c173bbd6e42c41ef034964a958bad10158ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Scene::expand (cognitive 23): Scene::expand has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (7 pts), loops 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":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":2848}}}],"partialFingerprints":{"codehealthFindingId/v1":"35155480cd95dbb020422f2281617e6ad9aed8590b2666e5773007ad45566751"}},{"ruleId":"D2","level":"warning","message":{"text":"Effects::poll (cognitive 23): Effects::poll has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 5, match/switch 3 (5 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":"viewer/src/assets/viewers/mdl/effects.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"31229353b980e5a4ffc6f81ebdb1a43f416f85c7b9db93b35e6569ab8573c545"}},{"ruleId":"D2","level":"warning","message":{"text":"CompiledFilterInput::score_part (cognitive 23): CompiledFilterInput::score_part has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (6 pts), match/switch 1 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/filter/input.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"f901bbedc84456c7abd70e17590b8d0563e44700574b132f0b339fba1c39cee6"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::material::ui (cognitive 23): viewer::assets::viewers::material::ui has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (9 pts), match/switch 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/material.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95edfa0291763847cd64ed65854cbd35d1053f292b9c3657bf1aa814de3dd03"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::mdl::export::shade_texel (cognitive 23): viewer::assets::viewers::mdl::export::shade_texel has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 4, 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":"viewer/src/assets/viewers/mdl/export.rs"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b7cc8650a572b9915ff93b679ca66496d819b0e5ccd1508d7142e67eebe0a9"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::skp::ui (cognitive 23): viewer::assets::viewers::skp::ui has cognitive complexity 23 (threshold 15). Drivers by points: loops 7 (18 pts), if/else 5 (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":"viewer/src/assets/viewers/skp.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ddcc8ed004b6ef106499aa36c198972490455ccf9161bc44c2c3437231b2ac"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::uld::properties (cognitive 23): viewer::assets::viewers::uld::properties has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (11 pts), match/switch 6 (10 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/uld.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"669ad14d09dd351bd9303cfbac6c8e232098ba39f1f75892977f2af41f3d1d80"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::character::weapons::read (cognitive 23): viewer::character::weapons::read has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/weapons.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5d0faa804df24faae05abbbf6e74125b0a4d0c4f82e3b05c50aba689ff2b7b"}},{"ruleId":"D2","level":"warning","message":{"text":"look.main (cognitive 23): look.main has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 3 (4 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 12). Of this number, 20 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. 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":"smoke/look.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15e7a97ef2bc06dafa608941ed4e053cb51c3373af4b8c524ab2bef23d3e873"}},{"ruleId":"D2","level":"warning","message":{"text":"net.main (cognitive 23): net.main has cognitive complexity 23 (threshold 15). Drivers by points: loops 7 (18 pts), if/else 2 (3 pts), boolean chains 1, ternaries 1 (nesting depth added 12). Of this number, 20 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. 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":"smoke/net.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"c26ad07585126f0f1659f5a4d5d1023cf969a0e9236e7131b594ab9a0b3730be"}},{"ruleId":"D2","level":"warning","message":{"text":"Scene::load_blobs (cognitive 22): Scene::load_blobs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 2 (5 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":3337}}}],"partialFingerprints":{"codehealthFindingId/v1":"d89d9b5a34dd7d8628bd093eb789e518841ed2297233ffa9e6b952deaa8d6ca4"}},{"ruleId":"D2","level":"warning","message":{"text":"Model::draw (cognitive 22): Model::draw has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 5 (7 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/gpu.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11a0cfaabb13968bd3c4692ac824b4c788446a1c9185639502c6263ea5e728e"}},{"ruleId":"D2","level":"warning","message":{"text":"SchemaColumn::resolve_placeholders (cognitive 22): SchemaColumn::resolve_placeholders has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (21 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":"viewer/src/sheet/schema_column.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e3d721eda6e9e3f58aa19fc3cca62b756a49bb048d2011332a621898eaf680"}},{"ruleId":"D2","level":"warning","message":{"text":"ZoneBrowser::poll (cognitive 22): ZoneBrowser::poll has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (13 pts), match/switch 3 (6 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/zones/mod.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"c711866ba2673be139fe9b93ffafe91038370b2ee7571f09e94561a68a45a91c"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::mdl::deferred::without (cognitive 22): viewer::assets::viewers::mdl::deferred::without has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (4 pts), match/switch 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":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":5068}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c82933e2a91cb6ca292ff4ea87a583f2c5093c645093b053e093ebcaad3fc9"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::mdl::export::dyed (cognitive 22): viewer::assets::viewers::mdl::export::dyed has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/export.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7761945d35a79a32ecaf5ac89233141e04934e4cfb3567b5f2ddf185c36157"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::character::emotes::read (cognitive 22): viewer::character::emotes::read has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 3, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/emotes.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d856bcc5590515d0f54270be66365a8ecd9aa0a8ec31d2475434fbabb88e8af"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::utils::export::menu (cognitive 22): viewer::utils::export::menu has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/utils/export.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0d59420ddbbfda84d7886dabc8191aaf33aab2f0e720be59028d6845c6b2fed"}},{"ruleId":"D2","level":"warning","message":{"text":"shadermerge::factor::prove (cognitive 21): shadermerge::factor::prove has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 5 (9 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shadermerge/src/factor.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28ac86f353931ab4408b9367c240b4f462c05250e2cb7f8e96f6e37e2b2a259"}},{"ruleId":"D2","level":"warning","message":{"text":"Channels::apply (cognitive 21): Channels::apply has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 2 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/mod.rs"},"region":{"startLine":2646}}}],"partialFingerprints":{"codehealthFindingId/v1":"356204a38248e1dc86f6cea8fac59b19b02ebae38c76cf867cf08c412fd2b189"}},{"ruleId":"D2","level":"warning","message":{"text":"Scene::load_effects (cognitive 21): Scene::load_effects has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 5, match/switch 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":2661}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31dd8f64f522dadc29c62de8844cbccba5bbebbba92b1a174fadaadc7f661ee"}},{"ruleId":"D2","level":"warning","message":{"text":"IconBrowser::draw_detail (cognitive 21): IconBrowser::draw_detail has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 4, boolean chains 2, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/icons/mod.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfdb6d7b4ef2f5983ddc505d911ec573cb2f96aa06408f424f4fcaca1cb10607"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::fpeb::decode (cognitive 21): viewer::assets::viewers::fpeb::decode has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 1 (6 pts) (nesting depth added 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/fpeb.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe47a24703349beb464eaa7c50a90a94650499a3e61a9804e75f888fba4509a4"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::mdl::program::shader_types (cognitive 21): viewer::assets::viewers::mdl::program::shader_types has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (15 pts), loops 3 (6 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/program.rs"},"region":{"startLine":4234}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f5cc42186f3073d28f21a44e30f12cde30cabad451dc21b2bbf37c937f3352"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::uld::details_ui (cognitive 21): viewer::assets::viewers::uld::details_ui has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 4 (7 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/uld.rs"},"region":{"startLine":1344}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec9e9edc7dd3b450defefcac57cfdb7e83212f993176c2d19043870b2fe6a43"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::character::npcs::stand_in (cognitive 21): viewer::character::npcs::stand_in has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 3 (7 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/npcs.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a968d6ee102b29d00a870874c53d0bcd5733cadbfd0eddd744cb2f6b82868e"}},{"ruleId":"D2","level":"warning","message":{"text":"luadec::expr::write_stat (cognitive 20): luadec::expr::write_stat has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (4 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"luadec/src/expr.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7616c500e184b9801502a75304bd3f07ff4fbb2763feec891a67d49a3d82beb"}},{"ruleId":"D2","level":"warning","message":{"text":"Scene::load_models (cognitive 20): Scene::load_models has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 3 (6 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":2957}}}],"partialFingerprints":{"codehealthFindingId/v1":"519367ffa5da9469e16e0271e77a1d6dfa89129e242a802a52c69df3c0c1e87b"}},{"ruleId":"D2","level":"warning","message":{"text":"SoundStage::poll (cognitive 20): SoundStage::poll has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (7 pts), loops 2, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/sound.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"635a0ec6f49d7e0388a76598317925a5c1414f4864a6d8de61e33a73940fdf9d"}},{"ruleId":"D2","level":"warning","message":{"text":"Loader::poll (cognitive 20): Loader::poll has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (6 pts), match/switch 2 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/pcb.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"29c1f4a07ccf3b97c9e241751251920e153996991e3992519e89ebdbe3168a60"}},{"ruleId":"D2","level":"warning","message":{"text":"Router::ui (cognitive 20): Router::ui has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 2, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/router/mod.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b743ed231a2a094d9e3fff672b3317841c7f8a7696c9de7e29baca7a9dc0badf"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::uld::ui (cognitive 20): viewer::assets::viewers::uld::ui has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 4 (7 pts), match/switch 2 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/uld.rs"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"d971b6d4b60da2c9f5b89b339765ee9a95196475aba751a67ad93179087f71a7"}},{"ruleId":"D2","level":"warning","message":{"text":"shadermerge::pick::cover (cognitive 19): shadermerge::pick::cover has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 4 (8 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shadermerge/src/pick.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"bffe2ed93497780ecc6ab74c730884331a1921ed1fe4d2ea9d0a2c5a55d8f834"}},{"ruleId":"D2","level":"warning","message":{"text":"Game::bind (cognitive 19): Game::bind has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (14 pts), loops 5 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/gpu.rs"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"751ca0c14feea2cca93c0788c6922917b7ca0c34dc0e558d5fae67b0897fd9d7"}},{"ruleId":"D2","level":"warning","message":{"text":"SheetTable::spawn_filter (cognitive 19): SheetTable::spawn_filter has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2 (3 pts) (nesting depth added 7). Of this number, 10 points are the body\u0027s own statements and 9 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":"viewer/src/sheet/sheet_table.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff9d28e031829fd610997fed96e42916690227c6fca9a5c8a5cf83c24db27b0"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::cutb::music::resolve (cognitive 19): viewer::assets::viewers::cutb::music::resolve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (6 pts), match/switch 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/cutb/music.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d92bf435d7fc1a00c4ff897b907e627b47805da11e929e537def5150b59aa1"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::cutb::play::transport (cognitive 19): viewer::assets::viewers::cutb::play::transport has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15 (18 pts), match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/cutb/play.rs"},"region":{"startLine":1767}}}],"partialFingerprints":{"codehealthFindingId/v1":"718d91f1e121c187ba36c637d86e113cbe9ffceaf30a150215ce1cc5a841d469"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::mdl::deferred::build_pair (cognitive 19): viewer::assets::viewers::mdl::deferred::build_pair has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (8 pts), loops 3 (5 pts), if/else 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":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":5141}}}],"partialFingerprints":{"codehealthFindingId/v1":"8016b827439a52cf91bb7b0c143cc973d0b72d4d25dc57244a04dbb705a432c5"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::mdl::dye::apply (cognitive 19): viewer::assets::viewers::mdl::dye::apply has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (5 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/dye.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9edb587eaf97f73094b76cc73e6dc7133c96fa140c05932192cf09f5644c859"}},{"ruleId":"D2","level":"warning","message":{"text":"App::draw_goto (cognitive 18): App::draw_goto has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (8 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":"viewer/src/app.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"6433227f80ceb6db15a697ffa6c21a183ce3883b3749ff21fa78c634453f7e46"}},{"ruleId":"D2","level":"warning","message":{"text":"App::on_named_sheet (cognitive 18): App::on_named_sheet has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (18 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":"viewer/src/app.rs"},"region":{"startLine":1543}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4f80742e7b3ca2f1e63781f77c2c4db018b6c7b4956ba37c1a1aedc4846adb"}},{"ruleId":"D2","level":"warning","message":{"text":"App::command_save_all_schemas (cognitive 18): App::command_save_all_schemas has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (4 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":"viewer/src/app.rs"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa7f6d6b4877a989d7dd165a5c5c444519d93045aa186e373ee742908696fcc"}},{"ruleId":"D2","level":"warning","message":{"text":"Particles::batch (cognitive 18): Particles::batch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts), match/switch 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/gpu.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c05771cb0d6e2c2699019617e992df583c9918632e6dc368508e217bbe3f01b"}},{"ruleId":"D2","level":"warning","message":{"text":"Program::build (cognitive 18): Program::build has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 5 (7 pts), boolean chains 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/program.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cb84ea8ab1ae115d400871c6dced91ed0dc56f4f17f83bce0da08fa1de9aa45"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::grass (cognitive 18): Renderer::grass has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (6 pts), loops 3 (6 pts), match/switch 2 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"098e76d59a05fea44d79e44a72b8cdb6d6c6793ae3a50cb9fe7cfdc7006c3f0f"}},{"ruleId":"D2","level":"warning","message":{"text":"Scene::place_grass (cognitive 18): Scene::place_grass has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (7 pts), match/switch 1 (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":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":2039}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5bdc3e3b3348bd3212a5ce6886040d25bf93d505cdafda644550f0ee8ba694"}},{"ruleId":"D2","level":"warning","message":{"text":"Rendered::details_ui (cognitive 18): Rendered::details_ui has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (8 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":"viewer/src/assets/viewers/zone/envs.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"82128852531f7cd902b740cc8bdab0949cd14293d6400ff2ba8233eea6dd7ea5"}},{"ruleId":"D2","level":"warning","message":{"text":"SheetTable::header_cell_ui (cognitive 18): SheetTable::header_cell_ui has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 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":"viewer/src/sheet/sheet_table.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"414ccc74c5e5577776efc29ea2e39f33b9e54271bc0657cea8ea7edcf7eb367c"}},{"ruleId":"D2","level":"warning","message":{"text":"burst.main (cognitive 18): burst.main has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 5 (7 pts), ternaries 1 (nesting depth added 7). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"smoke/burst.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d05997b684be09ae0a61bdd23b1b6bb7192f96efee52a62fcb357024b7bfbc"}},{"ruleId":"D2","level":"warning","message":{"text":"Reader::shortcut (cognitive 17): Reader::shortcut has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3, boolean chains 2, match/switch 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"luadec/src/read.rs"},"region":{"startLine":1482}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bdbb01fe8fa15767b2d5042413694a97b9b870f99baff0636df79ed8a035cbb"}},{"ruleId":"D2","level":"warning","message":{"text":"pathlist::write::encode_carved (cognitive 17): pathlist::write::encode_carved has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 4 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pathlist/src/write.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2dd96973be69f8453109c2f37d6f0265304295b4f0dbc8209bbe52eab6f391d"}},{"ruleId":"D2","level":"warning","message":{"text":"Rendered::details_ui (cognitive 17): Rendered::details_ui has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/mod.rs"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f94223cd1ef177984f8f50bc3ae9ed719ebcc16db41193095fa46732af8f85f"}},{"ruleId":"D2","level":"warning","message":{"text":"Sounds::poll (cognitive 17): Sounds::poll has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 3 (6 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/sound.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"706d1d4aea3a7af3b9f0911d4442cdf382cf98d621c94b1aa0d2ee9440576373"}},{"ruleId":"D2","level":"warning","message":{"text":"IconBrowser::draw_categories (cognitive 17): IconBrowser::draw_categories has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, loops 1 (2 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/icons/mod.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8676671b573f66ed5c18fa9a8ab6c7f7c01154b8b53ca4725f70cb58af5e133"}},{"ruleId":"D2","level":"warning","message":{"text":"QuestBrowser::draw_cutscenes (cognitive 17): QuestBrowser::draw_cutscenes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, 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":"viewer/src/quests/mod.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bec2db181f2d105b58454bc4f075d594b5c375837c5f9f032e84f9e889c2d5e"}},{"ruleId":"D2","level":"warning","message":{"text":"Player::transport (cognitive 17): Player::transport has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/quests/play.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2896711599e59eb14c0ddc705436ce34d91556024eef2570f6a2a2e15a4932"}},{"ruleId":"D2","level":"warning","message":{"text":"Player::step_ui (cognitive 17): Player::step_ui has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (6 pts), loops 1 (2 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/quests/play.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"3817f6eff94e3aab787bdd25281a434bbf4f841ee88d0a5f779906c8c237002e"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::grass::zone_ui (cognitive 17): viewer::assets::viewers::grass::zone_ui has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (5 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/grass.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9931ab8baa2c1c05264d2d061925543b507a5d358c75a1d10e9a4fdeea991c2"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::mdl::dye::table (cognitive 17): viewer::assets::viewers::mdl::dye::table has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 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":"viewer/src/assets/viewers/mdl/dye.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"441862ae72ea7e0ddeb9359b0dc06e499460e9543af1a5d864a78df34fd8652a"}},{"ruleId":"D2","level":"warning","message":{"text":"Renderer::textures (cognitive 16): Renderer::textures has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 6 (14 pts), loops 2 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2371c5f2026e14463c33686460099d925e6c86d35464356e550190572b4b09"}},{"ruleId":"D2","level":"warning","message":{"text":"Events::read (cognitive 16): Events::read has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/emote.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"471c2198387705005aa25f3fb442999c310c174c054ce9cdfe6751d4816f5df9"}},{"ruleId":"D2","level":"warning","message":{"text":"IconBrowser::draw_grid (cognitive 16): IconBrowser::draw_grid has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/icons/mod.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf432f8eb5b6e2518f7a4535c8157750306a1e9e81c0d216ca12ecf68cd28b8"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::avfx::curve::paint (cognitive 16): viewer::assets::viewers::avfx::curve::paint has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (7 pts), if/else 4 (5 pts), match/switch 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/curve.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"31473a09f276a3fadaaacb2034576a5cbed90a5361c557c22d85de7602d6a5c4"}},{"ruleId":"D2","level":"warning","message":{"text":"viewer::assets::viewers::font::ui (cognitive 16): viewer::assets::viewers::font::ui has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (7 pts), if/else 3 (5 pts), loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/font.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45be977161cc28fba67fcafd63fd9cdd099e0138588e2fbf8df4328f119193e"}},{"ruleId":"D2","level":"warning","message":{"text":"web::routes::api::build_songs (cognitive 16): web::routes::api::build_songs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/routes/api.rs"},"region":{"startLine":737}}}],"partialFingerprints":{"codehealthFindingId/v1":"de63aab1f5a8833355e9adf07adfb8980809c097338d213040c82537b39dd560"}},{"ruleId":"D2","level":"warning","message":{"text":"frame.main (cognitive 16): frame.main has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 2, loops 1, ternaries 1 (nesting depth added 2). Of this number, 14 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/frame.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3b0b5622ef07e4955497f9749f336625d42f17f47750547ef89fa0da8e0b0fa"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Scene: ClassTooLong \u2014 2994 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 63 methods, 2 blocks, lines 858-5401. The bar is 400 significant lines; this is 2594 over it, 7.49\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":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d94826144bf8370f90b1e5a2fe9a303a1fc3dec2018398b36f4166be8497c6a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scene/mod.rs: FileTooLong \u2014 3594 significant 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: Scene (2 blocks, 858-5401). The bar is 500 significant lines; this is 3094 over it, 7.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":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f3f37dae8c59f737fd9a90cc6303b988219f3b577a575e6ead18d530e54606"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mdl/deferred.rs: FileTooLong \u2014 3422 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 71% of them inside a single declaration: Buffers (3 blocks, 1000-4520), declaring 37 free functions. The bar is 500 significant lines; this is 2922 over it, 6.84\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cfa5f1b48ce401aef996390d4d52bfc72822f997caf1aae3b3bea55fa2e01e2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Buffer.fill: MethodTooLong \u2014 fill runs 668 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 568 over it, 6.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/program.rs"},"region":{"startLine":2931}}}],"partialFingerprints":{"codehealthFindingId/v1":"10da83974a9af96b9ff208de55566a8c0aec663a06dc13bf35fa9119a1c61c6a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Buffers: ClassTooLong \u2014 2423 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 88 methods, 3 blocks, lines 1000-4520. The bar is 400 significant lines; this is 2023 over it, 6.06\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8df73b582a48556408b20d0ae1c5b136a534407acc61bf0a24645e09a74fcbc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mdl/program.rs: FileTooLong \u2014 2492 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 46 free functions. The bar is 500 significant lines; this is 1992 over it, 4.98\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/program.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c008cd45f4627eb693d4e997fec55424e3dab294eb0a698bcf4ca4375fd49e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mdl/mod.rs: FileTooLong \u2014 2474 significant 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 62% of them inside a single declaration: Rendered (2 blocks, 469-3879). The bar is 500 significant lines; this is 1974 over it, 4.95\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":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66173fae7d8fb5e46bdc0d06e2a81fbd3791609ffaf3bce771d92f53e41ca08"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: character/mod.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 77% of them inside a single declaration: CharacterBuilder (3 blocks, 284-2882). 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":"viewer/src/character/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e3c0d7596a3c033b02f725ee58678b98ad7e9448d6af0d8f5ce7cc1e51903b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SetupWindow.draw: MethodTooLong \u2014 draw runs 454 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 354 over it, 4.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/setup.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09f26a886cdbb5afce4796e64f69b67109d4c62f8cc0699bc5e1be6ec19c944"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: CharacterBuilder: ClassTooLong \u2014 1772 significant 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, 3 blocks, lines 284-2882. The bar is 400 significant lines; this is 1372 over it, 4.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/mod.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2ef37ca6d0a543b4e81ef928da3cfe4734dd9085ba4a6ccd1805bb9ce8b267"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Rendered: ClassTooLong \u2014 1524 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 48 methods, 2 blocks, lines 469-3879. The bar is 400 significant lines; this is 1124 over it, 3.81\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"85eb194e3b27824d8b3c2e26743e800105fde358a75aa2fa01fcfbc1ada836de"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Scene.details_ui: MethodTooLong \u2014 details_ui runs 381 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 281 over it, 3.81\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":4866}}}],"partialFingerprints":{"codehealthFindingId/v1":"55aeeb5603a548da1b56ee47bafe1a4c840738ea6ca9607c91cd185cbfad4202"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Rendered.poll: MethodTooLong \u2014 poll 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":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"344af06839ae7437958a11f0759dd2655b0d0cdd7762a4fc68b36b350c1d13ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: assets/mod.rs: FileTooLong \u2014 1577 significant 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 1077 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":"viewer/src/assets/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72d32441b4a79622f99518203891baecedb99802f5f59efef98d51a99454f93"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: CharacterBuilder: TooManyFields \u2014 90 stored fields beside 53 methods. The bar is 30 stored fields; this is 60 over it, 3.00\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":"viewer/src/character/mod.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"1093918c86ec5be9636409e564518dd4915b609255aa32c609433fbb3fae51c2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: App: ClassTooLong \u2014 1192 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 54 methods, 4 blocks, lines 248-2067. The bar is 400 significant lines; this is 792 over it, 2.98\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":"viewer/src/app.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b8717479e7417ff7413cd385c8c8cb1835c91aa2370864a12aaae65122e99d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Scene: TooManyFields \u2014 89 stored fields beside 63 methods. The bar is 30 stored fields; this is 59 over it, 2.97\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":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f83f91e50cce3f117e987c34f1cd4370bfd3825b7daee9f71dc5c51c807d5a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: viewer::assets::viewers::layer::payload: FunctionTooLong \u2014 viewer::assets::viewers::layer::payload runs 296 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 196 over it, 2.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/mod.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d1a98d49d8fd7aa29ba362c3e6e6d9342923cf362289881d852fbafd699927"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Buffers: TooManyMethods \u2014 88 methods. The bar is 30 methods; this is 58 over it, 2.93\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c03b02eea4a7ad81fb2779c90fd1d8956ec036a4ae04c54ba1610a8f793a16e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/app.rs: FileTooLong \u2014 1446 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 82% of them inside a single declaration: App (4 blocks, 248-2067). The bar is 500 significant lines; this is 946 over it, 2.89\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab952cdd87ab51ed9b91fd0b4cc4142041ad5f43769b7b4a319953a2e8a8063"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/read.rs: FileTooLong \u2014 1380 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 65% of them inside a single declaration: Reader (2 blocks, 47-2028). The bar is 500 significant lines; this is 880 over it, 2.76\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"luadec/src/read.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fc0d8894d81ca3637ac5eef72a1d574f87dcae46048c974a203f155537acdb7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: smoke.main: FunctionTooLong \u2014 main runs 275 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 175 over it, 2.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/smoke.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed15b20b2b57662611bc56b4f0eb8a70b4141762b2506319349d8a3d784c015e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Scene.translate: MethodTooLong \u2014 translate runs 275 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 175 over it, 2.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":3590}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9e6ab8c664f336cddf86a8bc24a6d1fc9587cc510c35219dc0813326764cbf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: shadermerge::merge::merge: FunctionTooLong \u2014 shadermerge::merge::merge runs 263 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 163 over it, 2.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":"shadermerge/src/merge.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef8c49485ba79e6a2d27c0bed87b69163bbbe68df907a8b235ae9ea4221c306"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mdl/skin.rs: FileTooLong \u2014 1289 significant 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 789 over it, 2.58\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/skin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e292630fbbf5aae8ad6d8c6e54787c1f18a25c4812c1518100921c274077965d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CharacterBuilder.poll: MethodTooLong \u2014 poll runs 253 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 153 over it, 2.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/mod.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"87cac90367b1fc0144767372feee708c39b93fe3b22f8263794b94c41f0ebb4d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.draw_sheet_data: MethodTooLong \u2014 draw_sheet_data 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":"viewer/src/app.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"877ea52fc3e8608b0373be03a38f8e32185359ed5fb7630aa5ed0f87b9c68bae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scene/gpu.rs: FileTooLong \u2014 1212 significant 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: Renderer (3 blocks, 263-1690). The bar is 500 significant lines; this is 712 over it, 2.42\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef4f86a949ce256c7878d84a4529c911d6ec710e21e359e373e027e321125a9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Renderer: ClassTooLong \u2014 968 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 29 methods, 3 blocks, lines 263-1690. The bar is 400 significant lines; this is 568 over it, 2.42\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":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e3b5859a53bb1bcfe019a6d5d3bda811f6a630f5a969b1c95c7a4b2d034432"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cutb/play.rs: FileTooLong \u2014 1193 significant 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 51 free functions. The bar is 500 significant lines; this is 693 over it, 2.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/cutb/play.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3d0bbfd8e02e88d6f5728bf076de50e800b878f52945e5564a7676adc1c2d9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Buffers.attach: MethodTooLong \u2014 attach runs 228 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 128 over it, 2.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"428e9dd2b753534cdd73a70caeb5f917c761e34821ecbefaabf9a0c913da7354"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Reader: ClassTooLong \u2014 898 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 45 methods, 2 blocks, lines 47-2028. The bar is 400 significant lines; this is 498 over it, 2.25\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"luadec/src/read.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b320b4b79fdcfdf57e9dfb188f55cd74a300e1032e83097f83287808da97139"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: framediff::run: FunctionTooLong \u2014 framediff::run runs 220 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 120 over it, 2.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":"framediff/src/main.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"0560845731ad5132a6908afd32003834d7ed7c16ddde185aae81abdc827d65ff"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Rendered.viewport: MethodTooLong \u2014 viewport runs 211 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 111 over it, 2.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":2373}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b1f99dcff9bed778d4e532c27f492be374d31bbfe453de90b1714c0a4071f3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Scene: TooManyMethods \u2014 63 methods. The bar is 30 methods; this is 33 over it, 2.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":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab6ab00710d09936eeb5dfa1bf0ffcde39d3deae83bdbf145cdc5c43b00f0e6"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Buffers: TooManyFields \u2014 62 stored fields beside 88 methods. The bar is 30 stored fields; this is 32 over it, 2.07\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92177f897f744611193ea2adc32f7a3d361551241d7df345596b05168a117be"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Scene.viewport: MethodTooLong \u2014 viewport 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":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":4244}}}],"partialFingerprints":{"codehealthFindingId/v1":"237e614cf098540602d651a7431cc290bc25536b58ca63953ed44f9c0b08cf48"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: avfx/sim.rs: FileTooLong \u2014 1004 significant 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 504 over it, 2.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/sim.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c150f54232a879f05e6e90888720b415d7ae53ad716f1c3fdf4f93496016dfda"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mdl/gpu.rs: FileTooLong \u2014 993 significant 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 493 over it, 1.99\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/gpu.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7d82a149cc9127dc8bd4df5eca06bca58e637085943b676d7eff793ca88951"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: perf.main: FunctionTooLong \u2014 main runs 197 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 97 over it, 1.97\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/perf.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a71d8e7cc52413d1ecd1537a60b9fb78a67a825c44fa1a703b9c1753f2e3dff"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AssetBrowser: ClassTooLong \u2014 786 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 19 methods, 3 blocks, lines 820-1990. The bar is 400 significant lines; this is 386 over it, 1.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/mod.rs"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c7cde80a0e668668329cadec3c0c3445530e96e43d03db7e5e574c27bab6f6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Preview.info_ui: MethodTooLong \u2014 info_ui runs 192 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 92 over it, 1.92\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mod.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d9b0ad0e827f9eaae39fbe5efbd7c6caf8ce72b48ebcfc69e5f0241062e4e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: viewers/uld.rs: FileTooLong \u2014 933 significant 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 433 over it, 1.87\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/uld.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fad811d1f060fc5dab1ba5bdb362e4c9f6aa2798717abb75d8446e0e689adc4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.draw_menubar: MethodTooLong \u2014 draw_menubar runs 186 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 86 over it, 1.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d319f950d5944432636092ad7553edf790e75bf04a0b9f687d1a7cb494834e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PrWindow.draw: MethodTooLong \u2014 draw runs 186 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 86 over it, 1.86\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/pr_window.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f912cf343df6ec045377eee900badcb7851763b8e419b857d9d186589f872fa8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: mdl/export.rs: FileTooLong \u2014 922 significant 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 422 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":"viewer/src/assets/viewers/mdl/export.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"172aff605038df2512922456590055859c7862fa3c28b425b4640e9e176dee9c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EditableSchema.draw_internal: MethodTooLong \u2014 draw_internal 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":"viewer/src/editable_schema.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"efcbaf4e9fb11afde3aedd453ceb5c573de414c5ab03f1d2c90632e0791d4b9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: layer/mod.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":"viewer/src/assets/viewers/layer/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"691174b9486ae1926797c2ae6f1f5688baca1d0c1b47304342f4d3de5a7f0848"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Buffer: ClassTooLong \u2014 722 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 4 methods, 2 blocks, lines 1039-4074. The bar is 400 significant lines; this is 322 over it, 1.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":"viewer/src/assets/viewers/mdl/program.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"87ce178f76250bb78228d1318c4cde0909b333dac11c8ba511fa52316a7ae2a8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: App: TooManyMethods \u2014 54 methods. The bar is 30 methods; this is 24 over it, 1.80\u00D7 the bar. Most of these members implement app.App (54 of 54 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae0cd1d032bdd3f86010555e405a99be97874de37b43fd0f8eefc922dd97943"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: avfx/mod.rs: FileTooLong \u2014 896 significant 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 396 over it, 1.79\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6293d48b3666ebf6113e310f4c3f065011d08e8b5ffec5a5221a40e5a29aebca"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Builder.step: MethodTooLong \u2014 step runs 179 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 79 over it, 1.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shadermerge/src/canon.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a81a9f41143b47e1c6ba9c564d46777f29037489af6d8de4bc472456f07c1d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: viewers/mod.rs: FileTooLong \u2014 887 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 387 over it, 1.77\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68acc0266ce9bea8c284c334b0d981034f8d9bfbebe33ef395896120530d1757"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Renderer.render: MethodTooLong \u2014 render runs 177 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 77 over it, 1.77\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"fecc54e8a4282cb8a0ceca805428442c6270aac529bd2b1dfd466330442c4480"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: CharacterBuilder: 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":"viewer/src/character/mod.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"a004cc8e1dcbdfb2b2aefbc4c7873ec120cf377eb0f80bc712d93958e16ba65b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CharacterBuilder.side_panel: MethodTooLong \u2014 side_panel runs 176 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/mod.rs"},"region":{"startLine":2637}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6b592d779263c1ec3891cea1517eafcb64ea9d6b4711658afc492ec27b54c4"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Rendered: TooManyFields \u2014 52 stored fields beside 48 methods. The bar is 30 stored fields; this is 22 over it, 1.73\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6ab599ac23e7b215cd661767ca785ba06fd92d2b8a90197948f222d78e9219"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: viewer::assets::viewers::mdl::read_level: FunctionTooLong \u2014 viewer::assets::viewers::mdl::read_level runs 171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a420049e0971ca357a48fbfe199a5463aceea37a4326dafd676466b7582df53"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Ambient.ui: MethodTooLong \u2014 ui runs 169 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 69 over it, 1.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/ambient.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c2c123a899767b1eb994fb4677a085b53dccf39b31730e76e85091b144300e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: viewer::assets::viewers::shpk::list::ui: FunctionTooLong \u2014 viewer::assets::viewers::shpk::list::ui runs 168 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/shpk/list.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"565ca747016b53f4457ebfcb68aaeb1f0fa31465064a036015ccbd8dabdae468"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/music.rs: FileTooLong \u2014 830 significant 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: MusicPlayer (3 blocks, 120-931). The bar is 500 significant lines; this is 330 over it, 1.66\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":"viewer/src/music.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b316de50fe07014616e004c4f565a28ab815610de72ec7ee215b62fe774e606"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: viewer::assets::viewers::shpk::keys::read: FunctionTooLong \u2014 viewer::assets::viewers::shpk::keys::read runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/shpk/keys.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d165223b48e9e1d507b130d7b28b61dfab8868ed3e848f48b91b8c74d484c3f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Animation: ClassTooLong \u2014 657 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 44 methods, 2 blocks, lines 939-2014. The bar is 400 significant lines; this is 257 over it, 1.64\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/skin.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f03435608903e660d1f2da0b534ba45b82a07014e3729dd6308ade4ccbdb15c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Rendered: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d75646b05e2e42c220e900924bcd33fc4c2088f2c926b08e2bbf8099a09d1c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: viewer::assets::viewers::mdl::export::gather: FunctionTooLong \u2014 viewer::assets::viewers::mdl::export::gather runs 160 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 60 over it, 1.60\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/export.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0416bbfa485ae1ca2e8b01dedc0754feda7b62306ebd9486ab5dd3bb0b4e4118"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Scene.walk: MethodTooLong \u2014 walk runs 159 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":1647}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31c386ddc8b48e20c3b7b2b6618edcbcdb7d0215cc00c29b784b6ef1a937fd4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Reader.walk: MethodTooLong \u2014 walk runs 157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"luadec/src/read.rs"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2593536fcecd1346ebe24f1c471c50dad40f7b0ace4c654043a6e9e3120fe06"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IconBrowser: ClassTooLong \u2014 625 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 19 methods, 3 blocks, lines 62-939. The bar is 400 significant lines; this is 225 over it, 1.56\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":"viewer/src/icons/mod.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"97083d6e1a1aca50da89fd07e5508041c495db8977d79cf109f9824416f10a36"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: viewer::assets::viewers::layer::ui: FunctionTooLong \u2014 viewer::assets::viewers::layer::ui runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/mod.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ce61f865781ce22743764bb5f4d373eb9bc241031e016180879052f2a60d52"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Buffers.pass: MethodTooLong \u2014 pass runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":4022}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a653d80bb4d1060aebd2def3ff492c04ee5f7610e6d71fb2dccf00bb3b0c49"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SqpackWorker.received: MethodTooLong \u2014 received runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/worker/sqpack_worker.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a50ee563322061c1154ba2e6c40d8468803a1c3bfea81f3ba35b5bc26936d5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CharacterBuilder.appearance: MethodTooLong \u2014 appearance runs 154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/mod.rs"},"region":{"startLine":1955}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ebf99953bd3d833618136fa2b709cfe03e68bd04b2868aefd6ada7eb0a85fd"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Synth: ClassTooLong \u2014 615 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 13 methods, 2 blocks, lines 115-969. The bar is 400 significant lines; this is 215 over it, 1.54\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":"shadermerge/src/synth.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f2fa4d84d159b6f1f4d2c19dbbe4ee22288f4a1890be9018a0e82c6297ccd3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssetBrowser.detail_panel: MethodTooLong \u2014 detail_panel runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/mod.rs"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"d50af470833b4ef8a3bee05524bd107e68bb8cde5ca924979d07a29959886cf0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Reader: TooManyMethods \u2014 45 methods. The bar is 30 methods; this is 15 over it, 1.50\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"luadec/src/read.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b7ff2361d720ed3470df573cde1ed0f03dd21df09556e96db4b3dee8ba36861"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MusicPlayer.draw_player: MethodTooLong \u2014 draw_player 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":"viewer/src/music.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f38847392113163bcf08a53ca815da6a0356cbdfa62e9b1afda660d098e295"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: icons/mod.rs: FileTooLong \u2014 742 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 84% of them inside a single declaration: IconBrowser (3 blocks, 62-939). The bar is 500 significant lines; this is 242 over it, 1.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":"viewer/src/icons/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f78379d68982ed265b43d19ab2138be00f8cffbe614df11e256c1d943c8b78"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Animation: 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":"viewer/src/assets/viewers/mdl/skin.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"926cfffe284a016c03db797ce774e5d0e077b8c3c6c8e08ff80455aed6e314de"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: MusicPlayer: ClassTooLong \u2014 582 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 21 methods, 3 blocks, lines 120-931. The bar is 400 significant lines; this is 182 over it, 1.46\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/music.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a8bea5c119020876ef91d0749a4c84e6fe1e00a026f9efe3924dbe96fbc782"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/merge.rs: FileTooLong \u2014 710 significant 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 210 over it, 1.42\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shadermerge/src/merge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16427b720f31fa5dc0d2dc2f82111a52d9738e19e805e908220835089cf6e529"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.draw_sheet_list: MethodTooLong \u2014 draw_sheet_list runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8fa99f89139deba0a20753d8f7d0e478c4fe2279a587c2e611ae9261d0f455d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: routes/api.rs: FileTooLong \u2014 693 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 193 over it, 1.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/routes/api.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0518a66d9e6fa585c238bddaf4b79323add32640a17261a588058b6b3d9bf7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: smoke/smoke.ts: FileTooLong \u2014 692 significant lines (blank, comment-only and punctuation-only lines excluded). 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":"smoke/smoke.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96395f462daccdc001354d8da82298cd20ef2e2ab6f97351c6702cad935bbbf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/synth.rs: FileTooLong \u2014 679 significant 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: Synth (2 blocks, 115-969). The bar is 500 significant lines; this is 179 over it, 1.36\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shadermerge/src/synth.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd99f7ad2cb9ebba4da9513e048bd0c538c5c243190932434fa6814cd89d83d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scene/ambient.rs: FileTooLong \u2014 678 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 75% of them inside a single declaration: Ambient (2 blocks, 199-993). The bar is 500 significant lines; this is 178 over it, 1.36\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/ambient.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1808f61394b7a948e59a64a2bcd7bca5b79ccca798b5e5287c34bfe3e2149bf7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: shadermerge::factor::factor: FunctionTooLong \u2014 shadermerge::factor::factor runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shadermerge/src/factor.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa4a2d430ae9a601f7678437cafebdb4101925c37b0ce6c4e737966ebdd229b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AssetBrowser.draw_search: MethodTooLong \u2014 draw_search runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/mod.rs"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c484fdbbdfda2dee6e77191a01e5d948c09f19893997072a10dc7090c55989a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SetupWindow: ClassTooLong \u2014 530 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 4 methods, 2 blocks, lines 22-798. The bar is 400 significant lines; this is 130 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":"viewer/src/setup.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f93a9b9981166f516550b4f5c4a7769071f714b1f8de0b69bf26203cddc5cdf"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SheetTable: ClassTooLong \u2014 525 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 24 methods, 3 blocks, lines 50-811. The bar is 400 significant lines; this is 125 over it, 1.31\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":"viewer/src/sheet/sheet_table.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a6de6d2456b82b8d8a1b2fb74944d7cf89eb7e748bbaec7033199e875121c80"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/setup.rs: FileTooLong \u2014 653 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 81% of them inside a single declaration: SetupWindow (2 blocks, 22-798). The bar is 500 significant lines; this is 153 over it, 1.31\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/setup.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"672cf625df008d4ce61d331e2c4b842d28cbd7cc8197af35c15de0aed8daf8c1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Scene.new: MethodTooLong \u2014 new 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":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":1245}}}],"partialFingerprints":{"codehealthFindingId/v1":"75795fac96c7cb1f87cd5d7fa132143f97f2c0fb0cccae65efb8977b09200d3b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GoToWindow.draw: MethodTooLong \u2014 draw 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":"viewer/src/goto.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"0782a992518aa00ca7a04175e4812da738e1194620a96b00ba644c7f24e48f57"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Program.assemble: MethodTooLong \u2014 assemble 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":"viewer/src/assets/viewers/mdl/program.rs"},"region":{"startLine":2713}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc07da516db838b7cdb6ba3546cd2f15a7acbc15bf6beca9a9742f9b2d44c412"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Synth.build: MethodTooLong \u2014 build runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shadermerge/src/synth.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"75761b4219f304dd59e8cdda327422238f7cddf58306c6e23767dd58b239cf6d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Ambient: ClassTooLong \u2014 506 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 28 methods, 2 blocks, lines 199-993. The bar is 400 significant lines; this is 106 over it, 1.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/ambient.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab218b91f1ae061c838978d6140dad353661e86242a506494e704780dcc8cb4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: QuestBrowser: 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), 18 methods, 3 blocks, lines 86-771. 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":"viewer/src/quests/mod.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc8a790bf00003aaa9d7a8544e9fe2a4f997e66c0e7416cad084ea5404d3baae"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Synth.declarations: MethodTooLong \u2014 declarations 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":"shadermerge/src/synth.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6e0bb9644835ae79505afbbaf2657b573a167ab70dcca3a4d9905a3cd5e52d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: viewer::assets::viewers::phyb::simulator_ui: FunctionTooLong \u2014 viewer::assets::viewers::phyb::simulator_ui runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/phyb.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"b117ddcf0c2a498fc8bf60d93de972f03aa82963f150383e0669d8b08c89d045"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Game: ClassTooLong \u2014 482 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 10 methods, 3 blocks, lines 251-1366. The bar is 400 significant lines; this is 82 over it, 1.21\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/gpu.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfcb21e28230ec46400861e1f572b3ff7bc9fbd678d69ede42c6b6ac8d4b1a37"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Renderer.leg: MethodTooLong \u2014 leg 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":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab4a4ab8f617df49bc9892c724d3f9f9c6008f0b08a792b8f1c994fbcaa833b0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Scene.load_asides: MethodTooLong \u2014 load_asides 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":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":2483}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc5db7d60007ef8fe7db1dd5ebe5892c155f117f74d958b06eb8a5f57b823c4e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Rendered.details_ui: MethodTooLong \u2014 details_ui 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":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":3697}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef54ce98c186ed7b85d64afcc9d1aa8b7e53c5909e1652443b228839504694c7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CharacterBuilder.slot_ui: MethodTooLong \u2014 slot_ui 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":"viewer/src/character/mod.rs"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca277dcf124889d023ae7e1f8423a0c2bde946e7e3bcf5cc5b17fd11016d913"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: quests/mod.rs: FileTooLong \u2014 590 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 85% of them inside a single declaration: QuestBrowser (3 blocks, 86-771). The bar is 500 significant lines; this is 90 over it, 1.18\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/quests/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a196f5b4205d62d6fb8d6db1e44b675d77c709d6aa61585e399314fa07150c19"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: viewer::assets::hex_dump: FunctionTooLong \u2014 viewer::assets::hex_dump 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":"viewer/src/assets/mod.rs"},"region":{"startLine":2763}}}],"partialFingerprints":{"codehealthFindingId/v1":"27637c8c2db7fd6b8f5f02e7dead978b09016f01e4aae67ea411adcd51a2ce7c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Buffers.mirror: MethodTooLong \u2014 mirror runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":3086}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4b60163dc10074753f619f4ef251fd3a1ba855079f58614a72f7d6c3bac31e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Model.draw: MethodTooLong \u2014 draw runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/gpu.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"28215b5f6792f170713cf98d3b23e400fa5c3ef920df4328d43391d1ca31da33"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Location: TooManyFields \u2014 35 stored fields. The bar is 30 stored fields; this is 5 over it, 1.17\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11dc6595bcba41904a002dacfaff80bf61126fb8cf2668f767f55add5adcdcd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Graph.build: MethodTooLong \u2014 build runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/quests/graph.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"044f775c707735e9bce5d8fecd4c260f6c83cf009f7509c7104f1cf182867f7c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Preview: ClassTooLong \u2014 461 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 5 methods, 2 blocks, lines 306-920. The bar is 400 significant lines; this is 61 over it, 1.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":"viewer/src/assets/viewers/mod.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22cf2a4eff04632ddd7ddd199b48bbce5e56794dd9441f78f4d08291d84b4af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: luadec::read::sticky: FunctionTooLong \u2014 luadec::read::sticky 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":"luadec/src/read.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"845f5069e55bcb7446623db317518cd12b3ca70244b66af44dbf89ef5acfca22"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: viewer::assets::viewers::uld::canvas: FunctionTooLong \u2014 viewer::assets::viewers::uld::canvas 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":"viewer/src/assets/viewers/uld.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae286a9a905ededb93f287bb2bf6920282862c478c80da03168db5fa1a5a35a0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Scene.load_textures: MethodTooLong \u2014 load_textures runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":4038}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cfe1c9e9e150c44375f68d734acfdb33aab28f1f60bfab3505510d730225cde"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sheet/sheet_table.rs: FileTooLong \u2014 561 significant 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: SheetTable (3 blocks, 50-811). The bar is 500 significant lines; this is 61 over it, 1.12\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/sheet_table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"787061ef90f35d71fd1e7b137d7aef14ce4d30ff879c83cdc0f87ad5c1fc620b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: viewers/pcb.rs: FileTooLong \u2014 555 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 55 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/pcb.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ce5aa11f87cce5e529de2ce6ff1ee9b8b0d119a2123abf402d0e9cbc8fc5e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: viewer::assets::viewers::uld::properties: FunctionTooLong \u2014 viewer::assets::viewers::uld::properties runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/uld.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"668a1323fce1ddbf650714673f124bbc9e2579cdec31d46e40766e2b093317fc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Program: ClassTooLong \u2014 440 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 12 methods, 2 blocks, lines 2002-2904. The bar is 400 significant lines; this is 40 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":"viewer/src/assets/viewers/mdl/program.rs"},"region":{"startLine":2002}}}],"partialFingerprints":{"codehealthFindingId/v1":"25670e737cbce88cece43dcda34ee58547d467b7dd18f800b20229b743d427ea"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: shadermerge::merge::preprocess: FunctionTooLong \u2014 shadermerge::merge::preprocess 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":"shadermerge/src/merge.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"19481f87a92e7f334e231d11530251fed92b284072a01f13a36c4214babf8a97"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: framediff::bin::rdframe::run: FunctionTooLong \u2014 framediff::bin::rdframe::run 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":"framediff/src/bin/rdframe.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"86aabfd7c7579daf5b62cbec05bf44d450900a526b8fd0f78044ad246647415d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Rendered.translate: MethodTooLong \u2014 translate runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":3129}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fa8a179f54847b9fed85a701310dc2f6b3c93d9e8d489a94d7bfbcd8ba891d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IconBrowser.draw_detail: MethodTooLong \u2014 draw_detail runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/icons/mod.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ffed01fb2ec49f2f068cb072bd495aa994048d0f17b16cb41968b8f3858b4ef"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: viewer::assets::viewers::avfx::sim::shading: FunctionTooLong \u2014 viewer::assets::viewers::avfx::sim::shading runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/sim.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"29df0c140747d8fc3b14caf41c3d5bfafb2edc8fc3b6fe49d7d9cf646e98031e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Animation.walked: MethodTooLong \u2014 walked runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/skin.rs"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"489ce45e64936c24a0002ac40b2fe05b0c882b1796a48319969f23e0e6ce4aa0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: net.main: FunctionTooLong \u2014 main runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/net.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a510acbd256ec63a08448ba119b7302aa112da40a433564bc8d7d96697fcd0e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Synth.value: MethodTooLong \u2014 value runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shadermerge/src/synth.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd567631226cd9155c2106d10505623a0a7a336e5d562bd37c8b75e9ee3f8a25"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: web::main: FunctionTooLong \u2014 web::main runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/main.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"db271423982863d58d1facddfef6fc4d65176ac109e396cd750401411cfd6ddf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/data.rs: FileTooLong \u2014 507 significant 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 7 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/data.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed38a721b6f1e258aa70f7fb5f8d80290a55c978f3b4bb5b79c5abac5542699"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (37 shared lines): viewer/src/assets/viewers/mdl/program.rs:2377-2499 | viewer/src/assets/viewers/mdl/program.rs:2721-2884 \u2014 These two members are variants of one another: 37 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/program.rs"},"region":{"startLine":2377}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde4330182d9064dee734b7cb22642873ad2c7dda1254245cbb19d4a98be81bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): viewer/src/assets/viewers/layer/scene/gpu.rs:1776-1806 | viewer/src/assets/viewers/layer/scene/gpu.rs:1824-1854 | viewer/src/assets/viewers/mdl/deferred.rs:4827-4844 | viewer/src/assets/viewers/mdl/deferred.rs:4852-4878 | viewer/src/assets/viewers/mdl/deferred.rs:4884-4910 | viewer/src/assets/viewers/mdl/gpu.rs:1459-1508 | viewer/src/assets/viewers/mdl/grid.rs:86-103 \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":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":1776}}}],"partialFingerprints":{"codehealthFindingId/v1":"54cafbb529d0a9a72ebffc71b655ec3d3c36ed346cc26b367f8f6fcf0f28ab13"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): viewer/src/assets/viewers/avfx/mod.rs:1000-1089 | viewer/src/assets/viewers/layer/scene/mod.rs:4244-4542 | viewer/src/assets/viewers/mdl/mod.rs:2373-2697 | viewer/src/assets/viewers/pcb.rs:651-720 | viewer/src/assets/viewers/placed/mod.rs:126-192 \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":"viewer/src/assets/viewers/avfx/mod.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"42b36c36304e08a29296cdfbe3c96c71864a20beef2307870523816d1e7ec260"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): shadermerge/src/pick.rs:153-192 | viewer/src/assets/viewers/avfx/program.rs:280-331 | viewer/src/assets/viewers/mdl/program.rs:2145-2168 | viewer/src/assets/viewers/shader/code.rs:184-249 \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":"shadermerge/src/pick.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"81037627c876fa4e14242ee54f7782f158068368b283e7b1cd6ed282870ce4a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): viewer/src/assets/viewers/avfx/gpu.rs:549-584 | viewer/src/assets/viewers/mdl/deferred.rs:5145-5211 | viewer/src/assets/viewers/pcb/gpu.rs:175-202 | viewer/src/assets/viewers/placed/gpu.rs:219-246 \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":"viewer/src/assets/viewers/avfx/gpu.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"593aa7c95ea2e658f74a4885d3c7506c246d0fa6644fe52b7557c262070c806c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): viewer/src/assets/viewers/avfx/mod.rs:809-898 | viewer/src/assets/viewers/layer/mod.rs:849-1067 | viewer/src/assets/viewers/uld.rs:1235-1341 | viewer/src/assets/viewers/zone/envs.rs:202-303 \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":"viewer/src/assets/viewers/avfx/mod.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"eacabad0727bf80b5524c9e316811e47a78270919566b0d5ef873dbca754bc2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): viewer/src/assets/viewers/layer/scene/gpu.rs:644-761 | viewer/src/assets/viewers/layer/scene/gpu.rs:847-951 | viewer/src/assets/viewers/layer/scene/gpu.rs:1073-1236 | viewer/src/assets/viewers/layer/scene/gpu.rs:1372-1639 \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":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8fb148829ddd98c33e6b20d8c3ac42a74fb35069917111573a63bdb421d8403"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): viewer/src/assets/viewers/layer/scene/gpu.rs:777-831 | viewer/src/assets/viewers/layer/scene/gpu.rs:1023-1058 | viewer/src/assets/viewers/mdl/gpu.rs:1016-1124 | viewer/src/assets/viewers/mdl/gpu.rs:1146-1249 \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":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d4df16d079ab3a9e5308c29101e0ba1659024f8027ff2a41733f23c62dc4381"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): viewer/src/music.rs:283-361 | viewer/src/zones/mod.rs:213-283 \u2014 These two members are one piece of code written twice and then edited apart: 71 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/music.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9a6d790cf2171196f490b57840425f46c82bfd0084ecab830da2c30637b9b9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): viewer/src/music.rs:528-585 | viewer/src/zones/mod.rs:345-405 \u2014 These two members are one piece of code written twice and then edited apart: 58 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/music.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d652d9136710dd903e92b8dd301259bbf429df04fe41054a4b14034f30e5a68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): viewer/src/music.rs:599-636 | viewer/src/zones/mod.rs:419-455 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/music.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"517fb9e891fb5a48d0bd3858007e4f5560621e3b2b8e8b6fe65e36982aaabf0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): viewer/src/assets/viewers/avfx/program.rs:195-234 | viewer/src/assets/viewers/mdl/program.rs:2058-2098 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/program.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ac5427b3adc1876d17dc7fbcff182773b66be3748a93104966a417a69ad978"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): shadermerge/src/check.rs:107-142 | shadermerge/src/factor.rs:123-158 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shadermerge/src/check.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de75f5e80759befd06f87eb9ea8b2e167c670b89cbed96814f72529563bfbbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): viewer/src/assets/viewers/mdl/mod.rs:2891-2926 | viewer/src/assets/viewers/mdl/mod.rs:2931-2965 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":2891}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce9cc2099f7d1bb1dd473f56beec668b56857a4fa7a8f71e502893399310a61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): viewer/src/character/mod.rs:2179-2209 | viewer/src/character/mod.rs:2214-2250 \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":"viewer/src/character/mod.rs"},"region":{"startLine":2179}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbe2b4f3fd3e1435c95fb08d87198a0a526f69be981bee2054dc197c0104d08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): viewer/src/assets/viewers/layer/sound.rs:155-198 | viewer/src/assets/viewers/scd.rs:166-200 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/sound.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"85defd965b157652352b801ffcfaa9d3dcbe7a55fb8bffa2d16451d09afe3fca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): viewer/src/assets/viewers/mdl/mod.rs:3065-3093 | viewer/src/assets/viewers/mdl/mod.rs:3098-3125 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":3065}}}],"partialFingerprints":{"codehealthFindingId/v1":"83dfd943546d8f8aef66c54b8c63543ca1562cc67fe7e08f53b7028819ac6f50"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): viewer/src/assets/viewers/avfx/mod.rs:228-265 | viewer/src/assets/viewers/layer/scene/mod.rs:2757-2800 \u2014 These two members are one piece of code written twice and then edited apart: 38 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/mod.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"bee28fa708dbd609dfa3d4ff3638af474345d1de9180a6b3402c84a5216e279e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): viewer/src/assets/viewers/avfx/mod.rs:448-493 | viewer/src/assets/viewers/avfx/mod.rs:507-557 \u2014 These two members are one piece of code written twice and then edited apart: 46 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/mod.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f2e14c931184154791ad4447266ab9fa1153eaa2ca06400bff56583c08fefe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): viewer/src/assets/viewers/pcb/gpu.rs:204-230 | viewer/src/assets/viewers/placed/gpu.rs:249-275 \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":"viewer/src/assets/viewers/pcb/gpu.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"750aaa7b0e25cea0248764b235631a91b09eddf19d0a3d353f26d77ca1181117"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): viewer/src/assets/viewers/layer/scene/mod.rs:3472-3495 | viewer/src/assets/viewers/layer/scene/mod.rs:3500-3526 \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":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":3472}}}],"partialFingerprints":{"codehealthFindingId/v1":"381a2ec04e43f7da7e1e9622f096de76b92f06ce550e190a6e05393225ca5417"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): viewer/src/assets/viewers/layer/scene/mod.rs:1953-1981 | viewer/src/assets/viewers/layer/scene/mod.rs:2132-2161 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":1953}}}],"partialFingerprints":{"codehealthFindingId/v1":"4494f44cde454d1c1f93e04bd16493b425216735ab7a7d34c933152e6f5dee39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): viewer/src/assets/viewers/mdl/mod.rs:2838-2863 | viewer/src/assets/viewers/mdl/mod.rs:2969-2998 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":2838}}}],"partialFingerprints":{"codehealthFindingId/v1":"e619b413c91042b5167917e20cdba22d01aac7b56716b14b316d5758b83ba554"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): viewer/src/assets/viewers/layer/scene/mod.rs:4001-4021 | viewer/src/assets/viewers/mdl/mod.rs:1625-1650 \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":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":4001}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec874472d53000e1a0644be65a8a83010340ac936effd933012861c081e40877"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): viewer/src/assets/viewers/pcb.rs:624-649 | viewer/src/assets/viewers/placed/mod.rs:102-124 \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":"viewer/src/assets/viewers/pcb.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"797589a2771697d146098e9ac84d47540ed183a0e9aea8e6ad607ffe0c8fa63d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): viewer/src/report.rs:72-97 | web/src/paths/report.rs:70-91 \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":"viewer/src/report.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f94844d9401b2a82ebedc900c710e10e63b2b7bc5ed85f8e0f93ac82bf24309"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): viewer/src/assets/viewers/avfx/gpu.rs:517-547 | viewer/src/assets/viewers/mdl/deferred.rs:4914-4938 \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":"viewer/src/assets/viewers/avfx/gpu.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d572fd047f79e6c9beaf08b9c7c8ebe23abfb11f5fcebe431b74e014c5a8694"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): viewer/src/assets/viewers/est.rs:72-96 | viewer/src/assets/viewers/exl.rs:36-54 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/est.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e8e4c150802171819c9ceda5bbd136fcf086236845da3a5a7229b6ccf6906c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): viewer/src/utils/tex_loader.rs:329-345 | viewer/src/utils/tex_loader.rs:347-365 \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":"viewer/src/utils/tex_loader.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b62ed0d2853af709854a7c3896a5d144881f28eca6b604de9ce1ebdaa32a51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 15\u002B corresponding lines): viewer/src/assets/viewers/dic.rs:104-118 | viewer/src/character/mod.rs:2253-2269 | viewer/src/character/mod.rs:2272-2288 | viewer/src/character/mod.rs:2436-2452 | viewer/src/character/mod.rs:2455-2471 | viewer/src/character/mod.rs:2549-2565 | viewer/src/character/mod.rs:2568-2584 | viewer/src/character/mod.rs:2618-2635 \u2014 These 8 members are one piece of code written 8 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/dic.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b05387074a60995fcf5492f93103d5f4186e4a760e83be4fe628c8fd673a15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): viewer/src/sheet/filter/complex_filter_parse.rs:40-55 | viewer/src/sheet/filter/complex_filter_parse.rs:57-72 \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":"viewer/src/sheet/filter/complex_filter_parse.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f2df1578791405c2a19a45f5d34d6fa01b858fa3ae27bebfa954579cac1db5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): viewer/src/assets/viewers/mdl/deferred.rs:1985-2006 | viewer/src/assets/viewers/mdl/deferred.rs:3268-3283 \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":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":1985}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b310d0c785f6563ae914b57a921c070419ba2fee5c87d0fda865f4d490c1f82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): viewer/src/utils/tex_loader.rs:206-217 | viewer/src/utils/tex_loader.rs:312-327 \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":"viewer/src/utils/tex_loader.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1b252f042b7161de7ea37333fd6dc79ca8ee872710dc0c56d067f3c7c39d94"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): viewer/src/assets/viewers/layer/scene/gpu.rs:1647-1670 | viewer/src/assets/viewers/mdl/deferred.rs:2428-2451 \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":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":1647}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8f2791e21b51f902edb088dcb91bbe177fb6b4141577a38591c240adfcdc84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): viewer/src/assets/viewers/mdl/deform.rs:142-149 | viewer/src/assets/viewers/mdl/program.rs:368-376 \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":"viewer/src/assets/viewers/mdl/deform.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11c9297db008fd8e2a299a47ee4ab98d78298cacb252030bb83bc5e84804b9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): viewer/src/assets/viewers/eqp.rs:130-137 | viewer/src/assets/viewers/gmp.rs:85-101 \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":"viewer/src/assets/viewers/eqp.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"589fbd288a734dcc4840ff54748f915b532b0c1362b657b4f61e493112bde940"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): viewer/src/assets/viewers/fpeb.rs:185-211 | viewer/src/assets/viewers/waoe.rs:64-81 | viewer/src/assets/viewers/wtd.rs:64-88 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/fpeb.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3c8cff43176fc89fc42ebce2d7ff7060d54b072e81670666d57f61d69e9e44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): viewer/src/assets/viewers/mdl/program.rs:2334-2352 | viewer/src/assets/viewers/mdl/program.rs:2357-2370 \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":"viewer/src/assets/viewers/mdl/program.rs"},"region":{"startLine":2334}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de78faacec57939b4d4676ad81945008a8673500ed0e8b2f974d2c7c815cf12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): viewer/src/assets/viewers/pcb/gpu.rs:160-168 | viewer/src/assets/viewers/placed/gpu.rs:187-196 \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":"viewer/src/assets/viewers/pcb/gpu.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38feb36539f7815bf6f4846e4778bd742fc51651b14b001e36c0a847d9e2561"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): viewer/src/music.rs:265-281 | viewer/src/quests/mod.rs:342-365 | viewer/src/zones/mod.rs:195-211 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/music.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc69500fc7c6733bcde94a3fe18f309f435982a6d48d9c3d41ce09cdec28c73"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): viewer/src/assets/viewers/cutb/mod.rs:49-60 | viewer/src/assets/viewers/tmb.rs:194-205 \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":"viewer/src/assets/viewers/cutb/mod.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"92879fdf3e2e308d80d960814f08cca3b2a64ea930a36bc375bb414fa31ae109"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): viewer/src/sheet/filter/input.rs:124-144 | viewer/src/sheet/filter/input.rs:201-221 \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":"viewer/src/sheet/filter/input.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f187a12b9bd72a6f111f8f13218494f95e96fa8697f41070ccc15165bced92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): viewer/src/assets/viewers/mdl/mod.rs:1155-1164 | viewer/src/assets/viewers/mdl/mod.rs:1184-1195 \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":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe0681dc2b8c6c373f2457521ff2f88ffc4c485f7a68c6fb45b7f479ca4cf56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): viewer/src/assets/viewers/layer/lvb.rs:11-24 | viewer/src/assets/viewers/layer/sgb.rs:11-25 \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":"viewer/src/assets/viewers/layer/lvb.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ce3f743d334c18f83ad6a2ddb387acd0d886a397c95b1123190a1daf827398"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): viewer/src/data/web.rs:104-123 | viewer/src/data/web.rs:125-141 \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":"viewer/src/data/web.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a3addb629ebbde9f57e63c4a1e6798510e67399a1912f2e5806100a8576975"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): viewer/src/sheet/filter/complex_filter_parse.rs:157-170 | viewer/src/sheet/filter/complex_filter_parse.rs:246-261 | viewer/src/sheet/filter/complex_filter_parse.rs:263-276 \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":"viewer/src/sheet/filter/complex_filter_parse.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac680557147e8577e593105c49a97e5fb26d51bb593ee615bccf171b4212ba82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): viewer/src/data/worker.rs:58-71 | viewer/src/data/worker.rs:98-113 \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":"viewer/src/data/worker.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54829d3a41aa5c3db1ec7b216c80f7a050a5e0b8e0618a7019a860cafa91159"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): viewer/src/assets/viewers/font.rs:331-344 | viewer/src/assets/viewers/icons.rs:146-158 \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":"viewer/src/assets/viewers/font.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c952a69b1de00d016de52b7d08c5e3b8abfa81d7604e6dacf289444041af583"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): viewer/src/utils/tex_loader.rs:271-281 | viewer/src/utils/tex_loader.rs:283-298 \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":"viewer/src/utils/tex_loader.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"414d3796be87b3eb4619c24ad7345b3e2773e7e0c2ad7a6f1a5e1dd23f4dcdc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): web/src/data.rs:537-551 | web/src/data.rs:554-569 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/data.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"914551724b2488296ba08ef768d19824b61e54dba3f05834d91bc4b77007a71a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): viewer/src/assets/viewers/mdl/program.rs:1381-1389 | viewer/src/assets/viewers/mdl/program.rs:1393-1407 \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":"viewer/src/assets/viewers/mdl/program.rs"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a025988d58d382c7ae444bbf9b2c4ec9c8a90e4b8c48eb97189c52c265d9e06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): viewer/src/assets/viewers/eqdp.rs:104-112 | viewer/src/assets/viewers/evp.rs:73-80 \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":"viewer/src/assets/viewers/eqdp.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9b34653d1bfa41b046a12302c2aba01e833b8142f903672c535ceea63c686a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): viewer/src/sheet/filter/complex_filter_parse.rs:101-112 | viewer/src/sheet/filter/complex_filter_parse.rs:221-231 | viewer/src/sheet/filter/complex_filter_parse.rs:233-244 \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":"viewer/src/sheet/filter/complex_filter_parse.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1dc64f3b3ae6228fa549ab57c9d5f24bb57dfba7c631e4521048359f07a4b06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): viewer/src/editable_schema.rs:32-43 | viewer/src/editable_schema.rs:45-56 \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":"viewer/src/editable_schema.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c829c99b3a64223b7726e177f5400c6cabc2d5084734566dda0b7adf7994c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): viewer/src/app.rs:380-388 | viewer/src/app.rs:400-408 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"18e40a0c57d2c0ba7c4757c20a9169c8712c449a6c07fc81c7bcb8c0914ee01c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): viewer/src/assets/viewers/evp.rs:20-31 | viewer/src/assets/viewers/phyb.rs:25-43 | viewer/src/assets/viewers/skp.rs:66-83 \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":"viewer/src/assets/viewers/evp.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"982a340c15682bf797dff2abf04b5d4d67cf02c1d8441027c26d9ac809c7cca2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 10\u002B corresponding lines): viewer/src/app.rs:1638-1650 | viewer/src/app.rs:1674-1683 | viewer/src/app.rs:1709-1720 | viewer/src/app.rs:1747-1758 | viewer/src/app.rs:1782-1791 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c127b8ac393e1739188d8994d0b3e66a6bf164d5fc4433d984db2548d1c662"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): viewer/src/data/worker.rs:45-53 | viewer/src/schema/worker.rs:43-51 \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":"viewer/src/data/worker.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a8d18e0170de6bd1ca0e3343ece6f085b99a841b4ccf00eb48bbe7993b3d44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): viewer/src/utils/tex_loader.rs:194-202 | viewer/src/utils/tex_loader.rs:220-228 | viewer/src/utils/tex_loader.rs:367-380 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/utils/tex_loader.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1a2ad3e9be768812c55a24a71f52f84f9fccb4c53b1d085bb21cb9ae86eafc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 16\u002B corresponding lines): web/src/queue.rs:203-218 | web/src/queue.rs:225-242 | web/src/queue.rs:244-259 | web/src/queue.rs:261-276 | web/src/queue.rs:283-298 | web/src/queue.rs:305-322 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/queue.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae29a884d20c5d9c38500f4c503895df88c2b4b39aa7546319b12e8151b0f607"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): viewer/src/utils/export.rs:19-26 | viewer/src/utils/tex_export.rs:262-269 \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":"viewer/src/utils/export.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"89a7f8a984796e1998729931f222c11d398b9192da559550d8fc4089297d520c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): viewer/src/assets/viewers/mdl/skin.rs:2093-2099 | viewer/src/assets/viewers/mdl/skin.rs:2109-2115 \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":"viewer/src/assets/viewers/mdl/skin.rs"},"region":{"startLine":2093}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61497a62948aa8055a6568ff39ffc16205fcacc25ec5f663dc2ad9900636add"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): viewer/src/sheet/table_context.rs:293-304 | viewer/src/sheet/table_context.rs:312-322 \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":"viewer/src/sheet/table_context.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"8440c0e2645b8331278dbf45bc18d7ba5e92d5351cf63652f72e7f3cc21d665c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): viewer/src/assets/viewers/layer/scene/mod.rs:3424-3432 | viewer/src/assets/viewers/layer/scene/mod.rs:3460-3468 \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":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":3424}}}],"partialFingerprints":{"codehealthFindingId/v1":"f867e0ce7230a17cafaa80baf955434621a267752ea39488004bb406b5a49712"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): viewer/src/data/web.rs:90-102 | viewer/src/data/web.rs:143-155 | viewer/src/data/web.rs:157-169 \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":"viewer/src/data/web.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d66ea8d6b30dcbada293d4df81ff38287f2875bad0165f11dfc9401c8af6c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): viewer/src/assets/viewers/avfx/program.rs:614-621 | viewer/src/assets/viewers/mdl/program.rs:4077-4084 \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":"viewer/src/assets/viewers/avfx/program.rs"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea1f479b0e6a822126aab3eca991d60e0a50c63bb910ccbcfc236c5cd7daf723"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): viewer/src/app.rs:1627-1636 | viewer/src/app.rs:1736-1745 \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":"viewer/src/app.rs"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d28abb70b6fc91699ba2ea1cc66a4a165aa7df0e23907039c7a68ada4911f70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): viewer/src/assets/viewers/avfx/program.rs:347-359 | viewer/src/assets/viewers/mdl/program.rs:2220-2234 \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":"viewer/src/assets/viewers/avfx/program.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"db49638c393f01534d71872aa12407d5e19a50d5e98a2aba574d27d610d84a85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): shadermerge/src/pick.rs:13-21 | viewer/src/assets/viewers/shpk/keys.rs:62-70 \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":"shadermerge/src/pick.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5c779af8fd88af6213af9c3c723d15722e27503b75df99ae35a0757fc6bb95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): viewer/src/assets/viewers/avfx/mod.rs:593-600 | viewer/src/assets/viewers/avfx/mod.rs:602-613 \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":"viewer/src/assets/viewers/avfx/mod.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92464cf4b743f904e3d4f7086910d850528b38370ab24bc20f1616d53ad2df7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): viewer/src/app.rs:1661-1672 | viewer/src/app.rs:1699-1707 | viewer/src/app.rs:1769-1780 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f7e4f5fd1b57d4569c24232233529422bf2b10a389a619c9cfb1456e49257d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): viewer/src/sheet/filter/complex_filter_parse.rs:30-38 | viewer/src/sheet/filter/complex_filter_parse.rs:288-296 \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":"viewer/src/sheet/filter/complex_filter_parse.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7aff8c75762ad18196dd450612b072d1836d17c93eeaf93aef109bbb82bf10"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): viewer/src/assets/viewers/mdl/program.rs:2133-2141 | viewer/src/assets/viewers/shader/mod.rs:204-212 \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":"viewer/src/assets/viewers/mdl/program.rs"},"region":{"startLine":2133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b725679d7850579c5b6de9fc6a3dfbadcf42dc7fb52d66ea6b5733b1215a6b64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): viewer/src/data/sqpack.rs:43-51 | viewer/src/data/sqpack.rs:59-70 \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":"viewer/src/data/sqpack.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3562f63135cdb425bb071c662f0042ed94ef40b1aa205cb5e2418b21aef6ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): viewer/src/schema/web.rs:73-78 | web/src/routes/github.rs:65-72 \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":"viewer/src/schema/web.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab2072275f285a8935a3c2ce13e309440d54e705c451effd8be56a2b18fa8ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): viewer/src/assets/viewers/zone/envs.rs:182-185 | viewer/src/assets/viewers/zone/instanced.rs:271-274 \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":"viewer/src/assets/viewers/zone/envs.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"f604b55332f79decf939f0130b3b3180ff9d3a14ef2dd1528ec3f62fe0d92a01"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): viewer/src/assets/viewers/zone/envs.rs:187-190 | viewer/src/assets/viewers/zone/instanced.rs:276-279 \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":"viewer/src/assets/viewers/zone/envs.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee9f2613beb6e2bf0463f30063dbb1f901d5b0baf5efd17a6be8cb371f87e2ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): viewer/src/assets/viewers/zone/envs.rs:192-195 | viewer/src/assets/viewers/zone/instanced.rs:281-289 \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":"viewer/src/assets/viewers/zone/envs.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d09d719048721b31959847684fcc5e775dd528c24505675502761b4094e0284"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): viewer/src/assets/viewers/pcb/gpu.rs:171-173 | viewer/src/assets/viewers/placed/gpu.rs:214-217 \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":"viewer/src/assets/viewers/pcb/gpu.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"25743daafb107d3bda299e4c940ab7bf09f4f588f99f5b550e63e578172d1af3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): viewer/src/settings.rs:297-304 | web/src/data.rs:374-381 \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":"viewer/src/settings.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e90b28693d284f357ec58a708e4028ad4d4e9425c7e7d3baf3c16ac252a2fc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): viewer/src/assets/viewers/layer/mod.rs:248-257 | viewer/src/assets/viewers/zone/envs.rs:83-92 | viewer/src/character/palette.rs:118-120 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/mod.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"e39235bff74ef411e9205bb9b12eacd9860236d3b84682f3525be97413ae4d7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): viewer/src/setup.rs:239-267 | viewer/src/setup.rs:525-553 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/setup.rs:239\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/setup.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37098f8d77ee132e232807ad8b3c49f3dab9e1ea784177b44c133eae8d3d49f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201328 lines \u00D7 4): viewer/src/assets/viewers/avfx/mod.rs:1016-1043 | viewer/src/assets/viewers/mdl/mod.rs:2397-2424 | viewer/src/assets/viewers/pcb.rs:668-693 | viewer/src/assets/viewers/placed/mod.rs:142-169 \u2014 \u0060viewer/src/assets/viewers/avfx/mod.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 6 separate duplicated blocks between them, totalling at least 65 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/avfx/mod.rs:1016\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/mod.rs"},"region":{"startLine":1016}}}],"partialFingerprints":{"codehealthFindingId/v1":"72366ef57216edbcf859006f4985123fd9b757fc75bfd6ed78f618999e3fe3b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): viewer/src/assets/viewers/avfx/program.rs:283-309 | viewer/src/assets/viewers/mdl/program.rs:2172-2198 \u2014 \u0060viewer/src/assets/viewers/avfx/program.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/program.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 13 separate duplicated blocks between them, totalling at least 159 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/program.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5de57562541258d391d3e30fe56558f38215f7556980da1bcd9170211602175"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): viewer/src/music.rs:547-573 | viewer/src/zones/mod.rs:364-390 \u2014 before extracting anything, compare \u0060viewer/src/music.rs\u0060 and \u0060viewer/src/zones/mod.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060viewer/src/music.rs:547\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/music.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"a29b17d0269a09747b6259c3c6e41a67da758ce3ab17a42b884c4d50a08a9971"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 3): viewer/src/assets/viewers/avfx/mod.rs:848-872 | viewer/src/assets/viewers/layer/mod.rs:1020-1044 | viewer/src/assets/viewers/zone/envs.rs:247-271 \u2014 \u0060viewer/src/assets/viewers/avfx/mod.rs\u0060 and \u0060viewer/src/assets/viewers/layer/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 66 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/mod.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"8569fb134b0bcb4d6083a6216a356cf8f7a70d8cfc1dcbf0020b690dbf3b1332"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): viewer/src/assets/viewers/pcb/gpu.rs:178-202 | viewer/src/assets/viewers/placed/gpu.rs:222-246 \u2014 \u0060viewer/src/assets/viewers/pcb/gpu.rs\u0060 and \u0060viewer/src/assets/viewers/placed/gpu.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 68 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/pcb/gpu.rs:178\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":"viewer/src/assets/viewers/pcb/gpu.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9ea9e10ac07a0aabc5cae2048fd0891ca8974552bd75cee3f0822c9de8418a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): viewer/src/assets/viewers/mdl/deferred.rs:2118-2141 | viewer/src/assets/viewers/mdl/deferred.rs:2314-2337 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/mdl/deferred.rs:2118\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":2118}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a221785253981d612468461480344fe362f72d00a378c0f2836ab96f18fd89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3): viewer/src/assets/viewers/grass.rs:179-200 | viewer/src/assets/viewers/material.rs:232-253 | viewer/src/assets/viewers/uld.rs:1135-1156 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060viewer/src/assets/viewers/grass.rs:179\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/grass.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"e597bc6ed09fa3df5203ccb4a256e88c8bfc0bd35ffb5a8e309abff26e3b889e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): viewer/src/assets/viewers/mdl/program.rs:2380-2398 | viewer/src/assets/viewers/mdl/program.rs:2550-2569 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/mdl/program.rs:2380\u0060 it does not close everything it opens, so those exact 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":"viewer/src/assets/viewers/mdl/program.rs"},"region":{"startLine":2380}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae118726f3e767eeb6fe63f0e06c68aaabf272f5e02bab42fc7e35cb8cbb5293"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): viewer/src/assets/viewers/mdl/program.rs:2425-2442 | viewer/src/assets/viewers/mdl/program.rs:2782-2801 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/program.rs"},"region":{"startLine":2425}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a03d508eb931dd7dfc104ecac4eff31723c6748a0c334a89a213b6eb4e18a80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): viewer/src/setup.rs:194-212 | viewer/src/setup.rs:481-500 \u2014 both copies are in the same file, so extract the block 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":"viewer/src/setup.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bda3d396264e3fe56b90c7fe5ead4b404bfdf8e60630ea2e452b6e25ccc1e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): viewer/src/assets/viewers/layer/scene/gpu.rs:580-598 | viewer/src/assets/viewers/mdl/gpu.rs:1276-1292 \u2014 before extracting anything, compare \u0060viewer/src/assets/viewers/layer/scene/gpu.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/gpu.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/layer/scene/gpu.rs:580\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"62af2832c592f9bb8c37f39878ce6c7f7c47e9006ab14b52658ad63a95debce2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): viewer/src/assets/viewers/layer/scene/gpu.rs:1190-1208 | viewer/src/assets/viewers/layer/scene/gpu.rs:1477-1495 \u2014 both copies are in the same file, so extract the block 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, \u0060viewer/src/assets/viewers/layer/scene/gpu.rs:1210\u0060 calls \u0060color_mask\u0060 and \u0060viewer/src/assets/viewers/layer/scene/gpu.rs:1496\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":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"57e00a580c5b4324b291386ff3bf1c1125a5814719495a6494e76f8febb8cb72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): viewer/src/assets/viewers/layer/scene/gpu.rs:1779-1797 | viewer/src/assets/viewers/layer/scene/gpu.rs:1827-1845 \u2014 both copies are in the same file, so extract the block 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 \u0060indices\u0060 to \u0060\u0026[u32]\u0060 in one and \u0060\u0026[u16]\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":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":1779}}}],"partialFingerprints":{"codehealthFindingId/v1":"031ca63f3f6af2415bc81f7d7cd69e6c9596fc01b853c3c5c6157585c4087bb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 3): viewer/src/assets/viewers/mdl/deferred.rs:1877-1894 | viewer/src/assets/viewers/mdl/deferred.rs:2375-2392 | viewer/src/assets/viewers/mdl/deferred.rs:3315-3331 \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 \u0060viewer/src/assets/viewers/mdl/deferred.rs:1877\u0060 it does not close everything it opens, so those exact 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, \u0060viewer/src/assets/viewers/mdl/deferred.rs:2373\u0060 calls \u0060ok_or\u0060, \u0060table\u0060 and \u0060viewer/src/assets/viewers/mdl/deferred.rs:3314\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":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":1877}}}],"partialFingerprints":{"codehealthFindingId/v1":"230442395a1796e70fc0fd0502b8199f93ea94bbb44f23c3410d02b42f41c397"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): viewer/src/assets/viewers/cutb/sound.rs:153-170 | viewer/src/assets/viewers/layer/scene/sound.rs:115-132 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"viewer/src/assets/viewers/cutb/sound.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"388c2cb1f81a081f5bc672238f45c72d48ab4f52452f029b932d177a51cb8fb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): viewer/src/assets/viewers/pcb/gpu.rs:213-230 | viewer/src/assets/viewers/placed/gpu.rs:258-275 \u2014 \u0060viewer/src/assets/viewers/pcb/gpu.rs\u0060 and \u0060viewer/src/assets/viewers/placed/gpu.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 68 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/pcb/gpu.rs:213\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 \u0060indices\u0060 to \u0060\u0026[u32]\u0060 in one and \u0060\u0026[u16]\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":"viewer/src/assets/viewers/pcb/gpu.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abeea2963861fc1ebb0706535711eca607c2cfb527934835a4277692fec664c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): viewer/src/audio/web.rs:139-156 | viewer/src/audio/web.rs:626-642 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060audio\u0060 to \u0060Decoded\u0060 in one and \u0060Arc\u003CDecoded\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/audio/web.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"837a8d6efc8cbd7592fdafbb7d2ee6971a70e9d841f4f26ed1f8a7ca7b74e8cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): viewer/src/assets/viewers/layer/mod.rs:983-999 | viewer/src/assets/viewers/zone/envs.rs:204-220 \u2014 before extracting anything, compare \u0060viewer/src/assets/viewers/layer/mod.rs\u0060 and \u0060viewer/src/assets/viewers/zone/envs.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 105 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/mod.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab12cb2e6999416e80a26f3d464252a75c3a33f7d0e6c0333a0b9f9b6afc5747"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): viewer/src/assets/viewers/layer/scene/mod.rs:4170-4186 | viewer/src/assets/viewers/mdl/mod.rs:2180-2195 \u2014 before extracting anything, compare \u0060viewer/src/assets/viewers/layer/scene/mod.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/mod.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":4170}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8cdd009fe9d6119650e002569a8ff9c1f0e01e459b3fee351d9df6f6ea4c44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): viewer/src/report.rs:76-92 | web/src/paths/report.rs:73-89 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/report.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"de5c18bc3b2c88065d488bd3200636b3ff9e64952a7b615a2e16ee5dccfc3664"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): viewer/src/assets/viewers/avfx/program.rs:219-234 | viewer/src/assets/viewers/mdl/program.rs:2083-2098 \u2014 \u0060viewer/src/assets/viewers/avfx/program.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/program.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 13 separate duplicated blocks between them, totalling at least 159 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/avfx/program.rs:219\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":"viewer/src/assets/viewers/avfx/program.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e394ccc07819fc10446d96f94c7ebbd79b78bfc3161baad715b98a34138942"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): viewer/src/character/mod.rs:1831-1846 | viewer/src/character/mod.rs:3247-3260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/character/mod.rs:1831\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/mod.rs"},"region":{"startLine":1831}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7f8169cb2461321c5b828cae18fe094a02da5c5b6be95d0f54329a58d145ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): viewer/src/assets/viewers/avfx/mod.rs:884-898 | viewer/src/assets/viewers/layer/mod.rs:1053-1067 | viewer/src/assets/viewers/zone/envs.rs:289-303 \u2014 \u0060viewer/src/assets/viewers/avfx/mod.rs\u0060 and \u0060viewer/src/assets/viewers/layer/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 66 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/avfx/mod.rs:884\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/mod.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"986d48588dcb98d760e1b3fac71e30e2c2e1745feee2b3c022a6b8eec8dd58d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): viewer/src/assets/viewers/avfx/program.rs:315-329 | viewer/src/assets/viewers/mdl/program.rs:2153-2167 | viewer/src/assets/viewers/shader/code.rs:233-247 \u2014 \u0060viewer/src/assets/viewers/avfx/program.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/program.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 13 separate duplicated blocks between them, totalling at least 159 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/avfx/program.rs:315\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/program.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2bea7819b00efba4e7c8b5bbfc471a91a2566af73821edcd956c7d35088f226"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): viewer/src/assets/viewers/avfx/gpu.rs:552-566 | viewer/src/assets/viewers/mdl/deferred.rs:5168-5182 \u2014 before extracting anything, compare \u0060viewer/src/assets/viewers/avfx/gpu.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/deferred.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/avfx/gpu.rs:552\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/gpu.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"401789bfc9f36017c2551138a5cea3164c52a2a13fc2ccf6074d5d2d4fd95ca8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): viewer/src/assets/viewers/layer/scene/gpu.rs:609-623 | viewer/src/assets/viewers/mdl/gpu.rs:1303-1319 \u2014 before extracting anything, compare \u0060viewer/src/assets/viewers/layer/scene/gpu.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/gpu.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/layer/scene/gpu.rs:609\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1a2549a758c4066815dd5a214d653ea58fae36801e6f5e89db6238d996b8d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): viewer/src/assets/viewers/layer/scene/gpu.rs:1168-1182 | viewer/src/assets/viewers/layer/scene/gpu.rs:1464-1475 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/layer/scene/gpu.rs:1168\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":1168}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f2c6e76743703801f8c92d98444cca39444dd0af6d6c01c880d01dbb2f3bd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): viewer/src/assets/viewers/mdl/deferred.rs:1457-1470 | viewer/src/assets/viewers/mdl/deferred.rs:1522-1535 | viewer/src/assets/viewers/mdl/deferred.rs:3393-3406 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f34513afa0837f530852291c21a88420fa946ffae10d8b5990adea828b51768"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): viewer/src/assets/viewers/mdl/program.rs:2426-2439 | viewer/src/assets/viewers/mdl/program.rs:2667-2680 | viewer/src/assets/viewers/mdl/program.rs:2783-2796 \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 \u0060viewer/src/assets/viewers/mdl/program.rs:2426\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/program.rs"},"region":{"startLine":2426}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8dc94a003b46b096b1e268d7322392dfa374ad74c5785a00dc8b39cbbd9a90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): viewer/src/assets/viewers/avfx/program.rs:205-217 | viewer/src/assets/viewers/mdl/program.rs:2068-2081 \u2014 \u0060viewer/src/assets/viewers/avfx/program.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/program.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 13 separate duplicated blocks between them, totalling at least 159 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/program.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8e44584b201db7056bf29e0e4bce48b275609f78463977aec5cc8f987b01f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): viewer/src/assets/viewers/mdl/dye.rs:145-158 | viewer/src/assets/viewers/mdl/export.rs:357-370 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060viewer/src/assets/viewers/mdl/dye.rs:145\u0060 it does not close everything it opens, so those exact 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":"viewer/src/assets/viewers/mdl/dye.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca5f0673258edc250561ea673c16cd3e1b8e0e22c88fafda3e7e67ca1b29067"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201313 lines \u00D7 3): viewer/src/assets/viewers/cutb/mod.rs:173-185 | viewer/src/assets/viewers/pap.rs:198-205 | viewer/src/assets/viewers/sklb.rs:129-140 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/cutb/mod.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b48ec274fb8f5d1d4e3e71627a7939ca3248af06d2df5478128514a52a9cb2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): viewer/src/assets/mod.rs:1259-1271 | viewer/src/assets/mod.rs:1453-1463 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/mod.rs:1259\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/mod.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"22839b204d45638a86e580c18f00ad9bfb00fe29ebe93078f286a56098b91121"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): viewer/src/assets/viewers/avfx/program.rs:431-443 | viewer/src/assets/viewers/mdl/program.rs:2795-2807 \u2014 \u0060viewer/src/assets/viewers/avfx/program.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/program.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 13 separate duplicated blocks between them, totalling at least 159 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/avfx/program.rs:431\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060viewer/src/assets/viewers/mdl/program.rs:2808\u0060 calls \u0060declarations\u0060 and \u0060viewer/src/assets/viewers/avfx/program.rs:444\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/program.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fb137b5178c426ba8785b3cff198ef779edbd474af9f0f28b54b805f3571ab5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): viewer/src/assets/viewers/layer/mod.rs:1002-1017 | viewer/src/assets/viewers/zone/envs.rs:223-238 \u2014 before extracting anything, compare \u0060viewer/src/assets/viewers/layer/mod.rs\u0060 and \u0060viewer/src/assets/viewers/zone/envs.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 105 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060viewer/src/assets/viewers/layer/mod.rs:1002\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/mod.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"149495b964ac1b76df6b8dea51d7f06208d3793c82eb4c12f2bc5c595d5d368d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201313 lines \u00D7 2): viewer/src/assets/viewers/mdl/deferred.rs:3519-3531 | viewer/src/assets/viewers/mdl/deferred.rs:4321-4328 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/mdl/deferred.rs:3519\u0060 it does not close everything it opens, so those exact 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":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":3519}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1e8216e021bc3abe141eb87c95c5f18e7f25bf803cb582b9f4f536b175ae6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): viewer/src/assets/viewers/phyb.rs:27-39 | viewer/src/assets/viewers/skp.rs:67-79 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/phyb.rs:27\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/phyb.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ffe045ae10c315c45d37c712c5f205ae4ea2c5c3a9c14198c566803b88f5cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): viewer/src/setup.rs:374-385 | viewer/src/setup.rs:618-630 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/setup.rs:374\u0060 it does not close everything it opens, so those exact 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":"viewer/src/setup.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bacb650b4d6dee04dd53b89c7b21dea98431272e40e9eed20fd202230bfce9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 3): viewer/src/assets/viewers/avfx/program.rs:391-403 | viewer/src/assets/viewers/mdl/program.rs:2412-2423 | viewer/src/assets/viewers/mdl/program.rs:2734-2746 \u2014 \u0060viewer/src/assets/viewers/avfx/program.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/program.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 13 separate duplicated blocks between them, totalling at least 159 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/program.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"19213bdfddfab0365721c96613768e3aeba7a18da98b05f2f0179fb08fd08db3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): luadec/src/read.rs:1526-1537 | luadec/src/read.rs:1610-1620 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"luadec/src/read.rs"},"region":{"startLine":1526}}}],"partialFingerprints":{"codehealthFindingId/v1":"2669ad7b4a91e9b9c824cf642da7efa62b4b0732c9fd03fb677fe067151e2e8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): shadermerge/src/pick.rs:39-50 | viewer/src/assets/viewers/shpk/keys.rs:169-180 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"shadermerge/src/pick.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b1eb9574163b0b476560b46688fc02b76f82abf4ce51867d5ab1553a3b0cf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): viewer/src/assets/mod.rs:1231-1242 | viewer/src/assets/mod.rs:1430-1441 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/mod.rs:1231\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/mod.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"060ee1ebaf49d3e656ebe4085bb7a1171196f9c92d9ad55691ca7e0ea66f97a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): viewer/src/assets/viewers/avfx/program.rs:334-345 | viewer/src/assets/viewers/mdl/program.rs:2205-2216 \u2014 \u0060viewer/src/assets/viewers/avfx/program.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/program.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 13 separate duplicated blocks between them, totalling at least 159 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/program.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b58c137d24effce69fbcef73d9a53fbac895632891ce4a8801d6e9f220e6f0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 2): viewer/src/assets/viewers/layer/scene/gpu.rs:932-939 | viewer/src/assets/viewers/layer/scene/gpu.rs:1500-1511 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/layer/scene/gpu.rs:932\u0060 it does not close everything it opens, so those exact 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":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"339b3eed4bc40b5f3ff04d806692f2327ca7a0a16b7764acf0b0fc9670125f0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): viewer/src/assets/viewers/layer/scene/gpu.rs:1654-1665 | viewer/src/assets/viewers/mdl/gpu.rs:719-730 \u2014 before extracting anything, compare \u0060viewer/src/assets/viewers/layer/scene/gpu.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/gpu.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ff89ea408f8def4bfece23b9cd97c14c1ed84596451ba5298d3313664d55dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): viewer/src/assets/viewers/mdl/deferred.rs:2510-2521 | viewer/src/assets/viewers/mdl/deferred.rs:2533-2544 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/mdl/deferred.rs:2510\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":2510}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead7dc5f492495603bb023e304086e00999528d7a6f32aa0298b8eba282a0944"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): viewer/src/assets/viewers/mdl/deferred.rs:2711-2722 | viewer/src/assets/viewers/mdl/deferred.rs:2725-2736 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":2711}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3cb3d1a4e45a50e4aec1e05f0bb9210d348c65870663aa60b597794abdd6b5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 2): viewer/src/assets/viewers/mdl/deferred.rs:3534-3541 | viewer/src/assets/viewers/mdl/deferred.rs:4333-4344 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/mdl/deferred.rs:3534\u0060 it begins part-way through the construct above it, so those exact 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, \u0060viewer/src/assets/viewers/mdl/deferred.rs:4345\u0060 calls \u0060clone\u0060 and \u0060viewer/src/assets/viewers/mdl/deferred.rs:3542\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":3534}}}],"partialFingerprints":{"codehealthFindingId/v1":"4222c629f1d2cc8de6de3c814c3aab6c949081e1791ddfd3654618e30553ef7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): viewer/src/assets/viewers/mdl/gpu.rs:838-849 | viewer/src/assets/viewers/mdl/gpu.rs:1176-1187 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/mdl/gpu.rs:838\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/gpu.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"2081eda1d66c5023d183fcc471935ac33f9c6d7d5098052e493842e17ba4ddec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): viewer/src/assets/viewers/mdl/gpu.rs:1108-1118 | viewer/src/assets/viewers/mdl/gpu.rs:1230-1241 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/mdl/gpu.rs:1230\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/gpu.rs"},"region":{"startLine":1108}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf5d54c9fcb18ee156f33aa368daef67633d849e208f3d82eaad63cefecb2f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201312 lines \u00D7 2): viewer/src/data/worker.rs:63-71 | viewer/src/data/worker.rs:102-113 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/data/worker.rs:63\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":"viewer/src/data/worker.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7285878fc39c15800847d1253cf00858296ebd4fda3e632d660f8a2fcfa3559"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): viewer/src/sheet/filter/input.rs:125-136 | viewer/src/sheet/filter/input.rs:202-213 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/filter/input.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff2098bb4fcf95bb70933f892619f936b150aafda45c50773fe7b8a2c725eab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 6): viewer/src/assets/viewers/layer/scene/gpu.rs:1777-1787 | viewer/src/assets/viewers/layer/scene/gpu.rs:1825-1835 | viewer/src/assets/viewers/mdl/deferred.rs:4828-4837 | viewer/src/assets/viewers/mdl/deferred.rs:4853-4862 | viewer/src/assets/viewers/mdl/deferred.rs:4885-4894 | viewer/src/assets/viewers/mdl/gpu.rs:1460-1470 \u2014 before extracting anything, compare \u0060viewer/src/assets/viewers/layer/scene/gpu.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/gpu.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/layer/scene/gpu.rs:1777\u0060 it does not close everything it opens, so those exact 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 \u0060vertices\u0060 to \u0060\u0026[Vertex]\u0060 in one and \u0060\u0026[f32]\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":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"949beef7b80fc954a04f92d854075c9a1ae36b3d51af7933ee2137bce2b5bdaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): viewer/src/assets/viewers/avfx/gpu.rs:550-560 | viewer/src/assets/viewers/mdl/deferred.rs:5166-5176 | viewer/src/assets/viewers/pcb/gpu.rs:176-186 | viewer/src/assets/viewers/placed/gpu.rs:220-230 \u2014 before extracting anything, compare \u0060viewer/src/assets/viewers/avfx/gpu.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/deferred.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/avfx/gpu.rs:550\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/gpu.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd4aee69c95ed3d0cf5b7e92d52e5435cb8078b6a2526fd750f60eaeef95f42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): viewer/src/assets/viewers/mdl/gpu.rs:1110-1120 | viewer/src/assets/viewers/mdl/gpu.rs:1179-1189 | viewer/src/assets/viewers/mdl/gpu.rs:1233-1243 \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 \u0060viewer/src/assets/viewers/mdl/gpu.rs:1110\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/gpu.rs"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6b89a4b1425cfd04b2e86aab85ad5aebc6ef66811be0273562a85c73213de1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): luadec/src/read.rs:1263-1273 | luadec/src/read.rs:1462-1472 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060luadec/src/read.rs:1263\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"luadec/src/read.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76b75001a5e0b5d9c14fb47bba2367b756ab1fbb2344e874f99a5012963f59a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): viewer/src/assets/viewers/avfx/gpu.rs:569-579 | viewer/src/assets/viewers/mdl/deferred.rs:5193-5203 \u2014 before extracting anything, compare \u0060viewer/src/assets/viewers/avfx/gpu.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/deferred.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/avfx/gpu.rs:569\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/gpu.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d915fecb873e2e5aeec653a7da6e3aa810894abe1d43600b00edbdc88800b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): viewer/src/assets/viewers/avfx/mod.rs:172-182 | viewer/src/assets/viewers/mdl/mod.rs:2142-2152 \u2014 \u0060viewer/src/assets/viewers/avfx/mod.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 6 separate duplicated blocks between them, totalling at least 65 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/avfx/mod.rs:172\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/mod.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"efc5804dce46b4f854d95af3c55f02d7eee14e1b42a1a676bbe7f8e9439d33f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): viewer/src/assets/viewers/avfx/program.rs:459-469 | viewer/src/assets/viewers/mdl/program.rs:2464-2474 \u2014 \u0060viewer/src/assets/viewers/avfx/program.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/program.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 13 separate duplicated blocks between them, totalling at least 159 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/avfx/program.rs:459\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/program.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9420de7e1e553d2eb5893d03b897a1b2e7b909a6f79be5bd5bc93684878b21a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): viewer/src/assets/viewers/mdl/deferred.rs:1386-1399 | viewer/src/assets/viewers/mdl/deferred.rs:4447-4460 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/mdl/deferred.rs:1386\u0060 it does not close everything it opens, so those exact 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, \u0060viewer/src/assets/viewers/mdl/deferred.rs:4445\u0060 calls \u0060extend\u0060, \u0060take\u0060 and \u0060viewer/src/assets/viewers/mdl/deferred.rs:1384\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":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":1386}}}],"partialFingerprints":{"codehealthFindingId/v1":"6828d114027a16f91aeb5e0dc8e0c7ad88de711a70ef6f33c84a9af03a7f2a50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): viewer/src/assets/viewers/mdl/deferred.rs:4868-4878 | viewer/src/assets/viewers/mdl/deferred.rs:4900-4910 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/mdl/deferred.rs:4868\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":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":4868}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa56cacb4e1b2116d7177653de604f46f444dae82aad9a87d79b556464da5d90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): viewer/src/assets/viewers/pcb.rs:637-647 | viewer/src/assets/viewers/placed/mod.rs:112-122 \u2014 before extracting anything, compare \u0060viewer/src/assets/viewers/pcb.rs\u0060 and \u0060viewer/src/assets/viewers/placed/mod.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060viewer/src/assets/viewers/pcb.rs:637\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/pcb.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"0faba42d591ac73d6eedfb1b43d1eab329fac2de5bd73485932c08374db4d0f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): viewer/src/assets/viewers/pcb.rs:704-711 | viewer/src/assets/viewers/placed/mod.rs:178-188 \u2014 before extracting anything, compare \u0060viewer/src/assets/viewers/pcb.rs\u0060 and \u0060viewer/src/assets/viewers/placed/mod.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060viewer/src/assets/viewers/pcb.rs:704\u0060 it begins part-way through the construct above it, so those exact 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":"viewer/src/assets/viewers/pcb.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af2b53c9a67f54ed140c03f095765b4ef251b2a0ea817da328ae1eb619879dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): viewer/src/assets/viewers/shader/code.rs:74-84 | viewer/src/assets/viewers/shpk/merged.rs:94-104 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/shader/code.rs:74\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/shader/code.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d58e12ec064af0758b64cfe166e727272d91042a8fb783faa805b362feb4cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): viewer/src/music.rs:1127-1137 | viewer/src/zones/mod.rs:648-658 \u2014 before extracting anything, compare \u0060viewer/src/music.rs\u0060 and \u0060viewer/src/zones/mod.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/music.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"8269a0f1e709e0c53ea3ecf823733f1bb78662ac26d11df515f00085716e8e88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): viewer/src/setup.rs:215-225 | viewer/src/setup.rs:503-513 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/setup.rs:215\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/setup.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ea295653731ff1443e4ebfd029ad3bff14be3278eecb7daf2cc0ad682c5160"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 5): viewer/src/assets/viewers/layer/scene/gpu.rs:1789-1798 | viewer/src/assets/viewers/layer/scene/gpu.rs:1837-1846 | viewer/src/assets/viewers/mdl/deferred.rs:4867-4875 | viewer/src/assets/viewers/mdl/deferred.rs:4899-4907 | viewer/src/assets/viewers/mdl/gpu.rs:1484-1493 \u2014 before extracting anything, compare \u0060viewer/src/assets/viewers/layer/scene/gpu.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/gpu.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060indices\u0060 to \u0060\u0026[u32]\u0060 in one and \u0060\u0026[u16]\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":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":1789}}}],"partialFingerprints":{"codehealthFindingId/v1":"1067160f9129b9552e39eb2a3ae157a214f5f37ef6ef96d2f346f7a45031d590"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): shadermerge/src/check.rs:119-128 | shadermerge/src/factor.rs:134-143 | shadermerge/src/merge.rs:51-60 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060shadermerge/src/check.rs:119\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060shadermerge/src/factor.rs:144\u0060 calls \u0060sort_unstable\u0060 and \u0060shadermerge/src/check.rs:129\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shadermerge/src/check.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"84617359228f17aff84ecce713085109b0e56fa58e2ba271f02a863bceb27456"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): viewer/src/icons/mod.rs:345-354 | viewer/src/music.rs:545-554 | viewer/src/zones/mod.rs:362-371 \u2014 before extracting anything, compare \u0060viewer/src/music.rs\u0060 and \u0060viewer/src/zones/mod.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060viewer/src/icons/mod.rs:345\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/icons/mod.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c05fde20fe5bb5a61fa2db127fcdadb15f5ed3e00c435a45a8e69b270d5ff81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): shadermerge/src/check.rs:131-140 | shadermerge/src/merge.rs:80-89 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060shadermerge/src/check.rs:131\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shadermerge/src/check.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a66da5b62a21fa5fa272f77ee07553ff3077b18e9176d5c8df6e8945710135f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): shadermerge/src/merge.rs:807-816 | shadermerge/src/merge.rs:1010-1019 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060shadermerge/src/merge.rs:805\u0060 calls \u0060get\u0060, \u0060ok_or\u0060 and \u0060shadermerge/src/merge.rs:1007\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":"shadermerge/src/merge.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef67c63b7ef82cdaefde3299821e1470ac440fd07bb87ba4f2458bd165a40a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): viewer/src/assets/viewers/cutb/play.rs:1154-1163 | viewer/src/quests/detail.rs:501-510 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/cutb/play.rs:1154\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"viewer/src/assets/viewers/cutb/play.rs"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16330781c47db8e2c7b9fe354829023e31e77b46f14c8b71fcd9c595294551b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): viewer/src/assets/viewers/layer/scene/gpu.rs:806-815 | viewer/src/assets/viewers/layer/scene/gpu.rs:1041-1050 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060viewer/src/assets/viewers/layer/scene/gpu.rs:803\u0060 calls \u0060keep\u0060 and \u0060viewer/src/assets/viewers/layer/scene/gpu.rs:1040\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":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"3836344bb3d8d0fe91d41ab66ba0bd3be57ed9ceaeec363037b03b0c6ac75b59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): viewer/src/data/web.rs:74-83 | viewer/src/data/web.rs:105-114 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/data/web.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4f5b511df5193b9b012b544e817c40587c579e63be93dfff631addb09ee33a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): web/src/data.rs:540-549 | web/src/data.rs:646-655 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060web/src/data.rs:540\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/data.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5da1e36d074d92070a4d7ff4845b7b46f248d3d56d3027d13fedfa40bd892cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): viewer/src/assets/viewers/layer/scene/gpu.rs:685-693 | viewer/src/assets/viewers/layer/scene/gpu.rs:916-924 | viewer/src/assets/viewers/layer/scene/gpu.rs:1076-1084 | viewer/src/assets/viewers/layer/scene/gpu.rs:1396-1404 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":685}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb0bff74c298215d2b2f3e423ce3884c45d3489e0b3a47eb596e130e1b9498e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): viewer/src/assets/viewers/layer/scene/gpu.rs:715-723 | viewer/src/assets/viewers/layer/scene/gpu.rs:1166-1174 | viewer/src/assets/viewers/layer/scene/gpu.rs:1462-1470 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060viewer/src/assets/viewers/layer/scene/gpu.rs:725\u0060 calls \u0060bind_vertex_array\u0060, \u0060Some\u0060 and \u0060viewer/src/assets/viewers/layer/scene/gpu.rs:1175\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":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"411b761b6f4a661e948dc2ad94e1c914b12a0c93b23ac8b7d66a775c2598e205"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): viewer/src/assets/mod.rs:1185-1193 | viewer/src/icons/mod.rs:533-541 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"viewer/src/assets/mod.rs"},"region":{"startLine":1185}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea44d7a349c7cf16f4e508f9f0ed6e221d0d0ede63af3843da839b9d618833ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): viewer/src/assets/viewers/avfx/program.rs:489-497 | viewer/src/assets/viewers/mdl/program.rs:2940-2948 \u2014 \u0060viewer/src/assets/viewers/avfx/program.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/program.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 13 separate duplicated blocks between them, totalling at least 159 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/program.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d926440aaf2b0f211a1a95a6114a4ff4f5b6eaa9f76ae9a017704eec39498c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): viewer/src/assets/viewers/layer/scene/mod.rs:3686-3694 | viewer/src/assets/viewers/layer/scene/mod.rs:3968-3976 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/layer/scene/mod.rs:3686\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":3686}}}],"partialFingerprints":{"codehealthFindingId/v1":"09736e3c1ffbd29eac7a97f17db1c77db978e6185d50c14bcc2edaf5882403cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): viewer/src/assets/viewers/mdl/deferred.rs:3542-3555 | viewer/src/assets/viewers/mdl/deferred.rs:4346-4359 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/mdl/deferred.rs:3542\u0060 it does not close everything it opens, so those exact 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, \u0060viewer/src/assets/viewers/mdl/deferred.rs:4345\u0060 calls \u0060clone\u0060 and \u0060viewer/src/assets/viewers/mdl/deferred.rs:3541\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":3542}}}],"partialFingerprints":{"codehealthFindingId/v1":"2889e2ada65d68207bf3c2035e997bc8586a498cb55f435918fa81ff5f93d35f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): viewer/src/assets/viewers/mdl/deferred.rs:4836-4844 | viewer/src/assets/viewers/mdl/grid.rs:95-103 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060viewer/src/assets/viewers/mdl/deferred.rs:4836\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":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":4836}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4583a1399c08862d406983dd058f10e21f3d04f4222930a4d341dfd916c92eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): viewer/src/assets/viewers/mdl/program.rs:2566-2574 | viewer/src/assets/viewers/mdl/program.rs:2653-2661 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/program.rs"},"region":{"startLine":2566}}}],"partialFingerprints":{"codehealthFindingId/v1":"6156c5a7b473365ece82c73f56e016588d02b029a11ff8d7274e7dd554b796d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): viewer/src/assets/viewers/pcb.rs:88-96 | viewer/src/assets/viewers/placed/mod.rs:33-41 \u2014 before extracting anything, compare \u0060viewer/src/assets/viewers/pcb.rs\u0060 and \u0060viewer/src/assets/viewers/placed/mod.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/pcb.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e18fc0d9279065475c6d003a8df89b73bb0c740608e32cd7aee583cb8186a90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): viewer/src/music.rs:284-299 | viewer/src/zones/mod.rs:214-229 \u2014 before extracting anything, compare \u0060viewer/src/music.rs\u0060 and \u0060viewer/src/zones/mod.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/music.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"511f97242e7bad76cc81b32ce73f2029adc3e05d0c3cef1302ecfef517d8d4bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): viewer/src/music.rs:323-341 | viewer/src/zones/mod.rs:256-274 \u2014 before extracting anything, compare \u0060viewer/src/music.rs\u0060 and \u0060viewer/src/zones/mod.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/music.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdda669838718532f295f4aea38f3f6cd4e6e0f8295557da3aa9cb5cf658168"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): viewer/src/music.rs:589-597 | viewer/src/zones/mod.rs:409-417 \u2014 before extracting anything, compare \u0060viewer/src/music.rs\u0060 and \u0060viewer/src/zones/mod.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/music.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efec07f226ec2ca935e0310eb9baec34e363b421c31dd203c193db19a821313"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): viewer/src/setup.rs:165-173 | viewer/src/setup.rs:441-449 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/setup.rs:165\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/setup.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a373870209e9f4117f4a8e2988a80675b9f450c32248ca13726497e994694cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): viewer/src/assets/viewers/avfx/mod.rs:851-858 | viewer/src/assets/viewers/layer/mod.rs:1023-1030 | viewer/src/assets/viewers/uld.rs:1308-1315 | viewer/src/assets/viewers/zone/envs.rs:250-257 \u2014 \u0060viewer/src/assets/viewers/avfx/mod.rs\u0060 and \u0060viewer/src/assets/viewers/layer/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 66 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/avfx/mod.rs:851\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/mod.rs"},"region":{"startLine":851}}}],"partialFingerprints":{"codehealthFindingId/v1":"3192d7fb2da441cf75cb031fc75088a87d5c70f6444310988d818e158d2a0584"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): viewer/src/character/mod.rs:3241-3248 | viewer/src/quests/rewards.rs:146-153 | viewer/src/sheet/cell.rs:547-554 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/character/mod.rs:3241\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/mod.rs"},"region":{"startLine":3241}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f982b12d3a9b30f9d9427b6015c6cc6faaef3656b5fb7638bd4e98150a3e599"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): luadec/src/read.rs:830-837 | luadec/src/read.rs:907-914 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060luadec/src/read.rs:830\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"luadec/src/read.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda27235b679af92b71a1b05d13dc16dd6b7851f636e90f5b509c6a5c603a106"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): shadermerge/src/factor.rs:341-348 | shadermerge/src/factor.rs:377-384 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060shadermerge/src/factor.rs:341\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shadermerge/src/factor.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38ca6c4fb287e9ab899158467dad11064088e9829eb5da35c84801a274d179e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): shadermerge/src/pick.rs:14-21 | viewer/src/assets/viewers/shpk/keys.rs:63-70 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"shadermerge/src/pick.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2d6e242239a0d19ca5f779ed8e6c62c6a4fd8864f75261817be519a4eac114"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): viewer/src/assets/viewers/avfx/mod.rs:160-167 | viewer/src/assets/viewers/mdl/mod.rs:2129-2136 \u2014 \u0060viewer/src/assets/viewers/avfx/mod.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 6 separate duplicated blocks between them, totalling at least 65 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/avfx/mod.rs:160\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/mod.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e22f964859ddc0ee0fba2b980c44067e515a22d146325c4c9d046432e63ca1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): viewer/src/assets/viewers/mdl/deferred.rs:1425-1432 | viewer/src/assets/viewers/mdl/deferred.rs:4484-4491 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/mdl/deferred.rs:1425\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"998b83f4b9954acfcb7f42ea10a320de208fa39957b3b47567291ec76e1f32eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): viewer/src/assets/viewers/mdl/gpu.rs:1047-1055 | viewer/src/assets/viewers/mdl/gpu.rs:1195-1203 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/mdl/gpu.rs:1047\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/gpu.rs"},"region":{"startLine":1047}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e403e2e9ab142094f3e6e95f8d47e3898b814664c389049db5c739ee7b5781"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): viewer/src/assets/viewers/shader/code.rs:36-43 | viewer/src/assets/viewers/shpk/merged.rs:82-89 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/shader/code.rs:36\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/shader/code.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff0c2d2f4677216d03eca63707c2f8cd91e930ca10982faa9772a81330de985"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): viewer/src/assets/viewers/shpk/list.rs:26-32 | viewer/src/assets/viewers/shpk/list.rs:206-213 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/shpk/list.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"905f09acbdf1c0518610a1f1ff8a65c2f5ad10deafa7c92345e929f4e764b239"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): viewer/src/excel/base.rs:63-70 | viewer/src/schema/cache.rs:36-42 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/excel/base.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/excel/base.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b656d8fefaca686b05a5ea17bb151bd8920484dce7c83af6c7798b85b26cfab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 4): viewer/src/character/mod.rs:3241-3247 | viewer/src/quests/rewards.rs:146-152 | viewer/src/sheet/cell.rs:547-553 | viewer/src/sheet/event_icon_type.rs:142-148 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/character/mod.rs:3241\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/mod.rs"},"region":{"startLine":3241}}}],"partialFingerprints":{"codehealthFindingId/v1":"466b83ba39650a8fe398267102ce5bac80d365851dcdba6557c64e0c0b633840"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): viewer/src/assets/viewers/avfx/gpu.rs:518-525 | viewer/src/assets/viewers/mdl/deferred.rs:4915-4921 | viewer/src/assets/viewers/mdl/grid.rs:87-93 \u2014 before extracting anything, compare \u0060viewer/src/assets/viewers/avfx/gpu.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/deferred.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/avfx/gpu.rs:518\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/gpu.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"2564da7b8a1d6c4843777d1a7e562546816c64d6f3cef9816af6d7f4ade697cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20137 lines \u00D7 4): viewer/src/assets/viewers/avfx/mod.rs:1002-1008 | viewer/src/assets/viewers/mdl/mod.rs:2387-2390 | viewer/src/assets/viewers/pcb.rs:654-660 | viewer/src/assets/viewers/placed/mod.rs:128-134 \u2014 \u0060viewer/src/assets/viewers/avfx/mod.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 6 separate duplicated blocks between them, totalling at least 65 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/avfx/mod.rs:1002\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060viewer/src/assets/viewers/avfx/mod.rs:1008\u0060 calls \u0060sin_cos\u0060 and \u0060viewer/src/assets/viewers/mdl/mod.rs:2390\u0060 does not \u2014 after which the two agree again for 5 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/mod.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b4a0454aab74cca51c8016fa5012e6309962254775782749f8578513ba6052"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): viewer/src/assets/viewers/layer/scene/mod.rs:4519-4525 | viewer/src/assets/viewers/pcb.rs:707-713 | viewer/src/assets/viewers/placed/mod.rs:182-188 \u2014 before extracting anything, compare \u0060viewer/src/assets/viewers/pcb.rs\u0060 and \u0060viewer/src/assets/viewers/placed/mod.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 79 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060viewer/src/assets/viewers/layer/scene/mod.rs:4519\u0060 it does not close everything it opens, so those exact 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":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":4519}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be689c7af00d3e71ce101a172dcd2dc40685c519bff9d92f1c13132bcadde89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): web/src/queue.rs:98-105 | web/src/queue.rs:114-121 | web/src/queue.rs:130-137 \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 \u0060web/src/queue.rs:98\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/queue.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d22cd4e604208774eeb35bc5cc6ffe4a15a4f7ab59c69aa455b1c9055b7aa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): viewer/src/assets/viewers/avfx/program.rs:444-451 | viewer/src/assets/viewers/mdl/program.rs:2809-2816 \u2014 \u0060viewer/src/assets/viewers/avfx/program.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/program.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 13 separate duplicated blocks between them, totalling at least 159 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/avfx/program.rs:444\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/program.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"182601f2ee8787f17fa42724668e6c94f93191a813db0c47d51b13c5717c8c81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): viewer/src/assets/viewers/avfx/program.rs:615-621 | viewer/src/assets/viewers/mdl/program.rs:4078-4084 \u2014 \u0060viewer/src/assets/viewers/avfx/program.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/program.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 13 separate duplicated blocks between them, totalling at least 159 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/program.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"397c52f6eb5cdab66431c790080cc79c19148d24c41b68db83b74fde160135a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): viewer/src/assets/viewers/eid.rs:86-93 | viewer/src/assets/viewers/skp.rs:186-193 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/eid.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea48c71f0060e0cbca443d398f27bdd29bc032f0829f50a1f10eb7ca22fc547"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): viewer/src/assets/viewers/layer/scene/mod.rs:4015-4021 | viewer/src/assets/viewers/mdl/mod.rs:1644-1650 \u2014 before extracting anything, compare \u0060viewer/src/assets/viewers/layer/scene/mod.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/mod.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060viewer/src/assets/viewers/layer/scene/mod.rs:4015\u0060 it begins part-way through the construct above it, so those exact 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, \u0060viewer/src/assets/viewers/mdl/mod.rs:1643\u0060 calls \u0060chain\u0060, \u0060iter\u0060, \u0060flat_map\u0060 and \u0060viewer/src/assets/viewers/layer/scene/mod.rs:4014\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":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":4015}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e17a2eef2542aa740920d4a581e0695a48aa1d56ae82d5f0e59d53776fd2bc6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): viewer/src/assets/viewers/layer/scene/mod.rs:4520-4526 | viewer/src/assets/viewers/mdl/mod.rs:2681-2687 \u2014 before extracting anything, compare \u0060viewer/src/assets/viewers/layer/scene/mod.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/mod.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060viewer/src/assets/viewers/layer/scene/mod.rs:4520\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":4520}}}],"partialFingerprints":{"codehealthFindingId/v1":"5788eddfe883ed038833d86c10921b964328a16142faab3863931d7585083104"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): viewer/src/assets/viewers/layer/scene/sound.rs:253-259 | viewer/src/assets/viewers/layer/sound.rs:190-195 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/sound.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b72bdcc24eae3a94f6814619252f4019bfa3234142084a28635c120ba3ee112"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): viewer/src/assets/viewers/layer/sound.rs:174-180 | viewer/src/assets/viewers/scd.rs:184-190 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/layer/sound.rs:174\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/sound.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19cc468708f530ff1167104f11d31c0c6655c04c6c851120fd881c452d112e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): viewer/src/assets/viewers/mdl/deferred.rs:1374-1385 | viewer/src/assets/viewers/mdl/deferred.rs:4434-4445 \u2014 both copies are in the same file, so extract the block 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, \u0060viewer/src/assets/viewers/mdl/deferred.rs:4446\u0060 calls \u0060extend\u0060, \u0060take\u0060 and \u0060viewer/src/assets/viewers/mdl/deferred.rs:1386\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b0a485d19e543cb9924e025abdc46f611af01a50092cf24ffa67a5c6d4ea5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): viewer/src/assets/viewers/mdl/mod.rs:2896-2902 | viewer/src/assets/viewers/mdl/mod.rs:2936-2942 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/mdl/mod.rs:2896\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":2896}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c435c07a76df2e9ef130bc23f05bddaf189a324c152c84834fd40924b137d2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): viewer/src/assets/viewers/mdl/mod.rs:2908-2914 | viewer/src/assets/viewers/mdl/mod.rs:2942-2948 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/mdl/mod.rs:2908\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":2908}}}],"partialFingerprints":{"codehealthFindingId/v1":"1959d84bb63cd808637d3d1a3f30ab7d63e5100463911660616f3cc0fc658330"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): viewer/src/assets/viewers/mdl/program.rs:2464-2470 | viewer/src/assets/viewers/mdl/program.rs:2835-2841 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/mdl/program.rs:2464\u0060 it does not close everything it opens, so those exact 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":"viewer/src/assets/viewers/mdl/program.rs"},"region":{"startLine":2464}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e337ea3021e3b8fa9a76c13b1d61c90f2177a3fa409d7219c592cf9e1a6fa07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): viewer/src/assets/viewers/pcb/gpu.rs:104-110 | viewer/src/assets/viewers/placed/gpu.rs:119-125 \u2014 \u0060viewer/src/assets/viewers/pcb/gpu.rs\u0060 and \u0060viewer/src/assets/viewers/placed/gpu.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 68 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060viewer/src/assets/viewers/placed/gpu.rs:117\u0060 calls \u0060disable\u0060 and \u0060viewer/src/assets/viewers/pcb/gpu.rs:103\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/pcb/gpu.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5429a0290b2679fc9f5cf2c73e03786191e827f55075531d1e190de3f4fd441"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): viewer/src/assets/viewers/pcb/gpu.rs:205-211 | viewer/src/assets/viewers/placed/gpu.rs:250-256 \u2014 \u0060viewer/src/assets/viewers/pcb/gpu.rs\u0060 and \u0060viewer/src/assets/viewers/placed/gpu.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 68 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/pcb/gpu.rs:205\u0060 it does not close everything it opens, so those exact 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 \u0060vertices\u0060 to \u0060\u0026[Vertex]\u0060 in one and \u0060\u0026[f32]\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":"viewer/src/assets/viewers/pcb/gpu.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"3547d3df7e01d46bd0ab7036157ff0c92669f4637cc528ff0697e7382cf6940c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): viewer/src/character/mod.rs:2019-2025 | viewer/src/character/mod.rs:3056-3062 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/mod.rs"},"region":{"startLine":2019}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9b997eddd0f17518d2914dc2327dcbe656e8c1e4939cc7007528551d4dde03"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): viewer/src/goto.rs:56-62 | viewer/src/goto.rs:268-277 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/goto.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4dca8a2dfafab512596f529e3ee01054e9d1c05d28ec63095044ec3fc091333"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): viewer/src/quests/tree.rs:46-52 | viewer/src/quests/tree.rs:54-60 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/quests/tree.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"48cc0b2de558639bc2051691aeb926f0b1ec2f94c82793d4cc5a99c3b3fecade"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): viewer/src/utils/export.rs:20-26 | viewer/src/utils/tex_export.rs:263-269 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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":"viewer/src/utils/export.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"370e35eb92cb7605df2e30c093209ef1afda5fc1d653ba107d4ffd7b8994e12e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): viewer/src/assets/viewers/avfx/mod.rs:1080-1085 | viewer/src/assets/viewers/layer/scene/mod.rs:4520-4525 | viewer/src/assets/viewers/mdl/mod.rs:2681-2686 | viewer/src/assets/viewers/pcb.rs:708-713 | viewer/src/assets/viewers/placed/mod.rs:183-188 \u2014 \u0060viewer/src/assets/viewers/avfx/mod.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 6 separate duplicated blocks between them, totalling at least 65 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/avfx/mod.rs:1080\u0060 it does not close everything it opens, so those exact 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":"viewer/src/assets/viewers/avfx/mod.rs"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aca08dc85d6977c378a8ca881776ce5140a19b3e77cd8fb188ce8785b58d134"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): viewer/src/character/mod.rs:1824-1829 | viewer/src/character/mod.rs:3240-3245 | viewer/src/quests/rewards.rs:145-150 | viewer/src/sheet/cell.rs:546-551 | viewer/src/sheet/event_icon_type.rs:141-146 \u2014 there are 5 copies across 4 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/character/mod.rs:1824\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/mod.rs"},"region":{"startLine":1824}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bb7441de083b0a3cdbefc69f08bfa7c9a8fa1372d29c891f0bae65f01c20b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): shadermerge/src/pick.rs:161-166 | viewer/src/assets/viewers/avfx/program.rs:314-319 | viewer/src/assets/viewers/mdl/program.rs:2152-2157 | viewer/src/assets/viewers/shader/code.rs:232-237 \u2014 \u0060viewer/src/assets/viewers/avfx/program.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/program.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 13 separate duplicated blocks between them, totalling at least 159 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060shadermerge/src/pick.rs:161\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shadermerge/src/pick.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a6267ec1416619289080dcd4c53ee9e54dd6fc82bd0cc77d30891e98e6dae57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): luadec/src/read.rs:555-560 | luadec/src/read.rs:575-580 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060luadec/src/read.rs:555\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"luadec/src/read.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"c262b09e28e1d5e52a75dc80204da335426d016758373f5a82ecbd66186fa9db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): viewer/src/assets/viewers/avfx/mod.rs:810-815 | viewer/src/assets/viewers/zone/envs.rs:203-208 \u2014 before extracting anything, compare \u0060viewer/src/assets/viewers/avfx/mod.rs\u0060 and \u0060viewer/src/assets/viewers/zone/envs.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 72 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/avfx/mod.rs:810\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/mod.rs"},"region":{"startLine":810}}}],"partialFingerprints":{"codehealthFindingId/v1":"88433d90f1ef4aafeb176fa3c65b80f34966512bce733eaed92613664dca01aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): viewer/src/assets/viewers/layer/scene/mod.rs:2433-2439 | viewer/src/assets/viewers/layer/scene/mod.rs:2456-2461 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/layer/scene/mod.rs:2433\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":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":2433}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21adc82e512366e56a60135270bc3ea5f44e2a5b427c1c8597bab6b9a69d468"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): viewer/src/assets/viewers/layer/scene/mod.rs:2698-2703 | viewer/src/assets/viewers/mdl/effects.rs:181-186 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/layer/scene/mod.rs:2698\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":2698}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ea13a814eaba16f311e32dbc34689432d1df8e1d38c0834e72985b51bed1aa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): viewer/src/quests/requirements.rs:94-99 | viewer/src/quests/requirements.rs:129-134 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/quests/requirements.rs:94\u0060 it does not close everything it opens, so those exact 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, \u0060viewer/src/quests/requirements.rs:91\u0060 calls \u0060read\u0060 and \u0060viewer/src/quests/requirements.rs:127\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":"viewer/src/quests/requirements.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa3c37d664854deb549cfb2a5713ff992ef2b08fde48a893389692f40d88ab3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): viewer/src/sheet/cell.rs:120-125 | viewer/src/sheet/cell.rs:494-499 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/sheet/cell.rs:120\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/cell.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"0686f7c62d9e919a5237bba0a1e561d1d2f915bab734490cd5db9bb92b947b65"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): viewer/src/character/mod.rs:1823-1827 | viewer/src/character/mod.rs:3239-3243 | viewer/src/character/mod.rs:3388-3392 | viewer/src/quests/rewards.rs:144-148 | viewer/src/sheet/event_icon_type.rs:140-144 \u2014 there are 5 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/mod.rs"},"region":{"startLine":1823}}}],"partialFingerprints":{"codehealthFindingId/v1":"d580df32723d62d736fcf21ee7d90ff93d24eab1e068b63d56151aee9ebdc753"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): viewer/src/assets/viewers/layer/scene/gpu.rs:808-813 | viewer/src/assets/viewers/layer/scene/gpu.rs:1043-1048 | viewer/src/assets/viewers/mdl/gpu.rs:1050-1055 | viewer/src/assets/viewers/mdl/gpu.rs:1198-1203 \u2014 before extracting anything, compare \u0060viewer/src/assets/viewers/layer/scene/gpu.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/gpu.rs\u0060 as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/layer/scene/gpu.rs:808\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f9448e7d73d6ef63806e478a95f23b59101a53ed576afe67316e3a540f2304"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): viewer/src/assets/viewers/avfx/mod.rs:840-844 | viewer/src/assets/viewers/layer/mod.rs:1011-1015 | viewer/src/assets/viewers/zone/envs.rs:232-236 \u2014 \u0060viewer/src/assets/viewers/avfx/mod.rs\u0060 and \u0060viewer/src/assets/viewers/layer/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 66 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/avfx/mod.rs:840\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/mod.rs"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0fe46ba6602bc0e57bcdb39e164876f4507dd8ab10035d19756270ddbaca4b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): viewer/src/assets/viewers/mdl/deferred.rs:1704-1710 | viewer/src/assets/viewers/mdl/deferred.rs:4309-4313 | viewer/src/assets/viewers/mdl/deferred.rs:4392-4396 \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 \u0060viewer/src/assets/viewers/mdl/deferred.rs:1704\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c7b550b185b16788a2e166baada64c424a0ac0bc6c2ede9b6ea0ba15dcef4ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): viewer/src/assets/viewers/uld.rs:1397-1401 | viewer/src/assets/viewers/uld.rs:1412-1416 | viewer/src/assets/viewers/zone/envs.rs:461-465 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/uld.rs:1397\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060viewer/src/assets/viewers/uld.rs:1418\u0060 calls \u0060is_empty\u0060 and \u0060viewer/src/assets/viewers/uld.rs:1402\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":"viewer/src/assets/viewers/uld.rs"},"region":{"startLine":1397}}}],"partialFingerprints":{"codehealthFindingId/v1":"774faaa5aaa92345b2dccd8e02d1d0cfd23245c18a388669c19de9171f24a011"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): viewer/src/assets/viewers/layer/mod.rs:1213-1218 | viewer/src/assets/viewers/zone/envs.rs:449-454 \u2014 before extracting anything, compare \u0060viewer/src/assets/viewers/layer/mod.rs\u0060 and \u0060viewer/src/assets/viewers/zone/envs.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 105 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060viewer/src/assets/viewers/layer/mod.rs:1213\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/mod.rs"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"265fd4146e133207230c1b96034bcb66547e822920346e4b9e5ce68288a7177b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): viewer/src/assets/viewers/layer/scene/mod.rs:3474-3483 | viewer/src/assets/viewers/mdl/mod.rs:2940-2949 \u2014 before extracting anything, compare \u0060viewer/src/assets/viewers/layer/scene/mod.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/mod.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060viewer/src/assets/viewers/layer/scene/mod.rs:3474\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":3474}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e77c3db4f65c635f4e68daccad5c6c7f92c634deefba9eeea7cc3debf01797"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): viewer/src/character/menus.rs:227-231 | viewer/src/character/menus.rs:485-489 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/character/menus.rs:227\u0060 it does not close everything it opens, so those exact 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":"viewer/src/character/menus.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad911404ff9bd2bfc087931ccc702bf9891a8bdb418f6b05d4d29264e452fd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): viewer/src/assets/viewers/avfx/mod.rs:81-85 | viewer/src/assets/viewers/mdl/mod.rs:200-204 \u2014 \u0060viewer/src/assets/viewers/avfx/mod.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 6 separate duplicated blocks between them, totalling at least 65 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/mod.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0db833c88d9e99a982929a33572af36f04029657e1fc6714d16c9b0841c147"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): viewer/src/assets/viewers/avfx/program.rs:167-174 | viewer/src/assets/viewers/mdl/program.rs:2022-2029 \u2014 \u0060viewer/src/assets/viewers/avfx/program.rs\u0060 and \u0060viewer/src/assets/viewers/mdl/program.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 13 separate duplicated blocks between them, totalling at least 159 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/program.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"743a95e3711ea99d500a4579b94e1793caea1ef10c30cc177735fb4922c8a143"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): viewer/src/assets/viewers/layer/sound.rs:250-256 | viewer/src/assets/viewers/scd.rs:253-259 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"viewer/src/assets/viewers/layer/sound.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"4178c1ecc3bbb12910a0dfe4f05362dcf8d6b2d3b983ba5e507d1b627278f4a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): viewer/src/assets/viewers/scd.rs:262-273 | viewer/src/music.rs:1005-1016 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"viewer/src/assets/viewers/scd.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce36445f1984a8e16e76c49beb0e3c15459797483e3462eb02af20ab9a3e17a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): viewer/src/assets/viewers/layer/mod.rs:630-651 | viewer/src/assets/viewers/layer/mod.rs:712-723 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/layer/mod.rs:630\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/mod.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8d95a2a819453686e31420d19d70acb0861b37ffa92a6ba04c12163c30b0d2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): viewer/src/assets/viewers/pcb.rs:226-243 | viewer/src/assets/viewers/pcb.rs:275-283 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/pcb.rs:226\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"viewer/src/assets/viewers/pcb.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4345cc8c509803087095a2585ecb847fa405fd47af7c9a0452f77a35d687aaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): viewer/src/assets/viewers/avfx/mod.rs:824-836 | viewer/src/assets/viewers/layer/mod.rs:998-1009 | viewer/src/assets/viewers/zone/envs.rs:219-230 \u2014 \u0060viewer/src/assets/viewers/avfx/mod.rs\u0060 and \u0060viewer/src/assets/viewers/layer/mod.rs\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 5 separate duplicated blocks between them, totalling at least 66 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/avfx/mod.rs:824\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/mod.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3211833a9dfdce3182f605537a2b1e77eefe77ab6c336486f58d06cdd728a18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): viewer/src/assets/viewers/evp.rs:21-27 | viewer/src/assets/viewers/phyb.rs:27-39 | viewer/src/assets/viewers/skp.rs:67-79 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/evp.rs:21\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/evp.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ed36619471b670f737c9ad7efc6d438c3976762370bd5cd2a5b7ca28d75694"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): viewer/src/quests/mod.rs:516-526 | viewer/src/quests/play.rs:112-122 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/quests/mod.rs:516\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":"viewer/src/quests/mod.rs"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a1ac4b58e78b95534b17c37c41e7f40dc7b6af4241a5dda5bd707ba7fe9ab7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 2): viewer/src/assets/mod.rs:1784-1799 | viewer/src/zones/mod.rs:479-491 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"viewer/src/assets/mod.rs"},"region":{"startLine":1784}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c75cfd5593f6633651c12248dd1425afbc15026e6e0047044e637cc565dcc1a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): viewer/src/data/web.rs:91-99 | viewer/src/data/web.rs:126-135 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/data/web.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc4c74f56549a63ce754bb7be850467dda692ffcb420759f504394fe60caa44b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): viewer/src/data/web.rs:144-152 | viewer/src/data/web.rs:158-166 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/data/web.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"75dfadd0540d5d076d7fa06e5913e4a67092ee3f434394e98b08cd45ea029387"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): viewer/src/music.rs:532-540 | viewer/src/zones/mod.rs:349-357 \u2014 before extracting anything, compare \u0060viewer/src/music.rs\u0060 and \u0060viewer/src/zones/mod.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060viewer/src/music.rs:532\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/music.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2c912941e24296f7169c4436fd6199e48ac055778bcfd609db0e437b1156677"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): viewer/src/assets/mod.rs:1100-1108 | viewer/src/icons/mod.rs:332-340 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/mod.rs:1100\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/mod.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"3229337a7c41df7d56b1f43c702a0065506f9040e7448aef2303e6d3646ee255"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): viewer/src/assets/mod.rs:1186-1193 | viewer/src/assets/mod.rs:1836-1843 | viewer/src/icons/mod.rs:534-541 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/mod.rs:1186\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/mod.rs"},"region":{"startLine":1186}}}],"partialFingerprints":{"codehealthFindingId/v1":"522d9a440bb65bf9f2ab8916ae47d783d85f7b288c4df421181f135d029e56a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): viewer/src/character/menus.rs:452-457 | viewer/src/character/mounts.rs:52-58 | viewer/src/character/npcs.rs:331-337 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/character/menus.rs:452\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"viewer/src/character/menus.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"264869f678eb7ebbdc471e7345cb90ddfa0f7094b276091e3c5a447ffd013c1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): viewer/src/character/mod.rs:2193-2198 | viewer/src/character/mod.rs:2234-2239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/character/mod.rs:2193\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/mod.rs"},"region":{"startLine":2193}}}],"partialFingerprints":{"codehealthFindingId/v1":"74173807faf5d9365be6e600f33d81452e0d438b9f278cdb7bb3e3656c842882"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): viewer/src/quests/requirements.rs:69-74 | viewer/src/quests/requirements.rs:98-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 \u0060viewer/src/quests/requirements.rs:69\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/quests/requirements.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3149761d7abc0416c29c180835fe8c8d9b6185a53246f5901103fd271b3c279e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): viewer/src/assets/viewers/layer/sound.rs:283-288 | viewer/src/assets/viewers/scd.rs:106-111 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/layer/sound.rs:283\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/sound.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c750a383e940ceef1e07cf31afc986347971c7cb6c81248c2d39c587591b29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): viewer/src/assets/viewers/mdl/program.rs:2380-2384 | viewer/src/assets/viewers/mdl/program.rs:2550-2555 | viewer/src/assets/viewers/mdl/program.rs:2648-2652 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/program.rs"},"region":{"startLine":2380}}}],"partialFingerprints":{"codehealthFindingId/v1":"669ba27a61e4a165628dadafd67fbdf3b74329c41bb66df19a2a9692ad45ec91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): viewer/src/assets/viewers/mdl/export.rs:1182-1186 | viewer/src/assets/viewers/mdl/export.rs:1208-1212 | viewer/src/assets/viewers/mdl/export.rs:1221-1225 \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 \u0060viewer/src/assets/viewers/mdl/export.rs:1182\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/export.rs"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc5a1c744bfa3de6e8bf02fd8a932b649dab6431da7068b3e872e7d46a1a4ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): viewer/src/music.rs:253-257 | viewer/src/zones/mod.rs:179-183 \u2014 before extracting anything, compare \u0060viewer/src/music.rs\u0060 and \u0060viewer/src/zones/mod.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/music.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"6baa84253d40ad29198f746fbf2b2aceaad2aed6d9dcba544982ca90ec20bd1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): viewer/src/sheet/cell.rs:545-549 | viewer/src/sheet/sheet_table.rs:169-173 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/sheet/cell.rs:545\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":"viewer/src/sheet/cell.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"d030a542289b6a0b74e780d91e2ac42d08430c098fa3e2a789d3da268286e081"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): luadec/src/read.rs:864-868 | luadec/src/read.rs:878-882 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"luadec/src/read.rs"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2394ad43c7f58853f6fd7d1990a46db8cc1f858a8289da3f45c9997d040063c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): viewer/src/assets/viewers/mdl/mod.rs:1922-1926 | viewer/src/assets/viewers/mdl/mod.rs:1976-1980 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/mdl/mod.rs:1922\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5d915122e0ff4373479632ec8a4eb008a8eb04c883fbdbc40b67e9bfd4615e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): viewer/src/assets/viewers/mdl/program.rs:4137-4143 | viewer/src/assets/viewers/mdl/program.rs:4178-4184 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060viewer/src/assets/viewers/mdl/program.rs:4178\u0060 it does not close everything it opens, so those exact 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":"viewer/src/assets/viewers/mdl/program.rs"},"region":{"startLine":4137}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffd49c87c015d028295dc88ad4ee0cd952ec9789ebd035faefc761f6122c257"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: luadec: luadec: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e2e385f4d35d05c54f05aeb895c661f9007d8715927a453268ba2d9d5d1e4eee"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: pathlist: pathlist: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fcb1359d2c621d349cd58176394e08ea8c339c6164265843784f8445952783eb"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: WorkerFileProvider (LCOM4 5): WorkerFileProvider\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/data/worker.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5d6e67886a4e9c3e617c0e5d4f6b70e51f646e9e866110736a164a990949a09"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viewer/src/assets/viewers/mdl/program.rs: viewer/src/assets/viewers/mdl/program.rs changed 100 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 93 in Buffer::fill at line 2931. 2 of those changes were fix/bug commits, and the other 98 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- viewer/src/assets/viewers/mdl/program.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/program.rs"},"region":{"startLine":2931}}}],"partialFingerprints":{"codehealthFindingId/v1":"56bb69fc2b447601aabebf0b25acc1e41a451a25d93c407f55300678be1d94fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viewer/src/assets/viewers/layer/scene/mod.rs: viewer/src/assets/viewers/layer/scene/mod.rs changed 148 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in Scene::details_ui at line 4866. 2 of those changes were fix/bug commits, and the other 146 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- viewer/src/assets/viewers/layer/scene/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":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":4866}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae82df8c2a115eb451461508f9e2ad88618f7559e9469321263f15a378658ed8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viewer/src/character/mod.rs: viewer/src/character/mod.rs changed 79 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in CharacterBuilder::poll at line 692. 1 of those changes was a fix/bug commit, and the other 78 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- viewer/src/character/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":"viewer/src/character/mod.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe6f45e22bee9d686eb442bf6a8111a8c1169046d9b01d36b0b08106e8bec538"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viewer/src/assets/viewers/mdl/mod.rs: viewer/src/assets/viewers/mdl/mod.rs changed 88 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 71 in Rendered::poll at line 1673. 2 of those changes were fix/bug commits, and the other 86 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- viewer/src/assets/viewers/mdl/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":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"790e1b92497197c99ea584bea6da0297e97aef4b3756d0fc30f2c611b19139ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viewer/src/assets/viewers/mdl/deferred.rs: viewer/src/assets/viewers/mdl/deferred.rs changed 61 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in Buffers::pass at line 4022. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- viewer/src/assets/viewers/mdl/deferred.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":4022}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de0f38b32a1d4b25992b49edc1827995268f39d533bc2b1147b32cf0280eda1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viewer/src/assets/viewers/layer/scene/gpu.rs: viewer/src/assets/viewers/layer/scene/gpu.rs changed 46 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in Renderer::render at line 1366. 1 of those changes was a fix/bug commit, and the other 45 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-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- viewer/src/assets/viewers/layer/scene/gpu.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"00fb7740676e099e4026046dbef9a374f575c974b7bdbebd92f34afede86da51"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viewer/src/assets/viewers/mdl/skin.rs: viewer/src/assets/viewers/mdl/skin.rs changed 50 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Animation::walked at line 1731. 1 of those changes was a fix/bug commit, and the other 49 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- viewer/src/assets/viewers/mdl/skin.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/skin.rs"},"region":{"startLine":1731}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b6077ef9f34b156dfa9dc8e832b86027ddfde06323607f6f1fe32e037753db"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viewer/src/assets/viewers/cutb/play.rs: viewer/src/assets/viewers/cutb/play.rs changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in viewer::assets::viewers::cutb::play::ui at line 1269. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- viewer/src/assets/viewers/cutb/play.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/cutb/play.rs"},"region":{"startLine":1269}}}],"partialFingerprints":{"codehealthFindingId/v1":"2854000afd14839affa903896f76886fcc65c39f41014fdb69a4f432d356d96b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viewer/src/assets/viewers/avfx/sim.rs: viewer/src/assets/viewers/avfx/sim.rs changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in viewer::assets::viewers::avfx::sim::shading at line 704. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- viewer/src/assets/viewers/avfx/sim.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/sim.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"366c076f2add36875a2906dd03d703469bdbd9a29f1d01f728e3c1c85fd37e73"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viewer/src/assets/viewers/mod.rs: viewer/src/assets/viewers/mod.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in Preview::info_ui at line 665. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- viewer/src/assets/viewers/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":"viewer/src/assets/viewers/mod.rs"},"region":{"startLine":665}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08c915ef41aa5d3bc3ab0063124277ae8b2ffc939f8214b2273ea9af423cd20"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viewer/src/assets/viewers/layer/mod.rs: viewer/src/assets/viewers/layer/mod.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in viewer::assets::viewers::layer::payload at line 382. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- viewer/src/assets/viewers/layer/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":"viewer/src/assets/viewers/layer/mod.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e25776090bd84451309ac1e667914f15b1283c62b145c1143d17937cfec286"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viewer/src/assets/viewers/layer/scene/ambient.rs: viewer/src/assets/viewers/layer/scene/ambient.rs changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Ambient::ui at line 751. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- viewer/src/assets/viewers/layer/scene/ambient.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/ambient.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5732996a831a1d4880f322c6f960a0fa6c3a96e6b50061a25736bf93bc3742"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viewer/src/assets/viewers/mdl/export.rs: viewer/src/assets/viewers/mdl/export.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in viewer::assets::viewers::mdl::export::gather at line 89. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- viewer/src/assets/viewers/mdl/export.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/export.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac98b4f682d52d42245978e8d5d8cade9b07ef6bb6eb47071142228a85994d9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: smoke/smoke.ts: smoke/smoke.ts changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in smoke.main at line 566. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- smoke/smoke.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/smoke.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ddd81654c5d23a0db8bbcd46e53a9b0f03e976c7e201fdefed2e8089c54259"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viewer/src/assets/mod.rs: viewer/src/assets/mod.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in AssetBrowser::detail_panel at line 1629. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- viewer/src/assets/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":"viewer/src/assets/mod.rs"},"region":{"startLine":1629}}}],"partialFingerprints":{"codehealthFindingId/v1":"c739e17e26e8a19fd7fb063022adfbff80f427d6d413d74315aa7987c0fc2be5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viewer/src/app.rs: viewer/src/app.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in App::draw_menubar at line 543. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- viewer/src/app.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c191b8b432f09ba20cc1625c35cc07174faebb2dd1dbc78e9cf1f0f3dc0dbe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viewer/src/assets/viewers/mdl/gpu.rs: viewer/src/assets/viewers/mdl/gpu.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Model::draw at line 457. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- viewer/src/assets/viewers/mdl/gpu.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/gpu.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a13c78dbf39aaac3fbc7d4b4e0d1cdbe74a6fda9fd738967e04a8e7e542b23"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: luadec/src/read.rs: luadec/src/read.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in Reader::walk at line 1641. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- luadec/src/read.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"luadec/src/read.rs"},"region":{"startLine":1641}}}],"partialFingerprints":{"codehealthFindingId/v1":"a547f73d72f4e52676738a9e76a8c1481dfab86351f54b81894f66ff54e577be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viewer/src/character/stand.rs: viewer/src/character/stand.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in Cast::poll at line 283. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- viewer/src/character/stand.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/stand.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd8426aa0c9c7450b53db1df7c46c23939fe799bd3735425624d1493a18daad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viewer/src/icons/mod.rs: viewer/src/icons/mod.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in IconBrowser::draw_detail at line 798. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- viewer/src/icons/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":"viewer/src/icons/mod.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"45641646b9790301459d98eaf5de3f228a168033bcf6fcf201067c11426c6bde"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viewer/src/assets/viewers/mdl/emote.rs: viewer/src/assets/viewers/mdl/emote.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Cue::poll at line 411. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- viewer/src/assets/viewers/mdl/emote.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/emote.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bfd1a5c663fdab2dc31e0115a9817c12f03e5300d835013e932b68e0e6f1338"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viewer/src/music.rs: viewer/src/music.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in MusicPlayer::draw_player at line 701. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- viewer/src/music.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/music.rs"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d9b3f5ca2b67895b22f7f63635107f7830701182340aa8d1f166e13dc6fa243"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viewer/src/smoke.rs: viewer/src/smoke.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in SmokeApp::ui at line 365. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- viewer/src/smoke.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/smoke.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"2327f8937e2d3c1188c269592bc09009da9f781b91ef165b23ae22897b5c7c9f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viewer/src/character/gating.rs: viewer/src/character/gating.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Worn::covers at line 128. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- viewer/src/character/gating.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/gating.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1358b8cd0347668586803cae510376d666d81cbc5ec05ccc75a974842e1dd55"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: framediff/src/main.rs: framediff/src/main.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in framediff::run at line 84. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- framediff/src/main.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"framediff/src/main.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b43288e5d80be10c907e020a4dd7f127875bc77592fe86cc968048714ae9b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: smoke/perf.ts: smoke/perf.ts changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in perf.main at line 95. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- smoke/perf.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/perf.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"8853b979fee8d11a48a4bdeb7ed85ad0fcbbe6219dc8befb57bd0d1b529f2851"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viewer/src/character/emotes.rs: viewer/src/character/emotes.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in viewer::character::emotes::read at line 178. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- viewer/src/character/emotes.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/emotes.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b6e45c588841565899a3c70dcd5907ad9a125bd6694af36a7fa1a5ea01477f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viewer/src/assets/viewers/mdl/effects.rs: viewer/src/assets/viewers/mdl/effects.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Effects::poll at line 135. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- viewer/src/assets/viewers/mdl/effects.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/effects.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6978fe1ed525d87a2724349258adb17e92b62feace5fe1c7067e79591a01ef4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: viewer/src/character/menus.rs: viewer/src/character/menus.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in viewer::character::menus::pieces at line 297. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- viewer/src/character/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":"viewer/src/character/menus.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd271742b163dd4905250e57628a6270b222bfad41f086217cf96a1bbe2d88d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: smoke/probe.ts: smoke/probe.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in probe.main at line 130. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-16 08:21:56 -08:00\u0027 --until=\u00272026-11-14 08:21:56 -08:00\u0027 --full-history --no-merges -- smoke/probe.ts\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/probe.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"5840fa425ce4fc6169c89ecef68184f5c43ac4286a43cb73e9e47d62dbb0f7e7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: seems really wasteful to copy the entire image in memory just to reassign the channels. think of a better way to do this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/utils/tex_loader.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"56bb62ab947c2b05b83ff95c518cea74febdf2ca9616f19d2c1ff4da7c77d5e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use array_chunks once it hits stable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/utils/tex_loader.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"e983a5a5d4cdac6f6ba738a4b6b471d7c480e903fec7ce6911946f0644602fa2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: are there any non-failure cases here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/utils/tex_loader.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4094aa3cab1d3f1bb97cf13823401822144d75ec9a049924fb4b6ff12c7a79e"}},{"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 \u0060web/src/main.rs\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f397ed9690197e7963a06e799770da9481fb13442098b16d2c95402cadb977"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060viewer\u0060 (91780 LoC, 588 module-visible types across 28 directories) overshoots its size bounds. 1 of 9 build unit(s) (Cargo) overshoot their size bounds, lowering Project Cohesion to 7.8/10. Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"524d7e868ac32f77923ccfae6837e62d10dba4e07509565031463fe5261e727e"}},{"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":"1abf795a9d6415ea0cc612812b91eb9aff01b983c0b7327fc0e7add606ff7e52"},"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":"18bfd057a4fe9d9f903c05ce99c57e313d455368c3a5a17464bff95bd8a4a16a"},"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":"ced15fce7d961fa84ebd4352abc9da2c5e61caf25eb5959798ba7ee6d61122b6"},"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":"8c49f0ad232dea0e0cbb6fe344be0afcacbdf43c3b7d1461b464c10e931d27bf"},"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":"1821e1bf39c12a1631b5a84fd08e7b545a42fc726cdd1db3f37f4edf2ffaa532"},"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":"37d3ac1bd8810cdee2a2460e11c79c76338c8d671e0cfff617d6cc77e2f8b67a"},"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":"dbc896e7f4d0fec20f04b7fc31c8c4f9814b6d695d13fca2f594c702a02f544f"},"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":"b8be2bfb0198ec0f951eaa6833ab4d99a088b9fee60497bead5b4b377c069be6"},"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":"c4f2559ce82a1599533bc76bfbba3527874ebe6222a118633ba6a297907d4454"},"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":"0378dc86be8ec428467d2acc1768e7f5086e7c4f68428b06aaeb4a8a19027fb6"},"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":"337fa081553922d280e51fb2a7fa2b7ff12a0810b20f5cea51d32e7cb0e4e218"},"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":"9625f57eb119a0ac68296928133112f6019d036f1dcdc2cdddf64bd96a34920f"},"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":"e83c78305fa76a1bae542950b66b7c9e859499688766a9ee70014fea339fa1d8"},"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":"02dca755178b34bc460ffd2c94933bb9fc156e60916690e34cc59a66800fc752"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a8ead7054d83410525d3fa48b344be264ed51fed542e26d1968cb79d363cebb9"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"5700cf8ee182fc440abb16030061d2e9976929eb60c880096208a514bc453b10"},"properties":{"dependency":{"package":"zip","version":"8.6.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0367","RUSTSEC-2026-0368","RUSTSEC-2026-0369","RUSTSEC-2026-0429"],"severity":"critical","fixedVersion":"9.0.5","relation":"direct","declaredRange":"8","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":"baff9f37d19378d0b2078abf9afc4d42cb46356ce4f746d08f8d86e324a8d6a2"},"properties":{"dependency":{"package":"actix-files","version":"0.6.10","advisory":"RUSTSEC-2026-0443","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"0.7.4","relation":"direct","declaredRange":"0.6","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":"e2cc0412d7d7d1687bafca8cd45b662d4bbd215f7e22b475fbad02fd994fc6d2"},"properties":{"dependency":{"package":"actix-http","version":"3.13.1","advisory":"RUSTSEC-2026-0446","aliases":["[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0447","RUSTSEC-2026-0448","RUSTSEC-2026-0455"],"severity":"medium","fixedVersion":"3.20.2","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"71d284c2c3ef21070fb428fa814d2df2464ff71e41623904ac7b7f9e4eee0a88"},"properties":{"dependency":{"package":"actix-web","version":"4.14.0","advisory":"RUSTSEC-2026-0447","aliases":["[CVE redacted]","[GHSA redacted]","RUSTSEC-2026-0448"],"severity":"medium","fixedVersion":"4.18.2","relation":"direct","declaredRange":"4","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4975822701b3b96654c82dada9bad969e348a6adefa52cd3bba1b6cfd71c3bb7"},"properties":{"dependency":{"package":"bincode","version":"1.3.3","advisory":"RUSTSEC-2025-0141","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aa275dcc581e31816223ff250817b0083925776ca9db8bc9a83879cc85b97f8d"},"properties":{"dependency":{"package":"derivative","version":"2.2.0","advisory":"RUSTSEC-2024-0388","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9985e934bf5258966ba30771d636042c3373acbe5f9699173950198ff207d4c4"},"properties":{"dependency":{"package":"git2","version":"0.20.4","advisory":"RUSTSEC-2026-0183","severity":"medium","fixedVersion":"0.21.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1eae401a2a8770be38f5a54c3afe36fa4464ebe4004c5fb285ffaa2f1ae4d5b7"},"properties":{"dependency":{"package":"git2","version":"0.20.4","advisory":"RUSTSEC-2026-0184","severity":"medium","fixedVersion":"0.21.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"61f0d9c1091a69d656be9de2705c490765379cde3ef9a60d6d696a125e361d09"},"properties":{"dependency":{"package":"h2","version":"0.3.27","advisory":"RUSTSEC-2026-0258","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"0.4.16","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1088946f3786b204525ed139958bb5b87f5b5ef1f5c060a51cbeef605e18f92f"},"properties":{"dependency":{"package":"h2","version":"0.4.15","advisory":"RUSTSEC-2026-0258","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"0.4.16","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f48cf8c9f415048128045caa118a1e03769d0b4fe18d7f036c2f3766e3e8d8fb"},"properties":{"dependency":{"package":"instant","version":"0.1.13","advisory":"RUSTSEC-2024-0384","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"728758c9d3428053e1082b5fb9832c05e2e04dab40233f2ffbfd7792b93201ec"},"properties":{"dependency":{"package":"libz-sys","version":"1.1.29","advisory":"RUSTSEC-2026-0418","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"1.1.31","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"422864efbc32ee020d94634a443edac9d818b90faf02ac96d91c4d66ffa4da37"},"properties":{"dependency":{"package":"lru","version":"0.18.1","advisory":"RUSTSEC-2026-0253","severity":"medium","fixedVersion":"0.18.2","relation":"direct","declaredRange":"0.18","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":"b0683742ec4f790a9dbcce011bf1f99235f5a24eda6b88823c36c91f8b44e9fa"},"properties":{"dependency":{"package":"noyalib","version":"0.0.5","advisory":"RUSTSEC-2026-0333","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"0.0.53","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"46f49615124997a47ae03424c2b2e05e8f53b2ec644cd091de0dc203d46f11ac"},"properties":{"dependency":{"package":"pin-utils","version":"0.1.0","advisory":"RUSTSEC-2026-0441","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ffba3a9076a73cf66b6daacb5914c478fbdc74d1383d8d2e4003b6bf3aa7b43d"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.16","advisory":"RUSTSEC-2026-0338","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0339","RUSTSEC-2026-0340","RUSTSEC-2026-0341","RUSTSEC-2026-0342","RUSTSEC-2026-0523","RUSTSEC-2026-0524"],"severity":"medium","fixedVersion":"0.11.18","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"28f0bc6d34596072b24d37b19b745b7394ed4ce99a53e032439b262379e02dc1"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.15","advisory":"RUSTSEC-2026-0538","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"0.5.16","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"1.1.6","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7481fb93c86b503a82a3e06a3172c7e27c5da26b8a178702a1e8028944c7596"},"properties":{"dependency":{"package":"rustls","version":"0.23.43","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0285","RUSTSEC-2026-0346","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"severity":"medium","fixedVersion":"0.23.45","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ec937081c3ad6882e9c07735996d40cd6d5332ac535d70bb5252c6040e1f211"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.13","advisory":"RUSTSEC-2026-0382","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0383"],"severity":"medium","fixedVersion":"0.103.16","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8f033184701e1b0bb0a41dc94d91bb8f68c0336d8f7a6d1b9083b901dc9f1df6"},"properties":{"dependency":{"package":"serde_yml","version":"0.0.13","advisory":"RUSTSEC-2025-0068","aliases":["[GHSA redacted]"],"severity":"medium","relation":"direct","declaredRange":"0.0.13","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":"c64e30c28e3c0e2ac4c865fc1656b78d3404e0bf0484e55f9176b7c5f283f360"},"properties":{"dependency":{"package":"tokio","version":"1.53.1","advisory":"RUSTSEC-2026-0386","severity":"medium","fixedVersion":"1.53.3","relation":"direct","declaredRange":"1","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":"c78c7c829ffb431fb928ff724c9cf0276a780b7b7d9be87f32343d1209a988f8"},"properties":{"dependency":{"package":"webpki-root-certs","version":"1.0.9","advisory":"RUSTSEC-2026-0383","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0382"],"severity":"medium","fixedVersion":"1.0.10","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"232458f1e861a473d11b103db83010acd3c76ee2f5eb5b53069ae6f2eda9586f"},"properties":{"dependency":{"package":"webpki-roots","version":"1.0.9","advisory":"RUSTSEC-2026-0381","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"severity":"medium","fixedVersion":"1.0.10","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5ceb9040e13548b3df718b94867858f8e5659519eb178fbf2fd0e4e23343e0da"},"properties":{"dependency":{"package":"yaml-rust","version":"0.4.5","advisory":"RUSTSEC-2024-0320","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f6329e2b29fe1ee1dd724766af980b151618490b720201bbdc1839704210c3e"},"properties":{"dependency":{"package":"zbus_names","version":"4.3.4","advisory":"RUSTSEC-2026-0371","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f4999ef69e42f46a403f3866a4a634365963f93fdd6e82c0c4a8e528a960ab52"},"properties":{"dependency":{"package":"zstd","version":"0.13.3","advisory":"RUSTSEC-2026-0391","severity":"medium","fixedVersion":"0.13.4","relation":"direct","declaredRange":"0.13","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":"06e8dc8c07565b965cad3fead890e0d682e96e4f994ab4a0654e3f10afe7962d"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0395","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"414bb4a49ee404ddc9dbe92931374dee643d4d3104e067391ed93041a77ff631"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0396","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d67834474e5564706ab5d6117a7537fa7ddd9f89e1070ff0f40846a68262b203"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0397","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"64bc44f41a35cd29a5d01a7b192ce2cc5f1d458c15d9df1d5239ebb5b7c6fd43"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0399","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a79bcf37fda3b3cfb40243fa81b1818f80a0fe095c267b68e3c7eee6f042ddc9"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0400","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"21df614167acad094349de8aa7cfc685e485f636d67b1ded35b43230df65a136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0401","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd61c6a1a6d23109e3da0a091cdbb2ecd3102dd1235e0548e2d8ffd7db2a7005"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0402","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a910032c7367726c7f26107809b36a5b0ab01a6e3af6f2b0cf67b659ecca9e49"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0404","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d11388e41908d6112e7f61d01d0c0d9062830b07945356073c8069de5b88d627"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0405","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dbb5f2efe8d9cca6344840981b65d21b774960589fc9976e6690dc84fce97102"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0406","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7870b77ea4843334d11fffa265d6d0542e94eec7f4c8e852762d55c28578136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0398","aliases":["RUSTSEC-2026-0403"],"severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"84f9b61ffb7d87f7a0ea344424bcbd7389e2ed41eb01432b04fba9f732cd312c"},"properties":{"dependency":{"package":"zstd-sys","version":"2.0.16\u002Bzstd.1.5.7","advisory":"RUSTSEC-2026-0410","severity":"medium","fixedVersion":"2.1.2","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"77d4d5d4357ce0a5ade8f6f76c84914f1a2c80f9fe7358d9854254b760de650a"},"properties":{"dependency":{"package":"zvariant","version":"5.13.1","advisory":"RUSTSEC-2026-0370","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f67f0700e108bacf2f3dfd2008273e31f01b0ea1f2d5f9ef71c4f46ace73bbe9"},"properties":{"dependency":{"package":"zvariant_derive","version":"5.13.1","advisory":"RUSTSEC-2026-0372","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fe2d688610b51e0a5a02c7c5dd1724a4986e40f2689fb84510e2ec0164c27d6a"}},{"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":"5cfed0ee4e80785ce23c7083cffdead9acc6c64f9dce56a00ca7178bd3d7bee5"},"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":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"becbc5502f94878197b05d70c7ef15f1353fd99a90efcb824b9c43f11ae5ce7a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: sqpack.rs \u2192 web.rs, worker.rs, base.rs: \u0060viewer/src/data/sqpack.rs\u0060 changes together with 3 other files \u2014 \u0060viewer/src/data/web.rs\u0060, \u0060viewer/src/data/worker.rs\u0060, \u0060viewer/src/excel/base.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 3 separate couplings, not 3 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 3."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/data/sqpack.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2669516f3735d1e07289962c2a4f2117c5d45141289f9ce2279da65c363d6461"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: web.rs \u2194 worker.rs: \u0060viewer/src/data/web.rs\u0060 and \u0060viewer/src/data/worker.rs\u0060 change together 54% of the time (7 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00601428b5a0\u0060 Resolve icons under the locale they ship in; \u0060170b8102\u0060 Fix pathlist caching; \u006078e1260f\u0060 Display stream kind header \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/data/web.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"76de36042d2e06a25fe2925b4efd8c630e59800d473661ff65bfb2b4657a6683"}},{"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":"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":"cc682cd7167c2c692b624e54d299d32b2ea2b5b3eb72f5516f0dfab9c0ce991d"},"taxa":[{"id":"CICD-SEC-3","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":"ff257f0f4bc01c31e1159dd457ea3459bf068ab0131a377cda80c921f7d5352e"},"taxa":[{"id":"CICD-SEC-5","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":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/index.html"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"d091bdd0a7891afe87bfd4ca6118b9e4e851aa332079abae01374613f0d4d97a"}},{"ruleId":"AC3","level":"error","message":{"text":"Viewport restricts zoom: user-scalable=no/0 or a maximum-scale below 2 stops low-vision users zooming to 200%. Remove the zoom restriction from the viewport meta."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/index.html"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"28712c3da8029853fade80b5986987d4082bf1704db738c6195fbbaf90cc2f83"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.spinner\u0060 moves (\u0060animation: rotator 1.4s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/index.html"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"29fa5d02da0fd0be0df60c901c9322c060643ef1e710e6f8cd48d1d5301a9be6"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.path\u0060 moves (\u0060animation: dash 1.4s ease-in-out infinite, colors 5.6s ease-in-out infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/index.html"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1509cec170627c3afb8f6b695be4e64150608c06a9819846eaee29daef461f5"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060on_auth_callback\u0060 looks like it should compute a result but its body just returns a constant \u2014 a placeholder return that was never filled in."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2488a5a2c921df6021053203da054d7013b9c671eab985657f232f3989ce4f"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060set_metadata\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/audio/native.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2aaed8576c3fa8f54386a415349d649af86998120f5f9fe5c6500759ebcdba"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060set_icons\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/backend.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19e81816f23fdc5de95b4420ba695ccebea5814a8129d0c625d8938f426527a"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060forget\u0060 takes parameters but its body is empty \u2014 it accepts inputs and does nothing. Either implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/utils/icon_loader.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"a23e0d91ec661008f8fd12f06391b3fbed88624852a477d3ca079e833280030d"}},{"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":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 2/5 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060framediff\u0060, \u0060luadec\u0060."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060framediff/Cargo.toml\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":"framediff/Cargo.toml"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c7e02fc24c386165ffdfcf9bd81c635beed9e151b4a130321f3679da5baf6a"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/build-web.yml"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060ureq::Agent::config_builder(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/utils/webreq.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca3ce62bbecfb657635452b90766d4f4d187c6c8b0f55f86320f026455e4fde"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::builder(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/data.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d93b74a6d41c2f0aa5c407dc12835c6b3f820889320f8ae17974d289c5c2870f"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::new(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/paths/mod.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85974cfc11058105146953e3be52ccd18bd3bd61c3587a328ae394b571eed88"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::new(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/paths/report.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"aac8c665b9fc6a8e5c23f923b5f690882ab611cb46d93cf8ffd63eb784ee31ec"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::new(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/routes/api.rs"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7185378e5ef1c74f035ee92f54c02a6f34f485f4b68519b423aedd07b00bd7"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::new(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/routes/api.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc7ed01a2481155fb40c0f25e442389fed6b30369829e6ae026c04669b23cb9"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::Client::new(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/routes/api.rs"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"293ed5fee98e95dcbb816a8a45cff5296f639a5cfb49419609f5d1726284602a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060launch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/burst.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a5a7e0b4015a6c0e59927b6128ad34155272ea679aa222f1ad446f955fbf93f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060launch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/burst.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b14e47c3b3ce8aed276bd7058750f5b73d7bbd6cc63de2fcf5e8aca6866118"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/burst.ts"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"1437cf82aff7fef463cb3a28799806163dc56afd016fc00589ff9befec6bc60a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/burst.ts"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"0930c415c3bf94c24c3caaf2e71664c4846e47f13905a539a6b35bdef754369e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/burst.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e910d0fe8cea1f4ffdba5b790411ede65757529c500fc594239bc07e637b15da"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/burst.ts"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"0501cde7232d326aa37a7801a1d618c17e9777d851c9b59acb182d617d74bd2b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/burst.ts"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"056e467159c5c1c0b0e76e9e12ef943bcb531cc7bb565651fa28ec000ea24b97"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/burst.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"b425120d816ab5f887d2d0029dcce381f1b4430f8b89aa74141c0b50823b2088"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/burst.ts"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77fbd1d8e32dac8b8c70b6cb301ae47525a2135116cbc0331469f92866f1351"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060launch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/drive.ts"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f1d80f1acfc6884baaa1cd1b5a7c09fa904d3c6e4b5405f9d3392354d18ca1"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060launch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/drive.ts"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"f200b4d18d54ba46c087861c837cdf2280f0fc718c9c9ad56ed9e7b5adfdcd1f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060shot\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/drive.ts"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e1b1caa9fc192b1d981c11b15e96cb6e4e7df52b1efa6a9a19d82ac273c525d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/drive.ts"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"9976c2eecf1bc2be09546ed60dc27a9270547ac39245d4ba6cc058f0ffd5aa1c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/drive.ts"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"d854343f80e0d191b083616dd1d500ae56d722d9f71c6d8585076e2251e1aa36"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/drive.ts"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8e28ad7a44617f6ce2cebe41fc61e7e33d001962758883abc0538ca030530f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/drive.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"67cdde67158abff43c0d0c7a4404f4cccbce70ba547479fa7ebeccf912e37c4c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060launch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/frame.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"a359d00e68fc1539410f9a95cc7be56ff34a3eaa84afd4ff40ab037e66d01524"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060launch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/frame.ts"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"1202fd6e3eebcd8610ce050094bbeafa35fe1a0f4ca713821999a8b8b49ae19c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/frame.ts"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b803194d495a6d3383cb9b8f3cbda178f6579aa4065755944399d0f4a3c7be7"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/frame.ts"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"bec0869726d6cde05f17cd49ac8c1c6a227edfadf7ae083754dc781035878ccb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060statSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/frame.ts"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54fb675ec27700b825f549dd233caa8962089df55db082ffa2e7028caf5f0e"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/frame.ts"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"9672e6adacf95c586f0e5e5cdb5b45021c09e3b6b7fb9829cb8b3f388e94f113"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/frame.ts"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"1061b18b80004da299f79f8f977288e079ddaa573b8bc62f1f55012752df33d6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/frame.ts"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b6b05cf2448730677dbca166ef42f75aab9f4a7410e94e91836915afdb56309"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/frame.ts"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"c41db76bc01d5a300415b01af2b95692b9ffbc11afa6b357c12e9fa1a4665402"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/frame.ts"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc9d397e29de0939be4c39a2a9687bfd15643afca40bb6731bd3d979c578078"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060Bun.spawnSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/frame.ts"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"a722846956716f708e159dd94f1d6d0cbd8270fac5f70f2413cb2897227937d5"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060launch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/glow.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bc367e17caf7fa53bd62099d5fe6cf882b77a55f538106fe44bd223dc995c3"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060launch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/glow.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42e0c83ac0824fbd71906c9baab2bbd5fd198d988d19b1da96805d6eaa22029"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/glow.ts"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"537c50c3965d646009ffd293fc4d27539abde21404e3aa232339f72701b66048"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/glow.ts"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"19821e19d0d891be9c1b5abd8dd77921eaacf42cae4542542ede28dedc1e70ac"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/glow.ts"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a52a411e4494ce159619b2236c986d19373e6650fa17ac7914b04406ebb3c7d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/glow.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ad0dafd65a62f38dd6bc57165424d34b7bb5100d49fe15e44339ad2c46a7e9"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060waitFor(\u0022chromium\u0027s debugging port\u0022)\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/probe.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"98620af90d2bb49f44a11235b5351c55cb917efcb87bb03544f113a598a92565"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060launch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/probe.ts"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eac64d423bd35dda617cc7ccbcb50fd382193eb2ca480a789ec6bd613b2262d"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060shot\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/probe.ts"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"5427e91caf7a87d46203fe0814b7552ad1db5e2fd0143fb9ba9c22eb2c89de7c"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060shot\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/probe.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"062622135cf327672afe3c15422a80ddbc140f54ed2fa01671bbfa6957d1a703"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/probe.ts"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3a52c322a3b0c08786fce7ee2bbbe0e242a45d29e3cc858dfe5f54504297d0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/probe.ts"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"193e4f380c263727418a055e365d2817a8d461862e18672c655a452fd9f0f61b"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060launch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/quests.ts"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c672e1bfcdbff6a34f4cc3594793756691cda16e67bc6bc98ef0e69e9b9907"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060launch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/quests.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2e4a16ed70ba27b2714163fa3ce2a1bb1c32dfe973354fd77f078fd630e76a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/quests.ts"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fcdf97a2eb701519cc19fb3c458fd8c74170b8b92c3708c85ecab60a636fb0a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/quests.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb636ab410e84105c796f3681e56152bb7fea9c4fddd416dfe1b9e6c2a18dc6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060shoot\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/quests.ts"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f27a8e147f13a42707510935fcd605d09bc8ae2a8a9d634fed1b80b70c10206"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/quests.ts"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8449cff43de1c9d26d3bb88385ff6c141e088fb5a3bf6c643f26db4c731aaf"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060waitFor(\u0022chromium\u0027s debugging port\u0022)\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/smoke.ts"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c2132b4ad6c6300818007fca816d8fced15d696eb5af8a64b9199f90f7fbe8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060launch\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/smoke.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0e01d7a160fb715b7100ce2f46e305198acd649ae06d82e9c8859675e3a1ec2"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060shot\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/smoke.ts"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e83e0c557b0cea4ab93a2f63b94f3cc723d49d4fecb48a62e04393e77e1b4a0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060shot\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/smoke.ts"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d56b5bbf032ec234548b0b07c0d23dc70a117db0a4b8752f3c91da51c0d22c8"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060save\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/smoke.ts"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66247d3d0a0dcb5b7c62eb61fb16fca91503297311e607125771ba113e504fc"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060save\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/smoke.ts"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"68eee34b06fa7bd91994ee854de3d56f495dfabd02cd66543051a5d972ab1fd0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060existsSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/smoke.ts"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"7624ff55e1078c91b033429aada085cf4daed16aa6c5df5efa1e95935c84fc3f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdtempSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/smoke.ts"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"11132ed49238e7b4d995e656a144eb83bb5f016e05b2d76082f2f2c78ad423eb"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060readFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/smoke.ts"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"56a4ee6f166cef00c0b4beb3114051c5bdb0fe72bf8202fe01cb9c04b99fb194"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060mkdirSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/smoke.ts"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce9b492e41af361f21fdb96c41e9a4e9d02370572f6d80041771ea23b715080"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/smoke.ts"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbdbadba83a2d255f0f67d9bdae41a79548b8bc553c88b20c89815720070a29"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060writeFileSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/smoke.ts"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f97af72703aa535b83f96beba5e94c881a38b334de94c123c3d2509cc3bc4a"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060rmSync\u0060 in \u0060main\u0060 blocks the event loop until it finishes \u2014 a blocking call inside async code stalls the event loop \u2014 every other request waits for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/smoke.ts"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"261a41432c59f2ffcf972fdb0198c7437934f91e4a58ad8acb8ed82ec44dd996"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (114 identical lines \u00D7 2 files): smoke/look.ts:7 \u00B7 smoke/net.ts:7 \u2014 these 2 files are line-for-line copies of one another \u2014 114 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/look.ts"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"5751127c411365ca6abe366f5cc666b3622053328f4f8363508e2afb1fed2f1f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (57 lines \u00D7 2 locations): smoke/glow.ts:34 \u00B7 smoke/quests.ts:36 \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":"smoke/glow.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aa8557526bc344643e058d7ada2382e88bc01b3e5d36cc40a3e948f3e148c1b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (48 lines \u00D7 2 locations): smoke/drive.ts:25 \u00B7 smoke/glow.ts:26 \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":"smoke/drive.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"108df4eb154afa41ea060cdd3e9d0933b172450c00e4b74d8908c04f3cf9a4d9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (45 matched lines \u00D7 2 locations): smoke/perf.ts:12 \u00B7 smoke/probe.ts:14 \u2014 the two spans are one implementation copied and then locally edited \u2014 380 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":"smoke/perf.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf45a720adfddbac49dcd5cc9e42d0d8ed8ec2e190e669bf0ad7a5c2441d399"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (45 matched lines \u00D7 2 locations): smoke/probe.ts:48 \u00B7 smoke/smoke.ts:205 \u2014 the two spans are one implementation copied and then locally edited \u2014 362 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":"smoke/probe.ts"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be21d0e01d50377021b0d1da1ed8828ead6ca372048f52b166fb8a8d763bc49"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 2 locations): smoke/burst.ts:37 \u00B7 smoke/drive.ts:36 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/burst.ts"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"9145aea6fd50d2e307e89da37d25e272b5b69e19fc62a88681cd08a7f33e98c5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (41 matched lines \u00D7 2 locations): smoke/net.ts:102 \u00B7 smoke/perf.ts:187 \u2014 the two spans are one implementation copied and then locally edited \u2014 418 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":"smoke/net.ts"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"3669598bb7180d95065ef749b0295552ac450137960fa5004d3644db494a57dc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2 locations): smoke/drive.ts:111 \u00B7 smoke/quests.ts:77 \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":"smoke/drive.ts"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"582d429689ab36171fac8fac87ff84463e24888a58a605973a10e878b5405c63"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): smoke/frame.ts:85 \u00B7 smoke/perf.ts:76 \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":"smoke/frame.ts"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"a45277545ad86c458ad08aba5eb627f470f05877c7a3da7c3ebad0b19172da5e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): smoke/burst.ts:130 \u00B7 smoke/net.ts:153 \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":"smoke/burst.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77af87c11487092a805e9304288182d4986b3616798ddd72ea9eaa6bcbc9a39"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): smoke/quests.ts:33 \u00B7 smoke/smoke.ts:221 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/quests.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"938188eb51aaeaa1ba0bb423ca00439b139149c196f31a2e8c80f9db29a23e0e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4 locations): smoke/burst.ts:90 \u00B7 smoke/drive.ts:115 \u00B7 smoke/glow.ts:79 \u00B7 smoke/quests.ts:81 \u2014 the 4 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/burst.ts"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd76e2dfb8fa72041182d9452464fcaa04b159c886bb0e4f8d0c6bac267017f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): smoke/burst.ts:105 \u00B7 smoke/frame.ts:177 \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":"smoke/burst.ts"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"9757712062bd433960082af04004dfa01881504909b054fee31b706a6edebb9e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 9 locations): smoke/burst.ts:14 \u00B7 smoke/drive.ts:13 \u00B7 smoke/frame.ts:21 \u00B7 smoke/glow.ts:14 \u00B7 \u002B5 more site(s) not listed \u2014 the 9 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. There is one copy in each of 9 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/burst.ts"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb3f7042cd8b44984274f3a232c1b2ae324c97cd1abd446741862b4b3700ab7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 23, cognitive 49): main has cyclomatic complexity 23 and cognitive complexity 49; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/perf.ts"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"701af593b5d1c9cc1207baeaac304a695d15e022ffba0f2112e31c568ae17c4f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function decodePng (cyclomatic 23, cognitive 36): decodePng has cyclomatic complexity 23 and cognitive complexity 36; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/smoke.ts"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"a824cdea69cbca68684d1b915d4eee74ea42d93f9e600ebc3170c5e6fb41ef2e"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 22, cognitive 27): main has cyclomatic complexity 22 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/smoke.ts"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5d74ec2b297dce4ac9d5726f4c459b86013a41a093cfedd3f75790acfcc7fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 15, cognitive 27): main has cyclomatic complexity 15 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/drive.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4ab148ad82e038118e6c767bd153e75c2435365c832885a864b28fb0d66b73"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 15, cognitive 17): main has cyclomatic complexity 15 and cognitive complexity 17; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/frame.ts"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f75c5b64e1de9cbccfdf5a862aba7c118aa6d168fb8a07e9d06e004a21cb87b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 14, cognitive 27): main has cyclomatic complexity 14 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/probe.ts"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"281fbba1ddb9cbe065d752e3ed6bb73e7be94c7ad75c4dc9279be9b941b496eb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 14, cognitive 22): main has cyclomatic complexity 14 and cognitive complexity 22; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/burst.ts"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"9beedf990e00f1ad68d0968c486ecc5a49d116a9bd21f5e9616366c7664386f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function main (cyclomatic 12, cognitive 27): main has cyclomatic complexity 12 and cognitive complexity 27; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/look.ts"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c39157d0bb6f8794713fab403f7bc428a40fe9611f11a3057fb5efa2c2623bf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function record (cyclomatic 12, cognitive 11): record has cyclomatic complexity 12 and cognitive complexity 11; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/smoke.ts"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"25db5e818908d7a078f57f2199f7e099a4a6264a2f66a7b38f52460efcfc84f6"}},{"ruleId":"R3","level":"warning","message":{"text":"smoke/smoke.ts: 981 lines of code: smoke/smoke.ts has 981 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/smoke.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85cc8dc7a200c4ffcafdfbc96ff3da86c907e7256684cadcd48f5bf09b83056a"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027click\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/frame.ts"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df2cfc3bffb1f9d932f2d05b541ed63b0b1fe9077d474c27e115a207724307b"}},{"ruleId":"S1","level":"note","message":{"text":"No app-layer HTTPS enforcement detected: This repository starts an HTTP server and nothing in its Rust source or committed \u0060Rocket.toml\u0060 secures the transport: no TLS served (actix-web \u0060bind_rustls\u0060/\u0060bind_openssl\u0060, axum-server \u0060bind_rustls\u0060 with a \u0060RustlsConfig\u0060, tonic \u0060ServerTlsConfig\u0060, a \u0060TlsAcceptor\u0060, Rocket\u0027s \u0060[default.tls]\u0060), no \u0060Strict-Transport-Security\u0060 header, no \u0060X-Forwarded-Proto\u0060 read from a TLS-terminating proxy \u2014 so its traffic may cross the network in clear text. (\u22122.0 on this card.) The server: \u0060HttpServer::new(\u0060 (web/src/main.rs:100)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8697c7a8b4c37084f15e81b8ec84d4cf62954730be74a0816d39b2127a21fd9b"}},{"ruleId":"S1","level":"note","message":{"text":"Security headers incomplete: Set: Content-Security-Policy, Referrer-Policy, X-Content-Type-Options, X-Frame-Options. Missing: Strict-Transport-Security \u2014 the four headers that carry the points of this card\u0027s security-headers term (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options), 0.5 each.(\u22120.5 on this card.) The server: \u0060HttpServer::new(\u0060 (web/src/main.rs:100)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e9931804dbad8b1657857c9b88c05b8faeff182b6e2bb88641bd59bac687876e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!existsSync(portFile) \u0026\u0026 Date.now() \u003C deadline\u0060 appears character-identically in 8 files \u2014 smoke/burst.ts, smoke/drive.ts, smoke/frame.ts, smoke/glow.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/burst.ts"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"627b40e72768235bb5c4c96e3925e6022a7a90344be107d7ac8b6947f60203ba"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060argument === undefined || argument === null\u0060 appears character-identically in 2 files \u2014 smoke/probe.ts, smoke/smoke.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/probe.ts"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8dd70e34039d15d2d2009f5f032c0bb6e1049cd85935a3ce62efdd3352449f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060asked.startsWith(dist) \u0026\u0026 !asked.endsWith(\u0022/\u0022)\u0060 appears character-identically in 5 files \u2014 smoke/drive.ts, smoke/glow.ts, smoke/probe.ts, smoke/quests.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/drive.ts"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"94adb580d11494a14cd61afea73a58336317bc337d2d9424c6da03989d488db6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060asked.startsWith(dist) \u0026\u0026 !asked.endsWith(\u0022/\u0022) \u0026\u0026 existsSync(asked)\u0060 appears character-identically in 2 files \u2014 smoke/burst.ts, smoke/frame.ts. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/burst.ts"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"710795df498da3ef21efad8e04621eb49d36928ef49a351af516a1c4821f2d2b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060held.vertex() == shpk::NONE || held.pixel() == shpk::NONE\u0060 appears character-identically in 2 files \u2014 viewer/src/assets/viewers/avfx/program.rs, viewer/src/assets/viewers/mdl/program.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/program.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcdc4cb1ae643d2d71d2be1fdf4a492bf040033379101fa3c59ec38f84fb4057"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060rect.width() \u003C 1.0 || rect.height() \u003C 1.0\u0060 appears character-identically in 5 files \u2014 viewer/src/assets/viewers/avfx/mod.rs, viewer/src/assets/viewers/layer/scene/mod.rs, viewer/src/assets/viewers/mdl/mod.rs, viewer/src/assets/viewers/pcb.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/mod.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"69edefb8905ec721ff544ee97ee112c951e8c32ca93fb0231b5002c66ea1a88c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060coerce_integer\u0060 is public and takes a \u0060CellValue\u0060 as its receiver from its caller, and it calls itself at line 101 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060coerce_integer\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/cell.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb47e31fe8abca9f6a302117ae9542508667d397530c0a7db1c8f23d74675537"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060coerce_string\u0060 is public and takes a \u0060CellValue\u0060 as its receiver from its caller, and it calls itself at line 134 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060coerce_string\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/cell.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bbb5224b0ab42594138d53b4a6aa26d925ef7021fb611c08b1c907d048668f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060is_empty\u0060 is public and takes a \u0060CellValue\u0060 as its receiver from its caller, and it calls itself at line 144 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060is_empty\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/cell.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e48d365860fd44dbaf41dde5b42c68fd85500d653cf0b4c23d3362d03a98d6"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060read\u0060 is public and takes a \u0060Cell\u0060 as its receiver from its caller, and it recurses at line 381 through \u0060read_internal_link\u0060 and back with a piece of the document (and at line 323, line 401) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060read\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/cell.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"84bac317a449537a26d3f5be9f4ade70f94e27a10345801fc6c19e3e6cf5a7d2"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060show\u0060 is public and takes a \u0060Cell\u0060 as its receiver from its caller, and it recurses at line 284 through \u0060draw\u0060 and back with a piece of the document (and at line 168, line 514) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060show\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/cell.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"96400c2d156c12582de064aee56b48943ad1153aa81fceb40fc8e765888a73fb"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060size\u0060 is public, takes a document from its caller (line 266) and hands it to \u0060size_internal\u0060, which recurses at line 238 through \u0060size_internal_link\u0060 and back with a piece of the document (and at line 205, line 262) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060size_internal\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/cell.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"d09a37842795bde5e1fd0d19d4501d1c4d98219c237b880629429fbd142ec94f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060has_fuzzy\u0060 is public and takes a \u0060ComplexFilter\u0060 as its receiver from its caller, and it calls itself at line 26 with a piece of the document (and at line 27) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060has_fuzzy\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/filter/complex_filter.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62af7c37e9aa7fa794fd96511d48d973c8b269c4a47a591a352495c23dbb284"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060replace\u0060 is public and takes a \u0060Router\u0060 as its receiver from its caller, and it calls itself at line 62 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060replace\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/router/mod.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a06e785b13a3a214d64649cde07caf18179c2bcde266791d24f7ef1d0c5e694"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060back\u0060 is public and takes a \u0060Router\u0060 as its receiver from its caller, and it calls itself at line 66 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060back\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/router/mod.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"99884fe7c5d7e4a5df9320e3e4626ec637bcf6a61ea27264eb47fdb55d295071"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060forward\u0060 is public and takes a \u0060Router\u0060 as its receiver from its caller, and it calls itself at line 70 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060forward\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/router/mod.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa255d5591a442b730896d9b14a7b8bdc3a05c125fcf94b44cb9d156fda1045c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060base_url\u0060 is public and takes a \u0060Router\u0060 as its receiver from its caller, and it calls itself at line 74 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060base_url\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/router/mod.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"6273c62bafaced3daa2bde58329f4c7de2e799876dc0474c500e28e4cf9c8eee"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060lines\u0060 is public, takes a document from its caller (line 28) and hands it to \u0060count\u0060, which calls itself at line 44 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060count\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/quests/script.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25db222bd6514be7e2fd3a06f52224b167be83b46e66dbaeba1efe4b2e7e309"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060poll\u0060 is public and takes a \u0060Cast\u0060 as its receiver from its caller, and it calls itself at line 379 with a piece of the document (and at line 515) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060poll\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/stand.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"11c640d820a2a545c3db061f1031012ca446d5759d5ca5b04bbea5decf53b2fe"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060set_volume\u0060 is public and takes a \u0060Player\u0060 as its receiver from its caller, and it calls itself at line 102 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060set_volume\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/audio/native.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"92af8e49e0b183d115e62cd1fd82bb7553626ec11131d0a407d6a55859f0943d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060pause\u0060 is public and takes a \u0060Player\u0060 as its receiver from its caller, and it calls itself at line 83 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060pause\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/audio/native.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ef83b9f8b7f8bbc2b3ceaddc7dbc0801abb4f503a5968bccfc378af92a9ad8"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060retain\u0060 is public and takes a \u0060Mixer\u0060 as its receiver from its caller, and it calls itself at line 188 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060retain\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/audio/native.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ff3f12f5d85e5bba41d3dfae2055df8fcd067ea23123ffc7d313d9c0f0fca5"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060pause\u0060 is public and takes a \u0060Player\u0060 as its receiver from its caller, and it calls itself at line 282 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060pause\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/audio/web.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca9fb42ed5aa32dca02b015f991515c00125ce763d8ea1e865c5268c886aed4"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060stop\u0060 is public and takes a \u0060Player\u0060 as its receiver from its caller, and it recurses at line 304 through \u0060discard_source\u0060 and back with a piece of the document (and at line 197) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060stop\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/audio/web.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"eddbaaa9f52f4e5b25cc9423b746f7ec52347e641d129c93af50c66728410d17"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060play\u0060 is public and takes a \u0060Player\u0060 as its receiver from its caller, and it recurses at line 170 through \u0060resume\u0060 and back with a piece of the document (and at line 173, line 294, line 296) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060play\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/audio/web.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1f85fda6ceb42092d9aa9ffa122fb63e0999e8e1b3b2c796375b83e4d0fe83"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060retain\u0060 is public and takes a \u0060Mixer\u0060 as its receiver from its caller, and it calls itself at line 684 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060retain\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/audio/web.rs"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fafd02231ee7724b9ec75ac52334747144974430d0157f195e5eaf91b43cccc"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060replace\u0060 is public and takes a \u0060View\u0060 as its receiver from its caller, and it calls itself at line 99 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060replace\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/placed/mod.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"933e16af6692956760608129b9b0c594e6f9827a4a86a0b07dedb5fe2d86de2d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060active_props\u0060 is public and takes a \u0060Cue\u0060 as its receiver from its caller, and it calls itself at line 580 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060active_props\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/emote.rs"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b619c877c29f50e7ac6156dfa1027e3bfb39fe430532bb5787c155f2d5b3b0"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060joints\u0060 is public and takes a \u0060Cue\u0060 as its receiver from its caller, and it calls itself at line 593 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060joints\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/emote.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a6ce2a07d013c7689bc302ba4d40700a6c001076eb38f2faf4ba21add480e8"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060attachments\u0060 is public and takes a \u0060Model\u0060 as its receiver from its caller, and it calls itself at line 321 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060attachments\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/gpu.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42e4a832ac916b61f1f23f766ef69044cca9f97aa23a40b199c91b59eede5a9"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060attachments_learned\u0060 is public and takes a \u0060Model\u0060 as its receiver from its caller, and it calls itself at line 326 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060attachments_learned\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/gpu.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"f594ca3d7be2ffe6982e417046639394a438373ea9d28839f728991fb90e6f91"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060seed_attachments\u0060 is public and takes a \u0060Model\u0060 as its receiver from its caller, and it calls itself at line 332 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060seed_attachments\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/gpu.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"aacdd3a367b9e27c233c1b3a578321f755457a3db252a7bf421c1ee1d174505a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060fill\u0060 is public and takes a \u0060Model\u0060 as its receiver from its caller, and it calls itself at line 431 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060fill\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/gpu.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"1721d119ae5877915d5989071f4d6bb2d504edcf9efef39c56f12c7e41c07044"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060draw\u0060 is public and takes a \u0060Model\u0060 as its receiver from its caller, and it recurses at line 483 through \u0060ground\u0060 and back with a piece of the document (and at line 487, line 609, line 618, line 645) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060draw\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/gpu.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e7d8a5223c19b12893bb01bb4b1b1bdc8ba2bb007f808340536ac1271e42e8"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060anisotropic\u0060 is public and takes a \u0060Material\u0060 as its receiver from its caller, and it calls itself at line 223 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060anisotropic\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/material.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad97522bd683d05ee6f5f3c064bc2a72b224323befbbdd9da1624c0c4c91781"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060poll\u0060 is public and takes a \u0060Rendered\u0060 as its receiver from its caller, and it calls itself at line 1680 with a piece of the document (and at line 1683, line 1686, line 1696) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060poll\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":1680}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fc443c20df188cf266b2d93de7158f58b07e7c35b0f2cd1e79f327d7540937"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060hinged\u0060 is public and takes a \u0060Rendered\u0060 as its receiver from its caller, and it calls itself at line 3476 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060hinged\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":3476}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a02c5e52deb86f20773afc8a08ef8338d4c2d4e527a7e4e897bf5add984ef2"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060seated\u0060 is public and takes a \u0060Rendered\u0060 as its receiver from its caller, and it calls itself at line 3481 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060seated\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":3481}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b13925092704d9cf6dad3dc5c93e7facbdf4bbb71c30187a6125fea9d77129"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060play\u0060 is public and takes a \u0060Rendered\u0060 as its receiver from its caller, and it calls itself at line 3509 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060play\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":3509}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ae32fdfe93464b3d17fe1b3bfe6217cb9d99ceba04153cfc3c2f43764b7fa5"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060play_over\u0060 is public and takes a \u0060Rendered\u0060 as its receiver from its caller, and it calls itself at line 3515 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060play_over\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":3515}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9bfe4934d31f47715f815d00f8d8f5443256a17ef09bae21550b8aced612b3"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060blending\u0060 is public and takes a \u0060Rendered\u0060 as its receiver from its caller, and it calls itself at line 3520 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060blending\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":3520}}}],"partialFingerprints":{"codehealthFindingId/v1":"d23986b70a13c97b41990afb3d9725bc24d7c9a452a6977307610eff57dff226"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060stand\u0060 is public and takes a \u0060Rendered\u0060 as its receiver from its caller, and it calls itself at line 3535 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060stand\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":3535}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a06756656dc4f4f6d46b206a2697d2adae89a4d084a48f4471caf59336557cc"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060act\u0060 is public and takes a \u0060Rendered\u0060 as its receiver from its caller, and it calls itself at line 3541 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060act\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":3541}}}],"partialFingerprints":{"codehealthFindingId/v1":"00ce4ddb6071b6245e474ffb6afd482a7c9affdca92c2b2bf94b8006e31d5c29"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060plays_at\u0060 is public and takes a \u0060Rendered\u0060 as its receiver from its caller, and it calls itself at line 3548 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060plays_at\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":3548}}}],"partialFingerprints":{"codehealthFindingId/v1":"367f2db1f60e893ee5d0cb65c4331f1d7a17582479c78cab2bd3ab56b5cf50fc"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060standing\u0060 is public and takes a \u0060Rendered\u0060 as its receiver from its caller, and it calls itself at line 3553 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060standing\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":3553}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0963a083c0c8508f53b0d2f0e914935609506354936c61a4f24fdab4811de49"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060acting\u0060 is public and takes a \u0060Rendered\u0060 as its receiver from its caller, and it calls itself at line 3558 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060acting\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":3558}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce9119c6fa617eae45b5249bff4bbabb3e6aa92f625a087e43de1d1a4e4d984"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060eyed\u0060 is public and takes a \u0060Rendered\u0060 as its receiver from its caller, and it calls itself at line 3563 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060eyed\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":3563}}}],"partialFingerprints":{"codehealthFindingId/v1":"d60a6839ceb4a4b999ee55c9f14fe5c60a7cf224482c0cc1b3102b002aae565f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060express\u0060 is public and takes a \u0060Rendered\u0060 as its receiver from its caller, and it calls itself at line 3569 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060express\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":3569}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc6f4cb7afa18386e6fded64db354e2f92cce4305bca0d34a6426ac1b38efc8"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060built_on\u0060 is public and takes a \u0060Rendered\u0060 as its receiver from its caller, and it calls itself at line 3581 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060built_on\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":3581}}}],"partialFingerprints":{"codehealthFindingId/v1":"347842c6b53554a62e3618eb6d27d1df48d6dd4ce08a59a78f0cb2761badcaf4"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060details_ui\u0060 is public and takes a \u0060Rendered\u0060 as its receiver from its caller, and it calls itself at line 3794 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060details_ui\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/mod.rs"},"region":{"startLine":3794}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2945ccece8b96a4886b21b16d6abe176e27259e467959d4a28ed58682b4e0c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060rewear\u0060 is public and takes a \u0060Animation\u0060 as its receiver from its caller, and it calls itself at line 1111 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060rewear\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/skin.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"c705186eaf9bbbdbae73aaf223ee1adaa82908b6bbe4a991627f85933d24c044"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060poll\u0060 is public and takes a \u0060Animation\u0060 as its receiver from its caller, and it calls itself at line 1121 with a piece of the document (and at line 1137) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060poll\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/skin.rs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3930916f07ba8b2db52f71903094806225ac67683f5475197272b7c0498e4c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060details_ui\u0060 is public and takes a \u0060Rendered\u0060 as its receiver from its caller, and it calls itself at line 1210 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060details_ui\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/mod.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"2860fc3b06e42aa30f6af5a5a3e16a37847d36c3de0b87ae26e00b02bfc53830"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060pending\u0060 is public and takes a \u0060Ambient\u0060 as its receiver from its caller, and it calls itself at line 299 with a piece of the document (and at line 301) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060pending\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/ambient.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe1c3b3cad4944c9e0cd0e277113517240c615751b39617a195add4da838f01f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060sky\u0060 is public, takes a document from its caller (line 359) and hands it to \u0060weathers\u0060, which calls itself at line 375 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060weathers\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/ambient.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1b755e18c8b387623fb2f3e3939fda2985b56b86e7f86cbe4b868ef3267713"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060poll\u0060 is public and takes a \u0060Ambient\u0060 as its receiver from its caller, and it calls itself at line 327 with a piece of the document (and at line 329, line 331) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060poll\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/ambient.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"840a6fe077c2ea0ff61af1a1ddd38c482e25b02ca24d151140a925c99f0a9927"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060exposure\u0060 is public, takes a document from its caller (line 453) and hands it to \u0060keyframes\u0060, which calls itself at line 395 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060keyframes\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/ambient.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8b4451b0bef11ca0678ede9c1ba726ea16c3165e82997088209382e8f26cc9"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060attachments\u0060 is public and takes a \u0060Renderer\u0060 as its receiver from its caller, and it calls itself at line 336 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060attachments\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"378ddf6eb230a36796ed8323057541e4ff61e042e7a9bfe6141a1383c4d834ec"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060exposed\u0060 is public and takes a \u0060Renderer\u0060 as its receiver from its caller, and it calls itself at line 341 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060exposed\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e83422cd22295c5651a94c5af5b240101f81f7f9e874a32447d0ecd14fa99c3"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060measured\u0060 is public and takes a \u0060Renderer\u0060 as its receiver from its caller, and it calls itself at line 347 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060measured\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"308a802cd488b72cae9652a39e7bd3c2b8934c41e72b205cf035b26f3ebae5de"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060drawn\u0060 is public and takes a \u0060Renderer\u0060 as its receiver from its caller, and it calls itself at line 352 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060drawn\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72914e42ef1a461ceae6d4789f0c1d58bef9dc6ad6272d8d68f023a2329e081"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060draw\u0060 is public and takes a \u0060Renderer\u0060 as its receiver from its caller, and it recurses at line 472 through \u0060effects\u0060, \u0060render\u0060 and back with a piece of the document (and at line 1002, line 1616) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060draw\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/gpu.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e034cf7ff62f4129f2086560c962a4a299030fe14433105a2f6d9197ae38ff7"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060ui\u0060 is public, takes a document from its caller (line 5403) and hands it to \u0060poll\u0060, which calls itself at line 2811 with a piece of the document (and at line 2813) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060poll\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/mod.rs"},"region":{"startLine":2811}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b75e946a5676484685d9f168da48785d857f5c27deeead1c0e707cf0b9f4e59"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060play\u0060 is public and takes a \u0060Stage\u0060 as its receiver from its caller, and it calls itself at line 292 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060play\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/cutb/sound.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"83750a2332f866a2f81f1850d3bf50da894fbf8a920d7590da9dfef94c39fc74"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060ui\u0060 is public, takes a document from its caller (line 799) and hands it to \u0060poll\u0060, which calls itself at line 934 with a piece of the document (and at line 937) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060poll\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/mod.rs"},"region":{"startLine":934}}}],"partialFingerprints":{"codehealthFindingId/v1":"16520ce1e3282662c9a5fd90d9a796a621e5c1e3e4fcf9436140d51c7a177c5c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060negate\u0060 is public and takes a \u0060Expr\u0060 as its receiver from its caller, and it calls itself at line 147 with a piece of the document (and at line 148, line 152, line 153) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060negate\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"luadec/src/expr.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"4256e385b7d34af0ea4cd26300f3d502a1df0f028c4f631be3c4fbd003b9c22b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060write_block\u0060 is public and takes \u0060block: \u0026[Stat]\u0060 from its caller, and it recurses at line 414 through \u0060write_stat\u0060, \u0060write_closure\u0060, \u0060write_table\u0060, \u0060write_list\u0060, \u0060write_arguments\u0060, \u0060write_prefix\u0060, \u0060write_bare\u0060, \u0060write\u0060 and back with a piece of the document (and at line 167, line 176, line 179, line 195, line 203, line 210, line 211, line 215, line 218, line 230, line 232, line 243, line 246, line 248, line 280, line 289, line 311, line 325, line 329, line 347, line 421, line 435, line 444, line 447, line 450, line 456, line 465, line 474, line 477, line 481, line 489, line 492, line 500, line 502, line 515, line 517, line 521, line 525, line 536, line 539) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060write_block\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"luadec/src/expr.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b96e6681c3987ef7caacd87dcd2f2045cc089cb2cb4bb74a2967b4a9bfcbdd"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 0/2 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: page: \u0060page\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/smoke.ts"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e28c4e2c0b907d15313d9e0d6fcc1fb9c7efd18b0773593ad0e725e8e5e303"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: proxyFetches: \u0060proxyFetches\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"smoke/smoke.ts"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba01577ba4754a31679e46d6d64f88ae204f11664cbbf8e7b82f31b0aeab36b"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060UiColor.expansion\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5db9b418e610a3e76bd9bd66762550002d61281f70bc6a8084f6b18d0845336"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060UiColor.highlight_color\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d1dba8c64321bc91d689508f07e60cfdf280c4ddc9fbc1cd5387f4ffaed059"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Mount.last_location_mount\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e382a510ddc1ef2ed1b681d3cae9c5ecd2e45a368102ac2eb90778a0def2fca1"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Mount.mount_id\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb8ad90e59607a810a7316955eafc24d70fdae1485db209f38ff2900166e93c"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Mount.buddy_model_top\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"64651f0e65e29f1fb4de0de94e6b8cff89c5050b4e07d68fe8c7a1b0ba822559"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Mount.buddy_model_body\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"9875bad3a0639b02bf0fa0fc4d554fcfa7471e354cc56272415da1031b6b6fe6"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Mount.buddy_model_legs\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b245f256264e60a4d25b32496f5bd8756aa49858e6b819a6383386d2a79b0b12"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Mount.buddy_stain\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a31fc4bf1bf3a428e870a24cf5362b84b0528039987d845b301dfff1c8f48c9"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Location.location_type\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36fc77cd2c80654ddc21aca0e3f433b036e965532a011a50f2c15803290d516"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Location.title_screen_logo\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbfb73bfcfdc3d5230c91a359e5d7ab14daf63e004bc91af4820e18524adcd13"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Location.territory_type_id\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"f433c220224cb55b78858e7795371f3e40c259a9da555291a542e23a264e0e07"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Location.layout_territory_type_id\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0184ca67503fa0e650115bf329365435c9215dcf7cc23c7992e5a163b8bf317"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Location.layout_layer_filter_key\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf99363950ed047aee3fb22707d19625de341d205bf498e8435d64c7bbd924c6"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Location.bgm_id\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1eff3a1bdebed127036eb5fccc8284a1338ca51570fdfcb2add82c4d5a88f2"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Location.bgm_path\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"21730d622997c5d60a28a76acf055f26be0987b6a6bbfbe5d608820d1781f54e"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Location.movement_mode\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4c726e718dba46e4b8511ba39faa0435d6d5e53b28f9ac93e73c60a205f84b"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Location.vfx_trigger_indexes\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d77889508e9c5d8f326dabc1514dcc0c82d9c65aaa47dbcd77dbe7da4578827"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Location.save_layout\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e117428235b3f63cd065c2722b6dc5ca7ddb16eac32bc0d3c4ece73f8fe94d0"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Location.use_vfx\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c57db94bb80851e1efc05f5ad936b01eed27ee3e58a6411bd229cc26c8be756"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Location.save_housing\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"56313d79c35070544d216ba1eebd7ebd24ced4ea1c095e3a7a66c0c43a7eca78"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Location.save_festivals\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa486776ab731aa2f28a8b009eb2793dd778f1a9496ef52678d176ae776f5be"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Location.title_screen_override\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0aae99ce0bfaa966c5e48f5718eb0430f7f6b50a2ff2d6ac48e7409052fb948"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Location.ui_color\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eb9654b497a81c7e8440a5911424a94916c3630bc1d8862fd4f5b0d14c47f5a"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Location.title_screen_movie\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee73bc3c5e6215dc5bf87c43f32b18567a21ddf5812614ac50b058efd4390f2"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Location.use_live_time\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b6ecc7152f7a36c3575b1e54531e0166a141e18dc4ca4581dd9e0954923c911"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Location.furniture\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"69de9ea74d14f2b224192a1af7ee608a7f75fec4bd7b76b22ab99f101efd6e98"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Location.plots\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"504321e87c83e1d0aedc5e8c88b9674cef235c3db1e5149706c107b159dccaf5"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Location.estate\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/scene/preset.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c03dae1c7bc7a52fce097debcad85a1a6b676409dff15e8c65f5defb2441700"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Schema.relations\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/schema/format.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca78ead64f375666c70d9913460750edea3a6516c7937b87d6c9e928f50a9ae"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Field.relations\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/schema/format.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"98dfc5882c3238cfddb110b8eb749a7bf3a2bebcbcb47f553982102fb4281094"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060GithubCommit.sha\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/schema/web.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fc14983de40ea5b2359667b44cd84c7ffd9deefb33d1b53b8887f1ee2953cf6"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060GithubBranch.protected\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. Every value supplied for it is silently ignored. Consult it where it was meant to take effect \u2014 or, if it genuinely does nothing, remove it (or mark it deprecated and say so in its documentation) so the configuration stops advertising a setting that changes nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/schema/web.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac74332a74576197c9dc4330d74455669f81601a2205345a15e5ceefbbfd5943"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ShadowBuilder::builder().build()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/build.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"2882ece1557a0330c607935c3257481d0f083a9735be10ba072430239bb7cb2c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var(\u0022PROFILE\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_frontend\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/build.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfde29b636c5e322e00a03c00264de96a91889a62e095ac4311ee23481e5ad06"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060command.spawn()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build_frontend\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/build.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"a225f90d46eafe3d5354c7650be64c757aaa92cada90f3fa3f4850273e07c2c4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060child.wait_with_output()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060build_frontend\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/build.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7caefe4e01676ca6770f55f88d25c532a81f1e1d0d947ff5eb5532aaede27b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var(\u0022TARGET\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060get_output_directory\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/build.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bde3e8929042a7f5430f4f7abcd555c7f923151587029ff63f2f55bf4b0b5d5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var(\u0022OUT_DIR\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060get_output_directory\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/build.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"80d84b9dfaac78016aa30e7f4def160551bfd2d79fb8eb422827598b4a766959"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var(\u0022PROFILE\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060get_output_directory\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/build.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"403e5cc37437dd86fbd16d257b9fe25fde331b30da7acf5ae99605509e2dfb54"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060target_dir.to_str()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060get_output_directory\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/build.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffb3f5ca072bfd921bcecf693da0e435673a02f0102428c66563f04982a34ba"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Config::builder().add_source(File::new(\u0022config\u0022,FileFormat::Yaml).required(false)).add_source(Environment::default()).build().and_then(Config::try_deserialize)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/main.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"954aa650963050eefa303e1006d0090ef842c7b8343c539dfc4f7ee3ac445afd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060e.downcast::\u003Cprometheus::Error\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/main.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f9360e720b7fcb28f1346a01c7674f9eccc784d1a8179b639270528c0b4700"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Helmet::new().add(XContentTypeOptions::nosniff()).into_middleware()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/main.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"13218ca048bcf945b1a5b49fe09324d6120308cc5593f629fbe696cde4692ef4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060e.downcast::\u003Cprometheus::Error\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/main.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"518081e94220c506a5b4091db2c535a80f522c6f27dff2ae510ad7004ce22c03"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060repositories\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/queue.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"234f562b1c39998d26e7029bd4530ec067226f4dd4e3574996b9535a9fd03ab1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060exists\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/queue.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b5ecf7c7e5c864f282268b98dfc72aeee635994088748f72223cfadea6d4d2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060get_list_id\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/queue.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bcf51cef022d9ce92b802dfaf6ee5c3e70ad445213676f76a67b0753e036391"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060get_global_paths\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/queue.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff151409637b7a2dc6ae37a9acb3bef87ccc073c3112d10e81e2f4818f9755ce"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060get_presence\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/queue.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"956184c80fc8cf20d6bc60fe5d438c5bbba20f4c8c3019d067bc7a529daef060"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060get_file\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/queue.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"9355a0b813ef863226b3c45c96463894279aea289e528a18c6bd73ade1101ae3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060get_file_by_hash\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/queue.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"27726de540155b90a6b0a147a0bcd52397dcaaf50b03d372428ec9f253d64010"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.inner.seek_relative(relative_pos).map(|_|current_pos.checked_add_signed(relative_pos))?\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060seek\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/smart_bufreader.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a34a3dd3c810425443ca43fe4c600f7b9db440057f719e36082aa08f4d0160"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var(\u0022CARGO_CFG_TARGET_OS\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/build.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"784449fd55ddf5dfc945e4748c91cc461e1c8675904f213a7a88e8ff23ed70e2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060res.compile()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/build.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f9ee6f05158384ab7a1ba1cd8cea3e5d609b4dbce6f32da9227b3440b240720"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ShadowBuilder::builder().build()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/build.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ed634bb267be8ab68677ee1a385afb7be9738eb58e83bbcedf314754e10ee4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060create_router(ctx.clone())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060draw\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f55233566f3899cb231f3a75e25fb95eaa6331ac6fbb5f05364b9162d621135"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.router.get()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060draw\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0ff0aa3a977d604a27c8dafcab12ee812245c30bc21e4160d2634902a55ad5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.router.clone().get()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060draw_router\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3e184cbf9da9e02f988f8542d9d113045ed9de7f9908023db669a4c3d2c435"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.router.get()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060navigate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9ed8fe96441ab705d76223d0255d745b859da894c27b4ba413e10e66cb2fdb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.router.get().unwrap().navigate(path)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060navigate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f45e1e7e7ecae5e93ca09363bc3a5c04ecdeb759e06e0dde695e1f241408962"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.router.get()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060navigate_replace\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"45820540e9bea81ee451489a1c7aea95490d792bcdb35040cf0d504f16b2ba30"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.router.get().unwrap().replace(path)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060navigate_replace\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ffeb8fcb4ef0169c087f0a1fff73d6340e2e437831370974024bd4376bdbf24"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NonZero::new(e.get()as u16)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060draw_menubar\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"33dad6a7e8f50fec8aeab330b69eddf8d7a7623ad44acd94320fcadfa14bf2a7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NonZero::new(e.get()as u8)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060draw_menubar\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":698}}}],"partialFingerprints":{"codehealthFindingId/v1":"6598b0038af71da13b2e57d59dc390245c6c3433830a395063353d6a5f370b22"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.changed_schemas.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060poll_changed_schemas\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"2427ba2ac5e2857d89425291d619194a6f438adcc03a80215975980a320125a2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.backend.clone()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060draw_sheet_list\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":1049}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03064e601e521da55b405db1ead11edb4ba32248fc9bf1814804442a4fcbfed"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.backend.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060draw_sheet_data\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"089843bb2d806d2e3ae06d13a591c61e2ad072c4d80ad2d5028ff42fc6672d32"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SELECTED_SHEET.get(ctx)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060draw_sheet_data\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"94891b580b6bb7c139aeb4bd57b831e639662025eaa132dbf2204f7bf928b257"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.router.get()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060draw_sheet_data\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e5b2e80b9382b1cea92ccd22262f7cc318e6f8d673e96e852844949be6b6c1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.setup_window.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060draw_setup\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":1484}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbdd22bbd2294d62aaa59c541a002557f5edb3538a786bfabf780cf7086896df"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.backend.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060command_save_all_schemas\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":1848}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a0a43031ae5d133c80ae6c326e8a16251e565be9a015de98be07709485ec32"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NonZero::new(32)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":1919}}}],"partialFingerprints":{"codehealthFindingId/v1":"258c7a8e2a163c2bd876ec50c326f4382abae7c462810f0086cbda9ef12b8c07"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NonZero::new(8)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":1923}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c7e32490ffa66a7dc1f5fe0700c9511b88ea4582fd522b23597a68ab3747ac"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.font_promise.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060update_fonts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/app.rs"},"region":{"startLine":2003}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a2d306bf1b1a7e3abad6d8ada82791bda0beeac3ebd685441c00e2d4cf4aad2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NonZeroUsize::new(cache_size)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/backend.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"24eec21b8e556db9bcd3b2998e1649129a56dd7f9e9744ab8f9d156d46793b55"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060transact\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/backend.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c08da5c15e8119c8e8bdbd26712a7128acad5344054860ffdd63c02730d1b38"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060log::set_boxed_logger(Box::new(self))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060init\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/combined_log.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"0608d90b927e5001a540f263a7c06e69362c116d776ef8e94c7d75744c92baf9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060args.next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060smoke_config\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/main.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d404d4609828922ef413b37c3f05860e2d0f7f539dc1327b7add6152c273125"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060args.next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060smoke_config\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/main.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"d009590e8962bd2f8532283430ad50c83480dde2a77081a75c4048aadf69ff4a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060arg.split_once(\u0027:\u0027)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060smoke_config\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/main.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"529c1a95400be0b1397c3ff142b2f812ed2ea02e1f269193f6431236d75ddea0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060eframe::icon_data::from_png_bytes(\u0026include_bytes!(\u0022../assets/icon.png\u0022)[..])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/main.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0f461e92a126f09e8a68987db54fa617aef324e14762491981a40126fd65143"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060web_sys::window()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/main.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e5348eb76abc2d1abe51d9da531c65c8530aa5473b11c389b0aa2804e321b2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060web_sys::window().expect(\u0022No window\u0022).document()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/main.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aadae3323db7dcecd76fb3d6809cb28a943c03edfec8890057f62c332595242"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060document.get_element_by_id(\u0022the_canvas_id\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/main.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d9fefe576381bb95e53a267512c60ea0c835eb8f4202470a7d55b6f2e0db4c4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060document.get_element_by_id(\u0022the_canvas_id\u0022).expect(\u0022Failed to find the_canvas_id\u0022).dyn_into::\u003Cweb_sys::HtmlCanvasElement\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/main.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1883a9a77d4d5df0c5cca04dfbdc5b889e9ee1629ea5da802e5c488d1aab34d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.loading.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060poll_loading\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/music.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4dce5a0968268fd24ecdbb31a439dd0db3e546b16dca34c797ce73758578981"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.player.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/music.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"a424ad9da0d73569a16c87c022a7fa14a26878889d8749ff7c4c5fff4d1629ee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.now_playing.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060draw_player\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/music.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6113963196568e0c673820d22f88cd798a75e4addede32dfc16c3989128519f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pr_promise.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060draw\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/pr_window.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42ebc8ff49581773ecee14b2efa95271d8baa5319d49b962112a6f9630d2d4c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060web_sys::window()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060open_folder_picker\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/setup.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2af3083f0c6587f7039c30e7982639d64bdb7860bf05c089726c410082a55f7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.list.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_folder_list\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/setup.rs"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4fe6fd2801d0b29f06dc20f79e12ba2de373327477c65d5f5f6e7dbc61ae21"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060web_sys::window()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060is_supported\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/setup.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"430f5cb6ef17ec7bbf3808c5b63e49fb130a90d2557faad7bd6dab93dbab9f7f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Reflect::has(\u0026web_sys::window().expect(\u0022no window\u0022),\u0026\u0022showDirectoryPicker\u0022.into(),)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060is_supported\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/setup.rs"},"region":{"startLine":921}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a92c19e5da8617d26ae2aeb654fb9a95bd73458432e53f466532fce372dbaa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060log::set_boxed_logger(Box::new(self))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060init\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/smoke.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33e7d89a6e24831d42f9ff91f9ad555a7458a5d5f40ab132b6efd92ccac62f7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060input.serialize(\u0026SERIALIZER)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060encode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/worker/codec.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"96991fc9cff0ac17e8c265c16ebc0d95a909d41d27e856038717984ab4ff038a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_wasm_bindgen::from_value(input)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060decode\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/worker/codec.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93a811c32a168825522487827dd85c81d715c55a2a2e028de5ffd3fc1043ad3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.try_get_or_set_ref::\u003C()\u003E(key,||Ok(value_factory()))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_or_set_ref\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/utils/cache.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba60c6cbb7c5931e3786c8adef1fc34223c1f55b610b028a96a049513b5057d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.try_get_or_set_ref_indirect::\u003C()\u003E(checker,||Ok(value_factory()))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_or_set_ref_indirect\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/utils/cache.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"1475ca464edaf5fa454c386e80f1bd754729eb89f86cc75f16fae23ac7fb970c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.0.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_get_or_set_ref_indirect\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/utils/cache.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"876d8d9c25e5fe8c5f24a37bb251414c2896f8db4bc289fce2de334e7d9124b9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.0.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060try_get_or_set_ref_indirect_async\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/utils/cache.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88db807133794741393c5dadc51edeb5a85c2b99767859ed5a4a5bee31b7f58"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060converted_this_val\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060get_mut_with\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/utils/convertible_promise.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3f76f882e156ebeb79d12913228a2fec20a5178704e3055ddfa4f5ba71e8e1a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060choices.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060menu\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/utils/export.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c09a133ae8910031d82ab74804b88463f2ba143720e7583e605204ab4db9ec92"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060RgbaImage::from_raw(width as u32,height as u32,bytes)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060color_image_to_rgba\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/utils/icon_export.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"641edbc39bd1e6daf53d68a740fdc7420420bc6f0610cbc54f60cab77de1cbde"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u8::try_from(value)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_bgr5a1\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/utils/tex_loader.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f3d0e98cfa7c06bb838ea4b536a69cb47ce7b75b1aa6c1f7b1b51f9033f423"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rx.now_or_never()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060block_and_take\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/utils/unsend_promise.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d170b6cda7bbb1c30390d83869a3c90d27ca96b1d9d4b5041e9a200e9185f04"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rx.now_or_never().expect(\u0022UnsendPromise value not set\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060block_and_take\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/utils/unsend_promise.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c3f060164294ea47b0e53f6b75270116b6f20f2adba963afdb6f35e404415a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060version_string.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/utils/version.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bca64cafee8c1aa0dc09f6c20a0f54c4d022ebc6229f12e701bcf88ba93af6b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::new(\u00222012.01.01.0000.0000\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060epoch\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/utils/version.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"e988613c07c3692474aae2b8e725dca8674bdde621cc8fcfd8cb941edbae9430"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(\u0022fetch\u0022.to_owned()).spawn(move||answered(call(\u0026request)))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060carry\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/utils/webreq.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c081aeca87d8438e5a69d53c5b746a8266800be7002d1acd8c5a235095d2059"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060resolve.call0(\u0026JsValue::NULL)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060yield_to_ui\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/utils/yield_now.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"296b3c04976b059398bf4980a6fd36de0f3bbbed9446fcc66766f8ea767a53dd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060window()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060yield_to_ui\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/utils/yield_now.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f3e2927eb48cd0607b3840f4e11594b2a8b58e984ca89b31d635de881cd275"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060window().unwrap().set_timeout_with_callback_and_timeout_and_arguments_0(closure.as_ref().unchecked_ref(),0,)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060yield_to_ui\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/utils/yield_now.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aea0b6305a6577972d6c79f19d53bebb18e9682cd55430d049ccc531d008bad"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060table.sheet().get_row(row_id as u32)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060size_internal_link\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/cell.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"36494147d92c793f742ec0a7fc408142c147fae65f93b1ec36a4aa720a8e1efd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060table.sheet().get_row(row_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060read_internal_link\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/cell.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5f10f7dc2b53c01cb89ae1a96327952c7e6af6bf31c77912a97ac38cfc1aab"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060linked.sheet().get_row(row_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060resolve\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/event_icon_type.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1c2ba25a258eb66044e793a76e3b145c58797c79acbd7ebacf46e82c7bd309"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::from_schema(\u0026Schema::from_blank(\u0022Blank\u0022,column_count))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060from_blank\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/schema_column.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"7121c4430dcaca4622f5d68c039489e052d304c3b9a2216215a2d3a295ae4a1b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NonZero::new(8)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/sheet_table.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a6a2b02b2747ae8d274b17b3d3b1ebe72b9f2c483466283d1af8cf00a6758cd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sheet.get_row_subrow_count(row_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/sheet_table.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b22be7f1dd6fc39fecf6c9e027d22fd25d6e0a7ec1c520d4587ca7eb652bcd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ctx.sheet().get_row_subrow_count(row_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060filter_core\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/sheet_table.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"256422962e76e458f1dbe7bfbefbeb62fd0bd5929dc400a61e54f9e3a12e36a2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060filter.input()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060spawn_filter\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/sheet_table.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"9353e1dcbd91e9a31425cc11a57a49911f9ec63110267f4cf32a065a7ec7d847"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.current_filter.clone()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060tick_filter\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/sheet_table.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e9a77bafb68312f118227c79e8d00dd32b57bc0fa657d4b5eaf6063dcbb323"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.current_filter.clone().unwrap()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060tick_filter\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/sheet_table.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"302ed22acdfaf38c8a9017d64628eda54e74d5a63fdae5ce8f6bc89a184b92d8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sheet.get_subrow(row_id,subrow_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060size_all_rows\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/sheet_table.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e1a36d18d48be8bbc7016d411b4167d019399089ec515c0cf6df95d8ced2b7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NonZeroU32::new(1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060match_cell_score\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/filter/cache.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"6968c814cd7e065cdaecd32c3ecf6acd66ad7026e21e0547ef9c478d42e1e1da"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ret.into_iter().exactly_one()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parse_or_expr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/filter/complex_filter_parse.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9865f6eb33b7aa7fccc79aca15408421cd41461d474886a61b4fd030d126a4d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ret.into_iter().exactly_one()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parse_and_expr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/filter/complex_filter_parse.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd15657d5f7f35304a8b9c8bb7d0b7454ca35ee2460ce5bca86b3f457d9f95f7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060c\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parse_comparator\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/filter/complex_filter_parse.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"166f6f6635b98330ca1a263d263b9f129caf13dc7a18d1c0db9bea84b185e0dd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060c\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parse_range\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/sheet/filter/complex_filter_parse.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63d4a92226a93ddda8e2eb031f1c904c2499f9725bda4547f7a9caee580a54c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::num::NonZeroUsize::new(10)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new_local\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/schema/boxed.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"131611255e2909454b822df9238df34b0f0e7367e3160f9a568e9e89c1111213"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::num::NonZeroUsize::new(10)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new_worker\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/schema/boxed.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"6861b5ab45fe45c583aa7cdb2a3f088fa636270d1f3a98b6666652dc1a8eb54d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::num::NonZeroUsize::new(256)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new_web\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/schema/boxed.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eece13468bcc0cbadca2dadc4bd8fc9e0dafad4dfa6551898bca04281a46e1e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060PathBuf::from_str(base_path)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/schema/local.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"8acdd92973d77f33ffd315faee681aeb38dd1bb740b99e20db0e74a89051c20a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.parse()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parse\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/router/path.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"28bfc128d18604bc409ae8caf78023e8e16eacfb53e14eacbd8f57b3c2022e0d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.parse()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060with_params\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/router/path.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f16f51cb37a5bd8e1493eed6f187bf7151fb5f06bed03fd454bf543954622618"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.ctx.data_mut(|d|{let position={let history_len=Self::history(d).len();let position=Self::position(d);if*position\u003E=history_len{log::warn!(\u0022Position {position} is out of bounds for history length {history_len}\u0022);*position=history_len-1;}*position};Self::history(d).get(position).cloned()})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060active_route\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/router/history/memory.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"520b533afbee184a8d72f2eb982289d10de796840f3630b5f46312409bc22590"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060window()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/router/history/web.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8b63e88b0e71a4f11ff8b46e016389d525b28f95b0be2f4226b7972b0e913f8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060window.document()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/router/history/web.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e485bd4d6f99bfad17c98696841db72eb7af02b2796eb12430f3b438ba3ea6f5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060window.add_event_listener_with_callback(\u0022popstate\u0022,cb.as_ref().unchecked_ref())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/router/history/web.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d519b20e183ce6f1da0ea95ae8ccc78192af526d412f80c49e74a17ec69ccc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060window.history()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/router/history/web.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb0827c31cbfbba8cbcabef3cb1372a309151bbc60968eeda7e61b1be9ac03f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060window()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060drop\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/router/history/web.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39eb297bb30a489e44cb1f22c3cb482508063f744c369cb2e3cd2977c9e5faf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060window().unwrap().remove_event_listener_with_callback(\u0022popstate\u0022,self.cb.as_ref().unchecked_ref())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060drop\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/router/history/web.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa83e55b284686a947405409bf7f78042b6d687e297e0645891fdd0af1edbc74"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060window()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060set_title\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/router/history/web.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee3ea42088e562db527056ad149c4bd3c4b368056d2186130546d78879a65f2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060window().unwrap().document()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060set_title\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/router/history/web.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c85ebd391823a097d023ee6e3c6b56dace114c7e876a650efbf827873c3a40"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060window()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060base_url\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/router/history/web.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b945363bb003a45046cfdf6ceabd740a3d0643bec0418c774cb3176d82207564"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060location.origin()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060base_url\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/router/history/web.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b909ce65d5192e1484d4f8fa4d704e9e55a0a2dae185447b40dc6e68d5125c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060window()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060active_route\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/router/history/web.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"230d6ec662fbd7f5d6bbb9738c73c0cac0b6e77219a06ae3794b61f8be0c70bb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060location.pathname()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060active_route\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/router/history/web.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d245c588a9b56b87d3820cc57aff43c4d816c1c89e6f84170f2fc19162d1338"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060location.search()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060active_route\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/router/history/web.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca788c860f541e55735f9e691e5a04057946accd1b20531c680df683622fe1c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060location.hash()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060active_route\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/router/history/web.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"19497a0629f6ba1d98354a24cee7909b30a48de01f4378084e5471d4fe5655cc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.loading.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060poll\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/quests/mod.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c53303059fd98a97dc94c0f5a378c2cdbd5828b1e2323153f9aadbb11d8e4f7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060hits.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060rows\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/quests/tree.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d27a51d2ac41253452c6bda7d0ef851be4735b9b4dd05d341d3a095b3c1a85"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::str::from_utf8(group)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060thousands\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/icons/mod.rs"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"7383f9acac3a60896638426d1bb561266a5a74b548f8813bb6fe7110fa3c85e2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060getrandom::fill(\u0026mut buf)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060random_token\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/github/oauth.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba585b26a71289224d55f9746a8a534c7f0034fc19b977f30b528e2878b391d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060web_sys::UrlSearchParams::new()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060build_relay_payload\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/github/oauth.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6355516c82f9a7cba234f4d03f99ec26ba1c873e1c718276810ca9f3119137"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.client_id_promise.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060poll\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/github/session.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e18c1af2cee0cfccc22b605e436ad1fa57d67ac6ee2f71a07c4804215d0e21"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.exchange.take()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060poll\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/github/session.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd19f13952cfa7cfe4a70458d3e3f03075fb718401cc745db3e990f096662e6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.get_row_subrow_count(row_id)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_subrow_ids\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/excel/provider.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"16aa8f74ccd6a6f40818732074ee5872f0e4ed339ebdbff7c12a6ee662de1f66"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060PathBuf::from_str(install_location)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/data/sqpack.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3f4861962ec44483e6fd5ef9fe22aa9c9cd638a9831344d982f1b54292760f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060paired\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060appearance\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/character/mod.rs"},"region":{"startLine":2092}}}],"partialFingerprints":{"codehealthFindingId/v1":"0784e934d1b86aa1b8ce0e31585b0b33f2b981c3ecd638d790f2fcd399bfbc24"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060files.into_iter().next()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060package\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/audio/decode.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bfe0849068ae34ddbe2c66252949f9274707e3b2b7c94fecc74ff126bd5f40e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ChannelCount::new(self.audio.channels)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060channels\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/audio/native.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"c624edefc0b399f82dd17673ac7385e3ff58e8848803782fb9d8ba4ec9fe8e69"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SampleRate::new(self.audio.sample_rate)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sample_rate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/audio/native.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"0511338b5725b503539bcf459b56ebfcbfc7c55cefbf032067cc7b824ea8289b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NonZeroUsize::new(CAPACITY)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060default\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/deps.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc1beebb4294dfd6f45fd9fe65dc67523adbb5540597ff73b6be8a1258b88fc0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NonZeroUsize::new(CAPACITY)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060default\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/deps.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"01067048dd763c05f8ec841cf0739a9a200f8c4d14043f2be0952cc80e2499d6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NonZeroUsize::new(SHEETS)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060default\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/deps.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ca3d3f2c03f4cf78233e5d1cd3d869cbc07e5d43b7ad0995050f7ddc812b9c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060header[at..at\u002B2].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060is_texture\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/magic.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b03245bd49e6a0f50827abc3de6af763a3c6959470ee25808ed5cbe720352b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060header[at..at\u002B4].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060is_texture\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/magic.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eda4d836739e50ebca349255328f332d346dc6f57ed20b6c22d80aca4a1c042"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060header[at..at\u002B4].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060is_terrain\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/magic.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aa4f4b1b3ac3e795e5bced2a38fd113bb6c6f7c460bc19068773def636c7d60"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060header[at..at\u002B4].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060is_dictionary\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/magic.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5ad122fa00d9667b2324c386fb0223bb01196a3313ff3cd83120940f7074c0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::str::from_utf8(\u0026sample[..e.valid_up_to()])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060is_text\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/magic.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58347e5ead15cd8ef1ec11c0b8364e0a607726c76abd5e7692d8b33f9120aa3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060image::RgbaImage::from_raw(hwc::WIDTH as u32,hwc::HEIGHT as u32,pixels)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060pixels\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/hwc.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"092b282ed5e5a136f7f375617fb58748accdd27537ee35fd05e3833e87494dc0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060player.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060toggle\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/scd.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"501e1de4858a73ce23a64139a9b5463b435b1eaf1c3b9cc16c5c330753162da9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060location.track(track)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ui\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/zone/amb.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3705c5c4201aa6eec5da146a625cb620a61ed61e9cd7810dcdf79c6c03a6a2d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060passes.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060read\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/shpk/keys.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"981e497a14d08e2b14799389772714dcfcdfe69d37eb42ebd0d4efe184ac690a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.watered.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060waters\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":2830}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f3a9c322cf2b79e8d9341c46b63f16b5e9a3c8d3313ba354a784edb4408f68"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.mirrored.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060mirrors\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/deferred.rs"},"region":{"startLine":2991}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f08c02299214dd416a36489c4e9d132c2d4ce5406b2efab714fc7035dd981e0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060joints0.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060primitive_from\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/export.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d6c08473ea679635501335085582222b016737ec4fdb12dbaf963649f3084d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060weights0.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060primitive_from\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/export.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"7950f7d132db2aaa3399f1e7a5750281fd7c30f4813d1b9bc7f90b6aeeae9d96"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.sampler\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060texture\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/export.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf3491cf35058c0edd6b027f6263a45937f24e7bf609ca9ef0be2e82f435830"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060slot.try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060parameters\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/mdl/program.rs"},"region":{"startLine":2293}}}],"partialFingerprints":{"codehealthFindingId/v1":"61847dbfce8fa16cbdee2cbb5093cddde706fa570ccce9ea85645b43e817d44f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.instance(at)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060fields\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/mod.rs"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"14be7d7a968fc7af79c3c36672b476a723e17c46d2851b86dd2162fbd52521f5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060player.as_ref()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060toggle\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/layer/sound.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a9f9a307eb05eaafd1a1661868b42724796c33de0df1d83eb9b9c212565670"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.rows.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060row\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/avfx/mod.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a1caff3475946d0b24d315e17734165275cae18e72c8aaacec9debcc4f8cda"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pending.get_mut(reader)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060ordered\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shadermerge/src/factor.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"e312b10051253af2b231358c99a52b904ca3bd3e67536edf43c018771d3ff835"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060held.presence.remove(\u0026from)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060factor\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shadermerge/src/factor.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9eba27203edc59ee272572c08eb32385c899430a83c65dd053bd141e66a857"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060held.presence.get_mut(\u0026into)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060factor\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shadermerge/src/factor.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"9246d9e0bf582c41d79d9be3d4c9a8fc47ae92fe91892600e23b336260376566"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ready.iter().enumerate().max_by_key(|(_,value)|seen_at[*value].iter().filter(|held|**held).count()).map(|(at,_)|at)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060schedule\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shadermerge/src/merge.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"62e51428405cdb9d4d875356e2f35925f7d04c85b5905ddf1f9161e255df6b77"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.take(8)?.try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060u64_le\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"pathlist/src/utils.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc75797b25fd3af74cc5b5a06453e706506a4497232c8f54a8566c62f7e3431d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u16::try_from(tokens.len())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"glyphnames/build.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"2255f716195c0c7b523ffd384f9e912ae1f33f2ad386fcad96b547d8e9f4ef7f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u16::try_from(words.len()-1)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"glyphnames/build.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc13cc145c5bc874b790f5cb78b7bc4a24267bb4e42593e9415b937bf940049"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u16::try_from(tokens.len())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"glyphnames/build.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"edffac8a6bbeffbb3202bfb6e7754df8cee40b785629bfb18eefa06002db86fc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ends.last()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"glyphnames/build.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec25f2046a8da106d0e92f778b83e649be81e2b3421b3eee7e8dfc0bf2161ca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u16::try_from(word.len())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"glyphnames/build.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c261b3feeaaa9b4beb30c8dc37395992b89988f78659b8db9c731397887977"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(out,\u0022static UNIFIED: [(u32, u32); {}] = {unified:?};\u0022,unified.len())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"glyphnames/build.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30492bb2ebb6090f9cae6c90a1505c06410b9b33c5c6eb77bda43db7608a00b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(out,\u0022static COMPATIBILITY: [(u32, u32); {}] = {compatibility:?};\u0022,compatibility.len())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"glyphnames/build.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"244aee393e94bbb05cde40322a719d4cf737481d6afb8b1a6a497b88ae3a0ff6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(out,\u0022static WORDS: \u0026str = {:?};\u0022,words.concat())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"glyphnames/build.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d860a9851fa62527a8444a26f03d19329de5542a5157afc6aeb7258e994a3b1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(out,\u0022static BLOCKS: [(u32, \u0026[u16]); {}] = [\u0022,BLOCKS.len())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"glyphnames/build.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c4f217ad165bacc51852937cef3e09c8ab1566024debe496fb15a8af3d8cc1d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(out,\u0022    ({first:#06x}, \u0026BLOCK_{index}),\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"glyphnames/build.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb3289782da6289c52114b0d8d89c7ff7e4276856fa338c12a9841b4f499a5d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(out,\u0022];\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"glyphnames/build.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c4b6e7222aa5a63e11016b3cb5c9aa81e863d0212a28d365300e850efd3f83d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var_os(\u0022OUT_DIR\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"glyphnames/build.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"345b1e8361af3bda67a004a9e213ce24793c969e64c9925cd7a27725b1015aa5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(path,out)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"glyphnames/build.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"23664a9d5f011fb2e61bcdfc3c3acd16d56811b05ec44b2b6388d279962048c5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060writeln!(out,\u0022static {name}: [u16; {}] = {values:?};\u0022,values.len())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_array\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"glyphnames/build.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f322c61424f41d90df94652d234f9b2efbedb85405947045c1062b08b77f64"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pixel.0.iter().max()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060saturation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"framediff/src/lib.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5e5e4f8c0fe92653b8f8d9273059b92bea1ba9c353fbab214af06f54879df03"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pixel.0.iter().min()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060saturation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"framediff/src/lib.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb651b412c593fb1ba4fedd48a048e0544f99739f26975c2a1161816eeb03ac"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060cutscenes\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/quests/index.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9d38de2ac619948cfa9239673da2e6be092417daa6f5037f9909246083e133"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060class_job_reward\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/quests/rewards.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d05fcb9966bc7e756f741cb07e20b608899900305bd34f7c900522f8e82b81dc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060scripted\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/assets/viewers/cutb/music.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db47994e9e35e4ee0fce38e3e7f1daf4a93d9d50be823ad6302dcbe008faa3a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060companion\u0060 turns every \u0060Err\u0060 into \u0060Companion::default()\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":"viewer/src/assets/viewers/mdl/skin.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd11b90b7544a83ae76220afe0eb56e71d6ddf3861b0f5c6cf86c3ced6eadf6e"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060icon_columns\u0060 turns every \u0060Err\u0060 into \u0060Vec::new()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/icons/refs.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c1877e824d959f41098b0f2148e3e95b32e8b8be1114c198e5cb459710dba8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read\u0060 turns every \u0060Err\u0060 into \u00600\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"viewer/src/quests/rewards.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2e8649df783db92e0f14fef86537326fa5ea761bcabc84b44c088ae1974c79"}}],"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-611","guid":"1afbae66-ea29-2d59-aaa2-134e3ae2e85a","name":"Improper Restriction of XML External Entity Reference","shortDescription":{"text":"Improper Restriction of XML External Entity Reference"},"helpUri":"https://cwe.mitre.org/data/definitions/611.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-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-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"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":65,"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."]}]}