{"$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":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"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":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"ES1","name":"Fold determinism","shortDescription":{"text":"Fold determinism"},"helpUri":"https://codehealth.canine.dev/dimensions/ES1"},{"id":"ES2","name":"Immutable events","shortDescription":{"text":"Immutable events"},"helpUri":"https://codehealth.canine.dev/dimensions/ES2"},{"id":"GD1","name":"Unfinished \u0026 placeholder code","shortDescription":{"text":"Unfinished \u0026 placeholder code"},"helpUri":"https://codehealth.canine.dev/dimensions/GD1"},{"id":"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":"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":"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":"cranelift_mlir::lower::lower_instruction_mem (cyclomatic 330): cranelift_mlir::lower::lower_instruction_mem has cyclomatic complexity 330 (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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":4008}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed44d59a6a761c7d8c908c1c8f407c130ec9eaca5f672108563f15f9daedd938"}},{"ruleId":"D1","level":"warning","message":{"text":"cranelift_mlir::lower::lower_instruction (cyclomatic 229): cranelift_mlir::lower::lower_instruction has cyclomatic complexity 229 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":6882}}}],"partialFingerprints":{"codehealthFindingId/v1":"06bba96e79fa9f77b7715c2deec2293dabba057cd7d7c22e25d0e0a0a1a3d8d2"}},{"ruleId":"D1","level":"warning","message":{"text":"TileLayout::ui_system (cyclomatic 116): TileLayout::ui_system has cyclomatic complexity 116 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":3195}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef7451b27fd78626bceee22573303abf04885555ceeb2208a5f926923fff573"}},{"ruleId":"D1","level":"warning","message":{"text":"WorldBuilder::run (cyclomatic 108): WorldBuilder::run has cyclomatic complexity 108 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef22285185ff64e683659cc1d2b5ab7ee8efef8010253fe8b78a32df4a07c5f"}},{"ruleId":"D1","level":"warning","message":{"text":"cranelift_mlir::interp::binary (cyclomatic 102): cranelift_mlir::interp::binary has cyclomatic complexity 102 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce39b3aa35d0de25b15cc942dd8330d5c483fbccaf4cafcb4e3b9a2385b20140"}},{"ruleId":"D1","level":"warning","message":{"text":"cranelift_mlir::const_fold::try_fold (cyclomatic 96): cranelift_mlir::const_fold::try_fold has cyclomatic complexity 96 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/const_fold.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fffd9fd720d29a7db26a98e9b5234ea4c895376fa52581a431412bae672e76"}},{"ruleId":"D1","level":"warning","message":{"text":"cranelift_mlir::parser::parse_op (cyclomatic 92): cranelift_mlir::parser::parse_op has cyclomatic complexity 92 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced7f8120a24432830f59bef084a6aca54e0daa35db954db3d9b3ecf471cc860"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_db::handle_packet (cyclomatic 74): elodin_db::handle_packet has cyclomatic complexity 74 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/lib.rs"},"region":{"startLine":2145}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc9e2e5bf69aaf261cafc687fbc3af942e03bb3ce3528a281108709c22d003d"}},{"ruleId":"D1","level":"warning","message":{"text":"NoxprNode::eq (cyclomatic 72): NoxprNode::eq has cyclomatic complexity 72 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a7361084932ed5dc5a4893e9de999f117a2bc9848505a13beef402c00db678"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_db::export_mcap::run (cyclomatic 71): elodin_db::export_mcap::run has cyclomatic complexity 71 (threshold 15). Of this number, 66 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/export_mcap.rs"},"region":{"startLine":2271}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb70d741a36be6b66da03c13c15a763817b2b0df57e351b562702394981242a"}},{"ruleId":"D1","level":"warning","message":{"text":"NoxprNode::is_equal (cyclomatic 71): NoxprNode::is_equal has cyclomatic complexity 71 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"521a287321d9add5cdc38fd70b3b2a4a86ae59cdef7783cfaa945334a157d2df"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::plugins::frustum_intersection::draw_frustum_ellipsoid_intersections (cyclomatic 66): elodin_editor::plugins::frustum_intersection::draw_frustum_ellipsoid_intersections has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/frustum_intersection/mod.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e87c2b33340e4542e2d6f4981674b3265592e4ca8ea4c6ec0a53c367509a0b"}},{"ruleId":"D1","level":"warning","message":{"text":"DataOverviewWidget::ui_system (cyclomatic 60): DataOverviewWidget::ui_system has cyclomatic complexity 60 (threshold 15). Of this number, 58 points are the body\u0027s own statements and 2 belong to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/data_overview/mod.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"b139124837ce029c13771f914a24f0e76f4f67654df0d4c9934130637c09b90b"}},{"ruleId":"D1","level":"warning","message":{"text":"InspectorObject3D::ui_system (cyclomatic 60): InspectorObject3D::ui_system has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/object3d.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33c6007432c2f82c4d87396e135f75c1f9a5291c9f7d22534056b723c7f2ad5"}},{"ruleId":"D1","level":"warning","message":{"text":"cudainfo.main (cyclomatic 58): cudainfo.main has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"aleph/scripts/cudainfo.py"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b78ce6dbb83c311d339c1eae292c87833f415403c4ef2507579f9412208fecb"}},{"ruleId":"D1","level":"warning","message":{"text":"sensor_fw::main (cyclomatic 57): sensor_fw::main has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/main.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1476c56c969078f005a64170771897c4708d75b7ca821d31a49771c078a8a87"}},{"ruleId":"D1","level":"warning","message":{"text":"LoadSchematicParams::spawn_panel (cyclomatic 54): LoadSchematicParams::spawn_panel 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":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"0942e1cd5d34017cc013b14dc8cbf414039df41de6f6f022f2b0a13ee6ff8a2f"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_db::main (cyclomatic 51): elodin_db::main has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/main.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d4fe7c2ae7c73a8f37bfc7ec986c38bc2f10e217d5af5d16009a09433175c8"}},{"ruleId":"D1","level":"warning","message":{"text":"VideoStreamWidget::ui_system (cyclomatic 51): VideoStreamWidget::ui_system has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/video_stream.rs"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba69f109e5c0e6ba383a5a93236d376d0b4602429f31741295f73af8c1836c2"}},{"ruleId":"D1","level":"warning","message":{"text":"Noxpr::ty (cyclomatic 49): Noxpr::ty has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee07712fdb74736c34c5d27e46fbd343c9cb4ec37e99962317df3af7b99f036b"}},{"ruleId":"D1","level":"warning","message":{"text":"PrettyPrintTracer::visit (cyclomatic 49): PrettyPrintTracer::visit 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":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":2333}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfab32bef21b0d9714367f0f9e3f9823fb3de83ae619d1e71485b8e574a32af2"}},{"ruleId":"D1","level":"warning","message":{"text":"SchematicParam::get_panel_from_state (cyclomatic 45): SchematicParam::get_panel_from_state has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/mod.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"92886dbbbd3efbca0b7b84ddb6629210f93bc7c6963305081d5987ac726bf8bf"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::object_3d::compile_formula (cyclomatic 44): elodin_editor::object_3d::compile_formula has cyclomatic complexity 44 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"40bc624e0a0f0c689fbbb34330ae6de0f7dca1e37dad424f467ca031a0842949"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::plugins::frustum::draw_viewport_frustums (cyclomatic 44): elodin_editor::plugins::frustum::draw_viewport_frustums has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/frustum/mod.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"357647845ce27443c52e6a43344a749e5194d9d8b8b0a05e08e7e3c90238de9e"}},{"ruleId":"D1","level":"warning","message":{"text":"cranelift_mlir::const_fold::rewrite_aliases_instr (cyclomatic 43): cranelift_mlir::const_fold::rewrite_aliases_instr has cyclomatic complexity 43 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/const_fold.rs"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb94448fce7212ca6c6da03472c521b4aa6f96e7624e80727cfe31c3dd77279"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::plugins::cinematic_earth::apply_cinematic_earth (cyclomatic 42): elodin_editor::plugins::cinematic_earth::apply_cinematic_earth has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/cinematic_earth/mod.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7630815b740a6fed9889041eeb84ebb7b0e0d8bf9c605661462af9f88d955e4"}},{"ruleId":"D1","level":"warning","message":{"text":"Pane::ui (cyclomatic 41): Pane::ui 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":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba2a1a236ac99103601c2a8c2eade2ff640628e5949330a3bac0cc354b7a68c"}},{"ruleId":"D1","level":"warning","message":{"text":"impeller_bevy::sink_inner (cyclomatic 41): impeller_bevy::sink_inner has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66a1e294b8bf0a733faa88aa3ac8f5e9892f0907cebf9afd34130224b425808"}},{"ruleId":"D1","level":"warning","message":{"text":"nox_py::impeller_server::tick (cyclomatic 40): nox_py::impeller_server::tick 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":"libs/nox-py/src/impeller_server.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab34e68d564c615c5287d201fc3196799a3b5cc8660da52d36ace9d831131f57"}},{"ruleId":"D1","level":"warning","message":{"text":"cranelift_mlir::profile::dump_report (cyclomatic 39): cranelift_mlir::profile::dump_report has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/profile.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"86569cae15f2ab53d5470056e21d0ec608450d2c88ceab2119f791630dc30a45"}},{"ruleId":"D1","level":"warning","message":{"text":"LoadSchematicParams::load_schematic (cyclomatic 39): LoadSchematicParams::load_schematic has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"2038e7badd5fa84424e2050d600048cde6035ecf83a247e4d07a4693d79853a8"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_db::merge::run (cyclomatic 38): elodin_db::merge::run 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":"libs/db/src/merge.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"43db5df30891bd180417783b10e38555ab5ad39050e0082ad0c93875bbf3ba34"}},{"ruleId":"D1","level":"warning","message":{"text":"impeller_kdl::ser::serialize_viewport (cyclomatic 38): impeller_kdl::ser::serialize_viewport has cyclomatic complexity 38 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/ser.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"822ccb3e60f09f0d84862ab1999bc13423c71da206eed82c793302a4b8ce1188"}},{"ruleId":"D1","level":"warning","message":{"text":"InspectorViewport::ui_system (cyclomatic 37): InspectorViewport::ui_system has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/viewport.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e1df549d85f8148c3cac880d8afd16211a4ce6b3e6723327f6ccd573a9fe573"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::plugins::map_overlay::draw (cyclomatic 37): elodin_editor::plugins::map_overlay::draw has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/map_overlay.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"837db27f5577783c23e20996d155968402a90d4a419a9e74495b3bfe0d1a77cf"}},{"ruleId":"D1","level":"warning","message":{"text":"Noxpr::shape (cyclomatic 37): Noxpr::shape has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: ReplacementTracer::visit (cyclomatic 43) 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":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b834eeff8d466e83d7bfcecb7895a04a09c62243009783cfb4d6a89206d4198"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::plugins::gizmos::update_arrow_label_ui (cyclomatic 36): elodin_editor::plugins::gizmos::update_arrow_label_ui 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":"libs/elodin-editor/src/plugins/gizmos/mod.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"c61899e908c33467a433e283bd8a7bffb4dd0175e24ae77468118a964c9781b1"}},{"ruleId":"D1","level":"warning","message":{"text":"TimeseriesPlot::render (cyclomatic 35): TimeseriesPlot::render 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":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c2c27c56cbeb3829e9a9cd4fd680dd4b6ac436e996ce9e9584ac2b7db44dea"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::plugins::gizmos::render_vector_arrow (cyclomatic 35): elodin_editor::plugins::gizmos::render_vector_arrow 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":"libs/elodin-editor/src/plugins/gizmos/mod.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb9e326c2c68862c14a9697a31dede99829d71cac21cd909583b2d5369b37f9"}},{"ruleId":"D1","level":"warning","message":{"text":"ComponentValue::add_view (cyclomatic 35): ComponentValue::add_view 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":"libs/impeller/wkt/src/value.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a7c9ba4cef562cb744a8a8c899ba49eada7026915bfc74b6ce637aa6533abe"}},{"ruleId":"D1","level":"warning","message":{"text":"WorldBuilder::sensor_camera (cyclomatic 35): WorldBuilder::sensor_camera has cyclomatic complexity 35 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda1c9f27120e5d66c5b7b5c763ff32bba3e7345ff042d43b0d822f67a207712"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeBehavior::tab_ui (cyclomatic 34): TreeBehavior::tab_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":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":2311}}}],"partialFingerprints":{"codehealthFindingId/v1":"f588b4263543566f105072916fb3e2f35ec22cefc1973337d1c77071154d03ca"}},{"ruleId":"D1","level":"warning","message":{"text":"Noxpr::element_type (cyclomatic 33): Noxpr::element_type has cyclomatic complexity 33 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: ReplacementTracer::visit (cyclomatic 43) 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":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"d865a7c5433fb79a8818304f12179ec9aae93fc3dac3c55aab3f28bddec215b7"}},{"ruleId":"D1","level":"warning","message":{"text":"cranelift_mlir::tensor_rt::tensor_conv_f64 (cyclomatic 32): cranelift_mlir::tensor_rt::tensor_conv_f64 has cyclomatic complexity 32 (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":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":1900}}}],"partialFingerprints":{"codehealthFindingId/v1":"4119731eb8d43eaed95c6e29e6fba83f5fbc742201425cf22b6f6997b0665926"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_db::fix_timestamps::run (cyclomatic 32): elodin_db::fix_timestamps::run 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":"libs/db/src/fix_timestamps.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fd35b568e9e596fd2336e0bb06ae0789524df7eb79e8abe67c01490aa46ec5"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::ui::plot::gpu::extract_lines (cyclomatic 32): elodin_editor::ui::plot::gpu::extract_lines 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":"libs/elodin-editor/src/ui/plot/gpu.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe85abe698343c3d444318e8a86ac5550072fb81e178e3cc7049104f0f48bc24"}},{"ruleId":"D1","level":"warning","message":{"text":"monte_carlo::execute_campaign (cyclomatic 32): monte_carlo::execute_campaign 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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3170a1e7d754645c96cc58a5493da150b23c12db8155c155dabc4eb08cd901c"}},{"ruleId":"D1","level":"warning","message":{"text":"TimelineControls::ui_system (cyclomatic 31): TimelineControls::ui_system 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":"libs/elodin-editor/src/ui/timeline/timeline_controls.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f57c8e2c0c58d614a941cf6069017e838daa94203218fbd8319e88136e52f57"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::ui::schematic::tree::panel (cyclomatic 31): elodin_editor::ui::schematic::tree::panel has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/tree.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bdb1ec203b8fd9355f2cde16da1358937c13a3e7ca9b04f3ad3146df6f82f3f"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_db::grpc::ingest::validate_schema (cyclomatic 30): elodin_db::grpc::ingest::validate_schema 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":"libs/db/src/grpc/ingest.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd152123f7931e24e9a322bce786ac4cf6a5ba9208d139d67a519b8c17ced9e5"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::object_3d::update_object_3d_kernels (cyclomatic 30): elodin_editor::object_3d::update_object_3d_kernels 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":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"a740a3d66cdd18d701c1e47a6be599fac04306e15142fc89adfdafd7603cdd6d"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::ui::window::spawn::sync_windows (cyclomatic 30): elodin_editor::ui::window::spawn::sync_windows 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":"libs/elodin-editor/src/ui/window/spawn.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e59d2c2ebf9e349acbec86cd2570c6666dfe5b3dd4164854a524021503aee4e"}},{"ruleId":"D1","level":"warning","message":{"text":"cranelift_mlir::parser::parse_sort_op (cyclomatic 29): cranelift_mlir::parser::parse_sort_op 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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a864091cb1077a33de761e54eaa3dfa2c1343b00cfb95d8c9fb4a80e1bdaf8"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::object_3d::update_object_3d_system (cyclomatic 29): elodin_editor::object_3d::update_object_3d_system 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":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70c8b2923257bee70bfd0882c0fa8c88ddff181f92e2f97331994058e9da1e0"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_db::query::format_cell (cyclomatic 28): elodin_db::query::format_cell has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/query.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a4614d903beab7ede75d1749f5747a5692a6859864326ba56e033878d7cbae"}},{"ruleId":"D1","level":"warning","message":{"text":"monte_carlo::run_one (cyclomatic 28): monte_carlo::run_one 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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":2083}}}],"partialFingerprints":{"codehealthFindingId/v1":"362dfeab555f2ced211ba6ea918d6794996d38c0844c52aa35f6ad2c1cbe63f0"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::headless::load_headless_scene (cyclomatic 27): elodin_editor::headless::load_headless_scene 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":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"902b18b203177914fbed0e1346dfcf5f7e053abc9bba96280d4dfe261e10b787"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::ui::plot::widget::sync_kernel_graphs (cyclomatic 27): elodin_editor::ui::plot::widget::sync_kernel_graphs 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":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":2120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48679af25e9dd716a8059f7be2aed8602eb51430e901838c38871e4a9ddaf1e"}},{"ruleId":"D1","level":"warning","message":{"text":"DB::open (cyclomatic 26): DB::open 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":"libs/db/src/lib.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2cb1bcde24ae889d0dcd8148c6515c0827d8c05ea65c53d7b46d39b39252bc"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::ui::sql_eql::array_iter (cyclomatic 26): elodin_editor::ui::sql_eql::array_iter 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":"libs/elodin-editor/src/ui/sql_eql.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba6260e10073212d117b2e5fb3095fbdc04feb8e47a064409d6875cb72dcdf6"}},{"ruleId":"D1","level":"warning","message":{"text":"terrain.terrain_heightmap (cyclomatic 26): terrain.terrain_heightmap has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/python/elodin/terrain.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c111fc2aca97bdf6f6a3fa7cf97f1dc7de59d08d36bf6b931c9eba28ec608b"}},{"ruleId":"D1","level":"warning","message":{"text":"InspectorGraph::ui_system (cyclomatic 25): InspectorGraph::ui_system has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/graph.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a12814aac735532bc3feb74af76a8d6bafd18aa9d1b711c5f5dbe59a09ffdfea"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::plugins::view_cube::camera::handle_view_cube_editor (cyclomatic 25): elodin_editor::plugins::view_cube::camera::handle_view_cube_editor has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/view_cube/camera.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd186aa7b62e91173e989ac299a54a6b944bb4dc864229fca8e948b5e1dd9abe"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::ui::plot::widget::sync_derived_graphs (cyclomatic 25): elodin_editor::ui::plot::widget::sync_derived_graphs has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc7cf1048c6abbee1f007b4ad3eaa1b22066087df3a814844f099758bdd7b89"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::ui::plot_3d::point_trails::sync_point_trails (cyclomatic 25): elodin_editor::ui::plot_3d::point_trails::sync_point_trails has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot_3d/point_trails.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd340b29b5fd65cb4417204fc2f7d875f389df1d8972338b7fa00ff83478442"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::ui::timeline::timeline_controls::speed_control (cyclomatic 25): elodin_editor::ui::timeline::timeline_controls::speed_control has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/timeline/timeline_controls.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc4b9bc3392c3a68e7d6dbc26ea4734c59c4d7a4ca3478ce93cb46ca660adce"}},{"ruleId":"D1","level":"warning","message":{"text":"impeller_kdl::ser::serialize_object_3d_mesh (cyclomatic 25): impeller_kdl::ser::serialize_object_3d_mesh 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":"libs/impeller/kdl/src/ser.rs"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbba02dd807c3192ef04f9bf9a368eafe6a446e53518d7707dbbe608cf804fab"}},{"ruleId":"D1","level":"warning","message":{"text":"bevy_ai_skybox::apply_skybox_to_camera (cyclomatic 24): bevy_ai_skybox::apply_skybox_to_camera 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":"libs/bevy_ai_skybox/src/lib.rs"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa527940935c096b62222b611c8663864c1de5e0be9e12aec270c46f5a7d138"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_db::export_mcap::build_dynamic_arrows (cyclomatic 24): elodin_db::export_mcap::build_dynamic_arrows 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":"libs/db/src/export_mcap.rs"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9050e17374ea4feecefff0a029da6cef1c5d05ce3f73479b27523ef93aceca5"}},{"ruleId":"D1","level":"warning","message":{"text":"QueryPlotWidget::ui_system (cyclomatic 24): QueryPlotWidget::ui_system 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":"libs/elodin-editor/src/ui/query_plot.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47856ac808f0673494a7d7545d6f0b00355fc67c0156019ba4fec9f9ede24c5"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::object_3d::update_object_3d_billboard_system (cyclomatic 24): elodin_editor::object_3d::update_object_3d_billboard_system 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":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":2426}}}],"partialFingerprints":{"codehealthFindingId/v1":"b88a50b22f40b1aa9f7df8c601691d2f11ecfa21be2f0c19bc66d8384624c047"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::plugins::navigation_gizmo::set_camera_viewport (cyclomatic 24): elodin_editor::plugins::navigation_gizmo::set_camera_viewport 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":"libs/elodin-editor/src/plugins/navigation_gizmo/mod.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed22c9de3415001447af3000f92ede1e26baf5fd5252ac82961a38f1648d222"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::ui::plot::widget::pan_graph (cyclomatic 24): elodin_editor::ui::plot::widget::pan_graph 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":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":2479}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda2fcf6f1e41600617b69004a3c76c18d53d6a0b4a58160270653552da23938"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::ui::video_stream::drive_webcodecs (cyclomatic 24): elodin_editor::ui::video_stream::drive_webcodecs 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":"libs/elodin-editor/src/ui/video_stream.rs"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b225876e181923263e77728f9db1202aedd4f893fa622685e7e29ddf5e670e4"}},{"ruleId":"D1","level":"warning","message":{"text":"WorldBuilder::discover_components (cyclomatic 24): WorldBuilder::discover_components 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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":1967}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e95caa5b9cad900940ca3437f87ffbed838674aabdefaf98af1e013ad9c58f3"}},{"ruleId":"D1","level":"warning","message":{"text":"cranelift_mlir::parser::parse_reduce_op (cyclomatic 23): cranelift_mlir::parser::parse_reduce_op 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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cc1b46b3e314dafc5bc470df876d162bbfc363ab04bca06bf044f799d41193"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_db::follow::run_follower_inner (cyclomatic 23): elodin_db::follow::run_follower_inner 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":"libs/db/src/follow.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23e5a254a2d2f555a78fb446cb884753df29fdad23089a5d36d4492b46bc2f6"}},{"ruleId":"D1","level":"warning","message":{"text":"TimeseriesPlot::draw_x_axis (cyclomatic 23): TimeseriesPlot::draw_x_axis 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":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42aad040d5e45d07d0753830b647aff622e976f3a470c19c2070a46031d63ba"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::object_3d::extract_scalar (cyclomatic 23): elodin_editor::object_3d::extract_scalar 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":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d3b49cd9144425cc2eb9951c9c033cfaf7467e83cbb675da888e524b1fcef6"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::skybox_db_assets::sync_db_skybox_assets_from_config (cyclomatic 23): elodin_editor::skybox_db_assets::sync_db_skybox_assets_from_config 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":"libs/elodin-editor/src/skybox_db_assets.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0ea28de517dfc30f71c94088a0db94a9819c89df507dfeabee0477a3798e62"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::skybox_db_assets::upload_active_skybox_assets_to_db (cyclomatic 23): elodin_editor::skybox_db_assets::upload_active_skybox_assets_to_db 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":"libs/elodin-editor/src/skybox_db_assets.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"098e7f222e20066936f54b87e4f4900c4f06b26cb4696ea106a0749992493500"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::ui::data_overview::extract_values_from_array (cyclomatic 23): elodin_editor::ui::data_overview::extract_values_from_array 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":"libs/elodin-editor/src/ui/data_overview/mod.rs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"2733cf7fa7bf92d0333cac7e2c8fed01c1dc27681088390dac3c52a3fd7096bf"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::ui::plot::data::try_joint_triline_compress (cyclomatic 23): elodin_editor::ui::plot::data::try_joint_triline_compress has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/data.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79d9fec63658942a9a3bcdfcda1baba7458fb157cb4d0abc02b02731357c801"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::ui::plot::widget::auto_y_bounds (cyclomatic 23): elodin_editor::ui::plot::widget::auto_y_bounds 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":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8791a26ce8310db7c7030a552dad1e42ec759e9d2911477ff5d82139a3d1eb"}},{"ruleId":"D1","level":"warning","message":{"text":"impeller_kdl::python::panel_expr (cyclomatic 23): impeller_kdl::python::panel_expr 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":"libs/impeller/kdl/src/python.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"722e63b7694b1d5d4f2b9fe5a88cefc8ab68776a277618dea16760fb307206ed"}},{"ruleId":"D1","level":"warning","message":{"text":"monte_carlo::ports::find_port_owners (cyclomatic 23): monte_carlo::ports::find_port_owners 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":"libs/monte-carlo/src/ports.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"4346008402b7068d81bee2cb65e3602a1863cbaafb30f538f7a8c9bb58ed421d"}},{"ruleId":"D1","level":"warning","message":{"text":"aleph_serial_bridge::connect (cyclomatic 22): aleph_serial_bridge::connect 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":"fsw/serial-bridge/src/main.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad4a040c7c3289baff3952e37a82878a3f227238cb13df7bed75f44e6202eb7"}},{"ruleId":"D1","level":"warning","message":{"text":"DB::apply_component_row (cyclomatic 22): DB::apply_component_row 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":"libs/db/src/lib.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"22fafdbfc591c8b45841e8f5a2303ff881a2eab09192266463185e082e80d105"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::plugins::view_cube::interactions::setup_cube_elements (cyclomatic 22): elodin_editor::plugins::view_cube::interactions::setup_cube_elements 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":"libs/elodin-editor/src/plugins/view_cube/interactions.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ee3d1907cc4db1611f65ca4219395cd50eb37bcc04a8285f4a04dc1e39796e"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::ui::plot_3d::gpu::extract_lines (cyclomatic 22): elodin_editor::ui::plot_3d::gpu::extract_lines 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":"libs/elodin-editor/src/ui/plot_3d/gpu.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b15d2c0de4e1fdfd802d82c614cc694f408abb220da2d589e7afb6a434987b9"}},{"ruleId":"D1","level":"warning","message":{"text":"terrain_prepare.prepare (cyclomatic 22): terrain_prepare.prepare 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":"libs/nox-py/python/elodin/terrain_prepare.py"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"0509af86a96362e3ef1abac98d48fd89b8ac4ee054bac4a508f2396dedf42841"}},{"ruleId":"D1","level":"warning","message":{"text":"cranelift_mlir::const_fold::try_identity (cyclomatic 21): cranelift_mlir::const_fold::try_identity has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: cranelift_mlir::const_fold::operand_ids (cyclomatic 31) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/const_fold.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa45cd6e5382b5f68fde9924b23fb8fc9862c5f0d668aa2f51491783a151028"}},{"ruleId":"D1","level":"warning","message":{"text":"cranelift_mlir::tensor_rt::tensor_sort (cyclomatic 21): cranelift_mlir::tensor_rt::tensor_sort has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":2249}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3c99b706e65502043a88cc48a0608b1b47c80ebf1cf7e4c41d1c856d2722ff"}},{"ruleId":"D1","level":"warning","message":{"text":"LayoutBuilder::panel_node (cyclomatic 21): LayoutBuilder::panel_node has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/export_mcap.rs"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"7debe07838e2ee0aa4f940012b1d4f15d8d09a5f87d86f2ed3e6d61561798ae9"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_db::follow_stream::handle_follow_stream (cyclomatic 21): elodin_db::follow_stream::handle_follow_stream 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":"libs/db/src/follow_stream.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e79533c4a4ca6cfc6d30223306952ed1c5d0167d1e94eda36a3f2fdec501d2d"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_db::vtable_stream::handle_vtable_stream (cyclomatic 21): elodin_db::vtable_stream::handle_vtable_stream 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":"libs/db/src/vtable_stream.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd8b8a75c043e352116e96bdcd18b105fd2eeed09a9b86b6dba0cffeaff6df4"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::ui::plot::gpu::extract_plot_lines_wasm (cyclomatic 21): elodin_editor::ui::plot::gpu::extract_plot_lines_wasm 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":"libs/elodin-editor/src/ui/plot/gpu.rs"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a631496f3d45f3f26182c1adb7cd34aa7658d4b4239e8c8e5d7218a48d07ae"}},{"ruleId":"D1","level":"warning","message":{"text":"ComponentValue::div (cyclomatic 21): ComponentValue::div has cyclomatic complexity 21 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/wkt/src/value.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"40dd208c82b5905334baa42b90775150149bac55f4d83d2113f3a06a976bfa64"}},{"ruleId":"D1","level":"warning","message":{"text":"ArrayView::fmt (cyclomatic 21): ArrayView::fmt has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 4 of the 21 points are its own statements and the rest belongs to 2 function items inside it that branch (format_recursive, format_slice). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/array/src/lib.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"8057862eea7e5a40f1fed1744bd22d5a505d2b842889a158aaf2b8b726d3a944"}},{"ruleId":"D1","level":"warning","message":{"text":"terrain_prepare.validate_package (cyclomatic 21): terrain_prepare.validate_package 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":"libs/nox-py/python/elodin/terrain_prepare.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f98935d8dacd92648dbd6f389988c89cfec1a8813c844ab7599879ae0c4ad98"}},{"ruleId":"D1","level":"warning","message":{"text":"compare_runs.main (cyclomatic 21): compare_runs.main has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/branch-regression/compare_runs.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"870e7570524a8febfa702bc2a67041581627339339e5b96f0fe682a6dfeaa46c"}},{"ruleId":"D1","level":"warning","message":{"text":"search.makeTeaser (cyclomatic 21): search.makeTeaser 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":"docs/public/static/js/search.js"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f83e2c59ea190a45ed625684b07f018e007e1753aa10bc2f55d51e99a71c92f"}},{"ruleId":"D1","level":"warning","message":{"text":"cranelift_mlir::inliner::try_inline_one_top_level_call (cyclomatic 20): cranelift_mlir::inliner::try_inline_one_top_level_call 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":"libs/cranelift-mlir/src/inliner.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd8e2be30009dc54fad7b829119897f27dd85d498193e0386f0703acdc2e18a"}},{"ruleId":"D1","level":"warning","message":{"text":"cranelift_mlir::interp::reduce (cyclomatic 20): cranelift_mlir::interp::reduce has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: cranelift_mlir::interp::eval_instr (cyclomatic 71) 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":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"92279c3edb2dcf0764f12722ecf47bed19ca89c6824e35721eb35b174855e800"}},{"ruleId":"D1","level":"warning","message":{"text":"impeller_cli::run (cyclomatic 20): impeller_cli::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":"libs/db/cli/src/lib.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffcdede0724d39ef183040529c94846a49621c59de2bbec309932324fe6b2b79"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::to_graph_component_affines (cyclomatic 20): Expr::to_graph_component_affines has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/mod.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"670c2cc68e83cf59961dd8d7393a388e90e0a1ef59dcd6114b01b193ea964c63"}},{"ruleId":"D1","level":"warning","message":{"text":"Viewport::smooth_follow (cyclomatic 20): Viewport::smooth_follow has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/viewport.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfbdd58c614abfd9d4c03cf7bdaab594cede2019337f4c76a2e7d8a6825be72"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::headless::render_server_runner (cyclomatic 20): elodin_editor::headless::render_server_runner 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":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f8fd206dca3d994e02cc14bfbc734fc0a17aa64f3310c618a62a50ba3ec9e8"}},{"ruleId":"D1","level":"warning","message":{"text":"impeller_kdl::de::parse_viewport (cyclomatic 20): impeller_kdl::de::parse_viewport has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: impeller_kdl::de::parse_panel (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":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"14dfbfc55d30f35272356e35cb3e2dac3ef110c433ac8f7ba8c1d6499d01e063"}},{"ruleId":"D1","level":"warning","message":{"text":"SimRecipe::run (cyclomatic 20): SimRecipe::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":"libs/s10/src/sim.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"5000a76021ae730109d96beb8b9eb77c1a176038e2e528f086fb1218910de6ba"}},{"ruleId":"D1","level":"warning","message":{"text":"Schema.from_json (cyclomatic 20): Schema.from_json 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":"libs/nox-py/python/elodin/ui/schema.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d38baf5545377314d78fe2eb8a783ce9f137c49d1abc4c8eb20fd68813e1d62"}},{"ruleId":"D1","level":"warning","message":{"text":"cudainfo.get_jetson_info (cyclomatic 20): cudainfo.get_jetson_info 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":"aleph/scripts/cudainfo.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfec6ab2ab6db44b1d30a5d01e46c712ad763878bf0387100fe3a6fa9a0390e7"}},{"ruleId":"D1","level":"warning","message":{"text":"cranelift_mlir::interp::unary (cyclomatic 19): cranelift_mlir::interp::unary has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: cranelift_mlir::interp::eval_instr (cyclomatic 71) 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":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fae46cd1ba10b2e6454c9678af0a0976b7fb2f5c578bc3cc2e5a6453858322"}},{"ruleId":"D1","level":"warning","message":{"text":"cranelift_mlir::tensor_rt::tensor_reduce_window (cyclomatic 19): cranelift_mlir::tensor_rt::tensor_reduce_window has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":1722}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33f33a15de23bd0b5a72c87dcc8f0a35f2f78b70c8637816f53d5b06b1a6d50"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_db::export::fixed_size_list_to_string (cyclomatic 19): elodin_db::export::fixed_size_list_to_string 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":"libs/db/src/export.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a651b0bfdb7d6208d86f1cbccd2e403dd65db85f3f10a695d56356e3596e3a9"}},{"ruleId":"D1","level":"warning","message":{"text":"ViewportPane::spawn (cyclomatic 19): ViewportPane::spawn has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0457ca546b10f751d79ab75890fec268b8f376ac1c9e9640a9d5c3c94a3439"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::plugins::kdl_document::operations::sync_document_from_config (cyclomatic 19): elodin_editor::plugins::kdl_document::operations::sync_document_from_config has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/kdl_document/operations.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fb4255ef8add9b15808305a59a6bb7022a9ec36a7b2b5fa274bedf0c947b78"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::plugins::kdl_document::systems::handle_open_document_from_active_requests (cyclomatic 19): elodin_editor::plugins::kdl_document::systems::handle_open_document_from_active_requests has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/kdl_document/systems.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0185e7b64b55c8fb27c2d0a04bc79ba45096d437d0135f9f6d2446219fa8b4"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::plugins::map_overlay::sync_assets (cyclomatic 19): elodin_editor::plugins::map_overlay::sync_assets has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/map_overlay.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"1148ff14b1bb9f25223aa196d2df0f2666dc91574b5661d0129aa79cc77dda46"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::sensor_camera::spawn_sensor_cameras (cyclomatic 19): elodin_editor::sensor_camera::spawn_sensor_cameras has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/sensor_camera.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"3659a7cef91c90860281779d7dc6b799a1aa91ec1c70276a8fdf2e4f8fffdf71"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::ui::query_plot::auto_bounds (cyclomatic 19): elodin_editor::ui::query_plot::auto_bounds has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/query_plot.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"60daf74ad9c8faddd10175c4bcb9d1b60d0450a8492e5ac1efa1d6c047dc3699"}},{"ruleId":"D1","level":"warning","message":{"text":"impeller_kdl::de::parse_environment (cyclomatic 19): impeller_kdl::de::parse_environment has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: impeller_kdl::de::parse_panel (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":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddf53b4eb6e19e069bf7c53d047eadaa4067aa2e892012e93c84d9f90207c024"}},{"ruleId":"D1","level":"warning","message":{"text":"ProcessArgs::run (cyclomatic 19): ProcessArgs::run has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/src/recipe.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5d5e6d9c30aa77abbbd7a7544bbf1c33a2e541cc1af6292baa7b1968f1383ec"}},{"ruleId":"D1","level":"warning","message":{"text":"RegionPackage.node (cyclomatic 19): RegionPackage.node has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/python/elodin/terrain_prepare.py"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"c88c982ae48c04c5fd5c3f91f053392f88c756710becced5c5b8d0081d96ea8b"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin::cli::cloud::upload::transfer (cyclomatic 18): elodin::cli::cloud::upload::transfer 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":"apps/elodin/src/cli/cloud/upload/mod.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5faaea0eff34757fc541dd6897f8dab850555032a8b03d1b437324b8011139"}},{"ruleId":"D1","level":"warning","message":{"text":"Sdmmc::switch_signaling_mode (cyclomatic 18): Sdmmc::switch_signaling_mode 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":"fsw/sensor-fw/src/sdmmc.rs"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"0533cf67074eda15aa783e300a9c2fc2fc0a02126903338a9779694e1b5b13ac"}},{"ruleId":"D1","level":"warning","message":{"text":"bevy_world_mesh::terrain::debug::toggle_debug (cyclomatic 18): bevy_world_mesh::terrain::debug::toggle_debug has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/terrain/debug/mod.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"96484eb23b8298915e511db78fd5d2a3d2f5815c8e049badf5049444ef4390fa"}},{"ruleId":"D1","level":"warning","message":{"text":"cranelift_mlir::interp::scatter (cyclomatic 18): cranelift_mlir::interp::scatter has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file\u0027s highest cyclomatic complexity: cranelift_mlir::interp::eval_instr (cyclomatic 71) 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":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eea4752dd2362a6529af91ba1e5af617048a9180da8b8379b3651e5a6d987b6"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::to_sql_with_options (cyclomatic 18): Expr::to_sql_with_options 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":"libs/db/eql/src/lib.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"973af70d087c03eda7291d0bddd4ef0ad9c8415aee0ec48da0e0811ba680dbc7"}},{"ruleId":"D1","level":"warning","message":{"text":"DB::insert_vtable (cyclomatic 18): DB::insert_vtable 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":"libs/db/src/lib.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac35858b676d43d49f46a6f32c29168b73420141e233c3961df1564d94a2d83"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_db::drop::run (cyclomatic 18): elodin_db::drop::run has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/drop.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"27df55a7d247bcd87a74e493af5fbfd9d05ae723f70f5ee775fde1edd0ed905e"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_db::export_mcap::camera_offset_from_pos (cyclomatic 18): elodin_db::export_mcap::camera_offset_from_pos has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to 3 function items inside it that branch (formula_offset, flatten_literals, find_literal_tuple). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/export_mcap.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea627270902297f9a922bde48431c70ff49991215c93478b9269dd65c9fa442"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_db::prune::run (cyclomatic 18): elodin_db::prune::run has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/prune.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d7667e40b4cc6e04077932df1d24664677c985a1c8499a1b3b4f5336abc450"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_db::query::run (cyclomatic 18): elodin_db::query::run has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/query.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0704212d2bc677b039d3d4dff8fc371609370beae57b00076595a9b3d58dc0"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_db::time_align::run (cyclomatic 18): elodin_db::time_align::run has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/time_align.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1057d2dd7bd5c85c9c1d180a051c0a29ffeea413f5ba2599ddcd51206defe7d9"}},{"ruleId":"D1","level":"warning","message":{"text":"InspectorQueryTable::ui_system (cyclomatic 18): InspectorQueryTable::ui_system 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":"libs/elodin-editor/src/ui/inspector/query_table.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef858eefa3d35ae72adcd327b27a0dfcedf3d1ec7bb4dd77e2d7a0746f06325"}},{"ruleId":"D1","level":"warning","message":{"text":"impeller_bevy::msg_sink (cyclomatic 18): impeller_bevy::msg_sink 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":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f6f04276c723ba6bae56b007221af1667c795317b8f82d7df2b0bcf2d6bfe6"}},{"ruleId":"D1","level":"warning","message":{"text":"impeller_bevy::prefetch::prefetch_visible_window (cyclomatic 18): impeller_bevy::prefetch::prefetch_visible_window 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":"libs/impeller/bevy/src/prefetch.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ad03b8cff06e831f1ec8cc0b4027e908526ccc6c4efe39bc78359ba77cf3e5"}},{"ruleId":"D1","level":"warning","message":{"text":"impeller_kdl::de::parse_earth (cyclomatic 18): impeller_kdl::de::parse_earth has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: impeller_kdl::de::parse_panel (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":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"b983f3fd5ddcb398536eb4de87afb5998bdbd005e06f32499a33b6084168561e"}},{"ruleId":"D1","level":"warning","message":{"text":"monte_carlo::sample_cache_mappings (cyclomatic 18): monte_carlo::sample_cache_mappings 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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":3711}}}],"partialFingerprints":{"codehealthFindingId/v1":"e54b48087b2a2001607312f9f5013fc9a7b4404cbc6971bf3316cecb83a2734e"}},{"ruleId":"D1","level":"warning","message":{"text":"ElodinSink::send_packet (cyclomatic 17): ElodinSink::send_packet 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":"fsw/gstreamer/src/lib.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"349d88391c20dfbe0f6c379b36e5812f9985d6fc305496802efd40556f208a82"}},{"ruleId":"D1","level":"warning","message":{"text":"Ubx::parse_byte (cyclomatic 17): Ubx::parse_byte 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":"fsw/sensor-fw/src/ubx.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd96f6039d74467da6e38cc599508ac14e43c0f7aef50549281e9e0ac1203e94"}},{"ruleId":"D1","level":"warning","message":{"text":"TerrainPipelineFlags::from_debug (cyclomatic 17): TerrainPipelineFlags::from_debug has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (TerrainPipelineFlags::shader_defs) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/terrain/render/terrain_material.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"0835cc01820a2e11dc8efa09f1ec8ea42a75827560affe80d6f09cc8d5618a06"}},{"ruleId":"D1","level":"warning","message":{"text":"TerrainPipelineFlags::shader_defs (cyclomatic 17): TerrainPipelineFlags::shader_defs has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (TerrainPipelineFlags::from_debug) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/terrain/render/terrain_material.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f204056797403784d94795fe4d77ca21f3b020756ad3d808004b5930bbcaec75"}},{"ruleId":"D1","level":"warning","message":{"text":"cranelift_mlir::lower::compile_module_with_config (cyclomatic 17): cranelift_mlir::lower::compile_module_with_config 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: cranelift_mlir::lower::opcode_static_name (cyclomatic 62) 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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11fd635cb3348c98e31b8e66fdc887e7abb28e9f79eff0a0fdb11ded37c2f67"}},{"ruleId":"D1","level":"warning","message":{"text":"cranelift_mlir::lower::collect_body_defs_uses (cyclomatic 17): cranelift_mlir::lower::collect_body_defs_uses has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This is NOT this file\u0027s highest cyclomatic complexity: cranelift_mlir::lower::opcode_static_name (cyclomatic 62) 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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":2057}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0896c8aa212ee784c0fd758bc09b024e5d1550f444bba6b85064fa73e6ca677"}},{"ruleId":"D1","level":"warning","message":{"text":"cranelift_mlir::lower::convert_value (cyclomatic 17): cranelift_mlir::lower::convert_value has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: cranelift_mlir::lower::opcode_static_name (cyclomatic 62) 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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":9438}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18c47b1c7134c8d5d7f0ce1092dcb2f4c179e5c59f96d963229119651237de2"}},{"ruleId":"D1","level":"warning","message":{"text":"IngestServiceImpl::run_session (cyclomatic 17): IngestServiceImpl::run_session 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: elodin_db::grpc::ingest::encode_typed_component (cyclomatic 24) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/grpc/ingest.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1cb56a3dada9e2d345585e239069d9787069f4cd2278e270177917f30c9b571"}},{"ruleId":"D1","level":"warning","message":{"text":"DBSink::apply_buf (cyclomatic 17): DBSink::apply_buf 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":"libs/db/src/lib.rs"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd775115c3e57fa387afcc77df1318bd4c8c1b62be3efabb3484eb2a7eae68c2"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_db::export::run (cyclomatic 17): elodin_db::export::run 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":"libs/db/src/export.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad939cd4f531f80bb25da6875492870dc91724a2fc89312251134a50beee749"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_db::export_mcap::build_scene (cyclomatic 17): elodin_db::export_mcap::build_scene 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":"libs/db/src/export_mcap.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d94ba77ec3fb512c4f02a8c7c4c50dcbfe2dcba8422d73582f0cbe33d97b125"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_db::trim::run (cyclomatic 17): elodin_db::trim::run 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":"libs/db/src/trim.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff7a6f7d5d0a9a00194dbe6ad8e6ed355d052cea1673150a2ebbaf2808fe0bd"}},{"ruleId":"D1","level":"warning","message":{"text":"TimeseriesPlot::draw_modal (cyclomatic 17): TimeseriesPlot::draw_modal 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":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb381599ca4c6f2c62ae89a479d92f47c2c57b4e9b6bfc975bab6f052141f1d6"}},{"ruleId":"D1","level":"warning","message":{"text":"QueryTableWidget::ui_system (cyclomatic 17): QueryTableWidget::ui_system 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":"libs/elodin-editor/src/ui/query_table.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af0b02c84aa3e0dabf242d2fe51f562991c7c07e350ca5d57c1a6d22fe6895b"}},{"ruleId":"D1","level":"warning","message":{"text":"TileState::debug_dump::visit (cyclomatic 17): TileState::debug_dump::visit 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":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e5613961f9ff0fb048fe424831fa9a976558a60c3726b5a437e0f8c6cf8805"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::headless::sync_headless_skybox (cyclomatic 17): elodin_editor::headless::sync_headless_skybox 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":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e1bb3c9048ae828af6237e337d63ab6b7b2f4e34dcb29f754bf11479a72e4e"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::plugins::frustum_intersection::projection::build_projection_mesh (cyclomatic 17): elodin_editor::plugins::frustum_intersection::projection::build_projection_mesh 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":"libs/elodin-editor/src/plugins/frustum_intersection/projection.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"881cf661602e5cc9ec3888504a3c6dfb4c115f51f969bed92374bfaa451b207d"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::ui::gauges::horizon::paint_horizon (cyclomatic 17): elodin_editor::ui::gauges::horizon::paint_horizon 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":"libs/elodin-editor/src/ui/gauges/horizon.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0b781ea3bc9d796e26d8108fae32de49cc41c9b4385b3b2b9aab20afcbe676"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::ui::inspector::graph::add_components_from_eql (cyclomatic 17): elodin_editor::ui::inspector::graph::add_components_from_eql 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":"libs/elodin-editor/src/ui/inspector/graph.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"6474ce16f2d17171977ed8e20594d3d5840776962c305477c0ecbc48f7bd79c6"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::ui::inspector::widgets::eql_autocomplete (cyclomatic 17): elodin_editor::ui::inspector::widgets::eql_autocomplete 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":"libs/elodin-editor/src/ui/inspector/widgets.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7900d6799c10b65332a885deeaef3c46abbe49d10d6b03fbe818b25a085850bc"}},{"ruleId":"D1","level":"warning","message":{"text":"hamann_chen_line::select_indices_curvature (cyclomatic 17): hamann_chen_line::select_indices_curvature 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":"libs/hamann-chen-line/src/lib.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"b239db009cf45098bb056dc19230800de86b1536c3c95d09cff1a9a38c0eb3aa"}},{"ruleId":"D1","level":"warning","message":{"text":"nox_py::impeller_server::prime_schematic_assets (cyclomatic 17): nox_py::impeller_server::prime_schematic_assets 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":"libs/nox-py/src/impeller_server.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad291aa24e95d7bc9a8aa69d53279d4f718ce82074d2893ebd39b2176f0ae23"}},{"ruleId":"D1","level":"warning","message":{"text":"diff_profile.main (cyclomatic 17): diff_profile.main has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/scripts/diff_profile.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81775e2662ec87d3699512cd27d99f7648c605ee5b82d4ee2a1f9a983c906d8"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin::cli::cloud::upload::run (cyclomatic 16): elodin::cli::cloud::upload::run has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/elodin/src/cli/cloud/upload/mod.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59edbaf24804d62e9580524e72e513e6e231115025d3ef6118fd444221683fc"}},{"ruleId":"D1","level":"warning","message":{"text":"msp_osd::layout::clamp_to_perimeter (cyclomatic 16): msp_osd::layout::clamp_to_perimeter 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":"fsw/msp-osd/src/layout.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"12337006a1959413ab3fdd03ceb9412b323f847aa1217385925c31fdd9bba2aa"}},{"ruleId":"D1","level":"warning","message":{"text":"rtsp_streamer::run_once (cyclomatic 16): rtsp_streamer::run_once 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":"fsw/rtsp-streamer/src/main.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68441a4f0f526b66c5b387cb38e56ee9164228175484a3103bac60fb94f7c79"}},{"ruleId":"D1","level":"warning","message":{"text":"cranelift_mlir::parser::parse_custom_call_op (cyclomatic 16): cranelift_mlir::parser::parse_custom_call_op 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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1604}}}],"partialFingerprints":{"codehealthFindingId/v1":"67dc3896c647802150dd391aea600a8012049b21ed8ca2c761f0b11d9b7d17d8"}},{"ruleId":"D1","level":"warning","message":{"text":"cranelift_mlir::parser::parse_map_op (cyclomatic 16): cranelift_mlir::parser::parse_map_op 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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":2400}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d20ff6c9feb71d1db15b2cb4385b6ed816f5f0fbd01881a83fb45aa91a1f15a"}},{"ruleId":"D1","level":"warning","message":{"text":"cranelift_mlir::tensor_rt::tensor_select_and_scatter (cyclomatic 16): cranelift_mlir::tensor_rt::tensor_select_and_scatter 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":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":1815}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a89ce5bc95a730b2b4ca388e13ae23b2b03bdabdebaee2ce7a6895ddd5fd91"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_db::handle_real_time_stream_batched (cyclomatic 16): elodin_db::handle_real_time_stream_batched 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":"libs/db/src/lib.rs"},"region":{"startLine":3290}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1f75bece3a8266231becd5461d35fd20838aec9a074babe54c70eee4957b75"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_db::bin::bench::run_benchmark (cyclomatic 16): elodin_db::bin::bench::run_benchmark has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/bin/bench.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b9fa6e82e04190795a50ee82f696a28fa4289fc95ff69233159aae782b5205"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_db::export_mcap::build_layout (cyclomatic 16): elodin_db::export_mcap::build_layout 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":"libs/db/src/export_mcap.rs"},"region":{"startLine":1884}}}],"partialFingerprints":{"codehealthFindingId/v1":"9315d17d8fa6f49e27abac82b9706a486715e1dadf814586c6ea676881b33589"}},{"ruleId":"D1","level":"warning","message":{"text":"TreeWidget::ui_system (cyclomatic 16): TreeWidget::ui_system has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/tree.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"2087624b670def965083b2e65fb794adfe11a014dd7f8a48f96340b8b0e9cf31"}},{"ruleId":"D1","level":"warning","message":{"text":"TileSystem::render_panel_contents (cyclomatic 16): TileSystem::render_panel_contents 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":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":2762}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4820db8c031e06386528b7d7776b5788ef3634ed58c4115825ad848fb432d61"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::object_3d::compile_eql_expr_with_ctx (cyclomatic 16): elodin_editor::object_3d::compile_eql_expr_with_ctx has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f5258fb0148b6f5a80344a5884f956c32bcc659fdabefc151a0d8b287ed847"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::plugins::thruster_particles::sync_kdl_thruster_transforms (cyclomatic 16): elodin_editor::plugins::thruster_particles::sync_kdl_thruster_transforms 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":"libs/elodin-editor/src/plugins/thruster_particles/mod.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed43e8ccb3c3ab90141ad8a57b7a55c42ae2c470d17e68eaaf8a8ce7520e7f9d"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::plugins::view_cube::interactions::on_cube_hover_start (cyclomatic 16): elodin_editor::plugins::view_cube::interactions::on_cube_hover_start has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/view_cube/interactions.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3fde73e946a614e79fd619c3fa0ba7d1e4f964d5f2b0b2adc59d61323905ea"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::ui::data_overview::process_sparkline_result (cyclomatic 16): elodin_editor::ui::data_overview::process_sparkline_result 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":"libs/elodin-editor/src/ui/data_overview/mod.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef8693771c49a5a2d213435ec9dc0bcaf215524c739d8bb737d54798cdad2e5"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::ui::plot::widget::zoom_graph (cyclomatic 16): elodin_editor::ui::plot::widget::zoom_graph 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":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":2392}}}],"partialFingerprints":{"codehealthFindingId/v1":"88edad93b24de2d0bbb064666e8a00a84d9ee8994fa299c21fc43219041c470a"}},{"ruleId":"D1","level":"warning","message":{"text":"elodin_editor::ui::window::arrange::arrange_windows (cyclomatic 16): elodin_editor::ui::window::arrange::arrange_windows 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":"libs/elodin-editor/src/ui/window/arrange.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e68f0f891842c58bb6dca8ef7eb1cf0f8e7d2622b177b65ccf78d4b7d55da8a"}},{"ruleId":"D1","level":"warning","message":{"text":"sample._validate_variable (cyclomatic 16): sample._validate_variable 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":"libs/nox-py/python/elodin/monte_carlo/sample.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b80984a9875d185d2039722060dc0dfc2c10e0d499693c0180ab76d32602613"}},{"ruleId":"D1","level":"warning","message":{"text":"Terrain.__post_init__ (cyclomatic 16): Terrain.__post_init__ 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":"libs/nox-py/python/elodin/terrain.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb553627aa38000ec8eca006d804f001f9e48a6496bc20623fa5346dc19631cb"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::lower::lower_instruction_mem (cognitive 403): cranelift_mlir::lower::lower_instruction_mem has cognitive complexity 403 (threshold 15). Drivers by points: if/else 106 (225 pts), loops 32 (90 pts), match/switch 31 (58 pts), boolean chains 30 (nesting depth added 204). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":4008}}}],"partialFingerprints":{"codehealthFindingId/v1":"51dd56b725b8f9e5adc389e437a8e89b8a6a7e40bebdfbf39e71a8501909ad7b"}},{"ruleId":"D2","level":"warning","message":{"text":"WorldBuilder::run (cognitive 334): WorldBuilder::run has cognitive complexity 334 (threshold 15). Drivers by points: if/else 81 (255 pts), loops 11 (37 pts), match/switch 12 (29 pts), boolean chains 13 (nesting depth added 217). 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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5339cb2db684017dda6ed7ec7357d9d8b48f12386a472409a462f635d11e91"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::lower::lower_instruction (cognitive 301): cranelift_mlir::lower::lower_instruction has cognitive complexity 301 (threshold 15). Drivers by points: if/else 104 (194 pts), boolean chains 46, loops 18 (46 pts), match/switch 7 (15 pts) (nesting depth added 126). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":6882}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16ef6385975e03f05a2f06217f5aad21b7a6ef1aeab7931ad9b04d23ee60408"}},{"ruleId":"D2","level":"warning","message":{"text":"TileLayout::ui_system (cognitive 186): TileLayout::ui_system has cognitive complexity 186 (threshold 15). Drivers by points: if/else 60 (164 pts), match/switch 4 (12 pts), boolean chains 7, loops 3 (nesting depth added 112). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":3195}}}],"partialFingerprints":{"codehealthFindingId/v1":"04bd85f7b6e41cfb980611ed9eafea6d90b58d03eca750e16dd271dc356699ff"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::tensor_rt::tensor_conv_f64 (cognitive 155): cranelift_mlir::tensor_rt::tensor_conv_f64 has cognitive complexity 155 (threshold 15). Drivers by points: loops 22 (100 pts), if/else 8 (53 pts), boolean chains 2 (nesting depth added 123). 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":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":1900}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dff2ea305984db61a506fe7684914a827722cd26eac97a88695163e8dbedb67"}},{"ruleId":"D2","level":"warning","message":{"text":"sensor_fw::main (cognitive 130): sensor_fw::main has cognitive complexity 130 (threshold 15). Drivers by points: if/else 49 (116 pts), match/switch 9 (10 pts), boolean chains 3, loops 1 (nesting depth added 68). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/main.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d06f4f7716e5eb1c092e4d5601f147069cb52159abbd2dacade48d375af71e"}},{"ruleId":"D2","level":"warning","message":{"text":"VideoStreamWidget::ui_system (cognitive 130): VideoStreamWidget::ui_system has cognitive complexity 130 (threshold 15). Drivers by points: if/else 38 (113 pts), boolean chains 14, match/switch 2 (3 pts) (nesting depth added 76). 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":"libs/elodin-editor/src/ui/video_stream.rs"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dab4da65a8b910645f100c7d5eae32670d3af324963bdbfb1a9379ba57aa614"}},{"ruleId":"D2","level":"warning","message":{"text":"DataOverviewWidget::ui_system (cognitive 118): DataOverviewWidget::ui_system has cognitive complexity 118 (threshold 15). Drivers by points: if/else 41 (88 pts), loops 8 (15 pts), boolean chains 8, match/switch 4 (7 pts) (nesting depth added 57). Of this number, 115 points are the body\u0027s own statements and 3 belong to one function item inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/data_overview/mod.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"c943f7f2ff642c0ea69a1047df3c0d58e96ff4d4848a364313f1842e00b52051"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::frustum_intersection::draw_frustum_ellipsoid_intersections (cognitive 117): elodin_editor::plugins::frustum_intersection::draw_frustum_ellipsoid_intersections has cognitive complexity 117 (threshold 15). Drivers by points: if/else 42 (84 pts), loops 18 (22 pts), match/switch 2 (6 pts), boolean chains 5 (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/frustum_intersection/mod.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b4e03b2046d6ff55b1ba8f57844185de4adb7dda0f907345349ab83d7c21c6"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::map_overlay::draw (cognitive 113): elodin_editor::plugins::map_overlay::draw has cognitive complexity 113 (threshold 15). Drivers by points: if/else 27 (84 pts), loops 7 (23 pts), boolean chains 6 (nesting depth added 73). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/map_overlay.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a11abb2fa2b55e085cc1c3c581f1ab84a87935f09ec563eb1a239b47326450"}},{"ruleId":"D2","level":"warning","message":{"text":"InspectorObject3D::ui_system (cognitive 111): InspectorObject3D::ui_system has cognitive complexity 111 (threshold 15). Drivers by points: if/else 38 (87 pts), match/switch 8 (15 pts), boolean chains 6, loops 1 (3 pts) (nesting depth added 58). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/object3d.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed7241008b5f8cb35b753acf04aefad5fa09fc9558ee1390ee591792086e75d"}},{"ruleId":"D2","level":"warning","message":{"text":"cudainfo.main (cognitive 110): cudainfo.main has cognitive complexity 110 (threshold 15). Drivers by points: if/else 50 (80 pts), loops 9 (19 pts), error handling 6, ternaries 3, boolean chains 2 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"aleph/scripts/cudainfo.py"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"a316524d1b0f30ebc090917ec64bb6f19d1a9c87ca5652afed2119658f518e3a"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::export_mcap::run (cognitive 98): elodin_db::export_mcap::run has cognitive complexity 98 (threshold 15). Drivers by points: if/else 36 (58 pts), loops 16 (22 pts), match/switch 6 (11 pts), boolean chains 7 (nesting depth added 33). Of this number, 93 points are the body\u0027s own statements and 5 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/export_mcap.rs"},"region":{"startLine":2271}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6531a4dd42847ff6eeb710b14a66db226df6f91d8c0df1ba308b3f852b6eb5"}},{"ruleId":"D2","level":"warning","message":{"text":"SchematicParam::get_panel_from_state (cognitive 93): SchematicParam::get_panel_from_state has cognitive complexity 93 (threshold 15). Drivers by points: if/else 16 (50 pts), loops 6 (23 pts), match/switch 7 (18 pts), boolean chains 2 (nesting depth added 62). 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":"libs/elodin-editor/src/ui/schematic/mod.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9216c9e7c099a6f126b455c629581bf1413dfb175057a91ee26fc928343142f"}},{"ruleId":"D2","level":"warning","message":{"text":"nox_py::impeller_server::tick (cognitive 92): nox_py::impeller_server::tick has cognitive complexity 92 (threshold 15). Drivers by points: if/else 36 (83 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 48). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/impeller_server.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4bcd870030d422685bba29f5d82419fa7acf9c518f578efac832dd38e9086ee"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::parser::parse_op (cognitive 91): cranelift_mlir::parser::parse_op has cognitive complexity 91 (threshold 15). Drivers by points: if/else 80, boolean chains 11. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d12ba10fa78fbd537c8f6b819c9ba75de11d513a42427dba08f304f50764d3"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::handle_packet (cognitive 87): elodin_db::handle_packet has cognitive complexity 87 (threshold 15). Drivers by points: if/else 32 (64 pts), match/switch 6 (14 pts), loops 4 (8 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":"libs/db/src/lib.rs"},"region":{"startLine":2145}}}],"partialFingerprints":{"codehealthFindingId/v1":"379fd5b4800ecf3aea0995ac1cc5325683f6a3fef3de87c96d491c208f50bccf"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::interp::binary (cognitive 85): cranelift_mlir::interp::binary has cognitive complexity 85 (threshold 15). Drivers by points: if/else 32 (62 pts), match/switch 8 (16 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"008552fbad05a4f0444a2385e739917fa7eac1836a89ec7771a7d4afebfaddd9"}},{"ruleId":"D2","level":"warning","message":{"text":"TimeseriesPlot::render (cognitive 85): TimeseriesPlot::render has cognitive complexity 85 (threshold 15). Drivers by points: if/else 32 (69 pts), loops 2 (7 pts), match/switch 4 (7 pts), boolean chains 2 (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":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"926bfafef9edbf7208f01a655183026029e2600c6b1c267e9b2eb4bee815802d"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::main (cognitive 79): elodin_db::main has cognitive complexity 79 (threshold 15). Drivers by points: if/else 29 (56 pts), match/switch 8 (21 pts), boolean chains 2 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/main.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"3260999d76b291906bd991eb7cc3e0442d7ae04a1964f123df10a367db743cdf"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::gizmos::render_vector_arrow (cognitive 79): elodin_editor::plugins::gizmos::render_vector_arrow has cognitive complexity 79 (threshold 15). Drivers by points: if/else 25 (52 pts), loops 9 (22 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/gizmos/mod.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fed5298f028eea83ee7a92458e559267ad72a7d75a918cb6ddab47450d8ac9d"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::gizmos::update_arrow_label_ui (cognitive 79): elodin_editor::plugins::gizmos::update_arrow_label_ui has cognitive complexity 79 (threshold 15). Drivers by points: if/else 21 (58 pts), loops 9 (14 pts), boolean chains 7 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/gizmos/mod.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c5d48b80597b62ad00111a8e3fa8184aed3ba8e765bfb910d8110f6b23aa25"}},{"ruleId":"D2","level":"warning","message":{"text":"LoadSchematicParams::spawn_panel (cognitive 75): LoadSchematicParams::spawn_panel has cognitive complexity 75 (threshold 15). Drivers by points: if/else 24 (54 pts), match/switch 5 (10 pts), loops 3 (7 pts), boolean chains 4 (nesting depth added 39). 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":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bb3a4c1e87b92b65612b12a10ba4da85f75de22187ab8055dcb17f1dca04a7"}},{"ruleId":"D2","level":"warning","message":{"text":"Pane::ui (cognitive 75): Pane::ui has cognitive complexity 75 (threshold 15). Drivers by points: if/else 20 (58 pts), boolean chains 8, loops 1 (5 pts), match/switch 2 (4 pts) (nesting depth added 44). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3b361d87c1ba48ea28048483987a6d6647dc8cc1834ff91585d925ae626cfb"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::cinematic_earth::apply_cinematic_earth (cognitive 75): elodin_editor::plugins::cinematic_earth::apply_cinematic_earth has cognitive complexity 75 (threshold 15). Drivers by points: if/else 29 (56 pts), loops 8 (10 pts), match/switch 3 (7 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":"libs/elodin-editor/src/plugins/cinematic_earth/mod.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6548b9738a8d81b7870e378deeb4f3135cb4c9a74c90c1c4d482e03936a2e2c"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::object_3d::update_object_3d_system (cognitive 74): elodin_editor::object_3d::update_object_3d_system has cognitive complexity 74 (threshold 15). Drivers by points: if/else 19 (61 pts), match/switch 3 (8 pts), boolean chains 4, loops 1 (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8cbb685a6a0c0173bd0f31d7a55dcb97dcbbcf19668ae3d03664fa3b7268c37"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::frustum::draw_viewport_frustums (cognitive 74): elodin_editor::plugins::frustum::draw_viewport_frustums has cognitive complexity 74 (threshold 15). Drivers by points: if/else 24 (51 pts), loops 17 (20 pts), boolean chains 3 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/frustum/mod.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efa8da102581723706b6a04cbbfa7dc54bcf11969c6026276b1ed2ac9abfbdd"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::const_fold::try_fold (cognitive 73): cranelift_mlir::const_fold::try_fold has cognitive complexity 73 (threshold 15). Drivers by points: if/else 17 (35 pts), match/switch 15 (30 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 36). 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":"libs/cranelift-mlir/src/const_fold.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb19962bd8d608d8c72ec5a710129c0ae8e1a2af7ce9c4334447f9668bb91b7"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::grpc::ingest::validate_schema (cognitive 73): elodin_db::grpc::ingest::validate_schema has cognitive complexity 73 (threshold 15). Drivers by points: if/else 17 (53 pts), loops 5 (12 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/grpc/ingest.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"097866c7526e5996845065afd7ac537894f9013710a3e88c017b84141d53dc09"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::window::spawn::sync_windows (cognitive 72): elodin_editor::ui::window::spawn::sync_windows has cognitive complexity 72 (threshold 15). Drivers by points: if/else 19 (51 pts), loops 7 (16 pts), boolean chains 5 (nesting depth added 41). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/window/spawn.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fe6cda9ce1d8a7206f0b6a51f3a835dce94c17e701d10c221fa7e8fca15126"}},{"ruleId":"D2","level":"warning","message":{"text":"TreeBehavior::tab_ui (cognitive 70): TreeBehavior::tab_ui has cognitive complexity 70 (threshold 15). Drivers by points: if/else 35 (55 pts), match/switch 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":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":2311}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac5096fd0d82d77c33fca2a4ced07689ff37a8b5a9ff0a7d1ee4eee1d5a1d93"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::object_3d::update_object_3d_billboard_system (cognitive 70): elodin_editor::object_3d::update_object_3d_billboard_system has cognitive complexity 70 (threshold 15). Drivers by points: if/else 20 (56 pts), loops 3 (6 pts), boolean chains 4, match/switch 1 (4 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":2426}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1a0d103c29fd81b341b0d8a12fd50ab6909c1662cf5099462b91f549e9cb4e"}},{"ruleId":"D2","level":"warning","message":{"text":"InspectorViewport::ui_system (cognitive 67): InspectorViewport::ui_system has cognitive complexity 67 (threshold 15). Drivers by points: if/else 36 (61 pts), boolean chains 4, loops 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":"libs/elodin-editor/src/ui/inspector/viewport.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50c87f6d7b0d677a12e9cf3cc64134ab825b0ae3c16dabba2f9d3b0848fe190"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::profile::dump_report (cognitive 66): cranelift_mlir::profile::dump_report has cognitive complexity 66 (threshold 15). Drivers by points: if/else 32 (43 pts), loops 11 (21 pts), match/switch 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/profile.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d5b2ac190a12ee11226c64785193f20ebb1126f46ca11ad4c2c8fab785a337"}},{"ruleId":"D2","level":"warning","message":{"text":"impeller_cli::run (cognitive 65): impeller_cli::run has cognitive complexity 65 (threshold 15). Drivers by points: if/else 11 (37 pts), match/switch 5 (21 pts), loops 3 (6 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":"libs/db/cli/src/lib.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc24cdf644606cf32013c4e9fe5b208b3dcd5bc339c40c452812cfdad158118"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::view_cube::camera::handle_view_cube_editor (cognitive 64): elodin_editor::plugins::view_cube::camera::handle_view_cube_editor has cognitive complexity 64 (threshold 15). Drivers by points: if/else 24 (56 pts), match/switch 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/view_cube/camera.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb7bb360cb3680a7f0f75a244f79374606562785d7b5519e7e2ca8e23638711"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::sql_eql::array_iter (cognitive 64): elodin_editor::ui::sql_eql::array_iter has cognitive complexity 64 (threshold 15). Drivers by points: if/else 12 (48 pts), loops 3 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 46). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/sql_eql.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6cce6cf66ee942930b7b72a9ec8128fedbc2823e2239314b11445e71cb2bead"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::object_3d::update_object_3d_kernels (cognitive 61): elodin_editor::object_3d::update_object_3d_kernels has cognitive complexity 61 (threshold 15). Drivers by points: if/else 16 (43 pts), match/switch 6 (16 pts), boolean chains 1, loops 1 (nesting depth added 37). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"341b06ef663a87164f9efc79fbfc67037f2b268ca983e93cad5928d341018dbb"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::plot::gpu::extract_lines (cognitive 61): elodin_editor::ui::plot::gpu::extract_lines has cognitive complexity 61 (threshold 15). Drivers by points: if/else 25 (48 pts), loops 6 (8 pts), boolean chains 5 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/gpu.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d52c2e577d825634238a00cdb2106cbe460eadf00486b163bc253828538fbc"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::merge::run (cognitive 60): elodin_db::merge::run has cognitive complexity 60 (threshold 15). Drivers by points: if/else 31 (49 pts), boolean chains 6, loops 2 (4 pts), match/switch 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/merge.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b6414082521e0d0c2fc7910f9fbaeae43366b05f79283f4c65ccba3e281ee5"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::plot_3d::point_trails::sync_point_trails (cognitive 60): elodin_editor::ui::plot_3d::point_trails::sync_point_trails has cognitive complexity 60 (threshold 15). Drivers by points: if/else 14 (39 pts), loops 6 (15 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot_3d/point_trails.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b4ac2cd54b4ffe51971eefe733669292dc547af9c4933c249c31ce75989e17"}},{"ruleId":"D2","level":"warning","message":{"text":"impeller_bevy::sink_inner (cognitive 60): impeller_bevy::sink_inner has cognitive complexity 60 (threshold 15). Drivers by points: if/else 14 (35 pts), loops 5 (11 pts), match/switch 5 (9 pts), boolean chains 5 (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":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"23940cd32448547725179e7c89f5d45dc269f51bf50482c5474b37b113c66df4"}},{"ruleId":"D2","level":"warning","message":{"text":"ComponentValue::add_view (cognitive 57): ComponentValue::add_view has cognitive complexity 57 (threshold 15). Drivers by points: if/else 11 (33 pts), loops 11 (22 pts), boolean chains 1, match/switch 1 (nesting depth added 33). 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":"libs/impeller/wkt/src/value.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"1964b54ca9a8911b29fc1f70044ca8e2692903311a5b60f3ca6e45122bbbf349"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::thruster_particles::sync_kdl_thruster_transforms (cognitive 56): elodin_editor::plugins::thruster_particles::sync_kdl_thruster_transforms has cognitive complexity 56 (threshold 15). Drivers by points: if/else 18 (49 pts), loops 3 (7 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/thruster_particles/mod.rs"},"region":{"startLine":1171}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4ccd30fc38c7bdca5e960d047e80117510d9ee56be35529e868e04aa1fe292"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::plot::gpu::extract_plot_lines_wasm (cognitive 56): elodin_editor::ui::plot::gpu::extract_plot_lines_wasm has cognitive complexity 56 (threshold 15). Drivers by points: if/else 19 (39 pts), loops 4 (15 pts), match/switch 1 (2 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/gpu.rs"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3220ddf84f5496551922d5d05c465630c5ab96d9d4054b602703530787b125"}},{"ruleId":"D2","level":"warning","message":{"text":"monte_carlo::ports::find_port_owners (cognitive 56): monte_carlo::ports::find_port_owners has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (46 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/monte-carlo/src/ports.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"a68a0b70508409e43959e2ad248f5ea4ed661a7448d08bff1a1d0162d0b97f9d"}},{"ruleId":"D2","level":"warning","message":{"text":"LoadSchematicParams::load_schematic (cognitive 54): LoadSchematicParams::load_schematic has cognitive complexity 54 (threshold 15). Drivers by points: if/else 19 (36 pts), match/switch 4 (10 pts), loops 5 (6 pts), boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"06daffa2ef0719038463c3df9f35233b794eb9ca44adcd598da32180b5b925f4"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::follow_stream::handle_follow_stream (cognitive 53): elodin_db::follow_stream::handle_follow_stream has cognitive complexity 53 (threshold 15). Drivers by points: if/else 11 (31 pts), loops 7 (17 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/follow_stream.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"28114056793ce380c98965a9d1516a04f419c0c4a2f0853dd900f08defb290c8"}},{"ruleId":"D2","level":"warning","message":{"text":"impeller_kdl::ser::serialize_viewport (cognitive 52): impeller_kdl::ser::serialize_viewport has cognitive complexity 52 (threshold 15). Drivers by points: if/else 39 (47 pts), match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/ser.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"6975fe8c6e3e7ba859bb3462f58e0e1d541560c24a060f0d8cfbefd9584adfb3"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::headless::load_headless_scene (cognitive 51): elodin_editor::headless::load_headless_scene has cognitive complexity 51 (threshold 15). Drivers by points: if/else 22 (44 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"134a87b84a3843cccaa750ea87a3db99391197e023b7a7c5955a001f45295451"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::plot::widget::sync_kernel_graphs (cognitive 51): elodin_editor::ui::plot::widget::sync_kernel_graphs has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 5 (9 pts), match/switch 4 (8 pts), boolean chains 5 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":2120}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a260935624fb78dd7f1beb7efd29efb483a3d68533602e1c878abf7a450a3e"}},{"ruleId":"D2","level":"warning","message":{"text":"bevy_ai_skybox::apply_skybox_to_camera (cognitive 50): bevy_ai_skybox::apply_skybox_to_camera has cognitive complexity 50 (threshold 15). Drivers by points: if/else 12 (33 pts), boolean chains 6, loops 3 (6 pts), match/switch 2 (5 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":"libs/bevy_ai_skybox/src/lib.rs"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced8280241fe0f0b9041fcea0b7514e15fac874fbd3870563846c8217e0a676c"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::plot::widget::pan_graph (cognitive 50): elodin_editor::ui::plot::widget::pan_graph has cognitive complexity 50 (threshold 15). Drivers by points: if/else 22 (48 pts), boolean chains 1, loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":2479}}}],"partialFingerprints":{"codehealthFindingId/v1":"6419dc359dae42fe175f32245393f568b2c4f3b162edf884e2cdc4775b7e51f1"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcessArgs::run (cognitive 50): ProcessArgs::run has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (40 pts), match/switch 3 (8 pts), boolean chains 1, loops 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/src/recipe.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a748cc559d160ecbd58700f5fe0814bd528d158f6196ac17973f16c0f14220e"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::parser::parse_sort_op (cognitive 49): cranelift_mlir::parser::parse_sort_op has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (33 pts), loops 6 (10 pts), boolean chains 6 (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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fcb4b798e4600f2ce00623998a1467477d37f951d1276f62af2020def2fa9c"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::export_mcap::build_dynamic_arrows (cognitive 49): elodin_db::export_mcap::build_dynamic_arrows has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (27 pts), match/switch 7 (16 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/export_mcap.rs"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"d109175f12b62474a108be063605254b245581a7308d5a72cae185d8233fa5ff"}},{"ruleId":"D2","level":"warning","message":{"text":"InspectorGraph::ui_system (cognitive 49): InspectorGraph::ui_system has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (36 pts), loops 2 (6 pts), boolean chains 4, match/switch 2 (3 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/graph.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fbeea87ec0300d635847689527f67627b25b274662c292f1b31091a4a0caa9"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::view_cube::interactions::setup_cube_elements (cognitive 49): elodin_editor::plugins::view_cube::interactions::setup_cube_elements has cognitive complexity 49 (threshold 15). Drivers by points: if/else 16 (38 pts), loops 3 (7 pts), boolean chains 4 (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":"libs/elodin-editor/src/plugins/view_cube/interactions.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7331d2ed82d79523d1f82d243dd983884138217196fab8f5deb9d1d235595790"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::plot::widget::sync_derived_graphs (cognitive 49): elodin_editor::ui::plot::widget::sync_derived_graphs has cognitive complexity 49 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 5 (9 pts), match/switch 3 (6 pts), boolean chains 5 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"57a63acbf5b0eb1dc59d8ce02d261be2ed95e53b56110ce6e26a8944a65cc233"}},{"ruleId":"D2","level":"warning","message":{"text":"DB::open (cognitive 48): DB::open has cognitive complexity 48 (threshold 15). Drivers by points: if/else 23 (40 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/lib.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"e263362e182a96cc2f5a8d626725ef9a93c8640222bbfa7d94912eab820f4c9d"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::fix_timestamps::run (cognitive 48): elodin_db::fix_timestamps::run has cognitive complexity 48 (threshold 15). Drivers by points: if/else 21 (32 pts), match/switch 5 (9 pts), loops 4, 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":"libs/db/src/fix_timestamps.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"952cf44e248b8385cce0237e861cc04682b28dc19cf6afe7996cd8e8673113d2"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::plot::widget::auto_y_bounds (cognitive 48): elodin_editor::ui::plot::widget::auto_y_bounds has cognitive complexity 48 (threshold 15). Drivers by points: if/else 17 (40 pts), loops 4 (6 pts), boolean chains 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"73bc25a1e9a71d68fdb897a6b3a005cb5a95ef8f88ae5e1b04c5b527a6a5745e"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::object_3d::compile_formula (cognitive 47): elodin_editor::object_3d::compile_formula has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (31 pts), match/switch 10 (14 pts), loops 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7cbd7a8ade61bf44b942d6524f60cf8b8c503f3df374845ba3114f17eeddd8"}},{"ruleId":"D2","level":"warning","message":{"text":"monte_carlo::execute_campaign (cognitive 47): monte_carlo::execute_campaign has cognitive complexity 47 (threshold 15). Drivers by points: if/else 22 (33 pts), loops 6 (8 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f4d3a7121f3811b8b254b90f3b90b687164d7e8449979275f17e979e50fc16"}},{"ruleId":"D2","level":"warning","message":{"text":"TimelineControls::ui_system (cognitive 46): TimelineControls::ui_system has cognitive complexity 46 (threshold 15). Drivers by points: if/else 26 (36 pts), boolean chains 10 (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":"libs/elodin-editor/src/ui/timeline/timeline_controls.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b87e6b12bb15c1b7d271cbc3d046c936fff6109f1def7ad42c468275af80c9"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::plot_3d::gpu::extract_lines (cognitive 46): elodin_editor::ui::plot_3d::gpu::extract_lines has cognitive complexity 46 (threshold 15). Drivers by points: if/else 21 (37 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot_3d/gpu.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc6dc8ce8185c5b73817ffba3a44c9c99dcfc3c2e317dab6997d4efa0ecd7ea"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::navigation_gizmo::set_camera_viewport (cognitive 44): elodin_editor::plugins::navigation_gizmo::set_camera_viewport has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (36 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/navigation_gizmo/mod.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"6557da0ad782106575ce8c67f769d7c10543a3fae924ef6b3f5e1a0e290cc351"}},{"ruleId":"D2","level":"warning","message":{"text":"DB::apply_component_row (cognitive 43): DB::apply_component_row has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 5 (8 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/lib.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"b636b7badb3e46ee11cd3f557e2b82c52bcc72375128ad10ff8a81e44eb07cdc"}},{"ruleId":"D2","level":"warning","message":{"text":"QueryPlotWidget::ui_system (cognitive 43): QueryPlotWidget::ui_system has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (23 pts), match/switch 5 (10 pts), loops 3 (9 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/query_plot.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"f268a96495ab9b95c55ca2d74870b921f029e602fb115ab9fb0a5ce9ae78ec96"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::query_plot::auto_bounds (cognitive 43): elodin_editor::ui::query_plot::auto_bounds has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (30 pts), match/switch 2 (8 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/query_plot.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"96dfe768422bbc119000396e57153fea1eb74be8b7fdf981199dc333fe1e1fd6"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::timeline::timeline_controls::speed_control (cognitive 43): elodin_editor::ui::timeline::timeline_controls::speed_control has cognitive complexity 43 (threshold 15). Drivers by points: if/else 27 (36 pts), boolean chains 4, loops 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":"libs/elodin-editor/src/ui/timeline/timeline_controls.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc856bd8253a0b5f29e993ec1ed5f558653672a9ee40816c22bf1955aa1d250"}},{"ruleId":"D2","level":"warning","message":{"text":"monte_carlo::run_one (cognitive 43): monte_carlo::run_one has cognitive complexity 43 (threshold 15). Drivers by points: if/else 19 (27 pts), match/switch 5 (10 pts), boolean chains 5, 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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":2083}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc181d624741bf14cdf574ae73f612efcb9a4d4b6d69bd2e40586287a446f5f"}},{"ruleId":"D2","level":"warning","message":{"text":"Noxpr::ty (cognitive 43): Noxpr::ty has cognitive complexity 43 (threshold 15). Drivers by points: if/else 19 (37 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ed8f06239c96496a030afe134486dbc20ac0955f47ae98f9604e6f79a1d115"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::parser::parse_custom_call_op (cognitive 42): cranelift_mlir::parser::parse_custom_call_op has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (34 pts), loops 3 (8 pts) (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1604}}}],"partialFingerprints":{"codehealthFindingId/v1":"24be53aba21bcfe7023464bd86fc490e22cc0947ca5b4ec2151e0f11107df2c4"}},{"ruleId":"D2","level":"warning","message":{"text":"IngestServiceImpl::run_session (cognitive 42): IngestServiceImpl::run_session has cognitive complexity 42 (threshold 15). Drivers by points: if/else 7 (24 pts), match/switch 5 (14 pts), loops 2 (4 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/grpc/ingest.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"4574b9ae96782479ac56f1783c1123585f034f60583c4aa684979a513ba589d7"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::colors::load_user_presets (cognitive 41): elodin_editor::ui::colors::load_user_presets has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (28 pts), loops 3 (7 pts), match/switch 2 (6 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/colors.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"936bb44b695b48b13c3853efe54d7148ad448db0ccbeca3d434147061ea72d10"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin::cli::cloud::upload::transfer (cognitive 40): elodin::cli::cloud::upload::transfer has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 3 (6 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/elodin/src/cli/cloud/upload/mod.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"18506ec098bf8293d16aebc7753ce821d33c7cac0657cfaa4f69a38b9d534cbe"}},{"ruleId":"D2","level":"warning","message":{"text":"aleph_serial_bridge::connect (cognitive 40): aleph_serial_bridge::connect has cognitive complexity 40 (threshold 15). Drivers by points: if/else 9 (26 pts), match/switch 4 (10 pts), loops 3 (4 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/serial-bridge/src/main.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3e8f6664c8af7e102a747fd8697f7652fe0b4c7b66b91ad875c695b8662a3d2"}},{"ruleId":"D2","level":"warning","message":{"text":"TimeseriesPlot::draw_x_axis (cognitive 40): TimeseriesPlot::draw_x_axis has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 3 (6 pts), boolean chains 5, match/switch 1 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8f9e6ce64d1c0b8fab8341584906ba4776dad1538ae31a06f32f9848c9d5ed"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::skybox_db_assets::sync_db_skybox_assets_from_config (cognitive 40): elodin_editor::skybox_db_assets::sync_db_skybox_assets_from_config has cognitive complexity 40 (threshold 15). Drivers by points: if/else 15 (26 pts), match/switch 3 (10 pts), boolean chains 4 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/skybox_db_assets.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f02753018dd96c149e57f42c2d69b51eddf871914d9ecba98bc9a0f61048493"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::data_overview::extract_values_from_array (cognitive 40): elodin_editor::ui::data_overview::extract_values_from_array has cognitive complexity 40 (threshold 15). Drivers by points: if/else 19 (28 pts), loops 4 (11 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/data_overview/mod.rs"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a3f9a06bb4dd099a1857063158682a916a6cc0dedf06f3af92dec65500b628"}},{"ruleId":"D2","level":"warning","message":{"text":"impeller_bevy::prefetch::prefetch_visible_window (cognitive 40): impeller_bevy::prefetch::prefetch_visible_window has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 6 (13 pts), boolean chains 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/bevy/src/prefetch.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f19708e8e4abd494fd850cdc7bde1d9ef5c0b15538b483d5fdeeff82105c8a"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::vtable_stream::handle_vtable_stream (cognitive 39): elodin_db::vtable_stream::handle_vtable_stream has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (29 pts), loops 4 (5 pts), match/switch 2 (4 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":"libs/db/src/vtable_stream.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2c15c95304259b7e03e90d07d0df2ba950094d4377db5f9391c0931e0e68ca"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::kdl_document::operations::sync_document_from_config (cognitive 39): elodin_editor::plugins::kdl_document::operations::sync_document_from_config has cognitive complexity 39 (threshold 15). Drivers by points: if/else 16 (34 pts), match/switch 1 (4 pts), boolean chains 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":"libs/elodin-editor/src/plugins/kdl_document/operations.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4e300695fddf6b216c5012da552ce301e0b6eaf7741a7d9c3c7886fb6ef14df"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::map_overlay::sync_assets (cognitive 39): elodin_editor::plugins::map_overlay::sync_assets has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 7 (17 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/map_overlay.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e278f0416a2c10fe2714c96e4e606a82efc55c079b0010cdec48b82c61e5bd"}},{"ruleId":"D2","level":"warning","message":{"text":"SimRecipe::run (cognitive 39): SimRecipe::run has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (30 pts), loops 2 (4 pts), match/switch 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":"libs/s10/src/sim.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"02878e15bf4f9bf0af461d17cfa240ca91494274795ac7a2d1ab8828eb83a4fd"}},{"ruleId":"D2","level":"warning","message":{"text":"search.makeTeaser (cognitive 39): search.makeTeaser has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 7 (12 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":"docs/public/static/js/search.js"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"754136f788e0d2d92da1796ae4e89f2a274bf6a013a489f38dcaa8a12174d858"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::frustum_intersection::projection::build_projection_mesh (cognitive 38): elodin_editor::plugins::frustum_intersection::projection::build_projection_mesh has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 6 (13 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/frustum_intersection/projection.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1361d3b8093435aff6db442dfd976e57a5351c5ef9e9eddba166941bb8b7b76d"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::parser::parse_conv_dimension_numbers (cognitive 37): cranelift_mlir::parser::parse_conv_dimension_numbers has cognitive complexity 37 (threshold 15). Drivers by points: loops 3 (14 pts), match/switch 3 (13 pts), if/else 4 (10 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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":2827}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f88ae4243ee9c597f2b1cbe482c913a37a40112c32fa2d10f734b6ae80c5be"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::thruster_particles::sync_kdl_thruster_particles (cognitive 37): elodin_editor::plugins::thruster_particles::sync_kdl_thruster_particles has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (29 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/thruster_particles/mod.rs"},"region":{"startLine":1297}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf2d6ff230b0f8af6d9ecd598a3cd2e41c4dc767ccfa8043d11d83801d9c9e3"}},{"ruleId":"D2","level":"warning","message":{"text":"monte_carlo::sample_cache_mappings (cognitive 37): monte_carlo::sample_cache_mappings has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (30 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":3711}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e5d0c41cb9a393912fd92e8fc07122fdad2d1367269057787ffed3a88a5d62"}},{"ruleId":"D2","level":"warning","message":{"text":"TimeseriesPlot::draw_modal (cognitive 36): TimeseriesPlot::draw_modal has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 21). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ee9445197407f29755f2ca2de84694aa2abbf6d8467f0ca2ad90b1553a71c85"}},{"ruleId":"D2","level":"warning","message":{"text":"WorldBuilder::sensor_camera (cognitive 36): WorldBuilder::sensor_camera has cognitive complexity 36 (threshold 15). Drivers by points: if/else 22 (23 pts), boolean chains 11, match/switch 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"953ed9a5186e58cb32b237d99332ecf4aa9c2105a0b67899c036aa818b7179ad"}},{"ruleId":"D2","level":"warning","message":{"text":"ContentStore::serve (cognitive 35): ContentStore::serve has cognitive complexity 35 (threshold 15). Drivers by points: if/else 5 (22 pts), match/switch 2 (8 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/memserve/memserve.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bbf1769af4331b453fe1adb7fe62c0a385f58e5610ad6d60af5d3cb7f37c13"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::lower::lower_callee_body (cognitive 35): cranelift_mlir::lower::lower_callee_body has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 4 (14 pts), match/switch 1 (5 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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":6738}}}],"partialFingerprints":{"codehealthFindingId/v1":"04f8afd6150148a29e996ca134e672a5719dd1ae85565f352b3c3e85fd3d1b67"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::tensor_rt::tensor_reduce_window (cognitive 35): cranelift_mlir::tensor_rt::tensor_reduce_window has cognitive complexity 35 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 10 (15 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":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":1722}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ca6af610682c95a95d9f3a6ebdb80f48ecdedbc6784ca806e648aaab8d9652"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::follow::run_follower_inner (cognitive 35): elodin_db::follow::run_follower_inner has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (24 pts), loops 3 (5 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/follow.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c30f8e6de625b32d57bb9b3730c42b9bfef934e1c50d191a071a0699b4478d"}},{"ruleId":"D2","level":"warning","message":{"text":"Timeline::render (cognitive 35): Timeline::render has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (33 pts), loops 1 (2 pts) (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/timeline/timeline_slider.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6636e58970e0e00838adc27a5ab6545a66cb0df5c71e96899408bdbd456f19f"}},{"ruleId":"D2","level":"warning","message":{"text":"terrain.terrain_heightmap (cognitive 35): terrain.terrain_heightmap has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 8, error handling 3 (8 pts), loops 1 (2 pts), ternaries 1 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/python/elodin/terrain.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"098f9d3b293ec257f775632ce6c9d5e599c75c7e52841cee719285e1bcbb58c6"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::interp::argminmax (cognitive 34): cranelift_mlir::interp::argminmax has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 3 (6 pts), boolean chains 5, match/switch 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":1977}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c8cd05b1737b22aee3980693cda9489accc7d51e76918575861944e48eba40"}},{"ruleId":"D2","level":"warning","message":{"text":"search.substringByByte (cognitive 34): search.substringByByte has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (33 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/public/static/js/search.js"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ebcdbf1b5098f4252380e0e373c4b2973a3009613ac5a5398c0e06140a8ea95"}},{"ruleId":"D2","level":"warning","message":{"text":"rtsp_streamer::run_once (cognitive 33): rtsp_streamer::run_once has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (24 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/rtsp-streamer/src/main.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ba8e446c25c7d1eeed10ef2da65e3a69023c3f82b5780e0710c67032ca79976"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::interp::gather (cognitive 33): cranelift_mlir::interp::gather has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 6 (11 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eff632d310a971b2312b60e03a2ddde214cc7e3b969cea8cdc9a849b9bc6a74"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr::to_sql_with_options (cognitive 33): Expr::to_sql_with_options has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 4 (11 pts), match/switch 2 (3 pts) (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/lib.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"86607f3ed737436399a168168e50e2758d4124c8c2df55592cd79c9d3ada7228"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::handle_real_time_stream_batched (cognitive 33): elodin_db::handle_real_time_stream_batched has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 4 (10 pts), boolean chains 4 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/lib.rs"},"region":{"startLine":3290}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee7de2b210c44ea38f465840f262df05f5979e26af2da1f2db11d3cb9a0903e"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::merge::analyze_database (cognitive 33): elodin_db::merge::analyze_database has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 2 (5 pts), match/switch 1 (4 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":"libs/db/src/merge.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2aef78d1e615827e3fb609c8f891cbc144e19da18a779fb0e5dc9e3d485dc8e"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::trim::analyze_database (cognitive 33): elodin_db::trim::analyze_database has cognitive complexity 33 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/trim.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eced15ac10ba65c525f2def8c30f3538808420d2449ff9e77fa3e1c8ad2efa7"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::object_3d::apply_glb_material_overrides (cognitive 33): elodin_editor::object_3d::apply_glb_material_overrides has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 3 (5 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":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":2637}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ae52e296268f56793235929e62ca58721774ee1dab6b4d4ed46afc79302735"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::sensor_camera::spawn_sensor_cameras (cognitive 33): elodin_editor::sensor_camera::spawn_sensor_cameras has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 2, 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":"libs/elodin-editor/src/sensor_camera.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fb776949aa007647e73ffe534dae894e96788b5f177084575f1f0e5324ffe3"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::video_stream::drive_webcodecs (cognitive 33): elodin_editor::ui::video_stream::drive_webcodecs has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (25 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/video_stream.rs"},"region":{"startLine":1373}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8a7a4d07976f31b5700376fa06e57deb375776ec058d973a00bf0b7e436ef7"}},{"ruleId":"D2","level":"warning","message":{"text":"s10::watch::watch_filtered (cognitive 33): s10::watch::watch_filtered has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (22 pts), match/switch 3 (9 pts), loops 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/src/watch.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0766a3d847535b492624afd39332de6acaa7aa3ca92e34c0eb211b8e56ff71"}},{"ruleId":"D2","level":"warning","message":{"text":"Schema.from_json (cognitive 33): Schema.from_json has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 8, loops 2 (4 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/python/elodin/ui/schema.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe11b1b8c15b53fed7ad4334a29ecdaded38bce479cb580c7be85b71b16e4e8"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::parser::parse_reduce_op (cognitive 32): cranelift_mlir::parser::parse_reduce_op has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (23 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f1bf3e0e93041fcf7ad2042c08258e98dd7230f97521c13984547f85c3e92e3"}},{"ruleId":"D2","level":"warning","message":{"text":"MessageServiceImpl::run_publish (cognitive 32): MessageServiceImpl::run_publish has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (22 pts), match/switch 3 (7 pts), loops 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/grpc/msg.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"982a5e2987caa0799f1000a2c2792ea0852849919118cee2fcc84ef2bb2dfc19"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::export_mcap::build_layout (cognitive 32): elodin_db::export_mcap::build_layout has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 5 (8 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/export_mcap.rs"},"region":{"startLine":1884}}}],"partialFingerprints":{"codehealthFindingId/v1":"2376b57ccb32ba80be44efa8b55f2ac9c9efb77d50e6c0fd91c87f520f0bb765"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::headless::render_server_runner (cognitive 32): elodin_editor::headless::render_server_runner has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 3 (4 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe7dd6b45a6c5881d5a1ac8cca0d93382913b6d87a133e3737247f26cc5d82b8"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::inspector::widgets::eql_autocomplete (cognitive 32): elodin_editor::ui::inspector::widgets::eql_autocomplete has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/widgets.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba345dc8e425410ac9f407bc71a01d08d63762f05e03b9c96d39749a79be4a34"}},{"ruleId":"D2","level":"warning","message":{"text":"impeller_bevy::msg_sink (cognitive 32): impeller_bevy::msg_sink has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (23 pts), match/switch 3 (6 pts), boolean chains 2, loops 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":1622}}}],"partialFingerprints":{"codehealthFindingId/v1":"be354368c1737b7c0b7478732daa99a79c37adb1e4fc4a1bd7e4f35836321617"}},{"ruleId":"D2","level":"warning","message":{"text":"impeller_kdl::de::parse_vector_arrow (cognitive 32): impeller_kdl::de::parse_vector_arrow has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (22 pts), match/switch 4 (10 pts) (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":2514}}}],"partialFingerprints":{"codehealthFindingId/v1":"596382ba3c4ffe114a21a4a03e16ce67c96d8e7d07445a9d198c20d4f5876ad8"}},{"ruleId":"D2","level":"warning","message":{"text":"Client::run (cognitive 31): Client::run has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (18 pts), match/switch 3 (7 pts), loops 3 (6 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/roci/src/tokio.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9a48a3733a287569ecba236b650a39e107642ef44e4458a3be0f888fc05747"}},{"ruleId":"D2","level":"warning","message":{"text":"DB::insert_vtable (cognitive 31): DB::insert_vtable has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 6, loops 2, match/switch 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/lib.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1e055a3d215c52bc7995235e02d485f65c0e61cf4a78ca20b590894fd50448"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::skybox_db_assets::upload_active_skybox_assets_to_db (cognitive 31): elodin_editor::skybox_db_assets::upload_active_skybox_assets_to_db has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 10 (11 pts), loops 1 (5 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/skybox_db_assets.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1c1703d4aa44b2191dfb42d0e5f043cc721fd0da82a3858b7de7e22c5a67ad"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::plot_3d::sync_line_plot_3d (cognitive 31): elodin_editor::ui::plot_3d::sync_line_plot_3d has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 3 (4 pts), match/switch 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot_3d/mod.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57e6802a87c5efe8327a8bf42816f350521b24f63a07c8374d3ac47b442015c"}},{"ruleId":"D2","level":"warning","message":{"text":"FrameDecoder::push (cognitive 31): FrameDecoder::push has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (25 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/frame/src/lib.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2bf9bf9728ea31ccb45b5e0c4c89300881b34030476fa1dca9c0ba93cd72ddd"}},{"ruleId":"D2","level":"warning","message":{"text":"compare_runs.main (cognitive 31): compare_runs.main has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 4, loops 3 (4 pts), ternaries 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".cursor/skills/branch-regression/compare_runs.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca2d11cc625e98d9c244190affa272b4aa004d0a43959789d0c1c28a22d2811"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::run (cognitive 30): Server::run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 2 (13 pts), loops 4 (13 pts), match/switch 2 (4 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/roci/src/tokio.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2ed8b5e22a0fbdb23d232875896c2a6c77ccfcaf33aecf242000768919d3e8e"}},{"ruleId":"D2","level":"warning","message":{"text":"Args::run (cognitive 30): Args::run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 4 (7 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/video-streamer/src/main.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa9a18a3d85351e4619dc3add093908bcfd09ccf146e4cd524f0269ded2d890"}},{"ruleId":"D2","level":"warning","message":{"text":"bevy_mat3_material::sync_mat3_params_from_component (cognitive 30): bevy_mat3_material::sync_mat3_params_from_component has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (26 pts), loops 2 (4 pts) (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":"libs/bevy_mat3_material/src/lib.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ff2d1020a5bdc12a73ae38d5009d5caee741d4b19a53dd3bea7f7e2753df36"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::const_fold::try_identity (cognitive 30): cranelift_mlir::const_fold::try_identity has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (26 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/const_fold.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"df891d30dc8bd74a5bf8dc70f1513a09e1adc5a4a438e03e08b49b177af0e30e"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::query::resolve_slice (cognitive 30): elodin_db::query::resolve_slice has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 4, loops 1 (4 pts), match/switch 2 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/query.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a96a9740396cf8a0e048c294083e0a41aae02c1379144c50d4509e9751c795e"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::trim::do_trim (cognitive 30): elodin_db::trim::do_trim has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 2 (5 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/trim.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"00db7d639f794eada55298c6b7eaa3ea6daa4277e8635b24ae66825d7d7c5ae0"}},{"ruleId":"D2","level":"warning","message":{"text":"TileSystem::render_panel_contents (cognitive 30): TileSystem::render_panel_contents has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (18 pts), match/switch 3 (7 pts), loops 1 (4 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":2762}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82042cd87831cd5c2b745331d1171b06b51e298d3ddb2795a27c61c70f19599"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::display_kernel::evaluate_kernel_series (cognitive 30): elodin_editor::plugins::display_kernel::evaluate_kernel_series has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 6 (11 pts), match/switch 2 (7 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/display_kernel.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bda37cf51180de0cf1aff7b26ea3493f4c4386b6f4b985c47fdc563b5dcb75"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::thruster_particles::ensure_kdl_thrusters (cognitive 30): elodin_editor::plugins::thruster_particles::ensure_kdl_thrusters has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (23 pts), loops 3 (6 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":"libs/elodin-editor/src/plugins/thruster_particles/mod.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16f1b282b44468e22fb78f957af52dcd185dfc0056f56ad31bfab8dd7cb60fd"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::plot::data::try_joint_triline_compress (cognitive 30): elodin_editor::ui::plot::data::try_joint_triline_compress has cognitive complexity 30 (threshold 15). Drivers by points: if/else 21 (25 pts), boolean chains 4, match/switch 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/data.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"f46fd7c76d782e25e9eb840c453f1f09ce46219b96fbdd44b83944bfcc7053ac"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::plot::widget::reset_graph (cognitive 30): elodin_editor::ui::plot::widget::reset_graph has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (25 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":2588}}}],"partialFingerprints":{"codehealthFindingId/v1":"b03c24af15eb4c74b636d829c400d17e03a85d9e8cbc3e5bede713555a944114"}},{"ruleId":"D2","level":"warning","message":{"text":"NoxprNode::is_equal (cognitive 30): NoxprNode::is_equal has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 29, match/switch 1. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9d25fd58548c54735285a7f9b84e615bfbbced94e069d560a3b330463d0a4f"}},{"ruleId":"D2","level":"warning","message":{"text":"NoxprNode::eq (cognitive 30): NoxprNode::eq has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 29, match/switch 1. The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd2eac1f271c142f397414514c9c5592974bd6ba44d24970697b363d24209ce"}},{"ruleId":"D2","level":"warning","message":{"text":"WorldBuilder::discover_components (cognitive 30): WorldBuilder::discover_components has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 5 (8 pts), match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":1967}}}],"partialFingerprints":{"codehealthFindingId/v1":"933c0f4e9d24de7260d43874a9cb139036bfb011cca7b4782ca7f379e0317232"}},{"ruleId":"D2","level":"warning","message":{"text":"cudainfo.get_jetson_info (cognitive 30): cudainfo.get_jetson_info has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (29 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":"aleph/scripts/cudainfo.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"adfa027f939af5e2707127f16aa22eeb95f304094a7858f455bffb2ac3cb8da7"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::inliner::try_inline_one_top_level_call (cognitive 29): cranelift_mlir::inliner::try_inline_one_top_level_call has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 7 (9 pts), match/switch 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":"libs/cranelift-mlir/src/inliner.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0871176d49f83d9d180e2720cd6f5a6eba2a628c84bddf9382a66502ba100a8"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::kdl_document::systems::handle_open_document_from_active_requests (cognitive 29): elodin_editor::plugins::kdl_document::systems::handle_open_document_from_active_requests has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (22 pts), match/switch 3 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/kdl_document/systems.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab985787f75ac9ff3a83446a8bc82dcc7a5aa2dc3f18f8462c2813a1f222acc"}},{"ruleId":"D2","level":"warning","message":{"text":"impeller_kdl::ser::serialize_object_3d_mesh (cognitive 29): impeller_kdl::ser::serialize_object_3d_mesh has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 3, match/switch 2 (3 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/ser.rs"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"419ffa1b12cc6413c18ffbf065eb9339cdbd260aa15cb11eb52b9664b6912c12"}},{"ruleId":"D2","level":"warning","message":{"text":"broadcast_component.get_local_ip (cognitive 29): broadcast_component.get_local_ip has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 2 (4 pts), boolean chains 3, error handling 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/broadcast_component.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"269e70ccf2732ae20abd154873b673b6c13268ee05022ee7ccddb9e6cb20706b"}},{"ruleId":"D2","level":"warning","message":{"text":"receive_broadcast._print_status (cognitive 29): receive_broadcast._print_status has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 3 (11 pts), if/else 3 (10 pts), loops 3 (7 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":"fsw/udp_component_broadcast/receive_broadcast.py"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"9692e48ff8b97dfad1a83fb5f21be35e2e2d317121d05f72bbf6cea19356cdad"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::lower::collect_body_defs_uses (cognitive 28): cranelift_mlir::lower::collect_body_defs_uses has cognitive complexity 28 (threshold 15). Drivers by points: loops 10 (26 pts), match/switch 1 (2 pts) (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":2057}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b3e265eb71667d94bbfdcf474d73f51a12c6783a98952db3bbeadba3604652d"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::tensor_rt::tensor_select_and_scatter (cognitive 28): cranelift_mlir::tensor_rt::tensor_select_and_scatter has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 9 (13 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":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":1815}}}],"partialFingerprints":{"codehealthFindingId/v1":"830bb7489cd46cae6cf4fae841b1fda76f58528934d820d15fae7eacc95f0be5"}},{"ruleId":"D2","level":"warning","message":{"text":"video_toolbox::find_nal_units (cognitive 28): video_toolbox::find_nal_units has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/video-toolbox/src/lib.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"998f7912b88d9a30839e5692a946c49fb6083762446700d303f15831bfed3263"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::const_fold::rewrite_aliases_instr (cognitive 27): cranelift_mlir::const_fold::rewrite_aliases_instr has cognitive complexity 27 (threshold 15). Drivers by points: loops 13 (26 pts), match/switch 1 (nesting depth added 13). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/const_fold.rs"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ccb34c5e0ba40f39226af4baa643b94546868053d01d228fc2bed00b8efed7"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::lower::lower_call (cognitive 27): cranelift_mlir::lower::lower_call has cognitive complexity 27 (threshold 15). Drivers by points: loops 8 (18 pts), if/else 5 (8 pts), boolean chains 1 (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":8770}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc45381931f47ac3a06bc7bb10ee6264fea7b2d95f10643b1ccb6c6c649616e6"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::tensor_rt::tensor_concat_nd_f64 (cognitive 27): cranelift_mlir::tensor_rt::tensor_concat_nd_f64 has cognitive complexity 27 (threshold 15). Drivers by points: loops 8 (19 pts), if/else 4 (8 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":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cce4c9a21b547fdcf92e64ec15b57fa817ccdcaa2b89fd1f5545c7c4c3c044d"}},{"ruleId":"D2","level":"warning","message":{"text":"DBSink::apply_buf (cognitive 27): DBSink::apply_buf has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 2 (6 pts), boolean chains 3, loops 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":"libs/db/src/lib.rs"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63f0952c24987b15298bf929145f0b6fc335315b45f3ca97d4c18be6e5eef8c"}},{"ruleId":"D2","level":"warning","message":{"text":"PaletteItems::ui_system (cognitive 27): PaletteItems::ui_system has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/command_palette/mod.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"3725ec751a3dec07f571e83ac8c952b8a70566ab2b2a511b3e3b6237ac44e614"}},{"ruleId":"D2","level":"warning","message":{"text":"InspectorQueryTable::ui_system (cognitive 27): InspectorQueryTable::ui_system has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 4 (8 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/query_table.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e1742eef2f69cf2e8634d1a0eea0f9887a31671e8df7da45efa8c48394eb65"}},{"ruleId":"D2","level":"warning","message":{"text":"QueryTableWidget::ui_system (cognitive 27): QueryTableWidget::ui_system has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 4 (8 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":"libs/elodin-editor/src/ui/query_table.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"6386463e5f6751ab1e0f25eb8a01f5cf023240d61be35c826a58d0467a61cd6b"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::window::arrange::arrange_windows (cognitive 27): elodin_editor::ui::window::arrange::arrange_windows has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/window/arrange.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a4d1bf5964d59324f2626fb89d837d6c007ef153dc6167c2c868e30677ef99"}},{"ruleId":"D2","level":"warning","message":{"text":"impeller_kdl::de::parse_viewport (cognitive 27): impeller_kdl::de::parse_viewport has cognitive complexity 27 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5785b42ee6bbd96326792a33a7b3680555ab460d8fddba203fa991c0722838"}},{"ruleId":"D2","level":"warning","message":{"text":"terrain_prepare.prepare (cognitive 27): terrain_prepare.prepare has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (20 pts), error handling 2 (3 pts), boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/python/elodin/terrain_prepare.py"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9e9281c772dcdbf79e222991a89438d24250db894f29f315761832feebce5d"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::interp::scatter (cognitive 26): cranelift_mlir::interp::scatter has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 4 (7 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":1881}}}],"partialFingerprints":{"codehealthFindingId/v1":"42c446596f4c1e892dbed86791fbbe81e50c6eb16dd35598df102d894d353fe9"}},{"ruleId":"D2","level":"warning","message":{"text":"Viewport::smooth_follow (cognitive 26): Viewport::smooth_follow has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 10 (15 pts), boolean chains 6, if/else 4 (5 pts) (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/viewport.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"872a5cdd79c248c21b60f8924d2aaf68934cd1ce62aa0e9cddc428b199899e9d"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::object_3d::extract_scalar (cognitive 26): elodin_editor::object_3d::extract_scalar has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (25 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":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cdde1e12902bf5d0e75c9ddeaafbf7b15cf357b8f673b59859c6b786cc48b37"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::command_palette::palette_items::poll_schematic_save (cognitive 26): elodin_editor::ui::command_palette::palette_items::poll_schematic_save has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (21 pts), loops 1 (4 pts), match/switch 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":"libs/elodin-editor/src/ui/command_palette/palette_items.rs"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae3739ae4318fd94d3ee670bc3fcbfbbda4a09e57fa79b76f1ad68feb972367"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::video_stream::decode_video (cognitive 26): elodin_editor::ui::video_stream::decode_video has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/video_stream.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"f17b65cf1c59487d5a5be11b2bfb5cc184bbcc4dc132ce3e4af4a27e4c06df48"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::video_stream::connect_streams (cognitive 26): elodin_editor::ui::video_stream::connect_streams has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (19 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":"libs/elodin-editor/src/ui/video_stream.rs"},"region":{"startLine":1834}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a720cec9202b4a0862a3e10fbc1159d2abc7635e77e2b4b0f8432c67c2722e2"}},{"ruleId":"D2","level":"warning","message":{"text":"CraneliftExec::invoke_batch (cognitive 26): CraneliftExec::invoke_batch has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 5 (9 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":"libs/nox-py/src/cranelift_exec.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fac035a891a08248b959eba7a9ebcb56937a6db7d0af90c822e4b445b3d816"}},{"ruleId":"D2","level":"warning","message":{"text":"inscriber::list_external_disks (cognitive 25): inscriber::list_external_disks has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (7 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/inscriber/src/main.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6b2a4bf51780eab0489fe8325ca36bf25c73debce7e12edbc7e891ceb4b23f"}},{"ruleId":"D2","level":"warning","message":{"text":"TileTree::update (cognitive 25): TileTree::update has cognitive complexity 25 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 3 (6 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/terrain/terrain_data/tile_tree.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"c316113d75b85a556b6c96e8b5cd3f64dc7ea46eeb7d3b903603ad3a445a244b"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::utils::derive_playback_start_from_data (cognitive 25): elodin_db::utils::derive_playback_start_from_data has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (5 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":"libs/db/src/utils.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ac6976c2c3a76fe16512359263ff9287bca66e4ed2a080fd1d328974430494"}},{"ruleId":"D2","level":"warning","message":{"text":"TileState::insert_tile (cognitive 25): TileState::insert_tile has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (21 pts), match/switch 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"7203f9d42ecf288cbfc2383b919dd93cd17a82d6e9246771d6f27700c879a9c4"}},{"ruleId":"D2","level":"warning","message":{"text":"PlaybackDiscontinuities::scan (cognitive 25): PlaybackDiscontinuities::scan has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/timeline/playback.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"b280bc7a21db00ba0fa6a6cd98bdd28e3441df6aa305f205428b43cf4951464b"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::scene_environment::sync_camera_environment (cognitive 25): elodin_editor::plugins::scene_environment::sync_camera_environment has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/scene_environment.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66ffb0f3b5ca6ac2d53728d8782c6b79e9f0f5333e6ef461841ce86a1d5a82a"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::view_cube::interactions::edge_group_for_target_face (cognitive 25): elodin_editor::plugins::view_cube::interactions::edge_group_for_target_face has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (5 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":"libs/elodin-editor/src/plugins/view_cube/interactions.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"46f1011496c79ae3ecec622462805de5ca012a7a243739436631977df5234989"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::inspector::graph::add_components_from_eql (cognitive 25): elodin_editor::ui::inspector::graph::add_components_from_eql has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 6 (10 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/graph.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"61dd420a153c10897bb9f53be3867d609ac80271f958be4ed6dd874cca710260"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::plot::widget::zoom_graph (cognitive 25): elodin_editor::ui::plot::widget::zoom_graph has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":2392}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3515888464ef4608f7b5d950919c4331f944f395766a11a034bc4af4318c69"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::schematic::tree::panel (cognitive 25): elodin_editor::ui::schematic::tree::panel has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 2 (3 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":"libs/elodin-editor/src/ui/schematic/tree.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d553e0ed8af11b0324a4c82054b6bcd617f20384e4fd5131762ac18406453f"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::window::spawn::find_named_container_title (cognitive 25): elodin_editor::ui::window::spawn::find_named_container_title has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (9 pts), match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/window/spawn.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e846f2a03f2fa37629bb3353e2d5e60e5c8c2f8d2dfa65e4b5fa5e93ce0eca"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchTracer::process_scan (cognitive 25): BatchTracer::process_scan has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (5 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":"libs/nox/src/noxpr/batch_dfs.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f1e5c8af0f2e8dd7ab19ad194863ac7736f8012199ae33f87b52a37f9eeeb6c"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::parser::parse_dense_value (cognitive 24): cranelift_mlir::parser::parse_dense_value has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (6 pts), match/switch 1 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"8550b2b14fe0818eac7feb1bda9f591614d3169c78c4dfea4c20ab991df717cb"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::parser::parse_map_op (cognitive 24): cranelift_mlir::parser::parse_map_op has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":2400}}}],"partialFingerprints":{"codehealthFindingId/v1":"2501efd4638643868334e75cb1d88f5c0877e98bc2c5b2e27dd3d56bd7128e70"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr::to_graph_component_affines (cognitive 24): Expr::to_graph_component_affines has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (11 pts), match/switch 4 (9 pts), loops 1 (4 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/mod.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59c9a33b6484e28ef6672849ae8234a4bfab1e1b048fea92125ff54ed033287"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::export_mcap::build_scene (cognitive 24): elodin_db::export_mcap::build_scene has cognitive complexity 24 (threshold 15). Drivers by points: match/switch 4 (12 pts), if/else 5 (9 pts), loops 2, boolean chains 1 (nesting depth added 12). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/export_mcap.rs"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"106714e3746f1f44b3b9853d5fce0fa45dfaba9035d56ea1e760d7099fa72343"}},{"ruleId":"D2","level":"warning","message":{"text":"LoadSchematicParams::reload_changed_windows (cognitive 24): LoadSchematicParams::reload_changed_windows has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26386b0525d241f9d9fc82b187cd6655047c9e80df5bf1e2a36c61e8a750e9a"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::headless::sync_headless_skybox (cognitive 24): elodin_editor::headless::sync_headless_skybox has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 1, loops 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":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ddd33ad72c5aab0226624e7a2753445084aff2b64f47cb50d28b77c5a03a12"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::view_cube::camera::choose_min_rotation_up (cognitive 24): elodin_editor::plugins::view_cube::camera::choose_min_rotation_up has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 2 (6 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/view_cube/camera.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d7176bd249333c286b8407e1cefacd7d4b8e0ee452e44dc1d695dc9d6ac406"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::view_cube::interactions::on_cube_hover_start (cognitive 24): elodin_editor::plugins::view_cube::interactions::on_cube_hover_start has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (13 pts), loops 4 (6 pts), match/switch 1 (4 pts), boolean chains 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, 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":"libs/elodin-editor/src/plugins/view_cube/interactions.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e691b976ff7bac29cd729b71562b5f8262c372161f62d805b6156831146c13e"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::gauges::horizon::paint_horizon (cognitive 24): elodin_editor::ui::gauges::horizon::paint_horizon has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (5 pts), match/switch 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":"libs/elodin-editor/src/ui/gauges/horizon.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34035076dafd1704162693d415a846e8f5cceb88adbc47089e98e1184491158"}},{"ruleId":"D2","level":"warning","message":{"text":"hamann_chen_line::select_indices_curvature (cognitive 24): hamann_chen_line::select_indices_curvature has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/hamann-chen-line/src/lib.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"998c0e81221ea1d6e85dab84eb2f6ba90634516a396cc03374c845eeae95294c"}},{"ruleId":"D2","level":"warning","message":{"text":"TelemetryCache::drop_block (cognitive 24): TelemetryCache::drop_block has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee77a646217d33464834073c023d6505c263009a668976c3e04b6a95c4ef0360"}},{"ruleId":"D2","level":"warning","message":{"text":"bevy_world_mesh::terrain::render::terrain_material::queue_terrain (cognitive 23): bevy_world_mesh::terrain::render::terrain_material::queue_terrain has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/terrain/render/terrain_material.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"85fe37560c049241c5a2fd54506fd6216d219ee3581eb38862bc2fac4ddb1b03"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::tensor_rt::tensor_sort (cognitive 23): cranelift_mlir::tensor_rt::tensor_sort has cognitive complexity 23 (threshold 15). Drivers by points: loops 5 (14 pts), if/else 3 (5 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":2249}}}],"partialFingerprints":{"codehealthFindingId/v1":"de44a8dbecea059580da3068920a52e9784be75dfb7f37fd2e9a1f0166fa19f1"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::find_timestamp_source_ranges (cognitive 23): elodin_db::find_timestamp_source_ranges has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (6 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":"libs/db/src/lib.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd588399d974e8330d981f694ba4cdde59e0a0c20f1980de64f33bc5fe977f93"}},{"ruleId":"D2","level":"warning","message":{"text":"InspectorDataOverview::ui_system (cognitive 23): InspectorDataOverview::ui_system has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2, boolean chains 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/data_overview.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb9255f47aa21ef8ff1dfd53b3b1f52506a83e71fdbff0870faba2ee93fe650"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::object_3d::attach_joint_animations (cognitive 23): elodin_editor::object_3d::attach_joint_animations has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba40488f01268e61894140be4b5b74c6f3c3b641801a5bb30046df641a7e4c5"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::view_cube::update_theme_on_mode_change (cognitive 23): elodin_editor::plugins::view_cube::update_theme_on_mode_change has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/view_cube/mod.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d2b1fdf6cc8a62f1b1a7327f833e2f521fdf14d9c4636efe4b395755ac8948"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::sensor_camera::patch_sensor_view_dims (cognitive 23): elodin_editor::sensor_camera::patch_sensor_view_dims has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 2, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/sensor_camera.rs"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac034a8644e1f42b2d57cd3d0aae2c2fd80ef9119d31f5f8e73ac595b8b848d"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::tiles::shortcuts (cognitive 23): elodin_editor::ui::tiles::shortcuts has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":3957}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d5fa5c53f91649fd76e5b83ab14ba17ca4f599ad13f768156c047452d98310"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::video_stream::decode_video (cognitive 23): elodin_editor::ui::video_stream::decode_video has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/video_stream.rs"},"region":{"startLine":742}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc90d60eb4b30a89ec17b4deb571344da5777fd728f5e04240e3645555c4c3f7"}},{"ruleId":"D2","level":"warning","message":{"text":"impeller_kdl::de::parse_earth (cognitive 23): impeller_kdl::de::parse_earth has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"348633f61e2fead26510bbf54c2ba61a2ac31ddb5305ecf488a8c055f5e93543"}},{"ruleId":"D2","level":"warning","message":{"text":"impeller_kdl::ser::serialize_environment (cognitive 23): impeller_kdl::ser::serialize_environment has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (23 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":"libs/impeller/kdl/src/ser.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cecb9fd33c20153a8d696bf183789ae0daabdae6e9b3ae18d33e86b0b657936"}},{"ruleId":"D2","level":"warning","message":{"text":"monte_carlo::fs_util::compact_run_db (cognitive 23): monte_carlo::fs_util::compact_run_db has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/monte-carlo/src/fs_util.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4344628f87de8e771b63b20dda6e901c941d37288f3a7bd8095bde16c1cb15"}},{"ruleId":"D2","level":"warning","message":{"text":"nox_py::graph::exprs_from_edges_queries (cognitive 23): nox_py::graph::exprs_from_edges_queries has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 2 (5 pts), match/switch 1 (2 pts) (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/graph.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f7273bd73884d60b3aca0fc052aed5f4ca4de816f52bad5859611332ae4fb0"}},{"ruleId":"D2","level":"warning","message":{"text":"terrain_prepare.validate_package (cognitive 23): terrain_prepare.validate_package has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 8, loops 3, error handling 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/python/elodin/terrain_prepare.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c764f447850212007f489bec70b0780883a2e5c615898548331ee890d8a5867"}},{"ruleId":"D2","level":"warning","message":{"text":"ElodinSink::send_packet (cognitive 22): ElodinSink::send_packet has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 4 (7 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/gstreamer/src/lib.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2938e9d8ae60a46494f32f3034150bca68e93765123f71dca16b40f0deae4cd"}},{"ruleId":"D2","level":"warning","message":{"text":"DroneCan::read (cognitive 22): DroneCan::read has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/dronecan.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fe644ee7bbb8255660fddd4019a9c91639947b1ac9dba2590bc9bede7dedb0"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::lower::declare_all_functions (cognitive 22): cranelift_mlir::lower::declare_all_functions has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (11 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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":1929}}}],"partialFingerprints":{"codehealthFindingId/v1":"eee57179505a7b336b0018dac00c104fecb69afdc0d93b3df51e61e2c4ff6e6c"}},{"ruleId":"D2","level":"warning","message":{"text":"Atan2::to_sql (cognitive 22): Atan2::to_sql has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 1 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/formulas/atan2.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"85e65bc31390b2f95dedc0e32f00a33cce8f6a50b68f6f25854e68e44ca8facb"}},{"ruleId":"D2","level":"warning","message":{"text":"Rotate::parse (cognitive 22): Rotate::parse has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (22 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/formulas/rotate.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"238b587d1cf373246b63ab47a2beef7f2834850811271804633bae350fb8b46b"}},{"ruleId":"D2","level":"warning","message":{"text":"RotateWorld::parse (cognitive 22): RotateWorld::parse has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (22 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/formulas/rotate_world.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e072c4aaecf108b9e299234cde0c32539cba583a31be2574d9e5b09ad46ce7"}},{"ruleId":"D2","level":"warning","message":{"text":"TranslateWorld::parse (cognitive 22): TranslateWorld::parse has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (22 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/formulas/translate_world.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"66436da6a75187ca44458a7cd5a0521916240acb5b5067b33ff494bcb71db01e"}},{"ruleId":"D2","level":"warning","message":{"text":"LayoutBuilder::panel_node (cognitive 22): LayoutBuilder::panel_node has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/export_mcap.rs"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"025c5b61ef1386c65a2dd1d37afeea8fe8bc276a686c30a41ae9120f29011ec0"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::prune::run (cognitive 22): elodin_db::prune::run has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 2 (4 pts), loops 3, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/prune.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"360c31d65528fe580739cd3fa94e0fd0fe08f116acc30e562228e1970df567ad"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::time_align::collect_components (cognitive 22): elodin_db::time_align::collect_components has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/time_align.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5f3ce1e98c81013a9a372df73edccfaa92eedde0a87b029df94de2176950b0"}},{"ruleId":"D2","level":"warning","message":{"text":"StartupLayout::ctx_system (cognitive 22): StartupLayout::ctx_system has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/startup_window.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"98b94100fcac0df96947f6ef52ac8baeca97b09cd398a86b97c56c427fb43fce"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::set_secondary_camera_viewport (cognitive 22): elodin_editor::ui::set_secondary_camera_viewport has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/mod.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"13af4d6615956093a57a954503bfe4097ec47ccc1ec04dc3b3813f8119dadf25"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::schematic::load::strip_singleton_graph_tabs (cognitive 22): elodin_editor::ui::schematic::load::strip_singleton_graph_tabs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ece3a76a05991ceb84eb9faabf04d5476f7346e8ea21334b4e436f5e07f9245"}},{"ruleId":"D2","level":"warning","message":{"text":"impeller_kdl::rewrite::collect_elem_db_asset_names (cognitive 22): impeller_kdl::rewrite::collect_elem_db_asset_names has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (5 pts), boolean chains 4, 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. This shape REPEATS in the file: one other method here (impeller_kdl::rewrite::collect_elem_paths) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/rewrite.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2fe1c4f84aa352e1f83d958757003ab6140d96d8a4cc96ccb2f7d75fe87614"}},{"ruleId":"D2","level":"warning","message":{"text":"impeller_kdl::rewrite::collect_elem_paths (cognitive 22): impeller_kdl::rewrite::collect_elem_paths has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (5 pts), boolean chains 4, 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. This shape REPEATS in the file: one other method here (impeller_kdl::rewrite::collect_elem_db_asset_names) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/rewrite.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"4344b1232d8bcc3250e347ddec92022308e24227c9283d93ce8148ee00da573c"}},{"ruleId":"D2","level":"warning","message":{"text":"monte_carlo::apply_prune_globs (cognitive 22): monte_carlo::apply_prune_globs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1db493a254fa7828962e5e286a365b7ac49a2bc4d97c7e9b75fa825cccfb0e0"}},{"ruleId":"D2","level":"warning","message":{"text":"monte_carlo::ports::reap_port_squatters (cognitive 22): monte_carlo::ports::reap_port_squatters has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/monte-carlo/src/ports.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f56f58684d0235eb6f7ea6412ee1f9f33c7a68a0f0c3b8c500462888bc622e"}},{"ruleId":"D2","level":"warning","message":{"text":"Array::concat_many (cognitive 22): Array::concat_many has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 5 (9 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/array/mod.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"996aafd9bb0d75dcc3c26747017a2e6315362b1175c13a2b06b37eb02c69d5c9"}},{"ruleId":"D2","level":"warning","message":{"text":"StepContext::component_batch_operation (cognitive 22): StepContext::component_batch_operation has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 6 (9 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":"libs/nox-py/src/step_context.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"8842f5b7b76befab6c0b6deed49e0a4f97b3c6f10d21ce445610ac20030cd95d"}},{"ruleId":"D2","level":"warning","message":{"text":"video_toolbox::platform::decompress_callback (cognitive 22): video_toolbox::platform::decompress_callback has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/video-toolbox/src/platform.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d87d1e9b1978e9ce3f83e8e787e1342a4c0f4a4696ea7904862e04773565de3"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin::cli::cloud::upload::run (cognitive 21): elodin::cli::cloud::upload::run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, match/switch 2 (4 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/elodin/src/cli/cloud/upload/mod.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac0444c65f752e3e75efdf7dfdd09e4e35ed0229cb073ff7247491a63751fc68"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::interp::eval_body (cognitive 21): cranelift_mlir::interp::eval_body has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (7 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3dad9ce191afbb0bbb593db753b8bfa7e364a9d534444ad3211d0b5fa52c37"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::interp::sort (cognitive 21): cranelift_mlir::interp::sort has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 3 (5 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":2174}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d01d9a496d7206f39ef4c1f4a318545907e1807f732267aefa61b879d891ffa"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::lower::apply_reduce_op (cognitive 21): cranelift_mlir::lower::apply_reduce_op has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":9786}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5db7504735f021ae5a2663c758dd5bac9bde49d4f19ef9e5a4e5c10e5c627c"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::bin::bench::run_benchmark (cognitive 21): elodin_db::bin::bench::run_benchmark has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 4 (6 pts), match/switch 3 (4 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/bin/bench.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"011d7d3b38ad848425263d921a2c0a96ab41950b39bdd837b8afbb350baa88d7"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::time_align::run (cognitive 21): elodin_db::time_align::run has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 2, loops 2, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/time_align.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff1eb6f000bd45168973198a12cdb74c67affd5fe5128d87781f7f8207d916f8"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::thruster_particles::bind_file_effect_assets (cognitive 21): elodin_editor::plugins::thruster_particles::bind_file_effect_assets has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (20 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":"libs/elodin-editor/src/plugins/thruster_particles/mod.rs"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e03e24a0edac69d4060c86f030d4bfa3482b9ddcb2d5c487a70c281742974a5"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::view_cube::interactions::reset_highlight (cognitive 21): elodin_editor::plugins::view_cube::interactions::reset_highlight has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 1 (2 pts) (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/view_cube/interactions.rs"},"region":{"startLine":1561}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41807ff2aafdd75a1ea0edc9c0d593c8683a621c34976cbda1142797e607e04"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::inspector::viewport::set_viewport_pos (cognitive 21): elodin_editor::ui::inspector::viewport::set_viewport_pos has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 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":"libs/elodin-editor/src/ui/inspector/viewport.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e725d91c1440bf5ed037d2b49bd76d4c9543e1406f55503b99109653e6dc0b"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::plot::data::maybe_compress_all_graph_lines (cognitive 21): elodin_editor::ui::plot::data::maybe_compress_all_graph_lines has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/data.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba54f877ba64b8af2fc0a53e7fcd7de493b8e6de4958e16131e59e311eab572e"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::plot::data::sync_plot_lines_from_series_store (cognitive 21): elodin_editor::ui::plot::data::sync_plot_lines_from_series_store has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/data.rs"},"region":{"startLine":743}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83dd11522c13393e9a5d29682e47a29f75c2ef65ec66acf8d087d390ac297d2"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::sql_eql::process_sql_record_batch (cognitive 21): elodin_editor::ui::sql_eql::process_sql_record_batch has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/sql_eql.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ca176c69d961f9c098758ba932ac810f4fb79d3e06e72d1b1e7e1d099fd202"}},{"ruleId":"D2","level":"warning","message":{"text":"impeller_kdl::ser::serialize_timeline (cognitive 21): impeller_kdl::ser::serialize_timeline has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (20 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":"libs/impeller/kdl/src/ser.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e7031c478b6e1a05f905b4d656573e328a9379f46f564c69e6223324e9f03a"}},{"ruleId":"D2","level":"warning","message":{"text":"ComponentValue::div (cognitive 21): ComponentValue::div has cognitive complexity 21 (threshold 15). Drivers by points: loops 10 (20 pts), match/switch 1 (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/wkt/src/value.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"473f08cc9c5b1a7782993428af8a6b9f24e2b9e83d949aa75056fac38d0dedaa"}},{"ruleId":"D2","level":"warning","message":{"text":"nox_py::impeller_server::prime_schematic_assets (cognitive 21): nox_py::impeller_server::prime_schematic_assets has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 4 (7 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/impeller_server.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"3174a2a193ddec10a52d6f528d22f774ff5153a291c051b5e84a1fd0dac6c664"}},{"ruleId":"D2","level":"warning","message":{"text":"nox_py::impeller_server::copy_db_to_world_for_world (cognitive 21): nox_py::impeller_server::copy_db_to_world_for_world has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/impeller_server.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"102495458e1ffee83d1cd35fbaadc29112d0559bd246201ba43f71ddae755c4c"}},{"ruleId":"D2","level":"warning","message":{"text":"nox_py::ui::schematic (cognitive 21): nox_py::ui::schematic has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/ui/mod.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"a330285625b1256582bdfcf74641462b341c2ae00947ab0005d9001a3a2d6ceb"}},{"ruleId":"D2","level":"warning","message":{"text":"Terrain.__post_init__ (cognitive 21): Terrain.__post_init__ has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 6 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/python/elodin/terrain.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1587d781e8a49215a4e49ecf72b08b221d51efe778605391c4a4efb6f15ce3"}},{"ruleId":"D2","level":"warning","message":{"text":"RegionPackage.node (cognitive 21): RegionPackage.node has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7, ternaries 2 (3 pts), loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"libs/nox-py/python/elodin/terrain_prepare.py"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec94f9ee1a4afe07146ce1b3438bf0be26fcc8ba82fc3335989d100f89315fb"}},{"ruleId":"D2","level":"warning","message":{"text":"cudainfo.test_cuda_workflow (cognitive 21): cudainfo.test_cuda_workflow has cognitive complexity 21 (threshold 15). Drivers by points: error handling 8 (9 pts), if/else 5 (9 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"aleph/scripts/cudainfo.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ac26048f053300cd659705ab7683dca390caf2f75cd38d4f9028b45a0e38fb"}},{"ruleId":"D2","level":"warning","message":{"text":"msp_osd::layout::clamp_to_perimeter (cognitive 20): msp_osd::layout::clamp_to_perimeter has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 5 (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":"fsw/msp-osd/src/layout.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"355a3acd29f935270ad2e9a84dcc9c4d03de2454c15c43923fa50b34a9f92d74"}},{"ruleId":"D2","level":"warning","message":{"text":"GpuPreprocessor::prepare (cognitive 20): GpuPreprocessor::prepare has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 1 (4 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/terrain/preprocess/gpu_preprocessor.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"92cf8ff2e397bd826d553b632854fc31246b05aec45aea539344aa972c596c94"}},{"ruleId":"D2","level":"warning","message":{"text":"bevy_world_mesh::terrain::preprocess::preprocessor::select_ready_tasks (cognitive 20): bevy_world_mesh::terrain::preprocess::preprocessor::select_ready_tasks has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/terrain/preprocess/preprocessor.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"169a5a1efa8fe0776a882aa5137a41e675119e2c301c994fc371c392ec3c4a28"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::const_fold::fold_body (cognitive 20): cranelift_mlir::const_fold::fold_body has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/const_fold.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ca54bef784ac96df40c08e329493a67fa706e33fa4c7b40fe6c984e88c1c3f"}},{"ruleId":"D2","level":"warning","message":{"text":"Client::add_methods (cognitive 20): Client::add_methods has cognitive complexity 20 (threshold 15). Drivers by points: if/else 18 (19 pts), loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/cli/src/lib.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"d068fccb636470a18ec328667c5c51cd103cba90bd9dbbec0883e7bbb2e26032"}},{"ruleId":"D2","level":"warning","message":{"text":"Context::parse (cognitive 20): Context::parse has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 4 (9 pts) (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":"libs/db/eql/src/lib.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25dfe80dedfcf140334e2ee1006abb70434c45f0d5890792215e904cee309c0"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::grpc::stream::run_fixed_components (cognitive 20): elodin_db::grpc::stream::run_fixed_components has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/grpc/stream.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"90ad3087a134fc6067d563ccd5c7b60f21f7983ae0022f59a2456574bf7fe91a"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::trim::run (cognitive 20): elodin_db::trim::run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/trim.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"273daad2a6eaeeda68ba14c3a7dce3b94ef1f29fee1dfb4ecd13118e437923a4"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::run::run_recipe_at_with_execution (cognitive 20): elodin_editor::run::run_recipe_at_with_execution has cognitive complexity 20 (threshold 15). Drivers by points: if/else 16 (20 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/run.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bf51652581838fb35c424d95e608aa1f0bdbccd28ee78c38553e6a8d0c4c442"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::inspector::graph::add_component_widget (cognitive 20): elodin_editor::ui::inspector::graph::add_component_widget has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, 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":"libs/elodin-editor/src/ui/inspector/graph.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"99863f61f87791a6a71884f7738dd3cb965406c11ff68fa605a47fdf2181969c"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::window::placement::apply_window_screen (cognitive 20): elodin_editor::ui::window::placement::apply_window_screen has cognitive complexity 20 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/window/placement.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"200182bab5ec27990cc8d96cae0ac4f1de4499ff1f707a91f0c69177f650ced7"}},{"ruleId":"D2","level":"warning","message":{"text":"impeller_kdl::rewrite::rewrite_elem (cognitive 20): impeller_kdl::rewrite::rewrite_elem has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (5 pts), boolean chains 3, 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":"libs/impeller/kdl/src/rewrite.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98e48810660b6ec7f6af828ea30f6912740c89b99dfd804db8c361ac6abde5b"}},{"ruleId":"D2","level":"warning","message":{"text":"Noxpr::shape (cognitive 20): Noxpr::shape has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75a741f7dc0bd011e202581b1743486e0c75b61b3dc539dc73fba318a60dbf3"}},{"ruleId":"D2","level":"warning","message":{"text":"nox_py::impeller_server::commit_world_head_for_world (cognitive 20): nox_py::impeller_server::commit_world_head_for_world has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/impeller_server.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"11408de37cce5d9bb4cf5c9b0353012a7f6b9ccecbdc1a36a1ab4ec94ec3e930"}},{"ruleId":"D2","level":"warning","message":{"text":"Server::process_msg (cognitive 19): Server::process_msg has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 2 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/roci/src/tokio.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"17391740e413ded9f54bca72f4ac70bab7903860190293ce8c44b7bc1e588184"}},{"ruleId":"D2","level":"warning","message":{"text":"Ubx::parse_byte (cognitive 19): Ubx::parse_byte has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/ubx.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"895b7ba7e008e59459aaf0abd9f84d3893fd1a210924828822d6646f1059e932"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::lower::compile_module_with_config (cognitive 19): cranelift_mlir::lower::compile_module_with_config has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 7, boolean chains 2, match/switch 1 (2 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"02dd0851b4302b3c1834314e20d2ccb255e6a0580c05cb563475ab13e6b36ce6"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::lower::cranelift_cholesky (cognitive 19): cranelift_mlir::lower::cranelift_cholesky has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (15 pts), if/else 4 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":10494}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae98047b067c41d1e127e4773f77b04e2427a3da432f141621124b86205b925e"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::lower::cranelift_gelsd (cognitive 19): cranelift_mlir::lower::cranelift_gelsd has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 2 (6 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":11355}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f59c4786d8f12df81e345983fc8c81f66392e281ade8f242a489e503c1aaa5"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::parser::extract_padding_attr (cognitive 19): cranelift_mlir::parser::extract_padding_attr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 2 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":2774}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4b2117250e5a726a3641a5a0580e1ce0776707934a4a32f8256b91b1391381"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::parser::parse_case_op (cognitive 19): cranelift_mlir::parser::parse_case_op has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":2891}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed30d8c3f851b310cccfab52024097d486d71e43aac86f0d621b2715b101229f"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::tensor_rt::argminmax (cognitive 19): cranelift_mlir::tensor_rt::argminmax has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 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":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea9fab0d4e7a01d3b7a9f5922121ef07ea0d8afb800534c145fb9d002c414fd"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::export::fixed_size_list_to_string (cognitive 19): elodin_db::export::fixed_size_list_to_string has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (4 pts), match/switch 2 (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/export.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e89c12925710ed576f85bdf2597ac892dde19f478fc02d1ef5e113c9dab97c"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::export_videos::export_one_h264 (cognitive 19): elodin_db::export_videos::export_one_h264 has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (3 pts), loops 2, 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":"libs/db/src/export_videos.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"703c181baa60d3ca726e72d259f27d1f0b708dd6615988e7083132f0423dc16d"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::grpc::stream::run_fixed_messages (cognitive 19): elodin_db::grpc::stream::run_fixed_messages has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), match/switch 2 (5 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":"libs/db/src/grpc/stream.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a74161f634145ecddc172bac4a8c95a175a3c9174ed80379416b16aaece619"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::sensor_h264::take_ready_frames (cognitive 19): elodin_editor::sensor_h264::take_ready_frames has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 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":"libs/elodin-editor/src/sensor_h264.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f48f71d7f4939270c61074ffb41d6a00ecd1468fd7411bc1bea2bea5d50eb8"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::data_overview::process_sparkline_result (cognitive 19): elodin_editor::ui::data_overview::process_sparkline_result has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/data_overview/mod.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"caaad4f2794a3c8fa16ac5a943b33cffa93e9184eef8ab92131468bda80b5187"}},{"ruleId":"D2","level":"warning","message":{"text":"TelemetryCache::rebucket_predecessors (cognitive 19): TelemetryCache::rebucket_predecessors has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (4 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"50f62ece07d2d3b8062e9ec5c58cd7cfe658efa0432814d6d628142cfd708a75"}},{"ruleId":"D2","level":"warning","message":{"text":"impeller_kdl::de::parse_environment (cognitive 19): impeller_kdl::de::parse_environment has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (16 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1655643f138234c863ed1c8c700f18f5b7ca745a5f566cca6d2a3ed2892d3d5"}},{"ruleId":"D2","level":"warning","message":{"text":"monte_carlo::ports::allocate_db_ports (cognitive 19): monte_carlo::ports::allocate_db_ports has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/monte-carlo/src/ports.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"151c9e0b631ca7e2ae6ba067eb4748f294ff631bdd707a49ad268490fdbd41ea"}},{"ruleId":"D2","level":"warning","message":{"text":"ArrayView::fmt::format_recursive (cognitive 19): ArrayView::fmt::format_recursive has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/array/src/lib.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a2d42eeb9f4af1fb5f89da5611250ca7ed50c598188984d3e88d5ab5119ce3"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphQuery::edge_fold (cognitive 19): GraphQuery::edge_fold has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/graph.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"b552b1cc3899c4559bedf22175e7e935c390198a64eb41b0e7884977275790d8"}},{"ruleId":"D2","level":"warning","message":{"text":"diff_profile.main (cognitive 19): diff_profile.main has cognitive complexity 19 (threshold 15). Drivers by points: loops 9 (11 pts), boolean chains 4, if/else 2 (3 pts), error handling 1 (nesting depth added 3). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/scripts/diff_profile.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f83ed1c1198348b52159eb48230b0a74b03573b395fbdba6e72a775482377fc"}},{"ruleId":"D2","level":"warning","message":{"text":"inscriber::main (cognitive 18): inscriber::main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (7 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/inscriber/src/main.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"767663ef11a8c26a438bac038148b5320d3f250331aaa51b64d2f7b37f5c27e9"}},{"ruleId":"D2","level":"warning","message":{"text":"inscriber::list_external_disks (cognitive 18): inscriber::list_external_disks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/inscriber/src/main.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d9f641a8303b98e036744f54eff0a03fe1290302a4d88486f2d8270a811cc7"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::lower::cranelift_lu (cognitive 18): cranelift_mlir::lower::cranelift_lu has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 3 (7 pts) (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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":10378}}}],"partialFingerprints":{"codehealthFindingId/v1":"8068229dfb4a0ac119bb42adfab025010fdb27f88f38a39349487a5b275cf037"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::parser::parse_dot_general_op (cognitive 18): cranelift_mlir::parser::parse_dot_general_op has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4ac0b28fc5f4ca243a22b09fa2f031e45e10e1c3402502595796e01cb92cf8"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::tensor_rt::tensor_broadcast_nd_generic (cognitive 18): cranelift_mlir::tensor_rt::tensor_broadcast_nd_generic has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 5 (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":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"012b0f2f668d71143909022ee8cbd17d232c3c5e3a305ff8165ee5816ff79903"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::export::run (cognitive 18): elodin_db::export::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/export.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"b99a4ce02b30d8a6831ab43a0899b1323e17bfd15cf127a0bad5ac0781b1762d"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::follow::apply_follow_time_series (cognitive 18): elodin_db::follow::apply_follow_time_series has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/follow.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd5a369b568a0796c50d6381de89887b570831d3c4fffc4bb6cac9aaf31cbe7"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::query::run (cognitive 18): elodin_db::query::run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 2, boolean chains 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/query.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"2673e2803bf0cdba3cfb2d7cce3a19a26df00847f46d20a95df22afd5a0457a6"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::query::print_record_batch_csv (cognitive 18): elodin_db::query::print_record_batch_csv has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 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":"libs/db/src/query.rs"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"71232af4ba64f74208987d5d76b873b1ca3dc5748fe3abc018501663aa998506"}},{"ruleId":"D2","level":"warning","message":{"text":"InspectorSensorCamera::ui_system (cognitive 18): InspectorSensorCamera::ui_system has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/sensor_camera.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd44fee13315d12a1c9cafa5e27ab857393c81d0011c27e47128b17562f9a68"}},{"ruleId":"D2","level":"warning","message":{"text":"StatusBar::ctx_system (cognitive 18): StatusBar::ctx_system has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (16 pts), match/switch 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"libs/elodin-editor/src/ui/status_bar.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc14a1e2ff384e923d9dddbdb117248bf38044f7b0b1f58e8c992fe7c30879f"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::object_3d::compile_eql_expr_with_ctx (cognitive 18): elodin_editor::object_3d::compile_eql_expr_with_ctx has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 4 (8 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":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc6010f63a08baea530b2d29d525dd14ba94ba05a31b70a62453ecdbd394b1e"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::cinematic_earth::tag_globe_meshes (cognitive 18): elodin_editor::plugins::cinematic_earth::tag_globe_meshes has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/cinematic_earth/mod.rs"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"1868360049febc16b476fa04b0058ebacda0afae0e9039d8d8ca46541abe20d8"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::gizmos::cleanup_removed_arrows (cognitive 18): elodin_editor::plugins::gizmos::cleanup_removed_arrows has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/gizmos/mod.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"4850bcc3fb4cc643668d0ad55722399226fa079ed334bd6297440205cbbfeab1"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::hw_stats::log_render_error (cognitive 18): elodin_editor::plugins::hw_stats::log_render_error has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 3 (8 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/hw_stats.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b3dbf2ef8761ba6d28507aa32b309e61ebc7c8ec85cc644e9648d912c2ce05"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::view_cube::interactions::on_cube_click (cognitive 18): elodin_editor::plugins::view_cube::interactions::on_cube_click has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 1, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/view_cube/interactions.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b8767ccb90d7b94baeb065671e4c2118a48698b0e3dcbef9b21bd3228a367c4"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::set_camera_viewport (cognitive 18): elodin_editor::ui::set_camera_viewport has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/mod.rs"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f055d2290621f91618aa7fdf084f102efd88267f4200d902ef55f384be2733"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::timeline::timeline_controls::live_follow_button (cognitive 18): elodin_editor::ui::timeline::timeline_controls::live_follow_button has cognitive complexity 18 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/timeline/timeline_controls.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c0eb9b3d15288486f99a451dbfbdf9c9b9da0308cf39bbc79cf3cce45bad8a"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::window::placement::handle_window_relayout_events (cognitive 18): elodin_editor::ui::window::placement::handle_window_relayout_events has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), match/switch 2 (5 pts), loops 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/window/placement.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"53dce041499142a4fb851880b95f3f74c5731acdcfbe8b6b28b694c9bae92e88"}},{"ruleId":"D2","level":"warning","message":{"text":"impeller_kdl::de::parse_timeline (cognitive 18): impeller_kdl::de::parse_timeline has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dee129c134280cc3a53c6553f43d535f5f6ecbc753f85d57038bee62d2f7964"}},{"ruleId":"D2","level":"warning","message":{"text":"TelemetryExtractor::apply_value (cognitive 17): TelemetryExtractor::apply_value has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/db_client.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"532296ba523c49951a0350f9c96b33277575c6844f05cdfad097cbfc8a92aee7"}},{"ruleId":"D2","level":"warning","message":{"text":"bevy_world_mesh::terrain::debug::toggle_debug (cognitive 17): bevy_world_mesh::terrain::debug::toggle_debug has cognitive complexity 17 (threshold 15). Drivers by points: if/else 17. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/terrain/debug/mod.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5f25a49a3aa7d317d9585c8b2d8cb96bddfc5d1c5fe11119e4ee2cddb87ac1c"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::const_fold::concat_dense_arrays (cognitive 17): cranelift_mlir::const_fold::concat_dense_arrays has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/const_fold.rs"},"region":{"startLine":1331}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec696bded6457f27ee334090c3473bd724948e2bebad2789ba1cc580cec8518"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::inliner::plan_single_caller_inlines (cognitive 17): cranelift_mlir::inliner::plan_single_caller_inlines has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/inliner.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"801181ff6f56fc870ae0de9b8e8318fd7ebc6575eab789f589c79acf5f008747"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::tensor_rt::tensor_scatter (cognitive 17): cranelift_mlir::tensor_rt::tensor_scatter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 3 (5 pts), match/switch 2 (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":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac74acf46eaf59ede0250e099d944ec0f46eb4e63e77e62939260f90cc6af61"}},{"ruleId":"D2","level":"warning","message":{"text":"IngestServiceImpl::open_session (cognitive 17): IngestServiceImpl::open_session has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 3, boolean chains 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/grpc/ingest.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"645a719f934755ace14349838f7dfbf1a9179a75da182da325d17455d660e66b"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::assets_http::fetch_source_asset (cognitive 17): elodin_db::assets_http::fetch_source_asset has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (11 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/assets_http.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdba7e84848072f9350db0fecfb00afa15eea0f887b8dd5b12a954930fa788f2"}},{"ruleId":"D2","level":"warning","message":{"text":"LogStreamWidget::ui_system (cognitive 17): LogStreamWidget::ui_system has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/log_stream.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c02563b9eafc4420c6b870329f969a297d3bc0cd3b6ea3036e70674bd4bc6fba"}},{"ruleId":"D2","level":"warning","message":{"text":"Branch::show (cognitive 17): Branch::show has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"libs/elodin-editor/src/ui/schematic/tree.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c5d3e2823802bcdc2fff345046888cecd5b0305798860d32af28b0ed24f137"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewportPane::spawn (cognitive 17): ViewportPane::spawn has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, boolean chains 2, match/switch 2. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"a347bd9e718cd09e74e0c309052fe34df0815bcada451b881aa42482eec28667"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::object_3d::warn_imported_cameras (cognitive 17): elodin_editor::object_3d::warn_imported_cameras has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":1698}}}],"partialFingerprints":{"codehealthFindingId/v1":"3280fc4c89d8e5128cef831d218d9ad58bdb9dfabe443ab4411fb55e9dd41628"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::frustum_intersection::volume::compute_intersection_volume (cognitive 17): elodin_editor::plugins::frustum_intersection::volume::compute_intersection_volume has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (6 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":"libs/elodin-editor/src/plugins/frustum_intersection/volume.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a59129a755c6b10b35ee120c9334b6bd8d3e4ebb112b3f438e72f08e28d605"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::plot_3d::point_trails::extract_point_trails (cognitive 17): elodin_editor::ui::plot_3d::point_trails::extract_point_trails has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot_3d/point_trails.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e2767daaea24bc2677982e22f91bcad78ed3292bcf84edf2b2b29c59caf1bb"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::schematic::tiles_to_schematic (cognitive 17): elodin_editor::ui::schematic::tiles_to_schematic has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2, 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":"libs/elodin-editor/src/ui/schematic/mod.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"964c64e0526b365fe7b28767a4a248aeb582411a1ccf9777955271bcb0a83ef6"}},{"ruleId":"D2","level":"warning","message":{"text":"hamann_chen_line::main (cognitive 17): hamann_chen_line::main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 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":"libs/hamann-chen-line/src/main.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"4973ffcf07bec6aa98ba4d2a55c10eb5ea16c0a38fd9b90dc02970fcda13e3a8"}},{"ruleId":"D2","level":"warning","message":{"text":"ReadyProbe::wait (cognitive 17): ReadyProbe::wait has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/src/probe.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"176993d30fe0832e81e215180e7b43b3bd621c20958a8f62fb1fcc161a754a91"}},{"ruleId":"D2","level":"warning","message":{"text":"sample._validate_variable (cognitive 17): sample._validate_variable has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 7 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/python/elodin/monte_carlo/sample.py"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6e19a1c9a91c133267db7cab20bdca694ffb6d3c204af6d95082ebf6a3e7303"}},{"ruleId":"D2","level":"warning","message":{"text":"broadcast_component.get_network_broadcast (cognitive 17): broadcast_component.get_network_broadcast has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 2 (4 pts), boolean chains 1, error handling 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":"fsw/udp_component_broadcast/broadcast_component.py"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd0fafd2d57920c5792ba7da11b50c3294ca2612f533cf22a8f8b8778005ee4f"}},{"ruleId":"D2","level":"warning","message":{"text":"memserve::memserve::parse_args (cognitive 16): memserve::memserve::parse_args has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (6 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":"docs/memserve/memserve.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7dbaedb4df9e84a5c76598114399a236635897338cd2547ea482bda3f7ebfe"}},{"ruleId":"D2","level":"warning","message":{"text":"Coordinate::from_world_position (cognitive 16): Coordinate::from_world_position has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/terrain/math/coordinate.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad24bb6303fa9f4dff2f539ea0cd34aecdfc621435856386ad7399117a0c2d3"}},{"ruleId":"D2","level":"warning","message":{"text":"TerrainPipelineFlags::from_debug (cognitive 16): TerrainPipelineFlags::from_debug has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (TerrainPipelineFlags::shader_defs) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/terrain/render/terrain_material.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc550e551d1758e6dff4eb5e0f77f460839bf22612cbfe610cd9803fcf652462"}},{"ruleId":"D2","level":"warning","message":{"text":"TerrainPipelineFlags::shader_defs (cognitive 16): TerrainPipelineFlags::shader_defs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 16. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (TerrainPipelineFlags::from_debug) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/terrain/render/terrain_material.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfb2474c4e06e1a83230e9f7d5af4edd83fcc33b7f49dfdcfd6857d00f1d545"}},{"ruleId":"D2","level":"warning","message":{"text":"bevy_world_mesh::terrain::preprocess::dispatch_terrain_preprocess (cognitive 16): bevy_world_mesh::terrain::preprocess::dispatch_terrain_preprocess has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (8 pts), if/else 2 (4 pts), match/switch 1 (4 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/terrain/preprocess/mod.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"38447dbdf642db409f1e7666224b384cb3631a851c161281d14a91d9dc72358e"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::inliner::rewrite_block_param_ids_instr (cognitive 16): cranelift_mlir::inliner::rewrite_block_param_ids_instr has cognitive complexity 16 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 1, match/switch 1 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/inliner.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"b065009643b268e3984d906449f793cefc07de02fda10310f17c7a2baf827e70"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::interp::reduce (cognitive 16): cranelift_mlir::interp::reduce has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (8 pts), match/switch 2 (4 pts), boolean chains 2, if/else 2 (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":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"003fcea354bb6dd7a8ef26ed62b3df519579fb72474a78e54945ad8588a289a0"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::lower::lower_case (cognitive 16): cranelift_mlir::lower::lower_case has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 5 (7 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":8652}}}],"partialFingerprints":{"codehealthFindingId/v1":"3daeb57c51a79cc284a259ec9e0769d1fa47f95503227f49e329e44c2ef7c241"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::lower::lower_concatenate_nd (cognitive 16): cranelift_mlir::lower::lower_concatenate_nd has cognitive complexity 16 (threshold 15). Drivers by points: loops 6 (9 pts), if/else 3 (7 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":9543}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7fe2ec04fef64e6e76d1cc6a2e2f14490111da535580f2af0e6a9b93cad6bd"}},{"ruleId":"D2","level":"warning","message":{"text":"cranelift_mlir::parser::parse_return (cognitive 16): cranelift_mlir::parser::parse_return has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, 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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":2966}}}],"partialFingerprints":{"codehealthFindingId/v1":"436cf604ec35379a5e020d8fdcb861ce58e6a61fef4374e076f23c1e3629c308"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::compact::compact (cognitive 16): elodin_db::compact::compact has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/compact.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d08445213f7f71cb5d555c14e87990d82863c674b64ac9ffae7e0b83b46cd4b"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::drop::run (cognitive 16): elodin_db::drop::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), match/switch 4 (5 pts), loops 2 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/drop.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6a813a3f924092209d70da48cd9261e9e0474915ef6d3cd621eaba8fcd71a62"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_db::drop::collect_all_components (cognitive 16): elodin_db::drop::collect_all_components has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/drop.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2422bf9801d3ba597d8bad46b39b7278c043244656fa645a81ab9d75fbdaa4"}},{"ruleId":"D2","level":"warning","message":{"text":"LineTree::evict_chunks_outside (cognitive 16): LineTree::evict_chunks_outside has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/data.rs"},"region":{"startLine":2378}}}],"partialFingerprints":{"codehealthFindingId/v1":"3164ac2817794e2487d9833bc54eaf4fe470c37b9ce654e0af90eeed776aa49a"}},{"ruleId":"D2","level":"warning","message":{"text":"LineTree::visible_plot_strips (cognitive 16): LineTree::visible_plot_strips has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/data.rs"},"region":{"startLine":2841}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d7010166183d1be4292831ac2dedb946d8989d9f547e9aae50df629900dc03"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::object_3d::spawn_mesh (cognitive 16): elodin_editor::object_3d::spawn_mesh has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f623d0a9fbde5fb04f5fe3158c567d3e7fa15046725d1b336c61f817a73ecf59"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::cinematic_earth::sync_cinematic_earth (cognitive 16): elodin_editor::plugins::cinematic_earth::sync_cinematic_earth has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/cinematic_earth/mod.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6dc98b9bb5228b8712b79caaa804e27c783aca67145b9c0e3afc5521e8719ab"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::plugins::screenshot::capture_screenshot (cognitive 16): elodin_editor::plugins::screenshot::capture_screenshot has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/screenshot.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf24a6a105a410841c3d0b0bcf7628370297ffa2f6787b8d6621ea338507f489"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::sensor_camera::image_copy_driver (cognitive 16): elodin_editor::sensor_camera::image_copy_driver has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (4 pts), match/switch 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/sensor_camera.rs"},"region":{"startLine":1599}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe137e6af21ba09f19cbe238f87959892c1ad95eec8a3bf38a873d48f9056f9"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::gauges::orientation::paint_frame_sphere (cognitive 16): elodin_editor::ui::gauges::orientation::paint_frame_sphere has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/gauges/orientation.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03604b3ed4318288fe02cc7bd83f80803f7710dbce6a4dd5a77c7e61c135a00"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::plot::widget::wasm_sample_y_bounds (cognitive 16): elodin_editor::ui::plot::widget::wasm_sample_y_bounds has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":1552}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea909c6e1f5871ea6128ca5af37df449af40006ddf8f8011499ea6f5fab907b2"}},{"ruleId":"D2","level":"warning","message":{"text":"elodin_editor::ui::window::placement::apply_window_rect (cognitive 16): elodin_editor::ui::window::placement::apply_window_rect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/window/placement.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e199ff2924e5b5f1157e9649f47e2100913436ccf6c5ceae23c244cbe013522"}},{"ruleId":"D2","level":"warning","message":{"text":"TelemetryCache::drop_coverage (cognitive 16): TelemetryCache::drop_coverage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c91e069b216dc92d9dc3fb9e08d7bb9be311dcb3cc08939dd6289219b5e70a5"}},{"ruleId":"D2","level":"warning","message":{"text":"impeller_kdl::de::parse_schematic (cognitive 16): impeller_kdl::de::parse_schematic has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6dee99e4c35726484403ba46a850948357dd26d97e9ab511835cfa33be3e2e3"}},{"ruleId":"D2","level":"warning","message":{"text":"impeller_kdl::de::parse_object_3d (cognitive 16): impeller_kdl::de::parse_object_3d has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"34385ccbd2cebf467a5b6327e679b5f1d48c0ab343743b9ac6c2b6b6755a19b1"}},{"ruleId":"D2","level":"warning","message":{"text":"impeller_kdl::de::parse_color_from_node (cognitive 16): impeller_kdl::de::parse_color_from_node has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5 (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":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":2781}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9186c7688c426d0f145cc3f5cf1ea434a052409030f85f04985fb22d7b10d2"}},{"ruleId":"D2","level":"warning","message":{"text":"s10::probe::wait_for_log (cognitive 16): s10::probe::wait_for_log has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/src/probe.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6037d1771d68e7e69184d3bfec7b06ffe0721a73c908f36b5496ec5727d022"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cranelift_mlir::lower::lower_instruction_mem: FunctionTooLong \u2014 cranelift_mlir::lower::lower_instruction_mem runs 2270 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2170 over it, 22.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":4008}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc3fdb0bca99af71964d4b8b41da44d93963cf7cc0b20496fadfbb7b58bdbc8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lower.rs: FileTooLong \u2014 8699 significant 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 189 free functions. The bar is 500 significant lines; this is 8199 over it, 17.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca77483df1e0edebc25f93beb986287e982b69951ca2e865d5f56bd5b2169bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cranelift_mlir::lower::lower_instruction: FunctionTooLong \u2014 cranelift_mlir::lower::lower_instruction runs 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) in one body. The bar is 100 significant lines; this is 1112 over it, 12.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":6882}}}],"partialFingerprints":{"codehealthFindingId/v1":"34720bc57d99e4997be52af46a756fdbbdcd0f89cad748afc7fed4dfd613b19e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorldBuilder.run: MethodTooLong \u2014 run runs 667 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 567 over it, 6.67\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ed35e4757b921f214e8a032ecbea1d9fbfc1975c2847993450941d3cc741710"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 3198 significant 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 101 free functions. The bar is 500 significant lines; this is 2698 over it, 6.40\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ed05a339db9edb85cc61aafa10e084d4522d126e7931f3aa9a25b3d6f7cf32"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/tiles.rs: FileTooLong \u2014 2840 significant 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 2340 over it, 5.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f502b7dd24917567c03ec64c76697ca32a4ad03b45fa56d37d2fd0efed3b7787"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: sensor_fw::main: FunctionTooLong \u2014 sensor_fw::main runs 548 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 448 over it, 5.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":"fsw/sensor-fw/src/main.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"19cff0db400607c14ddf4d746e358d1d6b980e6af5babfb1ed6dacbe6ec6d0cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plot/data.rs: FileTooLong \u2014 2577 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 45 free functions. The bar is 500 significant lines; this is 2077 over it, 5.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":"libs/elodin-editor/src/ui/plot/data.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6766880791ae510c861e808e3c6ac5d3afab4397e7d3ac16b16fbb8c0b0acfe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/parser.rs: FileTooLong \u2014 2560 significant 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 78 free functions. The bar is 500 significant lines; this is 2060 over it, 5.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d85d84c62109c93f4608734b6288a9585f7fe47d207e06ed90690ebc142395"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: TensorRtIds: TooManyFields \u2014 153 stored fields. The bar is 30 stored fields; this is 123 over it, 5.10\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"8828fb42518f6ba5e46ecada652499d3bcfaa8eda7d3ce908744844820a4217d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_db::handle_packet: FunctionTooLong \u2014 elodin_db::handle_packet runs 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) in one body. The bar is 100 significant lines; this is 406 over it, 5.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/lib.rs"},"region":{"startLine":2145}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e9489da8bf219faed0d24adf9503c8e3595c2e03cdf543feb00d62d29628c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 2519 significant 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 2019 over it, 5.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1141528029e02af4bbf7342d57d850538b229edcc8722a73ae0d62867ef0898b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TileLayout.ui_system: MethodTooLong \u2014 ui_system runs 466 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 366 over it, 4.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":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":3195}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e6c6e8071083a1411ea0487d3f047f3b07442a6802e2e58487489d70d23a50b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InspectorObject3D.ui_system: MethodTooLong \u2014 ui_system runs 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) in one body. The bar is 100 significant lines; this is 361 over it, 4.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/object3d.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"7809e1ba71b0b9a8d1d34fd9fa089c78b8b11aae204e4f1408bba027142e7894"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/de.rs: FileTooLong \u2014 2158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 74 free functions. The bar is 500 significant lines; this is 1658 over it, 4.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7cb5a773e860a22417ff856c5174815d4747c901ab1ad76689ae37343477ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plot/widget.rs: FileTooLong \u2014 2064 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 39 free functions. The bar is 500 significant lines; this is 1564 over it, 4.13\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f70c36a1fc152c176685a3d61c47aea6214d90d8773616539755f3def6cbb91"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/object_3d.rs: FileTooLong \u2014 2062 significant 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 66 free functions. The bar is 500 significant lines; this is 1562 over it, 4.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"029adb19f3419096eab5af578fcd86a32f3e91f3760e5ee422022886dfe31e5a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoadSchematicParams.spawn_panel: MethodTooLong \u2014 spawn_panel runs 410 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 310 over it, 4.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"694007c5c2a3e187ee405b3ba8692411ebaa6f9e1904422daa58e0cc899f0242"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/export_mcap.rs: FileTooLong \u2014 2044 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 63 free functions. The bar is 500 significant lines; this is 1544 over it, 4.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/export_mcap.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b392e95ecb9e9240fb0f00bb37801636cb250c6118bfffb7d294ff3b1e6ce6d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/interp.rs: FileTooLong \u2014 1990 significant 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 65 free functions. The bar is 500 significant lines; this is 1490 over it, 3.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":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c75c8652d71aa85154284f9f8a5387749f436d7f0c2560f98587eeaa39e4973"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WorldBuilder: ClassTooLong \u2014 1520 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 17 methods, 4 blocks, lines 137-2324. The bar is 400 significant lines; this is 1120 over it, 3.80\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a25c68135b7333ab00b4c92425628f58c915fb3eccb6585ee6595e9bca6e739"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: noxpr/node.rs: FileTooLong \u2014 1835 significant 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 1335 over it, 3.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e4f73c233aa4e2f62491ace18d24d6d24fb848b4abcddd2e227811b827f899"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1767 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 1267 over it, 3.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"18280b0323a6ba19a20bb383b04ae91f0f2b3f79a23ee0956e2f6df47e732a65"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::plugins::frustum_intersection::draw_frustum_ellipsoid_intersections: FunctionTooLong \u2014 elodin_editor::plugins::frustum_intersection::draw_frustum_ellipsoid_intersections runs 353 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 253 over it, 3.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":"libs/elodin-editor/src/plugins/frustum_intersection/mod.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"05332e21f60475f8b4ffe2a3855ba6ffe808301519955c86237ebec033a88827"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: command_palette/palette_items.rs: FileTooLong \u2014 1762 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 57 free functions. The bar is 500 significant lines; this is 1262 over it, 3.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/command_palette/palette_items.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b131caa848f5317e1304f6de10a3158330682cf336dce94da89b58ae8f290af3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataOverviewWidget.ui_system: MethodTooLong \u2014 ui_system runs 345 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 245 over it, 3.45\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/data_overview/mod.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc22fe3ffb26b5dcf757825e2bf4c8c1c7a7d2051aff3a6fccb492453462774"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_db::main: FunctionTooLong \u2014 elodin_db::main runs 343 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 243 over it, 3.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/main.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd45d45c178f8fc281c97009acd3b7836eef9f956301c055d2fee9685292526"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Pane.ui: MethodTooLong \u2014 ui runs 343 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 243 over it, 3.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"1917ecebb27de51d6697aef6e21bd3f8e9daffbf81e90c9592b9023e8d8e08c1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/world_builder.rs: FileTooLong \u2014 1705 significant 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 89% of them inside a single declaration: WorldBuilder (4 blocks, 137-2324). The bar is 500 significant lines; this is 1205 over it, 3.41\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b92a434aeb444fb4401af531dfe3861bb3d486eaa1ca84d47c38141b5a105b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1669 significant 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 59 free functions. The bar is 500 significant lines; this is 1169 over it, 3.34\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7590ac14c5b2958527691084df1859b026a61d919fe84aeb7a4a09df3b08f8e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tensor_rt.rs: FileTooLong \u2014 1639 significant 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 175 free functions. The bar is 500 significant lines; this is 1139 over it, 3.28\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aebe5dee21dee3b120adfe3822174441f9a4a956a607bd1cd9269397d09570d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cranelift_mlir::const_fold::try_fold: FunctionTooLong \u2014 cranelift_mlir::const_fold::try_fold runs 312 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 212 over it, 3.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/const_fold.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff889a6c48ba8533cb971843f81d44faf3e34813e45ae00cf815cd04cca833d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/const_fold.rs: FileTooLong \u2014 1540 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 55 free functions. The bar is 500 significant lines; this is 1040 over it, 3.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/const_fold.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c20ecfc87af9a898c3af72e080a113ff49e51c155d5bc0e2f2e0dab7fb6e83"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/gui.rs: FileTooLong \u2014 1518 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 38 free functions. The bar is 500 significant lines; this is 1018 over it, 3.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/wkt/src/gui.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e972cb6dbc913ec773bcfaea65f2e97dd50a5b3b691a0e0fda3c1ad4201734b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: schematic/load.rs: FileTooLong \u2014 1492 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 69% of them inside a single declaration: LoadSchematicParams (2 blocks, 270-1792). The bar is 500 significant lines; this is 992 over it, 2.98\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7063d274d1e69ee1ec0700986c03267f1f2ec3d1e60e0548cfd545290b91eeb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cranelift_mlir::profile::dump_report: FunctionTooLong \u2014 cranelift_mlir::profile::dump_report runs 283 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 183 over it, 2.83\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/profile.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f3cea74445c4b3756b743e8942e612ffc8887159228164bbf6e7e220d06c14"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InspectorViewport.ui_system: MethodTooLong \u2014 ui_system runs 282 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 182 over it, 2.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/viewport.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c771f8774dae21a0171827315925244715a37a395efff4797be2090c263442"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SchematicParam.get_panel_from_state: MethodTooLong \u2014 get_panel_from_state runs 273 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 173 over it, 2.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/mod.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"c200bcbc12c7c40946d43d17f9865aa69cbcf44a169b142494edd7fd70472ee1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sensor_camera.rs: FileTooLong \u2014 1348 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 36 free functions. The bar is 500 significant lines; this is 848 over it, 2.70\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/sensor_camera.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62788ddd1931a1e8bb78087648cde831913251d55c534a81a2d0671141fc87a7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PrettyPrintTracer.visit: MethodTooLong \u2014 visit runs 269 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 169 over it, 2.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":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":2333}}}],"partialFingerprints":{"codehealthFindingId/v1":"becaeac608befbf63611881dcdec4ae8c0a43de11fd15ec56a8c6994b255ee53"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/builders.rs: FileTooLong \u2014 1321 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 63 free functions. The bar is 500 significant lines; this is 821 over it, 2.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/ui/builders.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0ff8adf48c712cc3347af645d53ad14c89808118f5e4f9bd44fb46cff0d9264"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: EditorPlugin.build: MethodTooLong \u2014 build runs 264 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 164 over it, 2.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/lib.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"35f5fb0bf32bfd929ce193f2c7068b4521674c886f2aeaa0d10ef9628427509f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TimelineControls.ui_system: MethodTooLong \u2014 ui_system runs 258 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 158 over it, 2.58\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/timeline/timeline_controls.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"9287a91f9ef16f4fccb95fbe050885941997310b07bd48890fda1fe0ad2bd2c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::plugins::view_cube::camera::handle_view_cube_editor: FunctionTooLong \u2014 elodin_editor::plugins::view_cube::camera::handle_view_cube_editor runs 256 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 156 over it, 2.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/view_cube/camera.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"1368236450fc5ec8ddacbe0938d71f14259aa032f799fc2ccdeaa72b31fc68a0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LoadSchematicParams: ClassTooLong \u2014 1023 significant 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 270-1792. The bar is 400 significant lines; this is 623 over it, 2.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":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0c85778649a8640b3ce765bfb3b3ed2ea038a7e377e2888cef68b422c3bc96"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 1276 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 32 free functions. The bar is 500 significant lines; this is 776 over it, 2.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_ai_skybox/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ee33d651dada7d3a07417ed46c1f5b320325fac4639b2853d5c92b96e19edf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/video_stream.rs: FileTooLong \u2014 1260 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 760 over it, 2.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/video_stream.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"96f43b884e3d0ee3d6d752010ce55cb8d692baf0968dbfe4830e2b30c4709e3d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plot/gpu.rs: FileTooLong \u2014 1246 significant 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 746 over it, 2.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/gpu.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43b43b45e021787fd8e69412827490b60861c78412b903bf5e15fc3270aed1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::ui::plot::gpu::extract_lines: FunctionTooLong \u2014 elodin_editor::ui::plot::gpu::extract_lines runs 249 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 149 over it, 2.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/gpu.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"585f89062850bdeb8ed4a4fa7a79d6fd7ee2fe7be8cea9fa07a87e80c2c97532"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: view_cube/interactions.rs: FileTooLong \u2014 1228 significant 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 728 over it, 2.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/view_cube/interactions.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92d1f6e236c4008abe977bb1018caf198acdb7b697c3b28a9437823b8b55e57"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cranelift_mlir::lower::compile_module_with_config: FunctionTooLong \u2014 cranelift_mlir::lower::compile_module_with_config runs 244 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 144 over it, 2.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":1551}}}],"partialFingerprints":{"codehealthFindingId/v1":"350db2ad8ad872e3fce4f646d30541d801fba32533fcef5deb618288e5e25020"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: nox_py::impeller_server::tick: FunctionTooLong \u2014 nox_py::impeller_server::tick runs 243 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 143 over it, 2.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/impeller_server.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ae6f296b4e7b4e7af237824020a73799796c60fc0a13717bf52cbc97d32bc54"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::plugins::frustum::draw_viewport_frustums: FunctionTooLong \u2014 elodin_editor::plugins::frustum::draw_viewport_frustums runs 242 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 142 over it, 2.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/frustum/mod.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"816c98f1826a2d3b06e74d45242a41cb88c7792ec47d023e7f492c09d49dd611"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cranelift_mlir::parser::parse_op: FunctionTooLong \u2014 cranelift_mlir::parser::parse_op runs 235 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 135 over it, 2.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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c33b71820b8c2c5293f33678a4d0dcae282c4577b3cbdbe9d1095e1c63a50e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ViewportPane.spawn: MethodTooLong \u2014 spawn runs 233 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 133 over it, 2.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"6af64ba20df7f9356eccd306f6ef3f88e0d850d46e4802bcd7916e1d0319f7e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monte_carlo::execute_campaign: FunctionTooLong \u2014 monte_carlo::execute_campaign runs 229 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 129 over it, 2.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc8606b7f01e18640871aa6757c287220e3f65fa888b36faa15f81452e99f53"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: JaxTracer.visit: MethodTooLong \u2014 visit runs 227 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 127 over it, 2.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":"libs/nox/src/jax.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eac29f834c81e05a85a71cd09f3d749a0efc274487b98323b076a9019103ac0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: array/mod.rs: FileTooLong \u2014 1128 significant 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 628 over it, 2.26\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/array/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecda8f603aa7143947fd4af85a791f20b898685de8a947efe092fbca4843c1d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Pins: TooManyFields \u2014 67 stored fields beside 2 methods. The bar is 30 stored fields; this is 37 over it, 2.23\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/bsp/aleph.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"a37e08ea5a58d41733ba6537bbeee627b04b238dd2c190e21c06d96779b76657"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cranelift_mlir::interp::eval_instr: FunctionTooLong \u2014 cranelift_mlir::interp::eval_instr runs 223 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 123 over it, 2.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1c581744df01fd963d54bf104398d86edc92e04598cc76a5e08a941278251c4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorldBuilder.sensor_camera: MethodTooLong \u2014 sensor_camera runs 219 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 119 over it, 2.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f7022ef71d961c4b597b03c922f57004df3afd72666acc2e674426f6fbd401"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cranelift_mlir::profile::write_json_report: FunctionTooLong \u2014 cranelift_mlir::profile::write_json_report runs 216 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 116 over it, 2.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/profile.rs"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3036bcb10c9e46cfbac2d76668e12a2b120ae434b932f7544557e62cb88748"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cranelift_mlir::const_fold::rewrite_aliases_instr: FunctionTooLong \u2014 cranelift_mlir::const_fold::rewrite_aliases_instr runs 215 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 115 over it, 2.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/const_fold.rs"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac095671713ce9ec0cdaaf94419ed57424de71259627afa9ddbcc20dc19cbfd7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/profile.rs: FileTooLong \u2014 1070 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 570 over it, 2.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/profile.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a404f2343602d7a2ddd07a5a2ab39a55cb3f24a20b1f8f6e633db17b102234"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TreeBehavior.tab_ui: MethodTooLong \u2014 tab_ui runs 212 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 112 over it, 2.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":2311}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58d3235bef113921da08c7aa33ffd4a78afdd005cea5a99e2217c454859f57e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ser.rs: FileTooLong \u2014 1054 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 49 free functions. The bar is 500 significant lines; this is 554 over it, 2.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":"libs/impeller/kdl/src/ser.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b55aefcf11b1b8b58b6082b7fbcd176945e0b179984fa569a00c43c6aeccd9d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LoadSchematicParams.load_schematic: MethodTooLong \u2014 load_schematic runs 210 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 110 over it, 2.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb715d932a429e0ee5be5d244b40185effaa7b2eabb8c0000e7b35278ff4f44e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InspectorGraph.ui_system: MethodTooLong \u2014 ui_system runs 204 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 104 over it, 2.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/graph.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9deb78ff06d2b216728cfb991ead9c5db9ccf69d94e19ec4a180fb0bf41ea9b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monte_carlo::run_one: FunctionTooLong \u2014 monte_carlo::run_one runs 198 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 98 over it, 1.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":2083}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e3c0ab838f7d06140d681a2f623a78d32580067a449b2d7896baeee87a0a59"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TimeseriesPlot.render: MethodTooLong \u2014 render runs 196 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"b49eb50eea2e4eae8fd5d11cad9db56a4d9dbc4740c2c9f0e1272f115b819212"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StatusBar.ctx_system: MethodTooLong \u2014 ctx_system runs 194 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 94 over it, 1.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/status_bar.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db09e0e25a033636f2090d1b0dddc38c6a379970cab6ca7277f26e0b9b55a8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_db::merge::run: FunctionTooLong \u2014 elodin_db::merge::run runs 188 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/merge.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"79740b6aa63d396a49c933d118649fa4fc9f57cf6857031c5e30d12c018f972f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::sensor_camera::spawn_sensor_cameras: FunctionTooLong \u2014 elodin_editor::sensor_camera::spawn_sensor_cameras runs 188 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 88 over it, 1.88\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/sensor_camera.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f08202d7d1dd2a8efbfff41a9c30bd1e0630ed9b05181117176af782ea71cd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: LineTree: TooManyMethods \u2014 56 methods. The bar is 30 methods; this is 26 over it, 1.87\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":"libs/elodin-editor/src/ui/plot/data.rs"},"region":{"startLine":2026}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbad3ccfba3fce8416897302682fafa0e6625ec76b7067a6cf9671ac963abf42"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/headless.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), declaring 31 free functions. 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":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa89a446168d7bdbd4007a84fb4b3977ed7669a91e5d25186adb19db35a544b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::ui::plot_3d::gpu::extract_lines: FunctionTooLong \u2014 elodin_editor::ui::plot_3d::gpu::extract_lines 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":"libs/elodin-editor/src/ui/plot_3d/gpu.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"0399aa5309c23f81cf37d1e1920e4e34fd7d2906fdedf96e544e1fb50cf79026"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::object_3d::spawn_mesh: FunctionTooLong \u2014 elodin_editor::object_3d::spawn_mesh 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":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":2175}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e20475316cdceb8291f79ab4db2f4dfe8416ee8e1e9626c8cf92ff3c26bc52"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Noxpr.ty: MethodTooLong \u2014 ty 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":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a21a2034fdf136e860aad72c3d1b643762878b90af84c7cb100c4467abd0d8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StartupLayout.ctx_system: MethodTooLong \u2014 ctx_system runs 182 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/startup_window.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"cce49fe7b18bb09001385f35dd3888f151222d84442d9e96d6640cbf18375a21"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeller_kdl::de::parse_viewport: FunctionTooLong \u2014 impeller_kdl::de::parse_viewport runs 182 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe4fe99e9871ae7c6c96c953053a815a06757ca8d9bb1cb51c4fb41e74cbba9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: thruster_particles/mod.rs: FileTooLong \u2014 902 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 32 free functions. The bar is 500 significant lines; this is 402 over it, 1.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/thruster_particles/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5f94bf2b63961ccc3067dc874af14e2cae594b29317393d4ed5456681a0ddd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: view_cube/camera.rs: FileTooLong \u2014 898 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 398 over it, 1.80\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/view_cube/camera.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d916fa2a7f19cb57f55bdfe76bfdbd4df5761abdb55a444a5ee0cb17954c0b7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LineTree: ClassTooLong \u2014 718 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 56 methods, 6 blocks, lines 2026-3204. The bar is 400 significant lines; this is 318 over it, 1.80\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/data.rs"},"region":{"startLine":2026}}}],"partialFingerprints":{"codehealthFindingId/v1":"2703cde85e24c2a7811ba194d1fcc091f94d49f8e6e965bd5cd3c7a3bb8386ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::ui::plot::gpu::extract_plot_lines_wasm: FunctionTooLong \u2014 elodin_editor::ui::plot::gpu::extract_plot_lines_wasm 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":"libs/elodin-editor/src/ui/plot/gpu.rs"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b5f2cb0ffee4c3a4554ef8b0ed1f8911f4efb1ec4f6d51fef8d2eccabaec214"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BatchTracer: ClassTooLong \u2014 709 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 14 methods, 2 blocks, lines 89-1017. The bar is 400 significant lines; this is 309 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":"libs/nox/src/noxpr/batch_dfs.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5af933d1dd80e99c5c99af5ced9c6daeb90add9690e0248065c128ff9cb1645"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::ui::command_palette::palette_items::create_3d_object: FunctionTooLong \u2014 elodin_editor::ui::command_palette::palette_items::create_3d_object 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":"libs/elodin-editor/src/ui/command_palette/palette_items.rs"},"region":{"startLine":2216}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd24935723d497a288686d73638816b3dc59e428c08053917b649f358616694"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cinematic_earth/mod.rs: FileTooLong \u2014 865 significant 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 365 over it, 1.73\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/cinematic_earth/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad8d7a1973c0aedb6a8ed10c8f0f1ec9aeebaa59907a7d48776b8117e843c17"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: upload/mod.rs: FileTooLong \u2014 863 significant 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 363 over it, 1.73\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/elodin/src/cli/cloud/upload/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f465dd4f10f18323f14f2473e45e764b7adfc1b28fe3285959d1250ab4487489"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: grpc/ingest.rs: FileTooLong \u2014 863 significant 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 363 over it, 1.73\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/grpc/ingest.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc9df7caa7108489b04b3bb19e047a596a09c05467b178dfb94fea5799b0fee"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Noxpr: TooManyMethods \u2014 51 methods, declared across 3 files: noxpr/node.rs (49), src/jax.rs (1), noxpr/batch_dfs.rs (1). The bar is 30 methods; this is 21 over it, 1.70\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d00ab9f9189b3dc4b55c9e638975a6f95330075ee9af8e9f2d84e10f1f2001"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: aleph_serial_bridge::connect: FunctionTooLong \u2014 aleph_serial_bridge::connect runs 170 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/serial-bridge/src/main.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9232a5f5c7e4f1c9a214364b515ba24d43abbc602242ecaa326cae580cdc78f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::object_3d::compile_formula: FunctionTooLong \u2014 elodin_editor::object_3d::compile_formula 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":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ef4b8e1eb211d99e83e9e06b7438e68d18af040e1db1d257ae3cc05690411f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cranelift_mlir::interp::binary: FunctionTooLong \u2014 cranelift_mlir::interp::binary 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":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d513481b3b29da6fc0522da2312b1d0b8748087705edbb240fd30fad27b3d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::ui::window::spawn::sync_windows: FunctionTooLong \u2014 elodin_editor::ui::window::spawn::sync_windows 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":"libs/elodin-editor/src/ui/window/spawn.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"82401784b9f3c780d228514372deb0b92da155d08b463a66f91cc4f75f93fe7f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: plot_3d/gpu.rs: FileTooLong \u2014 836 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 336 over it, 1.67\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot_3d/gpu.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"359d6cd3a427010ee451157fccc7ada8024c19e52bd3450ade5f09275ff79940"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: QueryPlotWidget.ui_system: MethodTooLong \u2014 ui_system 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":"libs/elodin-editor/src/ui/query_plot.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aac95fd8a163003931a0c70b25912e9c00ba12ab20610c5f6de61431b739e8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: noxpr/batch_dfs.rs: FileTooLong \u2014 829 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 86% of them inside a single declaration: BatchTracer (2 blocks, 89-1017). The bar is 500 significant lines; this is 329 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":"libs/nox/src/noxpr/batch_dfs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64ab9a25c30aaf9c20b734874a0f69115b02a2b3b2c0b2bd2ca2ef48c57f0a66"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: bin/bench.rs: FileTooLong \u2014 826 significant 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 326 over it, 1.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/bin/bench.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c98cc2a55f0ea431a4945b766d43cb40cfc92319bb40e88adcdca84c10b02943"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: inspector/viewport.rs: FileTooLong \u2014 826 significant 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 326 over it, 1.65\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/viewport.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5c4d0d0ebfe44c01bf3527abd61024cfaa2992105bbbd1fd3585df175842ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cranelift_mlir::const_fold::operand_ids: FunctionTooLong \u2014 cranelift_mlir::const_fold::operand_ids runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/const_fold.rs"},"region":{"startLine":1980}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5372e6d13bb118af6c49a6eb87ea2a86f74631caa00c5fcde17a667ceacbac4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::plugins::map_overlay::draw: FunctionTooLong \u2014 elodin_editor::plugins::map_overlay::draw runs 164 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/map_overlay.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b736cae6e60ca5a8e93ac13a537e1c67b2978791624a4f6cf00025caf15caa"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_db::fix_timestamps::run: FunctionTooLong \u2014 elodin_db::fix_timestamps::run runs 163 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/fix_timestamps.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"df521f1392cfe8f2c4d861911e235b13a004e9ffddd3d1cec1df8f4da1c74a7d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_db::follow_stream::handle_follow_stream: FunctionTooLong \u2014 elodin_db::follow_stream::handle_follow_stream runs 163 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/follow_stream.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab13b31e7ecb38f9f686bb78b8550c865f9fec61d7ee3d687fe9720f95a91f54"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::plugins::gizmos::render_vector_arrow: FunctionTooLong \u2014 elodin_editor::plugins::gizmos::render_vector_arrow runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/gizmos/mod.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"58137850d8b29ff7718aecdbfd8549cb403ea402efb4800de7653c0da7432c86"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 808 significant 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 308 over it, 1.62\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1923ce995e81ca5149c54086e354f52ae5f53ca1ef9aa98c99313312c9c2a1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: timeline/timeline_controls.rs: FileTooLong \u2014 796 significant 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 296 over it, 1.59\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/timeline/timeline_controls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15daf3872d68cc65813d6bcf04c01ad0ae2e95fce737309c86cf5ffbf10e739d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Array: ClassTooLong \u2014 636 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 47 methods, 16 blocks, lines 68-1641. The bar is 400 significant lines; this is 236 over it, 1.59\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/array/mod.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b1c161c99351900b457c13ceb34848bf2e785bdb27f03a1e4b57a3d36745e0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Noxpr: ClassTooLong \u2014 634 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 51 methods, 6 blocks, lines 997-2035. The bar is 400 significant lines; this is 234 over it, 1.59\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6cbd6ada883f9dfd03a3e3521276d75b38b1a669c793608dd32b14a8dcace0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \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). The bar is 500 significant lines; this is 286 over it, 1.57\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/cli/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f93facf3fafa47be4cc68bcfbd4efdaba32f5250a9133a15b7f0dd9a4ccb969"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_db::grpc::ingest::validate_schema: FunctionTooLong \u2014 elodin_db::grpc::ingest::validate_schema 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":"libs/db/src/grpc/ingest.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3986063f9b20375d32e0a165d7fa6dd7c75a3ecf145ea87349556927540c49b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Array: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/array/mod.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"de38416da2b305a755ba8db61edc4f6895310c9d8bf1bbbe86dcec58b096181c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_db::bin::bench::run_benchmark: FunctionTooLong \u2014 elodin_db::bin::bench::run_benchmark runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/bin/bench.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e71246e1f2de97f08da437917a74a92430094bf6b250bab9ee4370c4b76455"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: schematic/mod.rs: FileTooLong \u2014 773 significant 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 273 over it, 1.55\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"004196ca3a5e45c15db60991170b9dcbcc8bed8e3e70cc26d72fc7f290d921e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::plugins::gizmos::update_arrow_label_ui: FunctionTooLong \u2014 elodin_editor::plugins::gizmos::update_arrow_label_ui runs 153 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/gizmos/mod.rs"},"region":{"startLine":769}}}],"partialFingerprints":{"codehealthFindingId/v1":"b635e253f8a870e560fd149d4f85d32ab01944c0714c6cdfac8759fe1e2a31e9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DB.open: MethodTooLong \u2014 open runs 152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/lib.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b24864c6043c496a1d4264d585cdad3fbc82a9175976c077efd1883abdcf18d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::ui::plot::widget::sync_kernel_graphs: FunctionTooLong \u2014 elodin_editor::ui::plot::widget::sync_kernel_graphs runs 152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":2120}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c3963a5afe993859316a6adbe324d50a68030d3c639f179435e3fcd7c478661"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/system.rs: FileTooLong \u2014 754 significant 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 254 over it, 1.51\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/system.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06e00a26b6d6789d8d32c9bbfec5bcb6d4b2f649afa5182f6c0691da38746d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/types.rs: FileTooLong \u2014 751 significant 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 251 over it, 1.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/src/types.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b00c12b9a5de08e24e12bca2fd8bfbe3c4e638a5c0ed16a05720dc087a1aad"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: data_overview/mod.rs: FileTooLong \u2014 750 significant 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 250 over it, 1.50\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/data_overview/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17947f1ba67ec47d75927474de78cd63f11f672d9cc4d3b32d6e91e86c57e01b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeller_kdl::de::parse_object_3d_mesh: FunctionTooLong \u2014 impeller_kdl::de::parse_object_3d_mesh 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":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":2161}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d58f8ea7ab75e561620edaa2286c0672fc0fcd954212f4211059e5260fe6ef"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DB: ClassTooLong \u2014 597 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 29 methods, 2 blocks, lines 242-1233. The bar is 400 significant lines; this is 197 over it, 1.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":"libs/db/src/lib.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5d0937ad56091b88f90fbb0b76e99a444a27aa5841efd37d4b528bdf80f920"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/tensor.rs: FileTooLong \u2014 731 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 231 over it, 1.46\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/tensor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb7fc082ada5a44922efa2b6412bc4e92c10ef6e3bb8b8709d2cd1f4c2bbddca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::ui::timeline::timeline_controls::speed_control: FunctionTooLong \u2014 elodin_editor::ui::timeline::timeline_controls::speed_control runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/timeline/timeline_controls.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0798c69b3de042e5a4b210b9c915cca409952bb0578916b15c818d77280f29"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeller_bevy::sink_inner: FunctionTooLong \u2014 impeller_bevy::sink_inner runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c40b12da28e2d24b6a96e7f8d64d1ac8dc73e8c6c4eafb822b953b8f789644"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/sdmmc.rs: FileTooLong \u2014 718 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 73% of them inside a single declaration: Sdmmc (6 blocks, 96-990). The bar is 500 significant lines; this is 218 over it, 1.44\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/sdmmc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f05a98abed0fa077c574dc24394bada070bdacbe98c577908614fae1ccfd395"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TimeseriesPlot: ClassTooLong \u2014 573 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 11 methods, 2 blocks, lines 295-1368. The bar is 400 significant lines; this is 173 over it, 1.43\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e2f92a44f953ac9e2a720bdead37649e22855521b88a5d245df1685c43cbcd2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::plugins::navigation_gizmo::set_camera_viewport: FunctionTooLong \u2014 elodin_editor::plugins::navigation_gizmo::set_camera_viewport runs 143 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 43 over it, 1.43\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/navigation_gizmo/mod.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"88644c68509d280765ae32446a51c314e837d20fc3a17c6a4b0414c0e7da825e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/startup_window.rs: FileTooLong \u2014 711 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 211 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":"libs/elodin-editor/src/ui/startup_window.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"830f1dba334a9cd7f53a6e285e43b4f1a9bf659360a0166301424d8081e8d28e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin::cli::cloud::upload::run: FunctionTooLong \u2014 elodin::cli::cloud::upload::run runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/elodin/src/cli/cloud/upload/mod.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"44ccc00e4b8f4a98f78ebc1edaf57d30c4fb883ec03f49ea77ddbb366de57269"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::ui::plot::widget::sync_derived_graphs: FunctionTooLong \u2014 elodin_editor::ui::plot::widget::sync_derived_graphs runs 141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":1941}}}],"partialFingerprints":{"codehealthFindingId/v1":"593547d463cd67634af215013d2de44a88d7b71d3c80085b8d1395cd518e0aa2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_db::follow::run_follower_inner: FunctionTooLong \u2014 elodin_db::follow::run_follower_inner runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/follow.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b9b3d3ee890a6c636f608a32a22a7144ef5b1b2b8009b4b8d72e4d7092b633"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InspectorSensorCamera.ui_system: MethodTooLong \u2014 ui_system runs 140 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/sensor_camera.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"061183f61ffdced41d16f813dc2bae5718a8a8667695f7932450f19871a573e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cranelift_mlir::tensor_rt::tensor_conv_f64: FunctionTooLong \u2014 cranelift_mlir::tensor_rt::tensor_conv_f64 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":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":1900}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e65d354d2d4550d990023ba882b23a1857372ce02045a9f4d1e848338fd95a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NoxprNode.is_equal: MethodTooLong \u2014 is_equal runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"993da1629963d52401b17ddf3dfaf4007996c567c0c78fdeb93651aea92452d5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WorldBuilder.build_jited: MethodTooLong \u2014 build_jited runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":2143}}}],"partialFingerprints":{"codehealthFindingId/v1":"7693af04ff6bb55afd642cea64b802e9d93a281dd90bd4162b8a9d51e5a3f21b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Tensor: TooManyMethods \u2014 41 methods, declared across 4 files: src/tensor.rs (34), noxpr/batch_dfs.rs (3), noxpr/tensor.rs (3), src/matrix.rs (1). The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/tensor.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3ad41908ec19db2193a97bdd3d471633667f9b970e601c7e3385880b98fec6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/python.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), declaring 39 free functions. The bar is 500 significant lines; this is 179 over it, 1.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/python.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7150f2b12801d90c04697f222c7eefc9a52d8a4f9703593e38ead686f66316be"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/assets_http.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), declaring 45 free functions. The bar is 500 significant lines; this is 178 over it, 1.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/assets_http.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b66dcda836ecb2dc7399395e1d0337ef759cad7dabd56a970735bf0b80ea47"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: gizmos/mod.rs: FileTooLong \u2014 674 significant 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 174 over it, 1.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/gizmos/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac060bd06e7d35b5d3d236bade27fa37eded042b95b913c8cf9aa428c6573bc9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/recipe.rs: FileTooLong \u2014 674 significant 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 174 over it, 1.35\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/src/recipe.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"954cdc2ba65d372efb27f71264893c841f4948f32fb8afc5fd6bcfdd6600cd2f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TelemetryCache: TooManyMethods \u2014 40 methods. The bar is 30 methods; this is 10 over it, 1.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"9249b1281b619b69b5da8c0b9ff9c03a54cacda4fd7e6dab4b07e41bd8009fcd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/query.rs: FileTooLong \u2014 659 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 159 over it, 1.32\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/query.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f44edd39459e656030209d1d1a7e1f403d9a057ebafa60937bfd967b2fb3d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_db::bin::bench::run_writer_grpc: FunctionTooLong \u2014 elodin_db::bin::bench::run_writer_grpc runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/bin/bench.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"240bce83ec72e66a55606ebd14ce9144849193533ef204c505e4e49dc8696d1e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Timeline.render: MethodTooLong \u2014 render runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/timeline/timeline_slider.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"1442edc61c82f827695bfd277ad06d9e035f961e9c0c2a1107b337571e2dda89"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StepContext.component_batch_operation: MethodTooLong \u2014 component_batch_operation runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/step_context.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6003c650b1449507681fe4c8a4a87bcc0865edfdd15895011cd7a0cec864a3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Sdmmc: ClassTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 30 methods, 6 blocks, lines 96-990. The bar is 400 significant lines; this is 122 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":"fsw/sensor-fw/src/sdmmc.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a013d5603a4fe1322d5a2959ff1c501bc92abb4a49e35613ea4b57a1f235fb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 652 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 152 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"376800a7acaf06c51ff8d27d385e8972c3dad31285f926a0dfb63170fb0a7355"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::headless::load_headless_scene: FunctionTooLong \u2014 elodin_editor::headless::load_headless_scene 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":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3ee5925e464e5179d32dd61e8d35a91f21dd7691abf9d51ddca4e1fc8e758bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/mod.rs: FileTooLong \u2014 648 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 148 over it, 1.30\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c926ed72e2a69293e7bd1185790f45f33a9f511431b5776ae4af70e9f104b7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/query.rs: FileTooLong \u2014 646 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 146 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/query.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e8c3e1a7f0914f3db042b9811be0c1bb904d1ecf460e5b684aca6556fdc197"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: frustum_intersection/mod.rs: FileTooLong \u2014 643 significant 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 143 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/frustum_intersection/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c0c1524cc6aae76f873cdd79aa5cf4a81fd6978b1d826193cd5eca0c8d1e0e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_db::export::run: FunctionTooLong \u2014 elodin_db::export::run 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":"libs/db/src/export.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"63cae5a3b199cd8350c45d7bb5b1ff1ac015f33777a445f7bde2cb76cbe07e59"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::object_3d::update_object_3d_billboard_system: FunctionTooLong \u2014 elodin_editor::object_3d::update_object_3d_billboard_system 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":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":2426}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f0d7375b9fac33234293127a38f0d21c3f0d7b5a047ae81e2b8380acb01215"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TimeseriesPlot.draw_modal: MethodTooLong \u2014 draw_modal 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":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4e6283bb86ad2f4c755efddea071ad3e8ac157f93a0d99d6ec173e712a7b31"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/fetch.rs: FileTooLong \u2014 627 significant 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 127 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/fetch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28fc9af1579798a2381a2582704c6a52c439c14c10a06f31a19b586f827d4778"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::ui::schematic::tiles_to_schematic: FunctionTooLong \u2014 elodin_editor::ui::schematic::tiles_to_schematic runs 125 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 25 over it, 1.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/mod.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"256c5e65588f9d543db772f2c9bbbcf4f81680b1a926ff8c35744e6f265946a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: elodin/__init__.py: FileTooLong \u2014 624 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 124 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/python/elodin/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e91203ff7b057a28e9ffef34aed8c5309819284701cbb5b1c4633b94a2703bd6"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IngestServiceImpl.open_session: MethodTooLong \u2014 open_session runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/grpc/ingest.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"68cedc4528647a0243199fa4086860a165bcee0786d5bfddd789a9f95ce8b143"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cranelift_mlir::lower::lower_while: FunctionTooLong \u2014 cranelift_mlir::lower::lower_while runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":8437}}}],"partialFingerprints":{"codehealthFindingId/v1":"5996a6db79882c9e80df5790a5fa6940a8714853f91be6fa3c0aaf1c0f99dc2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeller_kdl::ser::serialize_viewport: FunctionTooLong \u2014 impeller_kdl::ser::serialize_viewport runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/ser.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c7e40a6f6c60c8c5c94c6456a8ff67bd0703451729cd1364473622981a84a7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Noxpr.shape: MethodTooLong \u2014 shape runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.23\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":1635}}}],"partialFingerprints":{"codehealthFindingId/v1":"065d245c5c7e306fdc95dc17cc7515828c92b4295dfcd23ca23b4323f4aae504"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/merge.rs: FileTooLong \u2014 610 significant 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 110 over it, 1.22\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/merge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bdda1d9c4b16672986a161a1ebb3a2e2db5eddd4b87bb7b6626b5287c791e5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_db::vtable_stream::handle_vtable_stream: FunctionTooLong \u2014 elodin_db::vtable_stream::handle_vtable_stream 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":"libs/db/src/vtable_stream.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e94bfe77943f77fb77d1a906a6a5e494da4f40d57cb0a212d61b6aeb67b71f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TileSystem.render_panel_contents: MethodTooLong \u2014 render_panel_contents 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":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":2762}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea39b7aa85bd9000eb0b5d6849b4e3d31c641f3515cf6adac994badb4653fc9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeller_kdl::ser::serialize_object_3d_mesh: FunctionTooLong \u2014 impeller_kdl::ser::serialize_object_3d_mesh 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":"libs/impeller/kdl/src/ser.rs"},"region":{"startLine":1260}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a8b03f9bf07c88199a0f22d5e601dd1d78b6870172f162fe6bd0bf46185e2ff"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TileLayout: ClassTooLong \u2014 485 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods, 2 blocks, lines 3164-3864. The bar is 400 significant lines; this is 85 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":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":3164}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae9b0f57d7ff3d238ac248f0c03df513e8aaebc5abdaf6e555bf38d3aa1b5c6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: db/client.rs: FileTooLong \u2014 606 significant 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 106 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/db/client.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcea1d8edcbd0d24b701fae6f863208a8d16ec2fed220b30e5c80c197cf99d13"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/export.rs: FileTooLong \u2014 605 significant 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 105 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/export.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3844ec78ec0a0586f8acc07295133216113032e63acfe73b274bdc4121e7d7ae"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DB.insert_vtable: MethodTooLong \u2014 insert_vtable 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":"libs/db/src/lib.rs"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"252e0dae56146581d520c71c3dc1de6467d589cc33e414cca6c41c608df7554e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/impeller_server.rs: FileTooLong \u2014 603 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 103 over it, 1.21\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/impeller_server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b023434ea96dad6ddcb32b71009031c3c97149523cdda2cfcc0f0e624ed9828"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Pins.steal: MethodTooLong \u2014 steal 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":"fsw/sensor-fw/src/bsp/aleph.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3742f787c5068441a9ba7d3949a9661169725bcb79a695eb86964f2c519b23"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::ui::plot_3d::point_trails::sync_point_trails: FunctionTooLong \u2014 elodin_editor::ui::plot_3d::point_trails::sync_point_trails 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":"libs/elodin-editor/src/ui/plot_3d/point_trails.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58ae2bcc3f68be74bbf99b1eb82d1b81f20908f6969432daf83bc7b6fa9e631"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BatchTracer.process_gather: MethodTooLong \u2014 process_gather 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":"libs/nox/src/noxpr/batch_dfs.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f1227a3db12f98d6113be8f6b4d5603907eaf026214c99ac736cee98f7d734"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TelemetryCache: ClassTooLong \u2014 476 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 40 methods, 2 blocks, lines 94-813. The bar is 400 significant lines; this is 76 over it, 1.19\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":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"5435d39e85497508737cd17d120ef8741e6e54e0d940f54cf16f5f2889c2102f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InspectorObject3D: ClassTooLong \u2014 476 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods, 2 blocks, lines 38-680. The bar is 400 significant lines; this is 76 over it, 1.19\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":"libs/elodin-editor/src/ui/inspector/object3d.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"846649cb1246f5e8619d0d57e1bfd68574a67a82aee20b830826ed9edef32f06"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HeadlessEditorPlugin.build: MethodTooLong \u2014 build 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":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"739f4b963ba3c3a5133cf7743a0125d3b19c1d5beb729e9a0cd6ba730929c074"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::object_3d::update_object_3d_system: FunctionTooLong \u2014 elodin_editor::object_3d::update_object_3d_system 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":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":1291}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3edc7901eeaace727f2dbd80ee11eb7957b85a4292e3b953188b9f19e5d3693"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::object_3d::update_object_3d_kernels: FunctionTooLong \u2014 elodin_editor::object_3d::update_object_3d_kernels 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":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":2723}}}],"partialFingerprints":{"codehealthFindingId/v1":"a47a89c84b36c45e5e147d3874fdd93fd8ee5ba020fa4d2e95c16fa8e6ebafda"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cranelift_mlir::lower::lower_call: FunctionTooLong \u2014 cranelift_mlir::lower::lower_call 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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":8770}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d4a3f065e1deb2a3153cad1a20e4322bddc6e4aea7c145ea57e7880a6ce897"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::plugins::view_cube::spawn::spawn_rotation_arrows: FunctionTooLong \u2014 elodin_editor::plugins::view_cube::spawn::spawn_rotation_arrows 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":"libs/elodin-editor/src/plugins/view_cube/spawn.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee43baad6dad3914cb7963de1149b69e921c9f9c92e2edad02159a798ef934fd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFunctions: elodin_editor::ui::colors: TooManyFunctions \u2014 35 free functions. The bar is 30 free functions; this is 5 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/colors.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"84eb681013e6956cd3706963f9ab70c7875684b202ac0c1e241d9a37b22c4cc9"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: SchematicParam: TooManyFields \u2014 35 stored fields beside 4 methods. 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":"libs/elodin-editor/src/ui/schematic/mod.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"838c1210da4fd1a3046f5b6b6205badd696f34611a7fa28429ca088d1110858d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 582 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 82 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7a99f8dd7a7ef95cb5b4b54bc742ac56a934e013185f63804973b854e6cffdd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monte_carlo::write_perf_csv: FunctionTooLong \u2014 monte_carlo::write_perf_csv 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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":2964}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3820e411879f866727d2a633fcd3af93e32002ad20174e64d368c730c1cb9cf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProcessArgs.run: MethodTooLong \u2014 run runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/src/recipe.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb76846fb95483edae227c1c93d464705ec4bafb50fdb67839dee286d23b3937"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeller_kdl::de::parse_vector_arrow: FunctionTooLong \u2014 impeller_kdl::de::parse_vector_arrow 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":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":2514}}}],"partialFingerprints":{"codehealthFindingId/v1":"9453a1e1b5d211d3bfc9c2a89947d16f91eb8ff6dfd40a4f9b6ef15b85fa7e38"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BatchTracer.process_node: MethodTooLong \u2014 process_node 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":"libs/nox/src/noxpr/batch_dfs.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"a391d9d69cd69bfdf6a8865e2d00bac9e69585ec61ca9f6405100557a1b1a67c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: NoxprNode.eq: MethodTooLong \u2014 eq 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":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"41279c1db34fc5f780746e6d8e039d5a4a362beec3ea48c9f8ae546fd5b9da8a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: view_cube/spawn.rs: FileTooLong \u2014 572 significant 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 72 over it, 1.14\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/view_cube/spawn.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aed11b53300ff3c1976122fa747153979ae723e3e2c01339ce907decbf03a3e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Args.run: MethodTooLong \u2014 run runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/video-streamer/src/main.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"456f1cd5cc4e32f771a8331c3ee06427e66df0b2af9b31cab651a3eca9b80ea1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cranelift_mlir::parser::parse_sort_op: FunctionTooLong \u2014 cranelift_mlir::parser::parse_sort_op runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"3081399f0356e42360531bf23c9204c4fa8b729c8e8f12059519f91961ecc66f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Client.add_methods: MethodTooLong \u2014 add_methods runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/cli/src/lib.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"440e34722c3abd559f48b958e08474d4bddf376a780ab43961c3f7a89744b6c1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: InspectorContent.ui_system: MethodTooLong \u2014 ui_system runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/mod.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc4c2835135dee4b822084f4d3f7d12d30f8b99accbe1ec2b36c354227b4c8a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Pane: ClassTooLong \u2014 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), 5 methods, 2 blocks, lines 1053-1660. The bar is 400 significant lines; this is 54 over it, 1.14\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":1053}}}],"partialFingerprints":{"codehealthFindingId/v1":"7294e0e3e49a6d821bea1c00db6a2c90fefab9987215fd92c43dfbf4514fb163"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: LoadSchematicParams: TooManyFields \u2014 34 stored fields beside 13 methods. The bar is 30 stored fields; this is 4 over it, 1.13\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"48aed54e997cf1edc9cc5c20da7bc21f453be6a447c2603ffe81841662f68bb9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::plugins::cinematic_earth::sync_cinematic_earth: FunctionTooLong \u2014 elodin_editor::plugins::cinematic_earth::sync_cinematic_earth 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":"libs/elodin-editor/src/plugins/cinematic_earth/mod.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"e633b9c8e722be0ee9da7573aa65cd264b948949dd2e0218005bd2e92b8a503e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_db::trim::run: FunctionTooLong \u2014 elodin_db::trim::run runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/trim.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee3fa6fb44dfcb33af1e040f8c920ab040c4134f9e0f106d566adc12cc68efe"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: grpc/stream.rs: FileTooLong \u2014 558 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 58 over it, 1.12\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/grpc/stream.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0474b484d9fe4d90aba74786068a816c6a38dc15d9e1cf2886a0d7c581a80341"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: inspector/graph.rs: FileTooLong \u2014 556 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 56 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae02123292569a1d1e2361d121431cf92732d33c1ebd73190bc9bb4cab8ca3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeller_cli::lua: FunctionTooLong \u2014 impeller_cli::lua 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":"libs/db/cli/src/lib.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd712fede12150653baaacd894110d56118b413ad4d12698cde8950f6107347"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::plugins::map_overlay::sync_assets: FunctionTooLong \u2014 elodin_editor::plugins::map_overlay::sync_assets 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":"libs/elodin-editor/src/plugins/map_overlay.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b8a5bfaaac49ac0317cd6fe99885c198cfeb07eb8ba4dbf738ea306c7b0566"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TimeseriesPlot.draw_x_axis: MethodTooLong \u2014 draw_x_axis 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":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b9c8f93b23d818a614e767813b8eda6932f1675a064da1bcdb2b677613d20b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_db::query::run: FunctionTooLong \u2014 elodin_db::query::run runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/query.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e5e17f89efd6f77f9adc54d71bdc73e1ff43a99f54b1b5945b4e3c9d7b4ada"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::ui::gauges::horizon::paint_horizon: FunctionTooLong \u2014 elodin_editor::ui::gauges::horizon::paint_horizon 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":"libs/elodin-editor/src/ui/gauges/horizon.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd003e0e193e19e1bc9c9cbbea284cd91df46b89b8175e23b05175cf0a12082"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::ui::timeline::timeline_controls::live_follow_button: FunctionTooLong \u2014 elodin_editor::ui::timeline::timeline_controls::live_follow_button 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":"libs/elodin-editor/src/ui/timeline/timeline_controls.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"c884f236c203a00075b3108cb9939d7ec8a1d8a7d0731fd6c2c16078525b5bd8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ReplacementTracer.visit: MethodTooLong \u2014 visit 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":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":2139}}}],"partialFingerprints":{"codehealthFindingId/v1":"7877971da49f88a7ada400910943e741fe24ca7785fe2a1f1ebb521b9f6be711"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: arrow/mod.rs: FileTooLong \u2014 547 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 47 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/arrow/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d5c34192671e7b221fbb29b09ddf371cdf2643b81397714058179ebdfbc25c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::ui::gauges::orientation::paint_frame_sphere: FunctionTooLong \u2014 elodin_editor::ui::gauges::orientation::paint_frame_sphere 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":"libs/elodin-editor/src/ui/gauges/orientation.rs"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"823e8994260c5875408cddb5aaa203ddab96b52d7cd3182f575f9bf68c6f2b4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: monte_carlo::write_campaign_summary: FunctionTooLong \u2014 monte_carlo::write_campaign_summary 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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":3357}}}],"partialFingerprints":{"codehealthFindingId/v1":"42431d15bcacceb64510a731f87b994e355c38115f66d71c41bcb5b3c908cd77"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Viewport.smooth_follow: MethodTooLong \u2014 smooth_follow runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/viewport.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"f807c900a85ae5a7a6710dd997395a7f1dbb5a8ae5a84d0aae0025c38d417da3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/bmm350.rs: FileTooLong \u2014 539 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 39 over it, 1.08\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/bmm350.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db65d0cb5b84c973ba757f60739dd44a47becba5bdfcc419f245d75f9f7d68e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cranelift_mlir::lower::emit_reduce_window: FunctionTooLong \u2014 cranelift_mlir::lower::emit_reduce_window 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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":3326}}}],"partialFingerprints":{"codehealthFindingId/v1":"92741a61cf89a46ed906a43d109f92f672aa0423e2834efbdae860f51c985af1"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Images: TooManyFields \u2014 32 stored fields. The bar is 30 stored fields; this is 2 over it, 1.07\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/images.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"673eb54ffc9db34bccb80e5ad3c9b4d6588962fbe5abb57f320c9f6d5d9b2332"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/bevy.rs: FileTooLong \u2014 532 significant 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 32 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/webcodecs-video/src/bevy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3112497a4cc3f90f3fe6aa78681e3572b925fbddb96c8df3fb08b375b6261f5d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: impeller_kdl::de::parse_object_3d: FunctionTooLong \u2014 impeller_kdl::de::parse_object_3d runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":1773}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c260e4dcb225029fa8568bc466669224d22d0afdc324e8f6b75e64aeb5f3c1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: nox_py::db::client::execute_request: FunctionTooLong \u2014 nox_py::db::client::execute_request runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/db/client.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4393406ccda8f672b576baad93bf440dc5b439946d8020bf7946b9178203f7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cranelift_mlir::lower::emit_select_and_scatter: FunctionTooLong \u2014 cranelift_mlir::lower::emit_select_and_scatter runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":3449}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f75199ab67b03143716bcef3157eafb4cbc07ce921d276009930dfec2606318"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ir.rs: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 22 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/ir.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc4546ad8a149d6177330abe875b1258f4493f3e5bf684b3953bd94c6bbc8e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cranelift_mlir::lower::lower_custom_call: FunctionTooLong \u2014 cranelift_mlir::lower::lower_custom_call 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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":10185}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3b5455b42fb680704f4166c5c9010cd04ec2feea6392383c8c868241f1312e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::plugins::kdl_document::systems::handle_open_document_from_active_requests: FunctionTooLong \u2014 elodin_editor::plugins::kdl_document::systems::handle_open_document_from_active_requests 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":"libs/elodin-editor/src/plugins/kdl_document/systems.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"55471d7404686d4fe637554508ca954648655c92f6a3077d4c1ed538987940fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: elodin/terrain_prepare.py: FileTooLong \u2014 517 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 17 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/python/elodin/terrain_prepare.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fff9d6cbe80c142704a482a84a5353625161c365a7864b858559e66cad0c791"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cranelift_mlir::parser::parse_reduce_op: FunctionTooLong \u2014 cranelift_mlir::parser::parse_reduce_op runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07db6b50c917f6788c0075d736956ba40942258cd6990e18ba7575b5549b4d7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::plugins::frustum_intersection::projection::build_projection_mesh: FunctionTooLong \u2014 elodin_editor::plugins::frustum_intersection::projection::build_projection_mesh runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/frustum_intersection/projection.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4619a4aedcabb77329399644e6035afae341f526b11995aab40c7d5cf1b2091"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: command_palette/mod.rs: FileTooLong \u2014 514 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 14 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/command_palette/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d76421a470d888e1ca7835e0e82f02df556b12b67c260c487e4e677a7cf9959c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::headless::render_server_runner: FunctionTooLong \u2014 elodin_editor::headless::render_server_runner 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":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"370b21dd8c9fc894a33149aeb9097c82c0daa25fb00171175954921fb8084bb0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GraphQuery.edge_fold: MethodTooLong \u2014 edge_fold 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":"libs/nox-py/src/graph.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0bf627c020b14d1839604da32cc895809a212c1d71a5c4fe02b7f36f9f3f4af"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_db::handle_real_time_stream_batched: FunctionTooLong \u2014 elodin_db::handle_real_time_stream_batched runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/lib.rs"},"region":{"startLine":3290}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1931f7808a829cbc78152051216c2128062874689e75727c802589a5318f253"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::plugins::view_cube::spawn::spawn_viewport_action_buttons: FunctionTooLong \u2014 elodin_editor::plugins::view_cube::spawn::spawn_viewport_action_buttons runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/view_cube/spawn.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d4674b36d586a15d823b2f33723b7057889236b3eb4d8dbb49c1b63ab2e642"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: elodin_editor::ui::inspector::graph::add_component_widget: FunctionTooLong \u2014 elodin_editor::ui::inspector::graph::add_component_widget runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/graph.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"23cb62aada7443f9c8c56145ab59b9fc636ed27dc68c8d2ad02e64e8475d1056"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BatchTracer.process_dot_general: MethodTooLong \u2014 process_dot_general runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/batch_dfs.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5fdd1f2ac5e088968237136a0a73d4569fed5ed3a03af7515848cb82087c7d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: inspector/object3d.rs: FileTooLong \u2014 504 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 94% of them inside a single declaration: InspectorObject3D (2 blocks, 38-680). The bar is 500 significant lines; this is 4 over it, 1.01\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/object3d.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c65d8944768dd24bbca575aa5f5a04dac5abc22d2f807206ce39e9e44bcfcf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: memserve/memserve.rs: FileTooLong \u2014 502 significant 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 2 over it, 1.00\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/memserve/memserve.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc53fad138dea8b8b08e9abde094fa180251e2b6f0688378503e8af66d3e1fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (4 members, 19 shared lines): libs/cranelift-mlir/src/parser.rs:1201-1281 | libs/cranelift-mlir/src/parser.rs:1287-1315 | libs/cranelift-mlir/src/parser.rs:1421-1445 | libs/cranelift-mlir/src/parser.rs:2320-2356 \u2014 These 4 members are variants of one another: a block of 19 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dfa8533131ab4853c22c7f66d010e7ef9a36350cac12026b8ee712ddeb022cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (132 shared lines): libs/elodin-editor/src/ui/plot/widget.rs:1950-2117 | libs/elodin-editor/src/ui/plot/widget.rs:2132-2316 \u2014 These two members are variants of one another: 132 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":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":1950}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe04ebe04da262ce5d235253d5ed9916765549289aa98fe2c4d70ffe05a51ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (111 shared lines): libs/elodin-editor/src/ui/inspector/sensor_camera.rs:41-231 | libs/elodin-editor/src/ui/inspector/viewport.rs:694-1082 \u2014 These two members are variants of one another: 111 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":"libs/elodin-editor/src/ui/inspector/sensor_camera.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba2c0a0e535c8ad4a4f9669c4de10f6c62a1270eeba7019b03eda0bdb579740"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (62 shared lines): libs/bevy_world_mesh/src/fetch.rs:833-931 | libs/bevy_world_mesh/src/fetch.rs:951-1048 \u2014 These two members are variants of one another: 62 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":"libs/bevy_world_mesh/src/fetch.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3c5574830480d04a01f3844b31b7ac4001cc6964c96cf60251def55d7592d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (55 shared lines): libs/elodin-editor/src/ui/inspector/query_table.rs:41-158 | libs/elodin-editor/src/ui/query_table.rs:162-278 \u2014 These two members are variants of one another: 55 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":"libs/elodin-editor/src/ui/inspector/query_table.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d52d2dd244316a3acc8346e4b2186b1bd99d78d643ad919d61a7523beac9b60"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (38 shared lines): libs/impeller/bevy/src/lib.rs:2246-2293 | libs/impeller/bevy/src/lib.rs:2296-2343 \u2014 These two members are variants of one another: 38 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":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":2246}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d69b5b7f58881c52e897885e84c10c0ed1ce01af07cc1814a7882dfc9d99a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (29 shared lines): libs/cranelift-mlir/src/lower.rs:9307-9340 | libs/cranelift-mlir/src/lower.rs:9351-9393 \u2014 These two members are variants of one another: 29 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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":9307}}}],"partialFingerprints":{"codehealthFindingId/v1":"679459f8bd88b2808700e5cffc8e371663d9650048217fa741a54dd694b1ace2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (24 shared lines): libs/nox/src/noxpr/node.rs:806-847 | libs/nox/src/noxpr/node.rs:850-900 \u2014 These two members are variants of one another: 24 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":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d18377a255b424c7109d90d20c87bc6a83e43c658552e46e904a84387899e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): libs/cranelift-mlir/src/lower.rs:3109-3162 | libs/cranelift-mlir/src/lower.rs:3176-3217 \u2014 These two members are one piece of code written twice and then edited apart: 42 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":3109}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe67736fe75b0e165d728845af80c465ece8a24831a7ddc32ff199878f3200b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): apps/inscriber/src/main.rs:22-48 | fsw/aleph-setup/src/main.rs:40-66 \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":"apps/inscriber/src/main.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea7647fc2ccd1ee1f6d987ff9c1edec10d97eab2e60cffc229993457dfefb2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): libs/cranelift-mlir/src/lower.rs:6895-8431 | libs/cranelift-mlir/src/lower.rs:10000-10035 \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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":6895}}}],"partialFingerprints":{"codehealthFindingId/v1":"115050051e8fb75ac51c1df8ced0eaa9bda008f04d2dcdbf06d7b84cc1208882"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): libs/bevy_world_mesh/src/fetch.rs:686-700 | libs/bevy_world_mesh/src/fetch.rs:702-725 \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":"libs/bevy_world_mesh/src/fetch.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ca29996c84d54df924a8be30e0ab839d55d64f3a6dd47ea9a31c1963796c7a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): libs/cranelift-mlir/src/parser.rs:792-813 | libs/cranelift-mlir/src/parser.rs:821-838 \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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"db96b43ec6f1733f015d55cbacd387c057818fdad02457231e8d9a0202658dd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (14 members, 50\u002B identical tokens): libs/cranelift-mlir/src/tensor_rt.rs:584-610 | libs/cranelift-mlir/src/tensor_rt.rs:1236-1294 | libs/cranelift-mlir/src/tensor_rt.rs:1310-1342 | libs/cranelift-mlir/src/tensor_rt.rs:1359-1390 | libs/cranelift-mlir/src/tensor_rt.rs:1402-1431 | libs/cranelift-mlir/src/tensor_rt.rs:1441-1467 | libs/cranelift-mlir/src/tensor_rt.rs:1491-1519 | libs/cranelift-mlir/src/tensor_rt.rs:1532-1564 | libs/cranelift-mlir/src/tensor_rt.rs:1578-1595 | libs/cranelift-mlir/src/tensor_rt.rs:1615-1635 | libs/cranelift-mlir/src/tensor_rt.rs:1647-1684 | libs/cranelift-mlir/src/tensor_rt.rs:1735-1812 | libs/cranelift-mlir/src/tensor_rt.rs:1829-1898 | libs/cranelift-mlir/src/tensor_rt.rs:1920-2075 \u2014 These 14 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 14 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 14 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f0d5f279a223742a20cd4f417fc5bb6a59d85a9fea8518073e6a4361f25dee"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (13 members, 50\u002B identical tokens): libs/db/eql/src/formulas/clip.rs:66-77 | libs/db/eql/src/formulas/rotate.rs:32-42 | libs/db/eql/src/formulas/rotate.rs:83-93 | libs/db/eql/src/formulas/rotate.rs:133-143 | libs/db/eql/src/formulas/rotate.rs:227-237 | libs/db/eql/src/formulas/rotate_world.rs:32-42 | libs/db/eql/src/formulas/rotate_world.rs:83-93 | libs/db/eql/src/formulas/rotate_world.rs:133-143 | libs/db/eql/src/formulas/rotate_world.rs:228-238 | libs/db/eql/src/formulas/translate_world.rs:32-42 | libs/db/eql/src/formulas/translate_world.rs:82-92 | libs/db/eql/src/formulas/translate_world.rs:132-142 | libs/db/eql/src/formulas/translate_world.rs:230-240 \u2014 These 13 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 13 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 13 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/formulas/clip.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd47509051e7d62a56fd2c3dcefbf047adb75d32d70baba280c2a47fbae0515"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): libs/cranelift-mlir/src/lower.rs:10809-10852 | libs/cranelift-mlir/src/lower.rs:10861-10893 | libs/cranelift-mlir/src/lower.rs:11128-11159 | libs/cranelift-mlir/src/lower.rs:11301-11349 | libs/cranelift-mlir/src/lower.rs:11417-11482 | libs/cranelift-mlir/src/lower.rs:11540-11586 | libs/cranelift-mlir/src/lower.rs:11635-11681 \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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":10809}}}],"partialFingerprints":{"codehealthFindingId/v1":"01bc96f0f60e4e13884e568ed26d7b12e743b49b2cb9042345fe916a4aabc770"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): libs/db/src/merge.rs:393-468 | libs/db/src/merge.rs:528-547 | libs/db/src/merge.rs:550-568 | libs/db/src/merge.rs:591-626 | libs/db/src/trim.rs:198-253 | libs/db/src/trim.rs:325-406 | libs/db/src/utils.rs:193-237 \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":"libs/db/src/merge.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3d848566756bdadb1384e0acf07b0f0bb3dda491866e5a04b6e48db9ae419f"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): libs/cranelift-mlir/src/lower.rs:10861-10893 | libs/cranelift-mlir/src/lower.rs:11043-11077 | libs/cranelift-mlir/src/lower.rs:11086-11119 | libs/cranelift-mlir/src/lower.rs:11417-11482 | libs/cranelift-mlir/src/lower.rs:11635-11681 \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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":10861}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7c0e76ee72fd4ee8bb3d0001ff613eced6347574fce351f5e5589ad92e04a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): libs/cranelift-mlir/src/parser.rs:1608-1694 | libs/cranelift-mlir/src/parser.rs:1926-2075 | libs/cranelift-mlir/src/parser.rs:2189-2235 | libs/cranelift-mlir/src/parser.rs:2404-2486 | libs/cranelift-mlir/src/parser.rs:2492-2581 \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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1608}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff39cd233a7b81d23ece96e61602154f2f426af9115c419d30926464caa3048"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): libs/db/eql/src/formulas/abs.rs:26-37 | libs/db/eql/src/formulas/arccos.rs:30-41 | libs/db/eql/src/formulas/degrees.rs:26-37 | libs/db/eql/src/formulas/sign.rs:33-44 | libs/db/eql/src/formulas/sqrt.rs:26-37 \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":"libs/db/eql/src/formulas/abs.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2dec665bf43d8332c3a6ff3942685c2aa7cb41010794676fa049b328f31319"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): libs/db/eql/src/formulas/direction.rs:40-50 | libs/db/eql/src/formulas/translate.rs:44-54 | libs/db/eql/src/formulas/translate.rs:86-96 | libs/db/eql/src/formulas/translate.rs:127-137 | libs/db/eql/src/formulas/translate.rs:185-195 \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":"libs/db/eql/src/formulas/direction.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"997bcc899d7844cf192df6d64791cd8b05e132bc0724deae280cf63ec7ef57a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): libs/db/src/drop.rs:55-193 | libs/db/src/fix_timestamps.rs:33-277 | libs/db/src/prune.rs:24-127 | libs/db/src/time_align.rs:46-187 | libs/db/src/truncate.rs:20-100 \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":"libs/db/src/drop.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"016734c2d80ec824c7c756c9b990e278e4a9d0f23cbeadd1279f2961d1ca1175"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): libs/elodin-editor/src/ui/command_palette/palette_items.rs:827-839 | libs/elodin-editor/src/ui/command_palette/palette_items.rs:869-881 | libs/elodin-editor/src/ui/command_palette/palette_items.rs:883-895 | libs/elodin-editor/src/ui/command_palette/palette_items.rs:897-909 | libs/elodin-editor/src/ui/command_palette/palette_items.rs:911-923 \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":"libs/elodin-editor/src/ui/command_palette/palette_items.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b399215900fbc2a69ceb8e5c1f7ff6e03b07f908bdf3765cc95b5b9728b12d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): libs/db/src/drop.rs:196-251 | libs/db/src/fix_timestamps.rs:33-277 | libs/db/src/prune.rs:24-127 | libs/db/src/time_align.rs:196-259 \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":"libs/db/src/drop.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe0f8d3376c8f06bfa02d0d225c83952ae6bd069fe79ca0ec1a2e02631202c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): libs/db/src/drop.rs:334-346 | libs/db/src/prune.rs:130-142 | libs/db/src/time_align.rs:262-283 | libs/db/src/time_align.rs:290-344 \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":"libs/db/src/drop.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"d909d1c923c437562cdac60db195db4e47c28180918fc58576f6d433f66d1fbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): libs/elodin-editor/src/plugins/view_cube/interactions.rs:1285-1299 | libs/elodin-editor/src/plugins/view_cube/interactions.rs:1307-1321 | libs/elodin-editor/src/plugins/view_cube/interactions.rs:1329-1343 | libs/elodin-editor/src/plugins/view_cube/interactions.rs:1351-1365 \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":"libs/elodin-editor/src/plugins/view_cube/interactions.rs"},"region":{"startLine":1285}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6078412db5e7b5713302eedc690d143df2f191a5ce49d5ba65b1969c4556a5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): libs/elodin-macros/src/from_builder.rs:16-75 | libs/elodin-macros/src/from_op.rs:15-60 | libs/elodin-macros/src/into_op.rs:15-71 | libs/elodin-macros/src/repr_monad.rs:16-130 \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":"libs/elodin-macros/src/from_builder.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"1364a5b94cf799f543990b55cd5f83f514694408025d28b4c879b8e820ed61f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): libs/impeller/kdl/src/de.rs:1948-2057 | libs/impeller/kdl/src/de.rs:2350-2391 | libs/impeller/kdl/src/de.rs:2393-2454 | libs/impeller/kdl/src/de.rs:2514-2662 \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":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":1948}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe987d321d2618a4c236d0d786ec4ba506a2bc1515ffd4f87e34798c25eda98"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): libs/impeller/src/types.rs:205-219 | libs/impeller/src/types.rs:223-238 | libs/nox-py/src/db/mod.rs:69-84 | libs/nox-py/src/world_builder.rs:1967-2093 \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":"libs/impeller/src/types.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff3d542f1f290df1b8bf3823a839e4bd9cd3dc96ec4c9af14df02f313205bc3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (180 corresponding lines): libs/nox/src/noxpr/node.rs:257-465 | libs/nox/src/noxpr/node.rs:469-648 \u2014 These two members are one piece of code written twice and then edited apart: 180 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc9f04279ece40c98b09dbf98a7493e7357e0c3c4b8db495885776fbb02b65c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (65 corresponding lines): libs/cranelift-mlir/src/lower.rs:10043-10107 | libs/cranelift-mlir/src/lower.rs:10116-10183 \u2014 These two members are one piece of code written twice and then edited apart: 65 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":10043}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd0ef6cb30fea2cd0dfcb43f136dfc8326d6911e4b37ce2ef5c63e9c0aa70368"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (95 corresponding lines): libs/postcard-c/codegen/src/lib.rs:204-298 | libs/postcard-c/codegen/src/lib.rs:314-425 \u2014 These two members are one piece of code written twice and then edited apart: 95 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/postcard-c/codegen/src/lib.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7061f00fef12273923e56d87f273b339fde75dcab5ecbc380f8ee78904631a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (55 corresponding lines): libs/db/src/bin/bench-csv-export.rs:75-129 | libs/db/tests_query/csv_export_goldie.rs:118-182 \u2014 These two members are one piece of code written twice and then edited apart: 55 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/bin/bench-csv-export.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4e74f16d024a5b532bdee092492329950edc4ca184e798cdfb50e0e78e9b1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (93 corresponding lines): libs/cranelift-mlir/src/lower.rs:2163-2258 | libs/cranelift-mlir/src/lower.rs:2273-2365 \u2014 These two members are one piece of code written twice and then edited apart: 93 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":2163}}}],"partialFingerprints":{"codehealthFindingId/v1":"44bf553983d88317f3c6efc0d156f74c4b6543a95a255203895226d7380e92ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (71 corresponding lines): fsw/sensor-fw/src/adc.rs:80-150 | fsw/sensor-fw/src/adc.rs:154-233 \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":"fsw/sensor-fw/src/adc.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a38c6617816c97e4f25292db7bae019170f444ae6514527d9e1c39155b93b9f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (104 corresponding lines): libs/cranelift-mlir/src/lower.rs:3338-3444 | libs/cranelift-mlir/src/lower.rs:3461-3564 \u2014 These two members are one piece of code written twice and then edited apart: 104 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":3338}}}],"partialFingerprints":{"codehealthFindingId/v1":"67073b14e7e0b1d4a5049f3cadc7ca95a0ae51cf9b0b613c1b5b2219c722b215"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): libs/elodin-editor/src/plugins/cinematic_earth/effects.rs:267-338 | libs/elodin-editor/src/plugins/cinematic_earth/effects.rs:351-404 \u2014 These two members are one piece of code written twice and then edited apart: 54 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/cinematic_earth/effects.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb86fd1641e007234bcaabff8419d4bc231a9b79d7f6a6fe5a7062583436adc8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (55 corresponding lines): libs/elodin-editor/src/plugins/thruster_particles/mod.rs:449-503 | libs/elodin-editor/src/plugins/thruster_particles/mod.rs:505-576 \u2014 These two members are one piece of code written twice and then edited apart: 55 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/thruster_particles/mod.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"40bba9428cf00ab1042d1e3811a1ca39cdd2e56160d32ae566f004c86885e616"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): libs/impeller/src/types.rs:441-457 | libs/impeller/wkt/src/value.rs:305-341 \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":"libs/impeller/src/types.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc332ee7f4847fd9be1273d4c676e05502c5c420b3d4d724cdde146e92864974"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): libs/bevy_world_mesh/src/bin/fetch_global_spherical.rs:363-412 | libs/bevy_world_mesh/src/bin/fetch_global_spherical.rs:420-471 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/bin/fetch_global_spherical.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78141f6237f790b0963702495af153f9938380ead7b8ded8003bf8c325385a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (76 corresponding lines): libs/elodin-editor/src/ui/gauges/geo_position.rs:64-142 | libs/elodin-editor/src/ui/gauges/orientation.rs:103-178 \u2014 These two members are one piece of code written twice and then edited apart: 76 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/gauges/geo_position.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f7486c268579685acd31b2a11884d4a21529ebc149fc8e51a9ae13ff1d8f57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): libs/impeller/src/types.rs:459-473 | libs/impeller/wkt/src/value.rs:343-357 \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":"libs/impeller/src/types.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"01845986791059c0d46a87b32607ad13c1cee45991f2eb4b9d3ac4fefdb3c517"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): libs/elodin-editor/src/object_3d.rs:517-537 | libs/elodin-editor/src/plugins/display_kernel.rs:448-468 \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":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ce45be182403fb1e229c34e7515293ec078e9bce2b0a37d9077e5aa2b9bc97"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): fsw/sensor-fw/src/bmi270.rs:308-357 | fsw/sensor-fw/src/bmi270_spi.rs:177-229 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/bmi270.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8c1b286cce2cc746a33de4bc3859bcdd495a0cfb265d7a02d0716a63584501"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): libs/impeller/kdl/src/de.rs:78-137 | libs/impeller/kdl/src/de.rs:498-543 \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":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d97348ea27db22e08d49761b2a3c99e80934f997820a945f0c89e5b52ce39a41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 56\u002B corresponding lines): libs/db/eql/src/formulas/rotate.rs:164-219 | libs/db/eql/src/formulas/rotate_world.rs:164-220 | libs/db/eql/src/formulas/translate_world.rs:163-222 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 56 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":"libs/db/eql/src/formulas/rotate.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6694126aca5dd818c98041eb31c16f9adb3a619606b054d9bc3f102cba0275"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (58 corresponding lines): libs/db/src/bin/bench.rs:859-917 | libs/db/src/bin/bench.rs:932-989 \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":"libs/db/src/bin/bench.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"95761cc140a78f809d1104b9a146c6e21be6b5e5444d9fa8cae13d37f162e02b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): libs/elodin-editor/src/ui/monitor.rs:93-141 | libs/elodin-editor/src/ui/monitor.rs:200-238 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/monitor.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"09309f7e6ed1390bef82221faffe818695b97da69abe4a1507367a21a4740468"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): libs/cranelift-mlir/src/lower.rs:3822-3864 | libs/cranelift-mlir/src/lower.rs:3882-3933 \u2014 These two members are one piece of code written twice and then edited apart: 43 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":3822}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9039e9a1cbe3c57b184045b8564c9a746311e9808f43918687030701f7e11e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): libs/s10/src/recipe.rs:172-217 | libs/s10/src/recipe.rs:224-269 \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":"libs/s10/src/recipe.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1e3c1ca208f01b07859c73d32d6bd115ddfecfd15d99053ab75c0451cc766a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): libs/impeller/bevy/src/lib.rs:2387-2428 | libs/impeller/bevy/src/lib.rs:2459-2499 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":2387}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe1e0c5657434e5c80dd7d7e4cdb03c78e746ee7da1636adc68e9cc7d3dd65c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): libs/stellarator/src/poll/ops.rs:44-90 | libs/stellarator/src/poll/ops.rs:159-199 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/src/poll/ops.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"15b0006373471e52c4c728ee68424c10fc23aadedab47957632bb94524999639"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): libs/elodin-editor/src/ui/video_stream.rs:747-784 | libs/elodin-editor/src/ui/video_stream.rs:838-891 \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":"libs/elodin-editor/src/ui/video_stream.rs"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d74e0763201b224f4260664e87ef393c647432a23152a871125ba1c2a35415"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): libs/elodin-editor/src/ui/label.rs:116-155 | libs/elodin-editor/src/ui/label.rs:163-201 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/label.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"194876c304262e41bf4fdcc49cd4f2e9e6eca833cbc27bb520a5a669d90a8bf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): libs/db/src/arrow/mod.rs:543-582 | libs/db/src/arrow/mod.rs:586-626 \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":"libs/db/src/arrow/mod.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4729640230e765f0631cd6536614179361f64583eb768b4f68af03c2da682b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): libs/db/src/utils.rs:252-289 | libs/db/src/utils.rs:296-333 \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":"libs/db/src/utils.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"7680f7772aa8b5f8fa6ea52ab287d7c7d09ce4ac9d09bbd0f14ec1414f862fea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): libs/nox-py/src/impeller_server.rs:363-403 | libs/nox-py/src/impeller_server.rs:453-489 \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":"libs/nox-py/src/impeller_server.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9410af0028bc87cb4e0d4549ee23d08d16c60be8052f49e5316f7dc9cc7fd47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): libs/db/cli/src/lib.rs:259-294 | libs/db/cli/src/lib.rs:296-324 \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":"libs/db/cli/src/lib.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26f971454d5c62a169a97765d7772ffedb35c06c68373e1797a59615fc4c76a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 25\u002B corresponding lines): libs/stellarator/src/poll/ops.rs:120-144 | libs/stellarator/src/poll/ops.rs:224-248 | libs/stellarator/src/poll/ops.rs:540-564 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 25 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/src/poll/ops.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8dceb33007025828519dd97a05cf439d5df084e5164a3411af0f24d51acec00"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): libs/cranelift-mlir/src/parser.rs:1700-1740 | libs/cranelift-mlir/src/parser.rs:1746-1785 \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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1700}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ff531891f1371c7e3d692b5c027e898cf3b88152e4814226aab896475c064b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): libs/stellarator/src/os.rs:133-169 | libs/stellarator/src/os.rs:176-210 \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":"libs/stellarator/src/os.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bc9e7f17ce2a817fb651ec3eafe00cc2bd3adbbd005848602158eb0214ba04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): libs/impeller/kdl/src/rewrite.rs:274-314 | libs/impeller/kdl/src/rewrite.rs:350-385 \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":"libs/impeller/kdl/src/rewrite.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e08e5f5ca9b9aee7816fff2ecfbf441338631f9bb6c47e20f1f1e0dda6118d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): libs/cranelift-mlir/src/lower.rs:10345-10376 | libs/cranelift-mlir/src/lower.rs:10660-10681 \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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":10345}}}],"partialFingerprints":{"codehealthFindingId/v1":"548e2f954e6e38100f784bc30b79c92f87ed06fb88b73c65577789ad9df9f45f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 28\u002B corresponding lines): libs/db/eql/src/formulas/angular.rs:23-53 | libs/db/eql/src/formulas/linear.rs:23-53 | libs/db/eql/src/formulas/linear.rs:102-131 | libs/db/eql/src/formulas/norm.rs:4-31 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 28 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/formulas/angular.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5a5bff0c1c894195c8f9275adc5a75bd52cd50fa92a2e8755d5987e430e19b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): libs/cranelift-mlir/src/parser.rs:848-878 | libs/cranelift-mlir/src/parser.rs:1477-1506 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab16e4dd5494e559a3d22be8078bcafe044cf899df30d31389c00f87c061cf20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): libs/elodin-editor/src/ui/inspector/gauges.rs:61-95 | libs/elodin-editor/src/ui/inspector/gauges.rs:113-155 \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":"libs/elodin-editor/src/ui/inspector/gauges.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4a3e14b160a50c944e6ea0adb954ed44ed4485c14148f7251ad106041c518d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): libs/nox/src/array/mod.rs:1368-1395 | libs/nox/src/array/mod.rs:1425-1452 \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":"libs/nox/src/array/mod.rs"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4a9983a6f28afba6eab4c7fa27ea7e4d13998f87f92e305d87eac46a5d7542"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): libs/db/src/export.rs:60-92 | libs/db/src/export.rs:100-133 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/export.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"be07387c3802b07cb62d93db5f41913525c8bce652374d93ff803110274dd897"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): libs/elodin-editor/src/object_3d.rs:1803-1832 | libs/elodin-editor/src/object_3d.rs:1834-1870 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb57344b7a65a4f754fc33f6a1433a040d897b012275b61a25fb0ed7e5ada18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): libs/cranelift-mlir/src/const_fold.rs:1136-1158 | libs/cranelift-mlir/src/const_fold.rs:1160-1182 \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":"libs/cranelift-mlir/src/const_fold.rs"},"region":{"startLine":1136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5df26d8a16db0ac994ce69ec79290c846b50b6b00fd09a76b1e7fabffa546f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): libs/db/src/grpc/stream.rs:57-87 | libs/db/src/grpc/stream.rs:89-114 \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":"libs/db/src/grpc/stream.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc98f287f3a748fa1af8494e673fecc936d73721754d59d0c6574bb173fa248e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): fsw/sensor-fw/src/fm24cl16b.rs:119-151 | fsw/sensor-fw/src/fm24cl16b.rs:158-197 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/fm24cl16b.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ab1be0c6043d7f5c5d218752eae135e8d42cab5e7b743f66bb7e03d2c36965"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): libs/elodin-editor/src/plugins/view_cube/interactions.rs:1378-1420 | libs/elodin-editor/src/plugins/view_cube/interactions.rs:1432-1467 \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":"libs/elodin-editor/src/plugins/view_cube/interactions.rs"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd3741a57a111a83fa117d409c71ff495fd8ec61a70504cb76c966858c29232"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): libs/elodin-editor/src/plugins/view_cube/interactions.rs:1615-1635 | libs/elodin-editor/src/plugins/view_cube/interactions.rs:1656-1675 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/view_cube/interactions.rs"},"region":{"startLine":1615}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c893b466e74d622c93efdecbd0330542fd050b40c86d383b6bdabcf4e47b6aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 29\u002B corresponding lines): libs/elodin-editor/src/plugins/frustum/mod.rs:93-125 | libs/elodin-editor/src/plugins/frustum/mod.rs:198-226 | libs/elodin-editor/src/plugins/frustum_intersection/mod.rs:207-237 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 29 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/frustum/mod.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"43efbb099825846d9b805a162fe867a94f8416bec0626ac8df0d63192d0ba819"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): libs/elodin-editor/src/ui/plot/gpu.rs:1733-1770 | libs/elodin-editor/src/ui/plot_3d/gpu.rs:1209-1250 \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":"libs/elodin-editor/src/ui/plot/gpu.rs"},"region":{"startLine":1733}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e49eb2643bb76587bb4f03f9de000642b32e3bd6c71c68af1d8daa77e33ca7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): libs/cranelift-mlir/src/tensor_rt.rs:347-362 | libs/cranelift-mlir/src/tensor_rt.rs:364-379 \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":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"5156de0cbdcb9cc49ad76b2b815dcb49b192bed6576c5b25871c86682d7b8b5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): libs/elodin-editor/src/ui/command_palette/palette_items.rs:1825-1850 | libs/elodin-editor/src/ui/command_palette/palette_items.rs:1852-1883 \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":"libs/elodin-editor/src/ui/command_palette/palette_items.rs"},"region":{"startLine":1825}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d9c919164d31c12c27548951ea0087b44d11e9322247afac088ede2c55c1ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): libs/elodin-editor/src/ui/command_palette/palette_items.rs:648-673 | libs/elodin-editor/src/ui/command_palette/palette_items.rs:734-766 \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":"libs/elodin-editor/src/ui/command_palette/palette_items.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c9bfeb6a56603d8dc2cc700201fd36671d4c9acd45d1734e4bac5b4c5f1613"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): libs/bevy_world_mesh/src/bin/fetch_real_terrain.rs:215-247 | libs/bevy_world_mesh/src/bin/fetch_real_terrain.rs:290-312 \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":"libs/bevy_world_mesh/src/bin/fetch_real_terrain.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"0227eb6ae200e79500e17d3c72cbdaabd890a9d543652517fc286a934a5742ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): libs/elodin-editor/src/ui/command_palette/palette_items.rs:925-954 | libs/elodin-editor/src/ui/command_palette/palette_items.rs:956-983 \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":"libs/elodin-editor/src/ui/command_palette/palette_items.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6a56d6a6b863cc0873949ac0b5b16b5305a4706b5a1fbc324d3cfc10e9da8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): libs/stellarator/buf/src/lib.rs:44-69 | libs/stellarator/src/buf.rs:30-55 \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":"libs/stellarator/buf/src/lib.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"9428f2c62840a14db7e602aa0cc7fe889375939d3d2bed4f58165bac7e59422d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): fsw/sensor-fw/src/command.rs:74-91 | fsw/sensor-fw/src/command.rs:93-108 \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":"fsw/sensor-fw/src/command.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5483a9066097f24a1fafe9f17615055b4cc253dffda9a7e302b721d0c6b76030"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): libs/elodin-editor/src/ui/gauges/horizon.rs:131-148 | libs/elodin-editor/src/ui/gauges/orientation.rs:231-245 \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":"libs/elodin-editor/src/ui/gauges/horizon.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"8927ba02a7a844eabaa1d8b7c9a3591bb734bc78bf67165721535631bd9ad22a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): libs/stellarator/macros/src/lib.rs:10-39 | libs/stellarator/macros/src/lib.rs:43-71 \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":"libs/stellarator/macros/src/lib.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad6288d80b77416b9e2cfacc7133dd09a9903fe0cce607b9b7b93907242d302"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): libs/db/src/arrow/mod.rs:250-266 | libs/db/src/arrow/mod.rs:276-303 \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":"libs/db/src/arrow/mod.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"e492068b4a8e4feb7b82504ffd6f7479911d61ade3faa4e4a6a83198add41235"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): libs/impeller/kdl/src/de.rs:1497-1519 | libs/impeller/kdl/src/de.rs:1521-1551 \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":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":1497}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ebb00ecc8b9282f74c476019d8774445ef7f2d753c5caf0ca94ccf0149cae0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): libs/monte-carlo/src/lib.rs:3589-3604 | libs/nox-py/src/tick_metrics.rs:717-733 \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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":3589}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f4d18499f1da40b5643e11c2fa8ebef143c092b144416d33f8618584e403ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): libs/bevy_world_mesh/src/bin/fetch_global_spherical.rs:312-330 | libs/bevy_world_mesh/src/bin/fetch_global_spherical.rs:337-355 \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":"libs/bevy_world_mesh/src/bin/fetch_global_spherical.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6b677795385b3f74a0c8353bfb735db7f08feb2ac0237ce0cdffe15a90fba0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): examples/cube-sat-pysim/main.py:197-204 | examples/cube-sat/main.py:218-225 | fsw/roci/adcs/reference-impls/mekf.py:31-38 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/cube-sat-pysim/main.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b9d137d0a689060b7ee8fcb5b55e7f9420fae0acd9774b6475c1bf230aa70f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): libs/cranelift-mlir/src/profile.rs:496-517 | libs/cranelift-mlir/src/profile.rs:550-568 \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":"libs/cranelift-mlir/src/profile.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a013528d7cb39a1f796913032df94cc90eb691d51ae849764e65c5f11f4f35a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): libs/bevy_world_mesh/src/fetch.rs:288-306 | libs/bevy_world_mesh/src/fetch.rs:313-333 \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":"libs/bevy_world_mesh/src/fetch.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6159f4695a618df87530ad342ff48da6f4610d60353ad72defd84917f27e11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): libs/elodin-editor/src/plugins/view_cube/interactions.rs:1532-1558 | libs/elodin-editor/src/plugins/view_cube/interactions.rs:1567-1589 \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":"libs/elodin-editor/src/plugins/view_cube/interactions.rs"},"region":{"startLine":1532}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9f3eb9dca6351f6f447b678eea5509ff47085636606c525846db5bfd790283"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): libs/nox/src/noxpr/repr.rs:175-194 | libs/nox/src/noxpr/repr.rs:266-285 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/repr.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"92bb244d9dee062fbcddfde5e5fece87a9bb6949879e8533c5093171c9b5dd5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): libs/elodin-editor/src/plugins/cinematic_earth/effects.rs:437-451 | libs/elodin-editor/src/plugins/cinematic_earth/effects.rs:454-468 | libs/elodin-editor/src/plugins/thruster_particles/mod.rs:423-447 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/cinematic_earth/effects.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba255956f04bc9bf49f17a8da45d0fc4fa30aa5f473663d254785c97cca0b77d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): libs/cranelift-mlir/src/lower.rs:2943-2981 | libs/cranelift-mlir/src/lower.rs:3062-3088 \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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":2943}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fb214c3a732a76f816e13e2c02061fa7ee57ce4bed6dee390b05bff57b6e57"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): libs/stellarator/src/io.rs:13-30 | libs/stellarator/src/io.rs:36-53 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/src/io.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"4340d43a1ea04ba9540952ff659072882df96525bcb8c3cd3a2f675c837e611a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): libs/nox-py/src/six_dof.rs:252-269 | libs/nox-py/src/six_dof.rs:281-296 \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":"libs/nox-py/src/six_dof.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"346ab70e0e27e63c9a27392743b7eed21c5888ae3b7157b0ebf25bb8b341c2d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): libs/db/src/grpc/stream.rs:582-603 | libs/db/src/grpc/stream.rs:609-630 \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":"libs/db/src/grpc/stream.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df3dba3bdda962c9780b66b6358768516d20e008ab24ad96e4526a3fe3da64c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): libs/elodin-editor/src/ui/schematic/load.rs:1097-1113 | libs/elodin-editor/src/ui/schematic/load.rs:1115-1129 \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":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":1097}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed9c942f6e4def23cba821fa87894855c4cfad53b80014b4b10eaef909db52c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): libs/nox-frames/src/iers.rs:58-67 | libs/nox-frames/src/iers.rs:69-78 \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":"libs/nox-frames/src/iers.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea2d790b125c7fb651801d58000caa46b256c6e7e35d4aa0b0dd729443c0a72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): libs/elodin-editor/src/ui/plot/data.rs:2896-2914 | libs/elodin-editor/src/ui/plot/data.rs:2917-2934 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/data.rs"},"region":{"startLine":2896}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6d3ecd5f9b84045e6e0ed2358b84a399f7afe5e6122e9c5197dce665a8415a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): libs/nox-py/src/spatial.rs:29-46 | libs/nox-py/src/spatial.rs:198-215 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/spatial.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6d9f1f2ddbfc3b059ca5771e262fd54eb45be9211f79e553f6d1999eea9ac7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): libs/impeller/src/types.rs:492-512 | libs/impeller/src/types.rs:514-534 \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":"libs/impeller/src/types.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba17b9364748ad606eabced6b6b96480c6e95a576635e20eb4d1ac7411b73d81"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): libs/s10/src/recipe.rs:309-328 | libs/s10/src/recipe.rs:360-379 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/src/recipe.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22bcb3e8d84f8eb5fde5c4fbe71adb39bf3cef400f53ab2209a0b6afe47e16d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): libs/bevy_world_mesh/src/fetch.rs:493-506 | libs/bevy_world_mesh/src/fetch.rs:514-527 \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":"libs/bevy_world_mesh/src/fetch.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bae4edceb694b3e019f5fd13ee26de971673528969982e4aa01aa8cc94bab2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): libs/cranelift-mlir/src/profile.rs:467-489 | libs/cranelift-mlir/src/profile.rs:529-546 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/profile.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb9b9c8ad51a5b3e8ae55db640e1bd966c44c3c23776de47f346f3051a00750"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): libs/cranelift-mlir/src/parser.rs:1395-1415 | libs/cranelift-mlir/src/parser.rs:1451-1471 | libs/cranelift-mlir/src/parser.rs:2081-2095 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ac1f9b85e0e957b28b7298d6edb18e0122abe00932749f686992b70a2a3c36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): libs/nox-py/src/db/client.rs:214-237 | libs/nox-py/src/db/writer.rs:170-193 \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":"libs/nox-py/src/db/client.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6e2791ea63cdf8a4f793b7327fab359e1b6f94f1d6fba540debaf7c0917b2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): libs/nox-py/src/cranelift_exec.rs:284-306 | libs/nox-py/src/jax_exec.rs:255-277 \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":"libs/nox-py/src/cranelift_exec.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea33313d9c05d7fbe3df6f8b704761d9be5cc20e8d4b014ec9e8a8afd76a6da3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): libs/elodin-editor/src/object_3d.rs:2921-2939 | libs/elodin-editor/src/object_3d.rs:2942-2957 \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":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":2921}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3be4464b8cc1676c86219b1f9c1e15678aa4c2a402438e383861d0911b1e9ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): libs/monte-carlo/src/lib.rs:4009-4024 | libs/monte-carlo/src/lib.rs:4054-4067 \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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":4009}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53ae6ef547560ef5d07c273cc643b2eeb137b914459b022aee2ee81060d8258"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): libs/nox-py/python/elodin/terrain_prepare.py:193-208 | scripts/export_photo3d_cache.py:39-51 \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":"libs/nox-py/python/elodin/terrain_prepare.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"536d3e3fad67fe3a185ceca92dcdb4128517606bf61ebb11c85ae562946d13a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): libs/db/eql/src/formulas/direction.rs:14-32 | libs/db/eql/src/formulas/translate.rs:9-24 | libs/db/eql/src/formulas/translate.rs:158-177 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/formulas/direction.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"caeb30a500657369fdfa7944a145c440dee7f9ae9cd518596037e24c227c31d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): libs/nox/src/array/mod.rs:567-588 | libs/nox/src/array/mod.rs:600-621 \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":"libs/nox/src/array/mod.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2b763cbaa116e670fa078596141997878d025b55de068dde97308593d67929"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): libs/nox-py/src/step_context.rs:425-445 | libs/nox-py/src/step_context.rs:452-464 \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":"libs/nox-py/src/step_context.rs"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffdd5d1ac4d63b6ea4e481f2f00dda2c76c68c2a73ba65b60e2f476af0a781fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): libs/bevy_world_mesh/src/scenes/globe.rs:147-171 | libs/bevy_world_mesh/src/scenes/planar.rs:39-63 \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":"libs/bevy_world_mesh/src/scenes/globe.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"60eb52ec3f5b12c8fa5b7fe82fadfb63c5cb507713ffb66ab68ce2585d0eef38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): libs/elodin-editor/src/object_3d.rs:2899-2919 | libs/elodin-editor/src/plugins/display_kernel.rs:307-331 \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":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":2899}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ec526f4078d420f4580d88cf63a5621a8b2fefc8d966f291d40e6f6a8c22ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): libs/bevy_world_mesh/src/fetch.rs:564-575 | libs/bevy_world_mesh/src/fetch.rs:607-618 \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":"libs/bevy_world_mesh/src/fetch.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fa1381c7b065fab8ecb639243f46f52e91854ddc354319d4b01f77f3a0dc89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): libs/s10/src/recipe.rs:131-139 | libs/s10/src/recipe.rs:147-155 \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":"libs/s10/src/recipe.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0db3386f5bbcee8e719c44a65344efdd508e1a4438c8dc0733efb38646502c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): libs/db/src/trim.rs:623-643 | libs/db/src/trim.rs:723-737 \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":"libs/db/src/trim.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bab2822eb4bf191d034abf4ed875664ef0e6537d83fc4f11fc032ab52c0a176"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): libs/nox-py/src/db/client.rs:620-646 | libs/nox-py/src/db/client.rs:685-702 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/db/client.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b756dea5f8fccf77025a05321b9581e618920bbc9fa30bfa65b2293b01814b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): libs/nox/src/array/mod.rs:420-434 | libs/nox/src/array/mod.rs:453-467 \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":"libs/nox/src/array/mod.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"56eb4fe3f50350e6da003ea01268ad38963170cd3ae1113e5cc0e507f8e7c07e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): libs/cranelift-mlir/src/interp.rs:1304-1322 | libs/cranelift-mlir/src/interp.rs:1330-1346 | libs/cranelift-mlir/src/interp.rs:1727-1746 \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":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd5e3b977dbfc870164cef20f43d0eedff17500822c846919fa871feca926f16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): libs/nox-py/src/db/client.rs:718-736 | libs/nox-py/src/db/client.rs:755-770 \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":"libs/nox-py/src/db/client.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"21fa80153175ed8e8eb793986ecb04dc052ee3fe2a3faa2d7ffc5eedf19ba4ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): libs/db/eql/src/formulas/angular.rs:86-100 | libs/db/eql/src/formulas/linear.rs:86-100 \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":"libs/db/eql/src/formulas/angular.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"956926d1259a350d872a96c79fce58855212d67d479473d4a1f651c5014309c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): fsw/roci/src/tokio.rs:59-75 | fsw/roci/src/tokio.rs:316-334 \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":"fsw/roci/src/tokio.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"592b745375d46bcd5e918840eabf4d99bbddb04cf67823220a97ce645d1c987a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): libs/cranelift-mlir/src/const_fold.rs:863-880 | libs/cranelift-mlir/src/const_fold.rs:887-905 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/const_fold.rs"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5324ce9ede28a5d0681d44e07575fb57eddfff9855b9da2f53326eb8489580e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): libs/cranelift-mlir/src/tensor_rt.rs:560-574 | libs/cranelift-mlir/src/tensor_rt.rs:653-661 \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":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"2891cc99efc31c917adcd884f496443df6386eff0c8cbb59e41f7b8113d9a9d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): libs/impeller/bevy/src/channels.rs:467-481 | libs/impeller/bevy/src/channels.rs:488-502 \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":"libs/impeller/bevy/src/channels.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"1072bc4e70023f40a057571e783bb7e8709dd995b61aa334606163abbdc476d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): libs/impeller/kdl/src/ser.rs:915-926 | libs/impeller/kdl/src/ser.rs:928-942 | libs/impeller/kdl/src/ser.rs:944-954 \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":"libs/impeller/kdl/src/ser.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab076d4e80377c5b46977d1d8d9c5f45226905274d33595b6b01a1f4471fba56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): libs/db/eql/src/formulas/atan2.rs:28-45 | libs/db/eql/src/formulas/clip.rs:44-64 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/formulas/atan2.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0b72ab6703157e52acbf30125b70182ef8a04a1066eebc83c520115afecb56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): libs/cranelift-mlir/src/const_fold.rs:1114-1130 | libs/cranelift-mlir/src/ir.rs:128-144 \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":"libs/cranelift-mlir/src/const_fold.rs"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fc705c57cb9da59c005f000b799654e4a314a53a97a355df9a34d3bcbf1377"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): libs/db/src/time_series.rs:24-37 | libs/db/src/time_series.rs:39-51 \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":"libs/db/src/time_series.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf538295096cab86a64c6af719b1f745643580b4ef3b4ce57f7e41b8e989c75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): libs/nox-py/src/spatial.rs:436-448 | libs/nox-py/src/spatial.rs:454-467 \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":"libs/nox-py/src/spatial.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe4b202b9225deedc5a0077c4ec1ef2ca8f5e27120510cb6a13dabac49ea78f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): fsw/roci/adcs/src/ukf.rs:179-189 | fsw/roci/adcs/src/ukf.rs:191-207 \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":"fsw/roci/adcs/src/ukf.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"844415f69210b9798cd303891b0a7ec7b012045609ad10e7b87cdda818412f32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): libs/cranelift-mlir/src/const_fold.rs:1518-1528 | libs/cranelift-mlir/src/const_fold.rs:1530-1540 \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":"libs/cranelift-mlir/src/const_fold.rs"},"region":{"startLine":1518}}}],"partialFingerprints":{"codehealthFindingId/v1":"694c514c6ddcb5146382e110be4acff04f1b84f77fc4a5179dade8ffdccd7bd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): libs/db/src/export_mcap.rs:806-815 | libs/elodin-editor/src/object_3d.rs:362-371 \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":"libs/db/src/export_mcap.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f3f3131b46088317a111101502bd0ca64af57dd79d762ac82383cd7c0911ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): libs/impeller/kdl/src/de.rs:1309-1322 | libs/impeller/kdl/src/de.rs:1907-1922 \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":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"aafce7c0689460456930ad06bbc10a87889c324bcb3217bda3649767419a19c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): libs/elodin-editor/src/plugins/frustum/mod.rs:249-262 | libs/elodin-editor/src/plugins/frustum_intersection/mod.rs:324-335 \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":"libs/elodin-editor/src/plugins/frustum/mod.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9df01e1f59510f2881adf488c874f89f7fef17e727dc1bf982a640fa8d3c48e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): fsw/msp-osd/src/config.rs:224-236 | fsw/msp-osd/src/db_client.rs:39-52 \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":"fsw/msp-osd/src/config.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d753b01c317ac8b4f65865e575d9a44391a596f46582057d899a4638f5e5292"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): libs/bevy_world_mesh/src/terrain/preprocess/mod.rs:76-98 | libs/bevy_world_mesh/src/terrain/render/tiling_prepass.rs:115-135 \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":"libs/bevy_world_mesh/src/terrain/preprocess/mod.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b384f54e724d77a2f5619093da1a70280bdd50006d07e06487a700d6d3e9275"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): libs/impeller/kdl/src/de.rs:1442-1458 | libs/impeller/kdl/src/de.rs:1614-1629 \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":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":1442}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdfaad154c45b3084c02617d2c3061ec9fa7c08207b2fdaf02e60dc15a45ca6c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): libs/nox-py/python/elodin/__init__.py:371-382 | libs/nox-py/python/elodin/__init__.py:388-404 \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":"libs/nox-py/python/elodin/__init__.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e06df71b2a2837caffc39fcc21fa7f770f35ed77c0b4b590d1ee3f39b9584c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): libs/elodin-editor/src/plugins/view_cube/interactions.rs:656-671 | libs/elodin-editor/src/plugins/view_cube/interactions.rs:679-694 \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":"libs/elodin-editor/src/plugins/view_cube/interactions.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"e668e079800a7cc613a34b24fd5bb9a4abe35f11d1c5166eebebdaa91ce1ad05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): libs/nox/src/bevy.rs:6-11 | libs/nox/src/bevy.rs:15-20 \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":"libs/nox/src/bevy.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5fc742fb8f6830199d5f8904d59d3cfec9d3ce1f6c2af43f36473aed0f8d84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): libs/nox/src/quaternion.rs:286-292 | libs/nox/src/quaternion.rs:298-304 \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":"libs/nox/src/quaternion.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1a3081fb455b46c8b585a0b2383b4b70eb92e9a9265c902580b88391dca150"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): libs/elodin-editor/src/ui/video_stream.rs:512-525 | libs/elodin-editor/src/ui/video_stream.rs:527-540 \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":"libs/elodin-editor/src/ui/video_stream.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d5774fd2b62e9df52b7dc4f2d2d60736b7a134b21b0ecf37aa6f3a13d4a878"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): fsw/sensor-fw/src/i2c_dma.rs:149-157 | fsw/sensor-fw/src/i2c_dma.rs:159-168 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/i2c_dma.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"91fc2116b093ae1a06804cf67362a6378cfac2c270b3a920936c500fe5fa4af4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): libs/elodin-editor/src/ui/plot/widget.rs:1591-1600 | libs/elodin-editor/src/ui/query_plot.rs:161-170 \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":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":1591}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94970c0f7795b5566906cfc0542be4433868730bd6e6f2a89884ab06e41c2ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): libs/hamann-chen-line/src/lib.rs:323-330 | libs/hamann-chen-line/src/lib.rs:351-360 \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":"libs/hamann-chen-line/src/lib.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"f26681f3a8e38961d163b07e50b371045f4b88bfc6b6224ec5737b781da2e8e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): libs/nox-py/src/ui/builders.rs:847-859 | libs/nox-py/src/ui/builders.rs:869-880 \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":"libs/nox-py/src/ui/builders.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"881b2180f27617d8332150e5670910d58fabfdd156f5f2aea3b6b6daf61b143b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): libs/cranelift-mlir/src/tensor_rt.rs:170-176 | libs/cranelift-mlir/src/tensor_rt.rs:178-184 | libs/cranelift-mlir/src/tensor_rt.rs:186-192 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b539ca0a9b056a66e9693677e27a218cb510f591967f3ea400a6f781b8370f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): libs/db/src/lib.rs:2855-2866 | libs/db/src/lib.rs:2875-2887 \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":"libs/db/src/lib.rs"},"region":{"startLine":2855}}}],"partialFingerprints":{"codehealthFindingId/v1":"442813a3fdb700e6d27aedf4e423f085612d4de9e47915d268eadad99b8430ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): libs/nox-py/python/elodin/egm08.py:138-145 | libs/nox-py/python/elodin/egm08.py:148-155 \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":"libs/nox-py/python/elodin/egm08.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e3ddb823ea8c8c080ca8fe718fd2ba66d3a8886cd510a93b2982699ce1ec78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): libs/db/src/assets.rs:394-407 | libs/elodin-editor/src/ui/schematic/mod.rs:798-812 \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":"libs/db/src/assets.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddedd3b2b5467d205d0c9e4aee6a864cb4a3248b5fd607c539598095ddbe5a70"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): libs/db/src/query.rs:681-689 | libs/db/src/query.rs:693-702 \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":"libs/db/src/query.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"70daf24400508c0ceb255972caa6aaf1489d1f6a09b003584c3225409a935858"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): libs/elodin-editor/src/ui/plot/data.rs:1661-1677 | libs/elodin-editor/src/ui/plot/data.rs:2940-2954 \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":"libs/elodin-editor/src/ui/plot/data.rs"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6a62f67b1464df6d803d910d844011027bab1abdf5bb6968829fb531ddf6c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): libs/impeller/src/types.rs:690-697 | libs/impeller/src/types.rs:699-706 \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":"libs/impeller/src/types.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"6116961e8f86966682d9b00abc1e12eed9d0707da8d05e47f97be92e8b4c9adc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): libs/stellarator/src/poll/mod.rs:249-263 | libs/stellarator/src/uring/mod.rs:302-314 \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":"libs/stellarator/src/poll/mod.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b599d469d98a12599c772d60e592c8296835063f6e8e9c412abec7bab7c7d2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): libs/stellarator/src/uring/ops.rs:77-86 | libs/stellarator/src/uring/ops.rs:118-127 \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":"libs/stellarator/src/uring/ops.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"df94b4811f8ceaef63c81cc273396231c2d5893b6ff595633ded6ff88566ecfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): libs/cranelift-mlir/src/lower.rs:8599-8612 | libs/cranelift-mlir/src/lower.rs:8618-8633 \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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":8599}}}],"partialFingerprints":{"codehealthFindingId/v1":"f281c7a020fb818e01752a974a1afbe589cf3f0d486065ea5de945e72d2b51e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): libs/db/src/assets.rs:49-59 | libs/elodin-editor/src/plugins/env_asset_source/mod.rs:7-17 \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":"libs/db/src/assets.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1386b8056a2c81777288e7f60c6d3a1cc843d55dd58d285340b508411a90a5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): libs/db/src/msg_log.rs:89-98 | libs/db/src/time_series.rs:96-107 \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":"libs/db/src/msg_log.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dbce4a526d97a07ed51829131e7d1f861b703ebe4b7d4a625f5ab10ec70b336"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): libs/impeller/kdl/src/de.rs:1631-1643 | libs/impeller/kdl/src/de.rs:1645-1657 | libs/impeller/kdl/src/de.rs:1659-1671 \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":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a5812d5674c4c7a5f0fe24d8338000158bec7dd0ea0d6d27b4ceb7de5ec1b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): libs/elodin-editor/src/plugins/view_cube/camera.rs:1000-1016 | libs/elodin-editor/src/plugins/view_cube/camera.rs:1033-1051 \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":"libs/elodin-editor/src/plugins/view_cube/camera.rs"},"region":{"startLine":1000}}}],"partialFingerprints":{"codehealthFindingId/v1":"4445bfcf057a2d7020ca0e03cd03c256be1555289786450469e644864bdf908b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): libs/cranelift-mlir/src/lower.rs:3234-3241 | libs/cranelift-mlir/src/lower.rs:3253-3260 \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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":3234}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae11bafd32fc18e16da41a4282d456719eb3f98836b8643cccdbdfac03e6d0dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 7\u002B corresponding lines): libs/cranelift-mlir/src/tensor_rt.rs:194-200 | libs/cranelift-mlir/src/tensor_rt.rs:202-208 | libs/cranelift-mlir/src/tensor_rt.rs:210-216 | libs/cranelift-mlir/src/tensor_rt.rs:653-661 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e795ea3aa8b0e85981182467a12849a48f50c13b3213ce67c293a0ef1cd93c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): libs/nox/src/array/mod.rs:481-497 | libs/nox/src/array/mod.rs:509-520 | libs/nox/src/array/mod.rs:525-536 \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":"libs/nox/src/array/mod.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca27bde18e850543e9aea8a4056977977ce7c898a11573b1263abfefa008df27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 8\u002B corresponding lines): libs/cranelift-mlir/src/lower.rs:1030-1037 | libs/cranelift-mlir/src/lower.rs:1153-1161 | libs/cranelift-mlir/src/lower.rs:1177-1184 | libs/cranelift-mlir/src/lower.rs:1220-1227 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":1030}}}],"partialFingerprints":{"codehealthFindingId/v1":"9948b5416133acd819b7db99abbc3de339d5d540f46035010c8df1aee73475cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): libs/impeller/kdl/src/rewrite.rs:316-331 | libs/impeller/kdl/src/rewrite.rs:387-403 \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":"libs/impeller/kdl/src/rewrite.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb765d4278f10a4add68ef6e188e160b0d78d58764f60d5c50e5caa29e7b6652"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): libs/nox-py/src/s10.rs:292-309 | libs/nox-py/src/s10.rs:331-346 \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":"libs/nox-py/src/s10.rs"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7404cdc2f8cea6b532afe580fc902361f226267139f4680d5a4965d37a7038"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): libs/bevy_world_mesh/src/terrain/render/terrain_view_bind_group.rs:199-214 | libs/bevy_world_mesh/src/terrain/render/terrain_view_bind_group.rs:222-241 \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":"libs/bevy_world_mesh/src/terrain/render/terrain_view_bind_group.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"2695740498bdf4556a4c252a7bb4334c03309ed68e705f3e3f8a5bddc0ad6f6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): libs/nox-py/src/db/stream.rs:277-285 | libs/nox-py/src/db/stream.rs:436-444 \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":"libs/nox-py/src/db/stream.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"0947dda169969d91095247100892c98dc1bc3df3a950f6df170be015377e9c59"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): libs/elodin-editor/src/plugins/thruster_particles/mod.rs:1397-1406 | libs/elodin-editor/src/ui/gauges/mod.rs:35-42 \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":"libs/elodin-editor/src/plugins/thruster_particles/mod.rs"},"region":{"startLine":1397}}}],"partialFingerprints":{"codehealthFindingId/v1":"612c467f2188be7953eaaf1edd264da030c22e635dbb58aed7dbf1f11c907962"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): libs/elodin-editor/src/plugins/editor_cam_input.rs:226-239 | libs/elodin-editor/src/ui/plot/widget.rs:2655-2669 \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":"libs/elodin-editor/src/plugins/editor_cam_input.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3159e914864da0d30acdb0e2c9bd1ef02868c8d3246d312729d5d9f83fc31f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): libs/bevy_world_mesh/src/fetch.rs:557-562 | libs/bevy_world_mesh/src/fetch.rs:600-605 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/fetch.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a783292290b4a411ee29fe18a999a4517d2b06a87b8b3005b774fb10ac228ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): libs/elodin-editor/src/lib.rs:955-968 | libs/elodin-editor/src/lib.rs:976-986 \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":"libs/elodin-editor/src/lib.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb55fd41bf254602cc1dae71fe4074351f3942bee15b735cc5940a1ad4c6830"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): libs/nox-py/src/impeller_server.rs:855-869 | libs/nox-py/src/impeller_server.rs:871-885 \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":"libs/nox-py/src/impeller_server.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d882ae20e1b05802f9492a8d083dbdeb5f7aced7f2f5f00c8c89120dae3db7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): fsw/msp-osd/src/osd_grid.rs:42-51 | fsw/msp-osd/src/osd_grid.rs:55-64 \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":"fsw/msp-osd/src/osd_grid.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"47570892bc86d28d778b0dc5d6629af0f889c55bc083081b116bd8f451f8452a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): fsw/sensor-fw/src/fm24cl16b.rs:77-92 | fsw/sensor-fw/src/fm24cl16b.rs:99-112 \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":"fsw/sensor-fw/src/fm24cl16b.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1953bdfa3ba03157cf7c93943d038b4e61a11b54d508343917b3b7e79a70fbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): libs/elodin-editor/src/ui/plot/widget.rs:2765-2773 | libs/elodin-editor/src/ui/plot/widget.rs:2775-2783 \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":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":2765}}}],"partialFingerprints":{"codehealthFindingId/v1":"846e668c2b59b0fe32fdb7b190fdd5e59f52708c8d71dfae2b1a84993f2c1b9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 8\u002B corresponding lines): libs/cranelift-mlir/src/interp.rs:2501-2509 | libs/cranelift-mlir/src/interp.rs:2511-2519 | libs/cranelift-mlir/src/interp.rs:2521-2529 | libs/cranelift-mlir/src/interp.rs:2531-2539 | libs/cranelift-mlir/src/interp.rs:2541-2548 | libs/cranelift-mlir/src/interp.rs:2550-2557 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":2501}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e7ed5099e50dcef81840487975094c03d61bbf94dd4d2c72587a09c4a2bf92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): libs/elodin-editor/src/ui/plot/data.rs:1775-1785 | libs/elodin-editor/src/ui/plot/data.rs:1787-1797 \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":"libs/elodin-editor/src/ui/plot/data.rs"},"region":{"startLine":1775}}}],"partialFingerprints":{"codehealthFindingId/v1":"09766d6824a4242bc2a64d1b04d187964a7a7b2734b4b612977563849fe97c51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): libs/impeller/bevy/src/prefetch.rs:225-240 | libs/impeller/bevy/src/prefetch.rs:459-476 \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":"libs/impeller/bevy/src/prefetch.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"e616818cd1857de108bd71d2a151c205bf4b5814afc9085f9d94d7dd1a8ef273"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): libs/nox-py/src/db/client.rs:199-211 | libs/nox-py/src/db/writer.rs:155-167 \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":"libs/nox-py/src/db/client.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"344ff3baccfd94eb5caad18c231a57652fca31e453838be5bd93d0841d611881"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): libs/impeller/kdl/src/rewrite.rs:203-217 | libs/impeller/kdl/src/rewrite.rs:334-348 | libs/impeller/kdl/src/rewrite.rs:406-420 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/rewrite.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32010549ad7b067a77508679b7f3495d90e533a6b9ab99012379a95e55fb212"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 11\u002B corresponding lines): libs/impeller/wkt/src/lib.rs:85-95 | libs/impeller/wkt/src/lib.rs:135-145 | libs/impeller/wkt/src/lib.rs:169-179 | libs/impeller/wkt/src/lib.rs:283-293 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/wkt/src/lib.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"d799700abb1ff1a0a7d89a48d7cff63720d5d54c418971156a4d4eb4512ec9fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): libs/monte-carlo/src/lib.rs:3558-3571 | libs/nox-py/src/tick_metrics.rs:497-510 \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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":3558}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee35c6455ef88ff35c2aa183892acbcc875acb5749ee9c4c959d53ab98c355f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): libs/monte-carlo/src/lib.rs:3577-3587 | libs/nox-py/src/tick_metrics.rs:485-495 \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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":3577}}}],"partialFingerprints":{"codehealthFindingId/v1":"da126294af7dcc69d1680de739ff07612159661d03aaa173b895c6bf75f80fda"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): libs/bevy_world_mesh/src/terrain/render/terrain_view_bind_group.rs:271-282 | libs/bevy_world_mesh/src/terrain/render/terrain_view_bind_group.rs:299-311 \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":"libs/bevy_world_mesh/src/terrain/render/terrain_view_bind_group.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7de7ffeec063e9e2d52306c843f8dd5546a70ac4186b2a205ee72808ac859d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): libs/cranelift-mlir/src/tensor_rt.rs:237-247 | libs/cranelift-mlir/src/tensor_rt.rs:676-705 \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":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef014ca97169aff7425ee5014ee215d0a4020ae4fe65d2951725da7c961bce0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): fsw/msp-osd/src/backends/displayport.rs:122-132 | fsw/msp-osd/src/backends/displayport.rs:170-180 | fsw/msp-osd/src/backends/displayport.rs:196-209 \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":"fsw/msp-osd/src/backends/displayport.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"d644c942d62015edb57e565cab28afbc3ded9497da94eaa10c23f2ebfb47055c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): libs/bevy_world_mesh/src/terrain/terrain_data/gpu_tile_atlas.rs:291-301 | libs/bevy_world_mesh/src/terrain/terrain_data/gpu_tile_atlas.rs:303-313 \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":"libs/bevy_world_mesh/src/terrain/terrain_data/gpu_tile_atlas.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f59ff62acc60e35d95f759edb215fd0fd8afc2b4941f819152dec2107289581"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): libs/cranelift-mlir/src/tensor_rt.rs:237-249 | libs/cranelift-mlir/src/tensor_rt.rs:676-687 \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":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c6bb0f7299c774e870cacd3c46b918b2fcd1ac392b2bf64e8c52cc44be80e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): libs/cranelift-mlir/src/tensor_rt.rs:237-248 | libs/cranelift-mlir/src/tensor_rt.rs:676-686 \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":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0178249a95b7fd65d8fcf4148663cd3825bee4e5bfe7ac959f1436c0a20ba3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): libs/cranelift-mlir/src/tensor_rt.rs:237-250 | libs/cranelift-mlir/src/tensor_rt.rs:676-699 \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":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbc782766ee03b24ce760828ec58a32e7374f891f0a8ffdb8224239a2cf10f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): libs/postcard-c/codegen/src/lib.rs:300-312 | libs/postcard-c/codegen/src/lib.rs:653-665 | libs/postcard-c/codegen/src/lib.rs:668-680 \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":"libs/postcard-c/codegen/src/lib.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"71eb943eccd8b4959193a325f68c48255a86a1a6267f04365fc6bd96d63f9845"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 9\u002B corresponding lines): libs/s10/src/recipe.rs:75-83 | libs/s10/src/recipe.rs:85-93 | libs/s10/src/recipe.rs:95-103 | libs/s10/src/recipe.rs:105-113 | libs/s10/src/recipe.rs:115-123 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/src/recipe.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70017ea4b37266b5aa9098667f043e51c1be49b9424679ccdd87891679a9ea7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): libs/bevy_world_mesh/src/terrain/preprocess/preprocessor.rs:174-189 | libs/bevy_world_mesh/src/terrain/preprocess/preprocessor.rs:195-210 \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":"libs/bevy_world_mesh/src/terrain/preprocess/preprocessor.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f146e95115cd3f6080e524565056ca2935748a9ca6161d9ea610d7e7a81020"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): libs/bevy_world_mesh/src/terrain/render/terrain_view_bind_group.rs:33-49 | libs/bevy_world_mesh/src/terrain/render/terrain_view_bind_group.rs:51-65 \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":"libs/bevy_world_mesh/src/terrain/render/terrain_view_bind_group.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ea0438bbd196aa57cfaf3d5d38a2706bd90b0d7314d626f5393ac3e2a79c89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): libs/cranelift-mlir/src/inliner.rs:225-237 | libs/cranelift-mlir/src/inliner.rs:243-259 \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":"libs/cranelift-mlir/src/inliner.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"0216f8fc1e91b5e0cdaceb070c170794e92155d01d0758491d977b19c533d32e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): libs/monte-carlo/src/lib.rs:1855-1862 | libs/monte-carlo/src/lib.rs:2493-2503 \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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":1855}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bab633577147488de1f5f234931b1ec52eee685996c6634c5e2067d4eabaf23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 8\u002B corresponding lines): libs/nox-py/src/spatial.rs:53-61 | libs/nox-py/src/spatial.rs:140-148 | libs/nox-py/src/spatial.rs:223-230 | libs/nox-py/src/spatial.rs:299-307 | libs/nox-py/src/spatial.rs:585-593 \u2014 These 5 members are one piece of code written 5 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/spatial.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df91d0d947c4ac06f53b2300d1535399de75888ec0ce1c12ad13fe09367aca1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): libs/bevy_world_mesh/src/fetch.rs:473-477 | libs/bevy_world_mesh/src/fetch.rs:481-485 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/fetch.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb2c4d2fa71d87dfcac8a86bba83a6b8b91abbfbfbb3c17d64172d60b558bae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): libs/cranelift-mlir/src/lower.rs:8971-8977 | libs/cranelift-mlir/src/lower.rs:9081-9095 \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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":8971}}}],"partialFingerprints":{"codehealthFindingId/v1":"00060ac6a672b32d84af217fd8c9fa0bc8b131f3503025bbf7bef265987ce664"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): libs/db/eql/src/formulas/angular.rs:59-64 | libs/db/eql/src/formulas/linear.rs:59-64 \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":"libs/db/eql/src/formulas/angular.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ab90a5d2d5408dd9c88b43ce17ce8122723550112826df8b6980e651f71da7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): libs/elodin-editor/src/ui/command_palette/palette_items.rs:675-689 | libs/elodin-editor/src/ui/command_palette/palette_items.rs:691-705 | libs/elodin-editor/src/ui/command_palette/palette_items.rs:707-721 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/command_palette/palette_items.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4007e021fbe83c2f689407fa379ac283080f5c89431e40f22c44e21f318ddf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): libs/impeller/bevy/src/lib.rs:774-783 | libs/impeller/bevy/src/lib.rs:791-799 \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":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ee71c41a2c258e0dc57ac990e06265b403e19577b5b50e5fc3c1f72c77a2b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): libs/nox-py/src/integrator/verlet.rs:42-49 | libs/nox-py/src/integrator/runge_kutta.rs:171-177 \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":"libs/nox-py/src/integrator/verlet.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15e72c6ef49b9846ec3f35a7de079a2df097049916dc4574f742af952bdb1f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): libs/db/src/assets_http.rs:95-102 | libs/elodin-editor/src/object_3d.rs:63-69 \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":"libs/db/src/assets_http.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce8f14a5a1dd4001102ae7e81cc7fc3a2a09eb46e888b4704f78c6455ebf6b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): fsw/roci/adcs/src/ukf.rs:79-84 | fsw/roci/adcs/src/ukf.rs:112-122 \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":"fsw/roci/adcs/src/ukf.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6aa4330ff651ab3d8184996668642ef0958eaef578f30a0c9f8357e815a631"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): libs/elodin-editor/src/plugins/frustum/mod.rs:185-192 | libs/elodin-editor/src/plugins/gizmos/mod.rs:186-190 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/frustum/mod.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd405f447c6df9dcdc0ea61875995c47b89d3c10ab0c62b7c57340cf5e4c28e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): fsw/sensor-fw/src/bmi270_spi.rs:126-133 | fsw/sensor-fw/src/bmi270_spi.rs:135-143 \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":"fsw/sensor-fw/src/bmi270_spi.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ffbbfbda8326684f95939200d5c6a1d90532f339ac05bea6b31224ff43b0758"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): fsw/sensor-fw/src/bmm350.rs:383-393 | fsw/sensor-fw/src/bmp581.rs:87-98 \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":"fsw/sensor-fw/src/bmm350.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8f9932bf0f6c2fde5cbc2646f1cbf8430041e9d5b66ef4366dae2cfd5abbf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): libs/bevy_world_mesh/src/bin/preprocess.rs:82-92 | libs/bevy_world_mesh/src/bin/preprocess_global.rs:92-104 \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":"libs/bevy_world_mesh/src/bin/preprocess.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"09119e0ea963140be3ad6fc729fc743ef5eb25b89c42aa522b33bb6ead26643a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): libs/elodin-editor/src/object_3d.rs:2610-2619 | libs/elodin-editor/src/ui/inspector/viewport.rs:1351-1360 \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":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":2610}}}],"partialFingerprints":{"codehealthFindingId/v1":"a555b51bc0f83b16d0f70d413980d2fbdee8eeaa2a03517ab8d43b1e6012c173"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): fsw/msp-osd/src/backends/displayport.rs:35-48 | fsw/sensor-fw/src/crsf.rs:319-332 \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":"fsw/msp-osd/src/backends/displayport.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"4675137aabdd6fb5e6a51c6e3b8e6f0c86a3de0fa307dbc3f88207e709d1a77c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): libs/elodin-editor/src/iter.rs:14-23 | libs/stellarator/maitake/util/src/fmt.rs:253-263 \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":"libs/elodin-editor/src/iter.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"de04fe6bfdc62ab0e1d758a24d837cec3984245fbed48ac3756ff0022c46adc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): libs/db/eql/src/formulas/atan2.rs:61-69 | libs/db/eql/src/formulas/cast.rs:127-136 | libs/db/eql/src/formulas/clip.rs:79-86 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/formulas/atan2.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c32991f61309619d34cac651d0e632691c43382885b7fbcf50fcf3e01a7b5b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 10\u002B corresponding lines): libs/db/macros/src/lib.rs:76-87 | libs/db/macros/src/lib.rs:89-100 | libs/elodin-macros/src/lib.rs:47-56 | libs/elodin-macros/src/lib.rs:63-73 | libs/stellarator/macros/src/lib.rs:73-83 \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":"libs/db/macros/src/lib.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c8d820008255912c110b1a67624c9f2d36c4baf30c2ccb9e71ba6c6970a796"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): libs/elodin-editor/src/ui/gauges/horizon.rs:72-75 | libs/elodin-editor/src/ui/gauges/orientation.rs:65-68 \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":"libs/elodin-editor/src/ui/gauges/horizon.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a517e77ad3f37d8cdcafdd7d014667378b44ef5b52356dfbcc59501d472d6b85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): libs/nox/src/quaternion.rs:95-102 | libs/nox/src/mrp.rs:45-51 \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":"libs/nox/src/quaternion.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e3d28d3a9ad49d99e00bffff32c602bf9615736bab3554e1aff3e89f25ac4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): fsw/sensor-fw/src/bmi270.rs:187-198 | fsw/sensor-fw/src/bmm350.rs:395-406 | fsw/sensor-fw/src/bmp581.rs:171-182 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 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":"fsw/sensor-fw/src/bmi270.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"6146d3eb05c614c5ad695c292268074df1a449b059c6bdbc9d8ccabb3b46f346"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): libs/db/src/compact.rs:66-71 | libs/monte-carlo/src/fs_util.rs:107-112 \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":"libs/db/src/compact.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc2b0f1153ad6f6ec93bbf5e4b8769fac7763a61c8cd6aa970dd9f29229b9102"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): examples/cube-sat-pysim/main.py:209-212 | examples/cube-sat/main.py:230-233 | fsw/roci/adcs/reference-impls/mekf.py:43-46 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 4 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/cube-sat-pysim/main.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"1727f3e48f41e89e84ab932e923e3c5863bc4bb475357038dcd631a025a948b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): libs/elodin-editor/src/ui/plot/gpu.rs:510-518 | libs/elodin-editor/src/ui/plot_3d/gpu.rs:350-360 \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":"libs/elodin-editor/src/ui/plot/gpu.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86ee757371fd5dc277092ade47dc8da30cf2670134f9cbaff25fa999696ca62"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): libs/impeller/kdl/src/de.rs:139-147 | libs/impeller/wkt/src/gui.rs:774-782 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"585ae8bee919e2e8bb57443af63a4a5f937be6e19890e7651ec80dd20145847a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): libs/db/eql/src/formulas/angular.rs:12-21 | libs/db/eql/src/formulas/linear.rs:12-21 \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":"libs/db/eql/src/formulas/angular.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c837c2a6bc7ce5be9f14786fdd96b1a8a0c62982223f7fafed46b4a2eaee19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): libs/db/eql/src/lib.rs:24-36 | libs/db/src/arrow/mod.rs:34-44 \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":"libs/db/eql/src/lib.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2298f56b5678d8754ff11ad590ec9c50e625ffa8ffc2aa0d19e4e28ebd6ad8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): libs/db/src/assets_http.rs:597-601 | libs/elodin-editor/src/plugins/web_asset/mod.rs:263-267 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/assets_http.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fcae18383d8a488fdeab265e9f8ad2d3a67dd4ed7ab1bc8a5ce0bce760c20e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): libs/elodin-editor/src/plugins/thruster_particles/mod.rs:615-621 | libs/elodin-editor/src/plugins/view_cube/spawn.rs:182-188 \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":"libs/elodin-editor/src/plugins/thruster_particles/mod.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ea78fc1e3d922128d297fb84fa0dc66ee79c57096f3f8548ab5a9d4a3d9226"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): libs/nox-py/python/elodin/monte_carlo/quickstart.py:175-177 | libs/nox-py/python/elodin/monte_carlo/sample.py:155-157 | libs/nox-py/python/elodin/monte_carlo/template.py:58-60 \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":"libs/nox-py/python/elodin/monte_carlo/quickstart.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d6f9b16c5bbd7b408704bf7225740d717416152a7babcc601198ed518fcec6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): libs/nox-py/python/elodin/stablehlo.py:84-100 | libs/nox-py/python/elodin/ui/kernel.py:243-260 \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":"libs/nox-py/python/elodin/stablehlo.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d7bd0f47d4bd07804d6b2bd326f4b2f412efaeea6aea97ecdf1cc8839bf31e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): libs/nox-py/src/db/client.rs:188-196 | libs/nox-py/src/db/writer.rs:106-116 \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":"libs/nox-py/src/db/client.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"7faa35414d44f020f4562138b6bc4557623e64da53168bac263615b71cb05a4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): libs/nox-py/src/graph.rs:476-479 | libs/nox-py/src/spatial.rs:48-51 \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":"libs/nox-py/src/graph.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"761cda757cf64a00f51409db383d9647e837a0f0f475b33ae4eae9fa60bcbd32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): libs/db/src/grpc/ingest.rs:338-342 | libs/db/src/grpc/msg.rs:154-159 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/grpc/ingest.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"58715a5e7c85400142dd6695a690f4c81bee34905ef5d09376b6cb42701c0ac9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): libs/db/src/grpc/ingest.rs:103-106 | libs/db/src/grpc/msg.rs:34-40 \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":"libs/db/src/grpc/ingest.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e3aaa7fd9a493529d7a99cc5c1d7a7685f533c55b0e82b9c6854de9fa9efb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): libs/impeller/wkt/src/metadata.rs:82-87 | libs/impeller/wkt/src/msgs.rs:410-415 \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":"libs/impeller/wkt/src/metadata.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56b830bb047905f30a71f7b4dbc97654048dc79e4171efe85881fcf6ce7ab10"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u201359 lines \u00D7 4): fsw/sensor-fw/src/adc.rs:53-55 | fsw/sensor-fw/src/adc.rs:58-59 | fsw/sensor-fw/src/adc.rs:92-150 | fsw/sensor-fw/src/adc.rs:175-233 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fsw/sensor-fw/src/adc.rs:92\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060adc\u0060 to \u0060pac::ADC1\u0060 in one and \u0060pac::ADC3\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060fsw/sensor-fw/src/adc.rs:91\u0060 calls \u0060modify\u0060, \u0060adcal\u0060, \u0060set_bit\u0060 and \u0060fsw/sensor-fw/src/adc.rs:53\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":"fsw/sensor-fw/src/adc.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"5663128e809a236e386b54a2fbe9ce5a899794331af843c83beb4348366e38cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (59 lines \u00D7 2): libs/elodin-editor/src/ui/tiles.rs:3544-3602 | libs/elodin-editor/src/ui/tiles.rs:3606-3664 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/tiles.rs:3544\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":3544}}}],"partialFingerprints":{"codehealthFindingId/v1":"0313568f34a356941f51304bd90d108066fe6c40d0ccd6e5c73fde7306a680da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (40\u201353 lines \u00D7 2): libs/elodin-editor/src/plugins/view_cube/spawn.rs:592-631 | libs/elodin-editor/src/plugins/view_cube/spawn.rs:636-688 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/plugins/view_cube/spawn.rs:592\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/view_cube/spawn.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5fc5b54dc67f5b04ca1314be32a4e988128482b31acf3456035f3f58d38c756"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): libs/bevy_ai_skybox/src/lib.rs:1351-1393 | libs/elodin-editor/src/plugins/cinematic_earth/mod.rs:832-874 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"libs/bevy_ai_skybox/src/lib.rs"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"7691d14e98ffe4a8d44067e8799f2e33787473a1ecf6031a3540d7c591b4c2b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201335 lines \u00D7 2): libs/monte-carlo/src/lib.rs:3323-3354 | libs/nox-py/src/tick_metrics.rs:156-190 \u2014 before extracting anything, compare \u0060libs/monte-carlo/src/lib.rs\u0060 and \u0060libs/nox-py/src/tick_metrics.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":3323}}}],"partialFingerprints":{"codehealthFindingId/v1":"9318d2218754d3ec21c2a05f356f36e92a1168e691d101475d7707d5a0ba1634"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 2): libs/impeller/bevy/src/lib.rs:2388-2421 | libs/impeller/bevy/src/lib.rs:2460-2493 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":2388}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c62b541faa20a0c14976f166c83ef65156a30a07e931e2183425b9dd22ee397"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): libs/cranelift-mlir/src/const_fold.rs:1592-1623 | libs/cranelift-mlir/src/const_fold.rs:1999-2030 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/const_fold.rs"},"region":{"startLine":1592}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab0c2944fc257165c8a7116378bfbe8a11674ac5494e569323c9f3dfa2df159"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32 lines \u00D7 2): libs/db/src/drop.rs:197-228 | libs/db/src/time_align.rs:197-228 \u2014 before extracting anything, compare \u0060libs/db/src/drop.rs\u0060 and \u0060libs/db/src/time_align.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 100 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/drop.rs:197\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/drop.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5b521427aca3a4da5007bee4e403fb3910a07e2e4fdb023fd4f1777767fd9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): libs/elodin-editor/src/ui/inspector/sensor_camera.rs:114-144 | libs/elodin-editor/src/ui/inspector/viewport.rs:936-966 \u2014 before extracting anything, compare \u0060libs/elodin-editor/src/ui/inspector/sensor_camera.rs\u0060 and \u0060libs/elodin-editor/src/ui/inspector/viewport.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 117 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/inspector/sensor_camera.rs:114\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/sensor_camera.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c87fb079d756c24fa98dfa3495cb02dd48ea84e057ef8159744a83bf18b2e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): libs/elodin-editor/src/ui/plot/widget.rs:2063-2093 | libs/elodin-editor/src/ui/plot/widget.rs:2262-2292 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/plot/widget.rs:2063\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":2063}}}],"partialFingerprints":{"codehealthFindingId/v1":"de7acf818999c8434f6f6b5da2adb525ecd8de2e77ca256c23bcafb827e263bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201329 lines \u00D7 2): libs/bevy_world_mesh/src/bin/preprocess.rs:22-48 | libs/bevy_world_mesh/src/bin/preprocess_global.rs:25-53 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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":"libs/bevy_world_mesh/src/bin/preprocess.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b472ba854da5b3b99d795f842e777dfa70c3725300e4ec79e411f2656935aaf4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201328 lines \u00D7 2): libs/db/src/merge.rs:259-286 | libs/db/src/trim.rs:113-136 \u2014 before extracting anything, compare \u0060libs/db/src/merge.rs\u0060 and \u0060libs/db/src/trim.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/merge.rs:259\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/merge.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"1099184431b0b1862a0d1d68d733c4d19a10511ed8c3ba7cdbbe1fb179baa106"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): libs/elodin-editor/src/ui/inspector/sensor_camera.rs:185-210 | libs/elodin-editor/src/ui/inspector/viewport.rs:995-1021 \u2014 before extracting anything, compare \u0060libs/elodin-editor/src/ui/inspector/sensor_camera.rs\u0060 and \u0060libs/elodin-editor/src/ui/inspector/viewport.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 117 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/inspector/sensor_camera.rs:185\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/sensor_camera.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f341f89d0ef07cfa3e92b9a0adf033f35a021b3feeef0dc21827bd6ed84b564c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): libs/nox-py/src/world_builder.rs:1045-1071 | libs/nox-py/src/world_builder.rs:1084-1110 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox-py/src/world_builder.rs:1045\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd452cf03bbd8aa2f57678885b8720b2bce55fb189b9c410125b9c9e3c9152d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201326 lines \u00D7 4): libs/cranelift-mlir/src/interp.rs:786-811 | libs/cranelift-mlir/src/interp.rs:832-857 | libs/cranelift-mlir/src/interp.rs:878-880 | libs/cranelift-mlir/src/interp.rs:905-907 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/interp.rs:786\u0060 it does not close everything it opens, so those exact 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":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"e748ac8bcf10e452ac54395f6a5f544f7ad4732d2ffbbe9ed59fa11042f800e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): libs/db/src/grpc/stream.rs:452-477 | libs/db/src/grpc/stream.rs:717-742 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/grpc/stream.rs:452\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 \u0060tx\u0060 to \u0060mpsc::Sender\u003CResult\u003CStreamComponentsResponse, Status\u003E\u003E\u0060 in one and \u0060mpsc::Sender\u003CResult\u003CStreamMessagesResponse, Status\u003E\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/db/src/grpc/stream.rs:451\u0060 calls \u0060Some\u0060 and \u0060libs/db/src/grpc/stream.rs:716\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":"libs/db/src/grpc/stream.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd05285c722418efb4dc4107cfd1948d2df9fe6f1b57222f402da05af9fa652"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): libs/elodin-editor/src/ui/plot/widget.rs:694-718 | libs/elodin-editor/src/ui/plot/widget.rs:744-769 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/plot/widget.rs:694\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"4729c1ff2626ff53ef7270e30016a474d293837dfe7c945fd422c888ab209f8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): libs/elodin-editor/src/ui/plot/widget.rs:2036-2061 | libs/elodin-editor/src/ui/plot/widget.rs:2235-2260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/plot/widget.rs:2036\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":2036}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c05dc4910a7b069e2af0a47b35d6e4cd7ed9e701cab1080ff2480af3cbf4ca7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): libs/s10/src/recipe.rs:177-203 | libs/s10/src/recipe.rs:229-255 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/s10/src/recipe.rs:177\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/src/recipe.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef7f3a8ed53b90afaf92aa181a13d5a1467bd9797f51e3782b255a2a558b9877"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): libs/elodin-editor/src/plugins/navigation_gizmo/mod.rs:48-72 | libs/elodin-editor/src/plugins/navigation_gizmo/mod.rs:82-106 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/plugins/navigation_gizmo/mod.rs:48\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":"libs/elodin-editor/src/plugins/navigation_gizmo/mod.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1758ee72f72cad6c42f89c5f69b337e9f166df33f2365e0480a5b0b4281825"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 2): libs/impeller/kdl/src/ser.rs:81-105 | libs/impeller/kdl/src/ser.rs:714-736 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/impeller/kdl/src/ser.rs:81\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/ser.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"98de6afa147fa3eadbdae6a57d23d72e3dfb135478558878ebe76a554c5425d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): libs/nox/src/array/mod.rs:1369-1393 | libs/nox/src/array/mod.rs:1426-1450 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/array/mod.rs"},"region":{"startLine":1369}}}],"partialFingerprints":{"codehealthFindingId/v1":"13cadea836ce590a71b629b5030e5cd78cf9604a45564ad5674a486a6174ae0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201324 lines \u00D7 2): libs/bevy_world_mesh/src/fetch.rs:891-914 | libs/bevy_world_mesh/src/fetch.rs:1017-1031 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/bevy_world_mesh/src/fetch.rs:891\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/fetch.rs"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2cc9be1f4897abf313ee4730561d5ec064d09287a51d0ecd6f8d32b6a5c5f43"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:2953-2976 | libs/cranelift-mlir/src/lower.rs:3063-3086 \u2014 both copies are in the same file, so extract the block 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, \u0060libs/cranelift-mlir/src/lower.rs:2978\u0060 calls \u0060emit_op_end\u0060 and \u0060libs/cranelift-mlir/src/lower.rs:3087\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":2953}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c628014c10fa259a3e9bd30744ee99aebea0cec19c898d066744bdcb5c8ba7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:8493-8516 | libs/cranelift-mlir/src/lower.rs:8545-8568 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":8493}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d430463965a2c6c7df150a181bdd8653ec4204ec5ab9912be91e8af1347c64b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): libs/elodin-editor/src/plugins/frustum_intersection/mod.rs:466-489 | libs/elodin-editor/src/plugins/frustum_intersection/mod.rs:504-527 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/plugins/frustum_intersection/mod.rs:466\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/frustum_intersection/mod.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"58cc0826f62bd8e340a6aeb8b0d14ab6948f0fe01756f8c1b510043b50d27ee6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): libs/elodin-editor/src/plugins/view_cube/interactions.rs:1384-1407 | libs/elodin-editor/src/plugins/view_cube/interactions.rs:1438-1461 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/plugins/view_cube/interactions.rs:1384\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/view_cube/interactions.rs"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fcdb3294a5026ccea71a16624463650f01c74de770877cc2a0deeef577ef566"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): libs/stellarator/buf/src/lib.rs:215-238 | libs/stellarator/src/buf.rs:188-211 \u2014 before extracting anything, compare \u0060libs/stellarator/buf/src/lib.rs\u0060 and \u0060libs/stellarator/src/buf.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. 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":"libs/stellarator/buf/src/lib.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e28ff0a022a3852857705ea790865031bd6b6a94208432430501c26c4ce0e85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): libs/elodin-editor/src/ui/label.rs:133-155 | libs/elodin-editor/src/ui/label.rs:179-201 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/label.rs:133\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/label.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"838720601da156d543c0782028fcff16e3d39982e327ae632b47556dc2eb7c44"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): libs/elodin-editor/src/ui/colors.rs:420-440 | libs/elodin-editor/src/ui/colors.rs:442-463 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/colors.rs:420\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/colors.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"24556dd3e48170c483aaf8c2841c730a6810c469a4887984aea5c3201d06aa50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): libs/elodin-editor/src/ui/inspector/query_table.rs:135-156 | libs/elodin-editor/src/ui/query_table.rs:221-242 \u2014 before extracting anything, compare \u0060libs/elodin-editor/src/ui/inspector/query_table.rs\u0060 and \u0060libs/elodin-editor/src/ui/query_table.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060libs/elodin-editor/src/ui/inspector/query_table.rs:135\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":"libs/elodin-editor/src/ui/inspector/query_table.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd31b6b90849aec57df9c5ae218addc087a1b22975bc9d0ee64c188a8d49f96e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): libs/elodin-editor/src/ui/plot/widget.rs:2415-2436 | libs/elodin-editor/src/ui/plot/widget.rs:2612-2633 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/plot/widget.rs:2415\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":2415}}}],"partialFingerprints":{"codehealthFindingId/v1":"7154a0f39bffd37bfdecf4d48b77f17b460ea7ed81d21b8bfd3535055f631f7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201321 lines \u00D7 3): libs/cranelift-mlir/src/lower.rs:2207-2227 | libs/cranelift-mlir/src/lower.rs:5473-5491 | libs/cranelift-mlir/src/lower.rs:5933-5951 \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 \u0060libs/cranelift-mlir/src/lower.rs:2207\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/cranelift-mlir/src/lower.rs:2228\u0060 calls \u0060declare_func_in_func\u0060 and \u0060libs/cranelift-mlir/src/lower.rs:5952\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":2207}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fd6d9996f8b5fe136019750b5f0072ab08fd10559f790c0575cf93ae4f9e6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201322 lines \u00D7 2): fsw/gstreamer/src/lib.rs:246-267 | fsw/gstreamer/src/lib.rs:314-330 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fsw/gstreamer/src/lib.rs:246\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060fsw/gstreamer/src/lib.rs:243\u0060 calls \u0060msg_id\u0060 and \u0060fsw/gstreamer/src/lib.rs:313\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":"fsw/gstreamer/src/lib.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"14af5365ce433360eb12001d1d64d6bd3f56a4d51e00414ea04009959e5f8d46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:5015-5035 | libs/cranelift-mlir/src/lower.rs:5070-5090 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":5015}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd8227c8c98faa76858d395cee0e38bda4a481a5f2cfd8fe4b28799deac264f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): libs/elodin-editor/src/ui/plot/gpu.rs:1311-1331 | libs/elodin-editor/src/ui/plot/gpu.rs:1690-1709 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/plot/gpu.rs:1311\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":"libs/elodin-editor/src/ui/plot/gpu.rs"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c66d388269be1a7cef2639d7855f721d5d9655bc519a570773bd2e2eceaba6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): libs/elodin-editor/src/ui/plot/widget.rs:2097-2117 | libs/elodin-editor/src/ui/plot/widget.rs:2296-2316 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/plot/widget.rs:2097\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":2097}}}],"partialFingerprints":{"codehealthFindingId/v1":"18bdc6905ac5b15d378313d8ab9c90cf46b807623913020043a7623fa92488a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 4): libs/cranelift-mlir/src/parser.rs:1934-1953 | libs/cranelift-mlir/src/parser.rs:2197-2216 | libs/cranelift-mlir/src/parser.rs:2412-2431 | libs/cranelift-mlir/src/parser.rs:2496-2515 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/cranelift-mlir/src/parser.rs:1932\u0060 calls \u0060parse_next\u0060 and \u0060libs/cranelift-mlir/src/parser.rs:2495\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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1934}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d5093494bdd52161ac110e84516b2781353998d6876599c8037f3248ec78de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): fsw/msp-osd/src/backends/terminal.rs:25-44 | fsw/msp-osd/src/backends/terminal.rs:71-90 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/backends/terminal.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e246357580111946debe968efa00d67c8918eb010e3fd4f98b32d567cf4687"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): libs/bevy_world_mesh/src/scenes/globe.rs:152-171 | libs/bevy_world_mesh/src/scenes/planar.rs:44-63 \u2014 before extracting anything, compare \u0060libs/bevy_world_mesh/src/scenes/globe.rs\u0060 and \u0060libs/bevy_world_mesh/src/scenes/planar.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/bevy_world_mesh/src/scenes/globe.rs:152\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/scenes/globe.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b0cf5a41b18cb1522e50b671a9f567663d4ad1a3357126e37cbc15b2ab579f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:6632-6651 | libs/cranelift-mlir/src/lower.rs:10932-10950 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:6632\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":6632}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8b1cb98f9417fded613bec5b7f456e866cbb2ae2894cbd870b5e67d995acd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): libs/db/src/bin/bench-csv-export.rs:81-100 | libs/db/tests_query/csv_export_goldie.rs:134-153 \u2014 before extracting anything, compare \u0060libs/db/src/bin/bench-csv-export.rs\u0060 and \u0060libs/db/tests_query/csv_export_goldie.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060libs/db/src/bin/bench-csv-export.rs:81\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/bin/bench-csv-export.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"284e4e9e9c9d67a9d3254b563922a7be7ad450aafa71c6e2f8d990293ce707dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): libs/elodin-editor/src/ui/inspector/query_table.rs:55-74 | libs/elodin-editor/src/ui/query_table.rs:182-201 \u2014 before extracting anything, compare \u0060libs/elodin-editor/src/ui/inspector/query_table.rs\u0060 and \u0060libs/elodin-editor/src/ui/query_table.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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":"libs/elodin-editor/src/ui/inspector/query_table.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bd98e191073146458549fd4fede6a4406f52273c570d302ed8ee74d752c227"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): libs/cranelift-mlir/src/const_fold.rs:266-284 | libs/cranelift-mlir/src/const_fold.rs:306-324 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/const_fold.rs:266\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/cranelift-mlir/src/const_fold.rs:286\u0060 calls \u0060iter_mut\u0060 and \u0060libs/cranelift-mlir/src/const_fold.rs:326\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":"libs/cranelift-mlir/src/const_fold.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"a117e65fc6ade11b8a8f05beb25f9433c0a9c92f234331003d152a93f08fb89d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:8841-8859 | libs/cranelift-mlir/src/lower.rs:8887-8905 \u2014 both copies are in the same file, so extract the block 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, \u0060libs/cranelift-mlir/src/lower.rs:8840\u0060 calls \u0060emit_marshal_begin\u0060 and \u0060libs/cranelift-mlir/src/lower.rs:8885\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":8841}}}],"partialFingerprints":{"codehealthFindingId/v1":"685ce9ef14b93b7c2c5fb34346bfcc062aff80c2cd8f3ece14c9cfe1f33f0112"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:10044-10065 | libs/cranelift-mlir/src/lower.rs:10117-10138 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":10044}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bad6a3a97e3b1e01a0209a5d9d389fc996f3fb013e32fa694e70b9c60e945f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31\u201332 lines \u00D7 2): libs/cranelift-mlir/src/parser.rs:2010-2041 | libs/cranelift-mlir/src/parser.rs:2366-2396 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":2010}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b83b7c57faf98b1dc171e987489d3040e6a184baaedffb9578910c803e55c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): libs/cranelift-mlir/src/parser.rs:2524-2542 | libs/cranelift-mlir/src/parser.rs:2616-2634 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":2524}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86f6a889a1e3982de6a1752870f6b1493b467d903433025845d7ee635929ce2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): libs/elodin-editor/src/plugins/frustum/mod.rs:491-509 | libs/elodin-editor/src/plugins/frustum/mod.rs:533-551 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/plugins/frustum/mod.rs:491\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/frustum/mod.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"097f3e2d3c4c004aa0dd9ceb268962e15d0ff3ed3058efbc9acadbb592038ea0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): libs/elodin-editor/src/plugins/view_cube/camera.rs:589-607 | libs/elodin-editor/src/plugins/view_cube/camera.rs:690-708 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/plugins/view_cube/camera.rs:589\u0060 it does not close everything it opens, so those exact 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, \u0060libs/elodin-editor/src/plugins/view_cube/camera.rs:608\u0060 calls \u0060trigger_rotation\u0060 and \u0060libs/elodin-editor/src/plugins/view_cube/camera.rs:709\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":"libs/elodin-editor/src/plugins/view_cube/camera.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca2b6835e6915847c8c21a71ce1c78a4f5d15dd4c8aeceb1e70787c06ed2f21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): libs/elodin-editor/src/plugins/view_cube/camera.rs:603-621 | libs/elodin-editor/src/plugins/view_cube/camera.rs:653-671 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/plugins/view_cube/camera.rs:603\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/view_cube/camera.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"109b26d3be001beb3e7c824c3b90a071b87089e64dd6c9099c9d528152dc0113"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): libs/elodin-editor/src/ui/inspector/object3d.rs:299-317 | libs/elodin-editor/src/ui/inspector/object3d.rs:319-336 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/inspector/object3d.rs:299\u0060 it does not close everything it opens, so those exact 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":"libs/elodin-editor/src/ui/inspector/object3d.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde90789cf1b3419792a549609af42e1e0a9f2685cb4f8241053891a466057da"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): libs/elodin-editor/src/ui/widgets.rs:77-95 | libs/elodin-editor/src/ui/widgets.rs:104-122 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/widgets.rs:77\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":"libs/elodin-editor/src/ui/widgets.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"00dfb0a5f10c3d7f90e33a530a057936762a97b6a7f34bbe071923a6b27eb8f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): apps/inscriber/src/main.rs:23-40 | fsw/aleph-setup/src/main.rs:41-58 | fsw/aleph-status/src/main.rs:45-62 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/inscriber/src/main.rs:23\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/inscriber/src/main.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b485b69c01194b67c3ab0d833e5f3fa47d7199bedf230f6830ad425e350619ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 3): libs/db/src/drop.rs:200-217 | libs/db/src/prune.rs:45-61 | libs/db/src/time_align.rs:200-217 \u2014 before extracting anything, compare \u0060libs/db/src/drop.rs\u0060 and \u0060libs/db/src/prune.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"libs/db/src/drop.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"de40d5a462cd21b00b730a151948b94b886323cea04c910832d8b411d2696e63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:3127-3144 | libs/cranelift-mlir/src/lower.rs:3188-3205 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:3127\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":3127}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e29146fd7f2805e175cf60ebc9705a3df1e7b1f5e515e6d9dddd8cd642a8de4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:3831-3848 | libs/cranelift-mlir/src/lower.rs:3895-3912 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:3831\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":3831}}}],"partialFingerprints":{"codehealthFindingId/v1":"a03f5f7701d60aa02b20a99d23dc666567e7ba0831a811e7eefee71855ee37ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): libs/db/src/bin/bench-csv-export.rs:101-119 | libs/db/tests_query/csv_export_goldie.rs:161-179 \u2014 before extracting anything, compare \u0060libs/db/src/bin/bench-csv-export.rs\u0060 and \u0060libs/db/tests_query/csv_export_goldie.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/db/tests_query/csv_export_goldie.rs:159\u0060 calls \u0060wrapping_mul\u0060, \u0060wrapping_add\u0060, \u0060collect\u0060 and \u0060libs/db/src/bin/bench-csv-export.rs:100\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/bin/bench-csv-export.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ed8209f556b8e31f0f24fcab83ed500ac12ec645b9c6fa4b64f3985b41f105"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): libs/db/src/export.rs:67-84 | libs/db/src/export.rs:106-123 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/export.rs:67\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/export.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"f869e1b93d75e2d78c5cc1a96a1eb78b1bb5cd729689c1ef18bc4b4ad9f00ea8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201318 lines \u00D7 2): libs/db/src/merge.rs:924-941 | libs/db/src/trim.rs:672-687 \u2014 before extracting anything, compare \u0060libs/db/src/merge.rs\u0060 and \u0060libs/db/src/trim.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/merge.rs:924\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":"libs/db/src/merge.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"3410d3978c451e973bea440db4969d271d6a90b313e9b9e2e1b8114f7cabe0ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): libs/elodin-editor/src/object_3d.rs:2303-2320 | libs/elodin-editor/src/object_3d.rs:2359-2376 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/object_3d.rs:2303\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"174c81f6a882e1edcfdbc495bed7ddccc3dcf363e8286195975e9cb41cd69c4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): libs/elodin-editor/src/ui/plot/widget.rs:2017-2034 | libs/elodin-editor/src/ui/plot/widget.rs:2216-2233 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/plot/widget.rs:2017\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":2017}}}],"partialFingerprints":{"codehealthFindingId/v1":"44c9bedd0b32f71864c3fe2d9059fdbfb8f601f86ca803da588b55adba427fe7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): libs/stellarator/buf/src/lib.rs:52-69 | libs/stellarator/src/buf.rs:38-55 \u2014 before extracting anything, compare \u0060libs/stellarator/buf/src/lib.rs\u0060 and \u0060libs/stellarator/src/buf.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/stellarator/buf/src/lib.rs:52\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":"libs/stellarator/buf/src/lib.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff37161b77d593351dc5cf977410a972618013adf75833822e57551ecd79981"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 3): libs/elodin-editor/src/ui/inspector/gauges.rs:63-77 | libs/elodin-editor/src/ui/inspector/gauges.rs:115-129 | libs/elodin-editor/src/ui/inspector/gauges.rs:175-191 \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 \u0060libs/elodin-editor/src/ui/inspector/gauges.rs:63\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/gauges.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced5ef054f4949bf6fdf77ef281d20352d4095863b2b639bfb64648bdc282540"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): fsw/sensor-fw/src/fm24cl16b.rs:120-136 | fsw/sensor-fw/src/fm24cl16b.rs:159-175 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fsw/sensor-fw/src/fm24cl16b.rs:120\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/fm24cl16b.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"9562302e319058ea15319c300d314c827e631f5406e6a7edd6b10b8148e123c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:5421-5441 | libs/cranelift-mlir/src/lower.rs:5464-5484 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":5421}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa7db99020499e9977a0012b9b4b935cf1a14bfb47197a475f790ee508c0894"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:8556-8572 | libs/cranelift-mlir/src/lower.rs:8728-8744 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":8556}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa1c8583876e5f75b055008c6b72f298db7e783c64e4156c70fae4fd2ff7772f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): libs/db/src/export.rs:784-800 | libs/db/src/export_videos.rs:447-461 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060libs/db/src/export.rs:784\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/export.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"6545e57d2ea64fa098c01f4d81e9e7dd757293b479a86eba704dbef8fe3390d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): libs/elodin-editor/src/lib.rs:1502-1518 | libs/elodin-editor/src/lib.rs:1525-1541 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/lib.rs:1502\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/lib.rs"},"region":{"startLine":1502}}}],"partialFingerprints":{"codehealthFindingId/v1":"2860bffbc8e5d2a7f1e4457da32c73e214a4a406c7f32ac17274ceabda4f5abc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): libs/impeller/bevy/src/lib.rs:2277-2293 | libs/impeller/bevy/src/lib.rs:2326-2342 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/impeller/bevy/src/lib.rs:2277\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":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":2277}}}],"partialFingerprints":{"codehealthFindingId/v1":"1febca37271db9b554048eb07df9e7bd69c52a101514344992904416e33c25b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): libs/nox-py/src/s10.rs:146-162 | libs/nox-py/src/s10.rs:178-194 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/s10.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeffec139dee5c8a8b18c4f8ba6012dd309e92c5781de66b005eade4b664005d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): libs/stellarator/src/os.rs:153-169 | libs/stellarator/src/os.rs:195-210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/stellarator/src/os.rs:153\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/src/os.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e7484c679467b1fb604df1d4335caf4e26ef5f84051042a01fb1ffa16011b92"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): libs/cranelift-mlir/src/lower.rs:4878-4893 | libs/cranelift-mlir/src/lower.rs:4984-4999 | libs/cranelift-mlir/src/lower.rs:5037-5052 \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 \u0060libs/cranelift-mlir/src/lower.rs:4878\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/cranelift-mlir/src/lower.rs:4875\u0060 calls \u0060store_i64_array\u0060, \u0060ins\u0060, \u0060iconst\u0060 and \u0060libs/cranelift-mlir/src/lower.rs:4983\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":4878}}}],"partialFingerprints":{"codehealthFindingId/v1":"876867dadc4067204aaa1a3ca5447f6f582c3e15814e8585366cd3705ec45ed5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): libs/db/src/bin/bench.rs:902-917 | libs/db/src/bin/bench.rs:974-989 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/bin/bench.rs:902\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":"libs/db/src/bin/bench.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"5417aa6f2a5dc0ad5373c449cba50c404ad67420fa51165896c400e4bc6919fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): libs/elodin-editor/src/plugins/view_cube/theme.rs:57-72 | libs/elodin-editor/src/plugins/view_cube/theme.rs:76-91 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"libs/elodin-editor/src/plugins/view_cube/theme.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d881cf0a02690503b3fc2284564ee88ca0b7f0d21c91178ba81c71cadc9e333f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): libs/elodin-editor/src/skybox_generation.rs:189-204 | libs/elodin-editor/src/skybox_generation.rs:436-451 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/skybox_generation.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28aa52fcc46afb15b0a0dbb583e866d128809f3f8074432b14dc24f4d04a7a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 2): libs/elodin-editor/src/ui/inspector/sensor_camera.rs:213-226 | libs/elodin-editor/src/ui/inspector/viewport.rs:1024-1039 \u2014 before extracting anything, compare \u0060libs/elodin-editor/src/ui/inspector/sensor_camera.rs\u0060 and \u0060libs/elodin-editor/src/ui/inspector/viewport.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 117 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/inspector/sensor_camera.rs:213\u0060 it begins part-way through the construct above it, so those exact 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":"libs/elodin-editor/src/ui/inspector/sensor_camera.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4a1dcf8b48df3cbaca76b586b687ba9e6de1d597c77684c1df9585205112ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): libs/nox/src/noxpr/batch_dfs.rs:501-516 | libs/nox/src/noxpr/batch_dfs.rs:532-547 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox/src/noxpr/batch_dfs.rs:501\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/batch_dfs.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"e50e8bc05911d9b28c6921a54aa4b059b37ffead6358a33f4a6d68b62795c76e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): apps/elodin/src/cli/editor.rs:473-487 | apps/elodin/src/cli/editor.rs:549-563 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/elodin/src/cli/editor.rs:473\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/elodin/src/cli/editor.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"477601218a6ddf999f820b21ee32c6cf1d0b08d768b2000088b12d4467f053d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): fsw/msp-osd/src/layout.rs:421-435 | fsw/msp-osd/src/layout.rs:437-451 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/layout.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"7409a0fdfe7a3a3408b137dd345298fe22b2e61645fa9daab50cbf4b0960679c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/cranelift-mlir/src/const_fold.rs:1573-1587 | libs/cranelift-mlir/src/const_fold.rs:1983-1997 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/const_fold.rs"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9822af030f5aa52170dffc5df7190cafd58aa413f2d20587104e3dfd334e603"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:10079-10094 | libs/cranelift-mlir/src/lower.rs:10151-10166 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:10079\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":10079}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eec5e004af0388d633f40cd598c449ef922da9d26b547f2855677e35f870727"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/db/src/utils.rs:267-281 | libs/db/src/utils.rs:311-325 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/utils.rs:267\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/utils.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"41e73102822b830fd0c51204b4feaf7db2b9e3a944b3158c7629d8d2df80a2bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): libs/db/src/vtable_stream.rs:308-322 | libs/db/src/vtable_stream.rs:343-356 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/vtable_stream.rs:308\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/vtable_stream.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3d6fffabe48c05847a2ab62995ba72c5ba6df6e3eaff8a343576644a4478694"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/elodin-editor/src/plugins/frustum/mod.rs:310-324 | libs/elodin-editor/src/plugins/frustum_intersection/mod.rs:491-505 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060libs/elodin-editor/src/plugins/frustum/mod.rs:310\u0060 it does not close everything it opens, so those exact 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":"libs/elodin-editor/src/plugins/frustum/mod.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac070ed0eae8736856df1c2268900abf231abc749b275a1fe36750d3097aa820"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/elodin-editor/src/ui/command_palette/palette_items.rs:649-663 | libs/elodin-editor/src/ui/command_palette/palette_items.rs:735-749 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/command_palette/palette_items.rs:649\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/command_palette/palette_items.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f278c453ba15d6e98b01c90d4e861e88c875f5739d71e1f84c0b74a68e3e69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): libs/elodin-editor/src/ui/data_overview/mod.rs:361-375 | libs/elodin-editor/src/ui/data_overview/mod.rs:1218-1229 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/data_overview/mod.rs:361\u0060 it does not close everything it opens, so those exact 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":"libs/elodin-editor/src/ui/data_overview/mod.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"2936d849a422524ed25b87d2357ef3aaded620821550b39d80963ac860a0c7c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/elodin-editor/src/ui/gauges/geo_position.rs:66-80 | libs/elodin-editor/src/ui/gauges/orientation.rs:105-119 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/gauges/geo_position.rs:66\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/gauges/geo_position.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"7845739c3030bf69014690d4aa972ab759049a6c6d366c7b733c68f2320c9c97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/elodin-editor/src/ui/inspector/viewport.rs:599-613 | libs/elodin-editor/src/ui/inspector/viewport.rs:638-652 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"libs/elodin-editor/src/ui/inspector/viewport.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"207519b018ccfb77777c11f66ba7b2e1e0dfd25d89509e012a9f44e9a68b94fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): libs/elodin-editor/src/ui/plot/widget.rs:1983-1997 | libs/elodin-editor/src/ui/plot/widget.rs:2178-2191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/plot/widget.rs:1983\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":1983}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd46e3b0b6f4542ded3217cab9405103aae0272d958517a884e123d6a84ddeba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/impeller/kdl/src/de.rs:150-164 | libs/impeller/wkt/src/gui.rs:793-807 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"419f1a874914161516f672c58ddd6f81e93bbdffc90236f352cc3ab0eac13c32"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): libs/nox-py/src/cranelift_exec.rs:288-302 | libs/nox-py/src/jax_exec.rs:260-273 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060libs/nox-py/src/cranelift_exec.rs:288\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/cranelift_exec.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ed767006cf3f599630dad5f13d72981da904fcf931976c6e559d3d89eec6e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/nox-py/src/system.rs:842-856 | libs/nox-py/src/system.rs:857-871 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/system.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe7a466cff88509bea324cab786f5aef7e0c6cc2235601412020894b56d8af6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5): libs/cranelift-mlir/src/parser.rs:1618-1631 | libs/cranelift-mlir/src/parser.rs:1938-1951 | libs/cranelift-mlir/src/parser.rs:2201-2214 | libs/cranelift-mlir/src/parser.rs:2416-2429 | libs/cranelift-mlir/src/parser.rs:2500-2513 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1618}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c4697d856742b86ba38b30630906a37cda976af695c7b8f271fea412db7ca8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): libs/db/src/drop.rs:56-69 | libs/db/src/prune.rs:25-38 | libs/db/src/time_align.rs:71-84 \u2014 before extracting anything, compare \u0060libs/db/src/drop.rs\u0060 and \u0060libs/db/src/prune.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/drop.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66391ae74cf82664dc829daa91740f46de9b2e7b3af26bfd48a17dfaf3d1e96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/bevy_world_mesh/src/fetch.rs:918-931 | libs/bevy_world_mesh/src/fetch.rs:1035-1048 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/bevy_world_mesh/src/fetch.rs:918\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":"libs/bevy_world_mesh/src/fetch.rs"},"region":{"startLine":918}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef9ded09c0bf53ab7fcf77f6811bf8fab1465a0b7c079ef4fb3f4f8ade94853"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:2181-2192 | libs/cranelift-mlir/src/lower.rs:2288-2301 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:2181\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":2181}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ca35629bbc08bb5c01ec695573aaa822c091f3e43c8461ace0ac497bcb28be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/db/eql/src/formulas/rotate_world.rs:175-189 | libs/db/eql/src/formulas/rotate_world.rs:194-207 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/eql/src/formulas/rotate_world.rs:175\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"libs/db/eql/src/formulas/rotate_world.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"b024816704305f0ef62240ef8231b1019b97cc6954ceee8d3788e57f0f929bf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): libs/db/src/follow_stream.rs:76-87 | libs/db/src/lib.rs:3345-3358 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060libs/db/src/follow_stream.rs:76\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/follow_stream.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab363f7304ad9807e787e0d95fc025e5155faa26e9723e941033fb8ce7d3f75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/db/src/grpc/common.rs:155-168 | libs/db/src/grpc/ingest.rs:1139-1152 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"libs/db/src/grpc/common.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66310bbd50f3ececd2ab163d11e1738c715279f6581ee3869931479e963714d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): libs/elodin-editor/src/object_3d.rs:1390-1403 | libs/elodin-editor/src/object_3d.rs:1412-1424 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/elodin-editor/src/object_3d.rs:1410\u0060 calls \u0060symmetric_6_to_mat3\u0060, \u0060Some\u0060, \u0060cholesky_3x3_spd\u0060 and \u0060libs/elodin-editor/src/object_3d.rs:1389\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":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd1418337e923f9dfab518a215db105549364f26b23a816f88d05829810d871"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): libs/elodin-editor/src/object_3d.rs:2330-2342 | libs/elodin-editor/src/object_3d.rs:2381-2394 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/object_3d.rs:2330\u0060 it begins part-way through the construct above it, so those exact 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":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":2330}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7932e5ea4221ffe23dff8dcb51f83c9cf584c15c23caf40770b32b50ca4345"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): libs/elodin-editor/src/plugins/frustum_intersection/mod.rs:344-356 | libs/elodin-editor/src/plugins/frustum_intersection/mod.rs:536-549 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/plugins/frustum_intersection/mod.rs:344\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"libs/elodin-editor/src/plugins/frustum_intersection/mod.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"74288c885b15530b9a745af556bafee223343a770b61093824ada4a91edee48b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): libs/elodin-editor/src/ui/inspector/query_table.rs:121-133 | libs/elodin-editor/src/ui/query_table.rs:206-219 \u2014 before extracting anything, compare \u0060libs/elodin-editor/src/ui/inspector/query_table.rs\u0060 and \u0060libs/elodin-editor/src/ui/query_table.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, 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 \u0060libs/elodin-editor/src/ui/inspector/query_table.rs:121\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/query_table.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1d2c9916a0e08225400c665f83a64afae542be727fdc436d9fa414c72faffe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/elodin-editor/src/ui/monitor.rs:128-141 | libs/elodin-editor/src/ui/monitor.rs:225-238 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/monitor.rs:128\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":"libs/elodin-editor/src/ui/monitor.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a46d5251db59093d89b5a2ca55c0714575039cf1c283051b0a93ea67dc70c54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/elodin-macros/src/from_builder.rs:39-52 | libs/elodin-macros/src/repr_monad.rs:58-71 \u2014 before extracting anything, compare \u0060libs/elodin-macros/src/from_builder.rs\u0060 and \u0060libs/elodin-macros/src/repr_monad.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-macros/src/from_builder.rs:39\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-macros/src/from_builder.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1a795dd57d687cd37f9bf7112fbcb937653442001ffbc672b2951edee7f0d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/nox-py/src/graph.rs:246-260 | libs/nox-py/src/query.rs:508-522 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060libs/nox-py/src/graph.rs:246\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/graph.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8910540bbe5d73dcffe12d3839d2f3066bd4c2576a55479879179012a481d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/s10/src/cgroup.rs:128-141 | libs/s10/src/cgroup.rs:246-259 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/s10/src/cgroup.rs:128\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":"libs/s10/src/cgroup.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f9be051de8e406329dcef04b664da09a4d6438d38ef12ebfa5ad545a55ba61b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): libs/stellarator/src/os.rs:136-149 | libs/stellarator/src/os.rs:179-191 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/stellarator/src/os.rs:136\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/src/os.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f00a92b01b5cc568eeba32ae2b199971542e1b0a2b40c9de31e834780f87c640"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): libs/db/eql/src/formulas/rotate.rs:167-179 | libs/db/eql/src/formulas/rotate_world.rs:167-179 | libs/db/eql/src/formulas/translate_world.rs:166-178 \u2014 before extracting anything, compare \u0060libs/db/eql/src/formulas/rotate.rs\u0060 and \u0060libs/db/eql/src/formulas/rotate_world.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/eql/src/formulas/rotate.rs:167\u0060 it does not close everything it opens, so those exact 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":"libs/db/eql/src/formulas/rotate.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b9100c11fbce382b56295db808cb4c014bea009a98ac96f5db010ede3a2a8ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 3): libs/db/src/follow_stream.rs:80-89 | libs/db/src/lib.rs:3201-3213 | libs/db/src/lib.rs:3349-3360 \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 \u0060libs/db/src/follow_stream.rs:80\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/follow_stream.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec8e3f698bfca8cc3cfc6aa4d2d4052705a59fd2270b3769a273126a59db948b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): fsw/lqr/src/main.rs:53-64 | fsw/mekf/src/main.rs:138-150 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fsw/lqr/src/main.rs:53\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/lqr/src/main.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6e1a08925e4a7ed40cdd66838217da688994fb9e2cef226a585b4b989e5e14a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/bevy_world_mesh/src/scenes/globe.rs:126-138 | libs/bevy_world_mesh/src/scenes/planar.rs:103-115 \u2014 before extracting anything, compare \u0060libs/bevy_world_mesh/src/scenes/globe.rs\u0060 and \u0060libs/bevy_world_mesh/src/scenes/planar.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/bevy_world_mesh/src/scenes/globe.rs:126\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":"libs/bevy_world_mesh/src/scenes/globe.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"970051d34de47d556f151c9f3621eabbe09bc122d58093911d4b48c1f68068d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:11208-11220 | libs/cranelift-mlir/src/lower.rs:11312-11324 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":11208}}}],"partialFingerprints":{"codehealthFindingId/v1":"713074879977569f7d7184fda7dffc3922b915eb85f75af4574a633f97012311"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:11232-11244 | libs/cranelift-mlir/src/lower.rs:11337-11349 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:11232\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":11232}}}],"partialFingerprints":{"codehealthFindingId/v1":"317823aa03bec7f5d9e1de81c729b57884300f0370ae013444c706967463af62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/cranelift-mlir/src/parser.rs:1711-1723 | libs/cranelift-mlir/src/parser.rs:1761-1773 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/parser.rs:1711\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b159eafd1bd628c5c5fc271a67f48a39bc7ece01b4d511d29dac9350570aa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/db/eql/src/formulas/rotate.rs:175-189 | libs/db/eql/src/formulas/rotate.rs:194-206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/eql/src/formulas/rotate.rs:175\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"libs/db/eql/src/formulas/rotate.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9dedd26a5c74c93ac5257a47dc702794835427a4ea14312c04d81a8dd370c7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): libs/db/eql/src/formulas/translate_world.rs:171-183 | libs/db/eql/src/formulas/translate_world.rs:191-201 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/eql/src/formulas/translate_world.rs:171\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/formulas/translate_world.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96deaa1e7a59bf863bccb624d861aba3001c7a45cf3610cfb1651e895338c01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/db/src/arrow/mod.rs:559-571 | libs/db/src/arrow/mod.rs:603-615 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/arrow/mod.rs:559\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/arrow/mod.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"0623f5cdf5b44de01367f2647c817eab9703ebf5083a60034d6644bc752f2524"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): libs/db/src/merge.rs:394-406 | libs/db/src/trim.rs:199-210 \u2014 before extracting anything, compare \u0060libs/db/src/merge.rs\u0060 and \u0060libs/db/src/trim.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/merge.rs:394\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/merge.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"584e6979cb33ffff4427348f0bf9d0340a3927af455949cd322f3ad0ac6a4149"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/db/src/merge.rs:530-542 | libs/db/src/merge.rs:551-563 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/merge.rs:530\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/merge.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"182c015256c012984f80a06a3bd470750b1761719a82169d044c7939ec177a40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/db/src/merge.rs:902-914 | libs/db/src/merge.rs:975-987 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/merge.rs:902\u0060 it begins part-way through the construct above it, so those exact 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":"libs/db/src/merge.rs"},"region":{"startLine":902}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cc33cdcc85ddb3a1e0e5bcbaa931d9eb8b56d56c1840fa60aeaf95e969f327"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/elodin-editor/src/object_3d.rs:1480-1492 | libs/elodin-editor/src/object_3d.rs:1498-1510 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/object_3d.rs:1480\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":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":1480}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5495360cd4bf8d30a8d532147e99de5a1a2e29f161b09b5819925353a71ff4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/elodin-editor/src/skybox_generation.rs:282-294 | libs/elodin-editor/src/skybox_generation.rs:305-317 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/skybox_generation.rs:282\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":"libs/elodin-editor/src/skybox_generation.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc7f5e3bff4426743803466cbf56d5467f286b62331a28d3cd3ca1cba62e4e9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/elodin-editor/src/ui/tiles.rs:2862-2874 | libs/elodin-editor/src/ui/tiles.rs:2894-2906 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/tiles.rs:2862\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":2862}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9640528be3fcb2cbee078897862e6d04059d0a9db08a26b268d27ccfcf2e87d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): libs/elodin-editor/src/ui/window/placement.rs:49-60 | libs/elodin-editor/src/ui/window/placement.rs:69-81 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/window/placement.rs:49\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/window/placement.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa4646aa82f5ee929785c18221a496abd64c4ab7591825183881fedfc0ba29e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/elodin-macros/src/from_op.rs:23-35 | libs/elodin-macros/src/into_op.rs:23-35 \u2014 before extracting anything, compare \u0060libs/elodin-macros/src/from_op.rs\u0060 and \u0060libs/elodin-macros/src/into_op.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 32 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-macros/src/from_op.rs:23\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-macros/src/from_op.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe1946e54fb9be960368fe9025380c53b1068b830b4965d7836a674af73434b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/monte-carlo/src/lib.rs:4012-4024 | libs/monte-carlo/src/lib.rs:4055-4067 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/monte-carlo/src/lib.rs:4012\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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":4012}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aac88efc1a40e4fa38174a687a8d2624f6aa81b3a68af5a9069f1ecc03fe1ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): libs/nox/src/noxpr/repr.rs:181-192 | libs/nox/src/noxpr/repr.rs:272-284 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox/src/noxpr/repr.rs:272\u0060 it begins part-way through the construct above it, so those exact 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":"libs/nox/src/noxpr/repr.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06bf14b9d9ab412f674efd68213b9033d521d3efbffceea2e080b136b50cc1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/s10/src/sim.rs:168-180 | libs/s10/src/sim.rs:182-194 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/s10/src/sim.rs:168\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/src/sim.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4db68be63215ed3fd7fab3159ae30240aabd160ef8605c4168cb32bbcbadd04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 4): libs/impeller/src/types.rs:207-218 | libs/impeller/src/types.rs:225-235 | libs/nox-py/src/db/mod.rs:71-82 | libs/nox-py/src/world_builder.rs:2010-2020 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/impeller/src/types.rs:207\u0060 it begins part-way through the construct above it, so those exact 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, \u0060libs/impeller/src/types.rs:237\u0060 calls \u0060fmt\u0060 and \u0060libs/impeller/src/types.rs:218\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":"libs/impeller/src/types.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd9cbfd5563c94728ea903beea9d3d4e4e4ff9df42a6cc40305a2ea4172cf64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 3): libs/db/src/merge.rs:400-410 | libs/db/src/trim.rs:204-213 | libs/db/src/utils.rs:196-207 \u2014 before extracting anything, compare \u0060libs/db/src/merge.rs\u0060 and \u0060libs/db/src/trim.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/merge.rs:400\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/merge.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3bca1950edfc7ba95504bf3a95c38b6f7e2777e4c5b00997b2bef00ec34ca54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): libs/elodin-editor/src/plugins/view_cube/interactions.rs:1379-1390 | libs/elodin-editor/src/plugins/view_cube/interactions.rs:1433-1444 | libs/elodin-editor/src/plugins/view_cube/interactions.rs:1475-1486 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/view_cube/interactions.rs"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"45a01c4fa6ea160ae7011d1930e81e66e8b34287f0548118b89c3680289f09cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): libs/elodin-editor/src/ui/plot/data.rs:2420-2431 | libs/elodin-editor/src/ui/plot/data.rs:2901-2912 | libs/elodin-editor/src/ui/plot/data.rs:2921-2932 \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":"libs/elodin-editor/src/ui/plot/data.rs"},"region":{"startLine":2420}}}],"partialFingerprints":{"codehealthFindingId/v1":"38669cd23d49cc52c9b2c460208ad3118a9e23279c6c6b9ab58d165499c32914"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 3): libs/elodin-editor/src/ui/plot/widget.rs:712-722 | libs/elodin-editor/src/ui/plot/widget.rs:763-773 | libs/elodin-editor/src/ui/plot/widget.rs:821-832 \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 \u0060libs/elodin-editor/src/ui/plot/widget.rs:712\u0060 it begins part-way through the construct above it, so those exact 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, \u0060libs/elodin-editor/src/ui/plot/widget.rs:775\u0060 calls \u0060from_seconds\u0060 and \u0060libs/elodin-editor/src/ui/plot/widget.rs:724\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":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6803389f7aeb00b07df6cbabb14e7f6cff235872a8d8a6094f31904a34ff2ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): libs/impeller/kdl/src/de.rs:1208-1219 | libs/impeller/kdl/src/de.rs:1221-1232 | libs/impeller/kdl/src/de.rs:1238-1249 \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 \u0060libs/impeller/kdl/src/de.rs:1208\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":1208}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3426e85a8bc4983c1e4647fb4c1f709f9684e76c73fc877b388a08d877289b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): libs/stellarator/src/poll/ops.rs:132-144 | libs/stellarator/src/poll/ops.rs:236-248 | libs/stellarator/src/poll/ops.rs:552-564 \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 \u0060libs/stellarator/src/poll/ops.rs:132\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/src/poll/ops.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d5e62fd8441973759c31bec4895334661235b45b3c4ec0e22194746b5aabe3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:3125-3136 | libs/cranelift-mlir/src/lower.rs:3150-3161 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:3125\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":3125}}}],"partialFingerprints":{"codehealthFindingId/v1":"643d705be8ea6598b61744bff31f20e98b007554f6d7229e7e11e49ef82dc2be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:5553-5564 | libs/cranelift-mlir/src/lower.rs:5584-5595 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:5553\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":5553}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb6cdce7b15ef5dbebfc94d70fbd84cf4abace18bc10e0dcf6e4fcde394c854"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:5666-5677 | libs/cranelift-mlir/src/lower.rs:5984-5995 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:5666\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":5666}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f75001fb358dd44f50c0a6b3406af964a287aa6bb1834781aa5ccad8a432cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:9284-9295 | libs/cranelift-mlir/src/lower.rs:9425-9436 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:9284\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":9284}}}],"partialFingerprints":{"codehealthFindingId/v1":"06cc1c0c6124d52d27f22f1fa716f2ca793eb3c0c19931731500e7357b36c301"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:9319-9328 | libs/cranelift-mlir/src/lower.rs:9370-9381 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:9319\u0060 it begins part-way through the construct above it, so those exact 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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":9319}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0a8c8333fa59f8729bbcdd003a783b03ede9153eb65793e53d77a15438239b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/db/src/drop.rs:153-164 | libs/db/src/time_align.rs:142-153 \u2014 before extracting anything, compare \u0060libs/db/src/drop.rs\u0060 and \u0060libs/db/src/time_align.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 100 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/drop.rs:153\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/drop.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e19412f849b0da0444c269e5496a2197eebe5c5fbe43d219fbf07dfddfcecb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): libs/db/src/lib.rs:2242-2252 | libs/db/src/lib.rs:2631-2642 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/lib.rs:2242\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/lib.rs"},"region":{"startLine":2242}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd30886b16deed02ae7a0370e4c60880f2ed65b3e32b17b92556d825e9296c90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/elodin-editor/src/plugins/cinematic_earth/effects.rs:218-229 | libs/elodin-editor/src/plugins/cinematic_earth/effects.rs:393-404 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/plugins/cinematic_earth/effects.rs:218\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/cinematic_earth/effects.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9303233ecd8fc7f6bf23e4b5a9e79801ee9d7a8d4edd922bedafbe04dc79575"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/elodin-editor/src/plugins/view_cube/interactions.rs:1288-1299 | libs/elodin-editor/src/plugins/view_cube/interactions.rs:1332-1343 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/plugins/view_cube/interactions.rs:1288\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/view_cube/interactions.rs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d7d99b269e04c88572e24b501552ed8447cb7002e4a4758e12e728cf3cdc9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/elodin-editor/src/plugins/view_cube/interactions.rs:1310-1321 | libs/elodin-editor/src/plugins/view_cube/interactions.rs:1354-1365 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/plugins/view_cube/interactions.rs:1310\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/view_cube/interactions.rs"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"a840fb340686dcd642b9dd6443fa578f181609c3d7675b2a99361769c35a8ab5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/elodin-editor/src/ui/label.rs:117-128 | libs/elodin-editor/src/ui/label.rs:164-175 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/label.rs:117\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/label.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"42df6c13fe405b4cf80a1fdc43acb7636dba2c66d8f83fa0e99f054145c3559c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): libs/elodin-editor/src/ui/plot/gpu.rs:167-177 | libs/elodin-editor/src/ui/plot_3d/gpu.rs:112-123 \u2014 \u0060libs/elodin-editor/src/ui/plot/gpu.rs\u0060 and \u0060libs/elodin-editor/src/ui/plot_3d/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 4 separate duplicated blocks between them, totalling at least 43 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 \u0060libs/elodin-editor/src/ui/plot/gpu.rs:167\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/gpu.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f666a6831eaf6739b6086e1cbdc8c4c79b9338774b7e9361fe5c2a6c707072"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/impeller/bevy/src/lib.rs:1489-1500 | libs/impeller/bevy/src/lib.rs:1505-1516 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/impeller/bevy/src/lib.rs:1489\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, \u0060libs/impeller/bevy/src/lib.rs:1517\u0060 calls \u0060clone\u0060, \u0060write_message\u0060 and \u0060libs/impeller/bevy/src/lib.rs:1501\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":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":1489}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1af551a8b7f32a71e1167d26d0c7defff5beaff7d333c7ac279789f5aba347a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/impeller/kdl/src/de.rs:121-132 | libs/impeller/kdl/src/de.rs:530-541 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/impeller/kdl/src/de.rs:121\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":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"6317d88042ed4e893dbe81b28fa9dbde784263078557eba1cff8e040c8dd5ba8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/nox/src/array/mod.rs:423-434 | libs/nox/src/array/mod.rs:456-467 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox/src/array/mod.rs:423\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":"libs/nox/src/array/mod.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"11831ed0d3c6293980aa0f8e6f39dfc2ad33096646d58364e989b0d1eca798d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/nox/src/noxpr/node.rs:866-877 | libs/nox/src/noxpr/node.rs:878-889 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox/src/noxpr/node.rs:866\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"339dbd650959d9b977499cf6c9c64b4f34b6d88faf5b43ef4d4f274bce73ad0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 5): libs/cranelift-mlir/src/parser.rs:2056-2066 | libs/cranelift-mlir/src/parser.rs:2468-2478 | libs/cranelift-mlir/src/parser.rs:2558-2568 | libs/cranelift-mlir/src/parser.rs:2647-2657 | libs/cranelift-mlir/src/parser.rs:2729-2739 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/parser.rs:2056\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":2056}}}],"partialFingerprints":{"codehealthFindingId/v1":"58c83bef04a88d608eee634480d3c38d13ba4485fd0efab033f798d7488a8ef8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 3): libs/elodin-editor/src/plugins/gizmos/mod.rs:881-891 | libs/elodin-editor/src/plugins/gizmos/mod.rs:898-907 | libs/elodin-editor/src/plugins/gizmos/mod.rs:916-926 \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 \u0060libs/elodin-editor/src/plugins/gizmos/mod.rs:881\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/gizmos/mod.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71d24b835831b5713dc14acdd4e330535274798ad3a9bdb47eef6f26c01e998"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/bevy_world_mesh/src/fetch.rs:834-844 | libs/bevy_world_mesh/src/fetch.rs:952-962 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/fetch.rs"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"135c49c9c3a811c59798f86e9b5a57b0ba251cb7992a8d966d88e11c90f41e9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:7721-7731 | libs/cranelift-mlir/src/lower.rs:7758-7768 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:7721\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":7721}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e221ba7dcd262bad761683c349011ce87460c667124cc509abfb2850d3f00e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:9330-9340 | libs/cranelift-mlir/src/lower.rs:9383-9393 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:9330\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":9330}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1b4e36867dae37036b8aa3336edf53a83805560c34cfb57c1515d92bbfbc72"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/cranelift-mlir/src/parser.rs:800-810 | libs/cranelift-mlir/src/parser.rs:825-835 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/parser.rs:800\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e8a96436cc34694d3370c47f19feff87aee7721665fd9870eeaaf8a1733b3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/cranelift-mlir/src/parser.rs:1676-1687 | libs/cranelift-mlir/src/parser.rs:1820-1830 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/parser.rs:1676\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1676}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f9d226bd10e629b3fe9f91e4d6343a9c611d8cb43cdbdfe16c9e0532f4fcad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/cranelift-mlir/src/tensor_rt.rs:2084-2094 | libs/cranelift-mlir/src/tensor_rt.rs:2101-2111 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/tensor_rt.rs:2084\u0060 it does not close everything it opens, so those exact 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, \u0060libs/cranelift-mlir/src/tensor_rt.rs:2081\u0060 calls \u0060tensor_fft_f64\u0060, \u0060from_raw_parts_mut\u0060 and \u0060libs/cranelift-mlir/src/tensor_rt.rs:2100\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":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":2084}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfac96b7138e3ae2fbb022b2397b7c20c1ae090c6334d7de0ada21a6846c6bbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/db/cli/src/lib.rs:268-278 | libs/db/cli/src/lib.rs:304-314 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/cli/src/lib.rs:268\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/cli/src/lib.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"504ffe6aaa6e9c8bfcdd5db455f433beffb28f06ff3e93cd4451843ff7aaff5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/db/src/export.rs:287-297 | libs/db/src/export.rs:301-311 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060v\u0060 to \u0060f64\u0060 in one and \u0060f32\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":"libs/db/src/export.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5ea572ed6f5512449110430e85ec5212e548992826f320cee77043549d2e30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/db/src/grpc/ingest.rs:1050-1060 | libs/db/src/grpc/ingest.rs:1069-1079 \u2014 both copies are in the same file, so extract the block 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":"libs/db/src/grpc/ingest.rs"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"382f37014c7c9f74329483bcefb1fdfef754a290b51221a1a20190d37aa8d8fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/db/src/grpc/stream.rs:706-716 | libs/db/src/grpc/stream.rs:751-761 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/grpc/stream.rs:706\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"libs/db/src/grpc/stream.rs"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83c4243c925ee90c57ff3b74528137c475bc8b56d54aa539f6c4a13170f6108"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/db/src/lib.rs:2584-2594 | libs/db/src/lib.rs:2611-2621 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/lib.rs:2584\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":"libs/db/src/lib.rs"},"region":{"startLine":2584}}}],"partialFingerprints":{"codehealthFindingId/v1":"442e5e66a923c5a71e5fb5b66902d9ac7e2afbdb893820397faf014206db289e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/elodin-editor/src/object_3d.rs:814-824 | libs/elodin-editor/src/object_3d.rs:863-873 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/object_3d.rs:814\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":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"16bdfc47414c208846ec9b2ab0d02c86d625d9d4e09cedd31e6d28bb4f4ddd7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/elodin-editor/src/plugins/display_kernel.rs:214-224 | libs/elodin-editor/src/ui/plot/data.rs:233-243 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"libs/elodin-editor/src/plugins/display_kernel.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b0eb7aba8a7d2bdd65afb9cceba58b7ca040c6f8f62b8cef74d854c6acaa5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): libs/elodin-editor/src/skybox_db_assets.rs:595-604 | libs/elodin-editor/src/skybox_db_assets.rs:672-682 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/skybox_db_assets.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e67f02aae75b1925047b679087d7a6e78a0124a8fc1400a2ea3ebde60bc6a3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): libs/elodin-editor/src/ui/data_overview/mod.rs:298-308 | libs/elodin-editor/src/ui/inspector/data_overview.rs:30-38 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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":"libs/elodin-editor/src/ui/data_overview/mod.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"98fa2a9f0841b7ef133c1d951df772d2d8d09074a41f87fad0273028a844f2eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201323 lines \u00D7 2): libs/elodin-editor/src/ui/inspector/object3d.rs:365-376 | libs/elodin-editor/src/ui/inspector/object3d.rs:404-426 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"libs/elodin-editor/src/ui/inspector/object3d.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad39606a774fddef2a036df707d59f70fe17e0883ebd65b8044e84c930e72735"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): libs/elodin-editor/src/ui/inspector/object3d.rs:478-488 | libs/elodin-editor/src/ui/inspector/object3d.rs:510-519 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/inspector/object3d.rs:478\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/object3d.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93979304403523fdf12f9a0de8fc68e749b794950b66c46385675873742c38b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/elodin-editor/src/ui/inspector/sensor_camera.rs:170-180 | libs/elodin-editor/src/ui/inspector/viewport.rs:980-990 \u2014 before extracting anything, compare \u0060libs/elodin-editor/src/ui/inspector/sensor_camera.rs\u0060 and \u0060libs/elodin-editor/src/ui/inspector/viewport.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 117 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/inspector/sensor_camera.rs:170\u0060 it does not close everything it opens, so those exact 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, \u0060libs/elodin-editor/src/ui/inspector/viewport.rs:978\u0060 calls \u0060from_color32\u0060 and \u0060libs/elodin-editor/src/ui/inspector/sensor_camera.rs:168\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":"libs/elodin-editor/src/ui/inspector/sensor_camera.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1aea109a69308036b924b265084663aa252d5f54e0f760c12e3925f7ee60fc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): libs/elodin-editor/src/ui/plot/widget.rs:954-964 | libs/elodin-editor/src/ui/plot/widget.rs:1252-1260 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/plot/widget.rs:954\u0060 it does not close everything it opens, so those exact 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":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"f250399715c27023bebd7cf08519b8f6fdfbb16f41fb61dc4f483d2f8835d34c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/elodin-editor/src/ui/plot/widget.rs:2005-2015 | libs/elodin-editor/src/ui/plot/widget.rs:2204-2214 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/plot/widget.rs:2005\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/elodin-editor/src/ui/plot/widget.rs:2002\u0060 calls \u0060as_mut\u0060, \u0060expect\u0060, \u0060Some\u0060 and \u0060libs/elodin-editor/src/ui/plot/widget.rs:2201\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":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":2005}}}],"partialFingerprints":{"codehealthFindingId/v1":"36eefa1370dbc0ae8e5212bf866a7526ba149b7357288945efb9ebb9e550e5e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/elodin-editor/src/ui/plot/widget.rs:2448-2458 | libs/elodin-editor/src/ui/plot/widget.rs:2930-2940 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":2448}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c498287f10f975cf9cf47d2dceb4808fc213d5992e7cd8ce9d3985ad630f23a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): libs/elodin-editor/src/ui/plot_3d/gpu.rs:893-901 | libs/elodin-editor/src/ui/plot_3d/gpu.rs:905-915 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/plot_3d/gpu.rs:893\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot_3d/gpu.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf64ba6161a92ee3d5d859095bb3abcf74d6cffe3e8168f8395fca32a38ad86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): libs/elodin-editor/src/ui/schematic/mod.rs:304-314 | libs/elodin-editor/src/ui/schematic/mod.rs:317-326 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/mod.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0dca34abd4fe52ddb27f44fb9ea56ccf7c45bdbce4053fa2e27d2ff55508fae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): libs/elodin-editor/src/ui/video_stream.rs:755-765 | libs/elodin-editor/src/ui/video_stream.rs:860-869 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/video_stream.rs:755\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/video_stream.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeac361393974e40b9d7abb42bbb77a437e00c8957e3dac3b54aa4c7b45d657d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/elodin-editor/src/ui/video_stream.rs:774-784 | libs/elodin-editor/src/ui/video_stream.rs:881-891 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/video_stream.rs:774\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":"libs/elodin-editor/src/ui/video_stream.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ec51eda6581b4bcd844db3f365b39406a94b4ce21f5653fc908aa77cf81aa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/impeller/bevy/src/lib.rs:2264-2274 | libs/impeller/bevy/src/lib.rs:2313-2323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/impeller/bevy/src/lib.rs:2264\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":2264}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b3709805c227c5cdcce29fe78778abeeb3fc412e51f2f5443453b273f715604"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/impeller/kdl/src/de.rs:1382-1392 | libs/impeller/kdl/src/de.rs:1774-1784 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/impeller/kdl/src/de.rs:1382\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":1382}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0705a2e8afbc268b4327d577be9d3e2fd5a726bfb27ccc9faf49071e8e831b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/nox-py/src/db/stream.rs:263-273 | libs/nox-py/src/db/stream.rs:422-432 \u2014 both copies are in the same file, so extract the block 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":"libs/nox-py/src/db/stream.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4837614f1de3fd6328f88dacb957f89a2e8e08f8706fdcfe93b358e786c9ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/nox-py/src/step_context.rs:274-284 | libs/nox-py/src/step_context.rs:658-668 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox-py/src/step_context.rs:274\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/step_context.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f91b39ecaffd5dc7236ec9e9eda28ba26554297ff3ba5160ba89ab14a62fc81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/nox/src/array/mod.rs:568-578 | libs/nox/src/array/mod.rs:601-611 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/array/mod.rs"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a58901df8c1f7f8f9018be3429badfcac3fee94485538f3c749dcaa14d12def"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/nox/src/noxpr/node.rs:818-828 | libs/nox/src/noxpr/node.rs:829-839 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox/src/noxpr/node.rs:818\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68162083a57287c8bc074d0605d7d1bd9b620880d54e611da657357f43f6aa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/stellarator/src/io.rs:20-30 | libs/stellarator/src/io.rs:43-53 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/stellarator/src/io.rs:20\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":"libs/stellarator/src/io.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2839cdaf91e77fcbd5c3e69ff34ad0f0569c46d63700554477a586547b47a47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 14): libs/cranelift-mlir/src/parser.rs:794-802 | libs/cranelift-mlir/src/parser.rs:955-963 | libs/cranelift-mlir/src/parser.rs:1245-1253 | libs/cranelift-mlir/src/parser.rs:1289-1297 | libs/cranelift-mlir/src/parser.rs:1330-1338 | libs/cranelift-mlir/src/parser.rs:1423-1431 | libs/cranelift-mlir/src/parser.rs:1479-1487 | libs/cranelift-mlir/src/parser.rs:1519-1527 | libs/cranelift-mlir/src/parser.rs:1748-1756 | libs/cranelift-mlir/src/parser.rs:2111-2119 | libs/cranelift-mlir/src/parser.rs:2245-2254 | libs/cranelift-mlir/src/parser.rs:2324-2333 | libs/cranelift-mlir/src/parser.rs:2591-2600 | libs/cranelift-mlir/src/parser.rs:2687-2695 \u2014 all 14 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/cranelift-mlir/src/parser.rs:2242\u0060 calls \u0060parse_next\u0060 and \u0060libs/cranelift-mlir/src/parser.rs:953\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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d726dd0819759928ee460fdca431c45bf958536b875ab68db84e02710cdf5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): libs/cranelift-mlir/src/lower.rs:4465-4474 | libs/cranelift-mlir/src/lower.rs:4517-4526 | libs/cranelift-mlir/src/lower.rs:5697-5706 | libs/cranelift-mlir/src/lower.rs:5732-5741 | libs/cranelift-mlir/src/lower.rs:6004-6013 | libs/cranelift-mlir/src/lower.rs:6043-6052 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:4465\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":4465}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda57490c265084ebd5e489f752b4dd4b3d163296db8bfa7506c766022f7d6ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 5): libs/db/src/drop.rs:159-168 | libs/db/src/fix_timestamps.rs:224-232 | libs/db/src/prune.rs:99-107 | libs/db/src/time_align.rs:148-157 | libs/db/src/truncate.rs:82-90 \u2014 before extracting anything, compare \u0060libs/db/src/drop.rs\u0060 and \u0060libs/db/src/prune.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/drop.rs:159\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/drop.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"7624cb08b1149fdaa52298f961e637b80b9874706d07ec92c384d997682d8cbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 4): libs/cranelift-mlir/src/tensor_rt.rs:591-600 | libs/cranelift-mlir/src/tensor_rt.rs:1370-1378 | libs/cranelift-mlir/src/tensor_rt.rs:1502-1510 | libs/cranelift-mlir/src/tensor_rt.rs:1546-1554 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/tensor_rt.rs:591\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"009b402ded8fabda62b011e4c58ab84c5d756ceb11679f8583b284f24752e299"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): libs/elodin-macros/src/from_builder.rs:49-59 | libs/elodin-macros/src/from_op.rs:32-42 | libs/elodin-macros/src/into_op.rs:32-42 | libs/elodin-macros/src/repr_monad.rs:68-78 \u2014 before extracting anything, compare \u0060libs/elodin-macros/src/from_builder.rs\u0060 and \u0060libs/elodin-macros/src/repr_monad.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/elodin-macros/src/from_builder.rs:46\u0060 calls \u0060iter\u0060, \u0060any\u0060 and \u0060libs/elodin-macros/src/from_op.rs:31\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":"libs/elodin-macros/src/from_builder.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"d38fd9287f43a658f36782a4b8dc0dde91292acd78d27f689f3997b4d84d2110"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): libs/cranelift-mlir/src/lower.rs:2186-2195 | libs/cranelift-mlir/src/lower.rs:2295-2304 | libs/cranelift-mlir/src/lower.rs:2402-2411 \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 \u0060libs/cranelift-mlir/src/lower.rs:2186\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":2186}}}],"partialFingerprints":{"codehealthFindingId/v1":"58af41e4c78ebe64e8280f09bb6716b72a1d877c71a774d10dd47468b4924f8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): libs/nox/src/noxpr/repr.rs:181-190 | libs/nox/src/noxpr/repr.rs:274-283 | libs/nox/src/noxpr/repr.rs:404-413 \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":"libs/nox/src/noxpr/repr.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ddc55d46e8e1b09b89f0070eb7c1c132c1614f51faffa3c1ff5c675b7b6bfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): fsw/sensor-fw/src/can.rs:88-96 | fsw/sensor-fw/src/can.rs:112-121 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060rb\u0060 to \u0060pac::FDCAN1\u0060 in one and \u0060pac::FDCAN2\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":"fsw/sensor-fw/src/can.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f7eb7730122f1f3624d99652876ccb10dd605a5ef575c3aa0c14f939a02726"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/build-common/git_inspect.rs:31-40 | libs/build-common/git_inspect.rs:73-82 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/build-common/git_inspect.rs:31\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/build-common/git_inspect.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"38281835fb79ef43df75896845962a1ec867eb91c66bccedf78cfb75fc50c434"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/cranelift-mlir/src/interp.rs:878-891 | libs/cranelift-mlir/src/interp.rs:905-918 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/interp.rs:878\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f695a8f9c313810ce679e2ef4e985870dea151a4915565237afccb2ed1e0e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:3110-3119 | libs/cranelift-mlir/src/lower.rs:3177-3186 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:3110\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":3110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6bcd51fa019d099eabd7dba8bc848421884588fdfb21d86587fecbd26f9560"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:4177-4189 | libs/cranelift-mlir/src/lower.rs:6916-6928 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:4177\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, \u0060libs/cranelift-mlir/src/lower.rs:6929\u0060 calls \u0060Ok\u0060, \u0060lower_constant\u0060 and \u0060libs/cranelift-mlir/src/lower.rs:4190\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":4177}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa31856f83081421c3837d365ddedaeb95b9e2d0063b744005a951e3302b37f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:5111-5120 | libs/cranelift-mlir/src/lower.rs:5172-5181 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:5111\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":5111}}}],"partialFingerprints":{"codehealthFindingId/v1":"34f767a061c55a4d3c899200b6734cd67a160a25d7935dd2069c6ec7f9d887db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:5849-5858 | libs/cranelift-mlir/src/lower.rs:8686-8695 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:5849\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":5849}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ed2e941667924d4001a11d8efff0466d12d8327e75efe852bc391629dadda9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:9116-9127 | libs/cranelift-mlir/src/lower.rs:9129-9140 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:9116\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":9116}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c30a3130ed09da0d22109a50fcc2910470dbf5933369325c1c1fc8c24234b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:10843-10852 | libs/cranelift-mlir/src/lower.rs:11577-11586 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:10843\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":10843}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae72272210a7cf4c474c78f193f4d12f5bf00faa1ebe5d65827df9f1be9bd4be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/cranelift-mlir/src/parser.rs:1400-1409 | libs/cranelift-mlir/src/parser.rs:1456-1465 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/parser.rs:1400\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"0874f625dd78f5cacab48be99c7e402293c1f166c6ed9a19e6ad6c6cc8e9cd25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/cranelift-mlir/src/parser.rs:1528-1537 | libs/cranelift-mlir/src/parser.rs:2602-2611 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e248eef115960af723b7ca2bfa0805aada58fd5c91327b54b67ca57b4d08fa2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): libs/cranelift-mlir/src/tensor_rt.rs:1326-1335 | libs/cranelift-mlir/src/tensor_rt.rs:1452-1460 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/tensor_rt.rs:1326\u0060 it does not close everything it opens, so those exact 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, \u0060libs/cranelift-mlir/src/tensor_rt.rs:1450\u0060 calls \u0060collect\u0060 and \u0060libs/cranelift-mlir/src/tensor_rt.rs:1324\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":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"5453c14ff5aca374884e158f5d79f336ee5916970964f2ab239fd775a478a855"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/cranelift-mlir/src/tensor_rt.rs:2042-2051 | libs/cranelift-mlir/src/tensor_rt.rs:2058-2067 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":2042}}}],"partialFingerprints":{"codehealthFindingId/v1":"537a63c1d351de58d096efe362a2b0f4e97568164c1b04a833980560ddf628b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/db/src/fix_timestamps.rs:71-80 | libs/db/src/prune.rs:44-53 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/fix_timestamps.rs:71\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/fix_timestamps.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa827cd61127a6ec211b94437d8d043e354882bca8bb6e98b0eb1e7f64299425"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/elodin-editor/src/plugins/view_cube/interactions.rs:1533-1542 | libs/elodin-editor/src/plugins/view_cube/interactions.rs:1546-1555 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/view_cube/interactions.rs"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"d70acc080821354c7be5c65a0100a286cc246ece234866588346b44cf99d400f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): libs/elodin-editor/src/ui/inspector/sensor_camera.rs:149-157 | libs/elodin-editor/src/ui/inspector/viewport.rs:971-980 \u2014 before extracting anything, compare \u0060libs/elodin-editor/src/ui/inspector/sensor_camera.rs\u0060 and \u0060libs/elodin-editor/src/ui/inspector/viewport.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 117 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/inspector/sensor_camera.rs:149\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/sensor_camera.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c68c134d5069e9e6cf5b0c56d0732fa7e9c8877c619fd27b8128e46dc16b756"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/impeller/bevy/src/lib.rs:1412-1421 | libs/impeller/bevy/src/lib.rs:1639-1648 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/impeller/bevy/src/lib.rs:1412\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"589f8f8454ca8b22c6a39eb0cdc2ff416bd37723f0f9974f60e7dd53bed31a66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/monte-carlo/src/lib.rs:3767-3776 | libs/monte-carlo/src/lib.rs:4149-4158 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":3767}}}],"partialFingerprints":{"codehealthFindingId/v1":"433e2f4ba40f7c2cc0cd9d81e71b3d202be04b6f55db9fe06b778105b029d12d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/nox/src/noxpr/node.rs:1332-1341 | libs/nox/src/noxpr/node.rs:1642-1651 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fd910bc3afa87b6aac9ab8fe9d324ff7a6ad4daf40c218d48f02362bcd4d9c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/nox/src/noxpr/node.rs:1498-1508 | libs/nox/src/noxpr/node.rs:1735-1745 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40cb68dfabc4d3a4570772b23afdce4ca9f2310431eddf47b5c3a787eb8518b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): libs/cranelift-mlir/src/interp.rs:803-811 | libs/cranelift-mlir/src/interp.rs:849-857 | libs/cranelift-mlir/src/interp.rs:883-891 | libs/cranelift-mlir/src/interp.rs:910-918 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/interp.rs:803\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3911d030b0a70d98f92343c875901576f70341b613e8422e47fb8d48dcbcd7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): libs/cranelift-mlir/src/lower.rs:6939-6947 | libs/cranelift-mlir/src/lower.rs:6962-6970 | libs/cranelift-mlir/src/lower.rs:6985-6993 | libs/cranelift-mlir/src/lower.rs:7008-7016 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:6939\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":6939}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd33a82d28a563dee2117c8be46256139840c9bf4834d53c6d71649c4a05c316"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): libs/elodin-editor/src/plugins/view_cube/interactions.rs:1286-1294 | libs/elodin-editor/src/plugins/view_cube/interactions.rs:1308-1316 | libs/elodin-editor/src/plugins/view_cube/interactions.rs:1330-1338 | libs/elodin-editor/src/plugins/view_cube/interactions.rs:1352-1360 \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":"libs/elodin-editor/src/plugins/view_cube/interactions.rs"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c65091441edeeb18b8cf5e1de0b85ea1bbed43092df63b164646cf47dde130"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 4): libs/elodin-editor/src/ui/inspector/sensor_camera.rs:140-147 | libs/elodin-editor/src/ui/inspector/sensor_camera.rs:175-183 | libs/elodin-editor/src/ui/inspector/viewport.rs:962-969 | libs/elodin-editor/src/ui/inspector/viewport.rs:985-993 \u2014 before extracting anything, compare \u0060libs/elodin-editor/src/ui/inspector/sensor_camera.rs\u0060 and \u0060libs/elodin-editor/src/ui/inspector/viewport.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 117 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/inspector/sensor_camera.rs:140\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/sensor_camera.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"741fdf85aeed49141cb09b9009b6a2e1bb67e43ac1c96bcdac7345188788fdd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): libs/cranelift-mlir/src/lower.rs:9628-9636 | libs/cranelift-mlir/src/tensor_rt.rs:1417-1424 | libs/cranelift-mlir/src/tensor_rt.rs:1667-1675 \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 \u0060libs/cranelift-mlir/src/lower.rs:9628\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":9628}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cdd84fdc94f23eef3d507befac90111c89bc6ea44ff747b4937eacca67f3f75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): libs/db/src/drop.rs:335-343 | libs/db/src/prune.rs:131-139 | libs/db/src/time_align.rs:263-271 \u2014 before extracting anything, compare \u0060libs/db/src/drop.rs\u0060 and \u0060libs/db/src/prune.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/drop.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b3492f84ff01fb8c30f3427a1f0058cfaf75138fac4ea49bcce208067ced99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 3): libs/elodin-editor/src/ui/plot/widget.rs:2426-2434 | libs/elodin-editor/src/ui/plot/widget.rs:2525-2533 | libs/elodin-editor/src/ui/plot/widget.rs:2624-2631 \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 \u0060libs/elodin-editor/src/ui/plot/widget.rs:2426\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":2426}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b2a66f9e4cb6ea7813dcf9f4108d0596def4877fca086b7c3081abd1e8f197"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): libs/impeller/kdl/src/de.rs:1632-1640 | libs/impeller/kdl/src/de.rs:1646-1654 | libs/impeller/kdl/src/de.rs:1660-1668 \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":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e581c3aa0188ee2306476de5c6b2d67530a5069b348136e32a8d8d042f7785"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): fsw/sensor-fw/src/bmi270.rs:280-288 | fsw/sensor-fw/src/bmi270_spi.rs:152-160 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fsw/sensor-fw/src/bmi270.rs:280\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/bmi270.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd94f01323638be00821a234e4f847b5d6afc6b23499b96af0ecca3384bac7d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): fsw/sensor-fw/src/bmm350.rs:416-424 | fsw/sensor-fw/src/bmp581.rs:132-141 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fsw/sensor-fw/src/bmm350.rs:416\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/bmm350.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2933e2084da9d713ff1f4cbc4e3490ca72716c7a1933ab21728bf10fe0666d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): fsw/sensor-fw/src/sdmmc.rs:264-272 | fsw/sensor-fw/src/sdmmc.rs:662-670 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fsw/sensor-fw/src/sdmmc.rs:264\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/sdmmc.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd84574088a888174db063669498235eb8885d38322bb27e67ca69ba478341c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/bevy_world_mesh/src/scenes/globe.rs:188-196 | libs/bevy_world_mesh/src/scenes/planar.rs:139-147 \u2014 before extracting anything, compare \u0060libs/bevy_world_mesh/src/scenes/globe.rs\u0060 and \u0060libs/bevy_world_mesh/src/scenes/planar.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 42 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/bevy_world_mesh/src/scenes/globe.rs:188\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/scenes/globe.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e928cd55d04a2a276bff55bd986f0d6073969e4cc7212101e2de5c46b32d76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/cranelift-mlir/src/const_fold.rs:872-880 | libs/cranelift-mlir/src/const_fold.rs:896-905 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/const_fold.rs:872\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":"libs/cranelift-mlir/src/const_fold.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"257e4b852d0011f6832e98467945382369f3d6a0f2b46a5d8b1146f55b3a68b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/cranelift-mlir/src/const_fold.rs:1046-1054 | libs/cranelift-mlir/src/const_fold.rs:1057-1065 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/const_fold.rs:1046\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":"libs/cranelift-mlir/src/const_fold.rs"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"de56f2298adafdaf97cb727e787257038eb5ca5ef4c50ec4eeceb5fdcec6295a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/cranelift-mlir/src/const_fold.rs:1057-1065 | libs/cranelift-mlir/src/const_fold.rs:1068-1076 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/const_fold.rs:1057\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":"libs/cranelift-mlir/src/const_fold.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"44168238eea30d67e6d56b3098aa7075f16a3a132dd931888e42596e5f50fe3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/cranelift-mlir/src/inliner.rs:366-374 | libs/cranelift-mlir/src/inliner.rs:393-401 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/inliner.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"e062b79d2bf0824f7130e78cd35078de471ad2c5e681c3ce9ca97448d4fc80ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/cranelift-mlir/src/parser.rs:1040-1048 | libs/cranelift-mlir/src/parser.rs:1055-1063 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"314f1cbfa291174baa9421ee5b9692ec70156deb85a0a829526d78c04616adad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/cranelift-mlir/src/parser.rs:2274-2282 | libs/cranelift-mlir/src/parser.rs:2287-2295 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/parser.rs:2274\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":2274}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf3e7b655d6a49a8e829bd16b7134a5438cd93d60da826e87481ac3ff60f966"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/db/src/bin/bench.rs:884-892 | libs/db/src/bin/bench.rs:958-966 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/bin/bench.rs:884\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/bin/bench.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"48ff15d495e7c58adc41067dc4fff6c5db3c984c127a95e1385624fe56f458d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/db/src/export_mcap.rs:181-189 | libs/db/src/export_mcap.rs:237-245 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/export_mcap.rs:181\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/export_mcap.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b22eea15fb7aba281032e64c41742888082292fd45e10c381fb3770f6b86a27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/db/src/export_mcap.rs:2290-2298 | libs/db/src/export_videos.rs:458-466 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060libs/db/src/export_mcap.rs:2290\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/export_mcap.rs"},"region":{"startLine":2290}}}],"partialFingerprints":{"codehealthFindingId/v1":"057d6897acd8b9ff308d8be06e7bb533c6a4af7f9ffe18e1d9759e92993fb2f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): libs/db/src/lib.rs:395-405 | libs/db/src/lib.rs:855-866 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/lib.rs:395\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":"libs/db/src/lib.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4e32a8148b818e93a318131072000eb330b8094c0b2b68bd01ac7df7b8faf71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/db/src/merge.rs:363-371 | libs/db/src/merge.rs:373-381 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/merge.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49b239f1c979a477a542f55248ef587247bfe33e46116ce20067a4a28d3df21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/elodin-editor/src/object_3d.rs:791-800 | libs/elodin-editor/src/object_3d.rs:844-853 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/object_3d.rs:791\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ae2eda92479388cc3bcb07aabbef4f856663345fa32803d8772dfdab3cdbf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 2): libs/elodin-editor/src/ui/inspector/graph.rs:166-174 | libs/elodin-editor/src/ui/inspector/query_table.rs:87-92 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060libs/elodin-editor/src/ui/inspector/graph.rs:166\u0060 it begins part-way through the construct above it, so those exact 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":"libs/elodin-editor/src/ui/inspector/graph.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"639e7d12221564e9b957111e8456cf9e514ba43c188d6da6123ffc15805549e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/elodin-editor/src/ui/plot/data.rs:2749-2758 | libs/elodin-editor/src/ui/plot/data.rs:2849-2857 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/plot/data.rs:2749\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/elodin-editor/src/ui/plot/data.rs:2858\u0060 calls \u0060as_slice\u0060, \u0060cpu\u0060 and \u0060libs/elodin-editor/src/ui/plot/data.rs:2759\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":"libs/elodin-editor/src/ui/plot/data.rs"},"region":{"startLine":2749}}}],"partialFingerprints":{"codehealthFindingId/v1":"07dc31fd7cdc4e8aff67de1399a45715cbbb6f23d27122d8396aa73f5601b794"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/elodin-editor/src/ui/plot/gpu.rs:1655-1663 | libs/elodin-editor/src/ui/plot_3d/gpu.rs:845-853 \u2014 \u0060libs/elodin-editor/src/ui/plot/gpu.rs\u0060 and \u0060libs/elodin-editor/src/ui/plot_3d/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 4 separate duplicated blocks between them, totalling at least 43 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 \u0060libs/elodin-editor/src/ui/plot/gpu.rs:1655\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/gpu.rs"},"region":{"startLine":1655}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3dac2cf78c7e5630ef4f767acb026bd4b2c2f1af446594097667f3c5df92751"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/elodin-editor/src/ui/schematic/load.rs:1329-1337 | libs/elodin-editor/src/ui/schematic/load.rs:1414-1422 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/schematic/load.rs:1329\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2844bb026f6afeb71c92bce39c9128c695d3b9f5aa9981ffdca8cd9694ad9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/impeller/kdl/src/de.rs:111-119 | libs/impeller/kdl/src/de.rs:520-528 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/impeller/kdl/src/de.rs:111\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"be3c67cf895806dab8bbc5ecfea267061bfb7588da8f7743ee6b8f81014ceb19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/impeller/kdl/src/de.rs:1683-1691 | libs/impeller/kdl/src/de.rs:1727-1735 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":1683}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb375899a202505cb9dd7941bb9d7ee1d29aeb19e4a8066ef678cdb3614bf64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/nox-py/src/impeller_server.rs:364-372 | libs/nox-py/src/impeller_server.rs:454-462 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox-py/src/impeller_server.rs:364\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/impeller_server.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"43642d2eef235e2827813954414fc9f62a20b1077f3bb6764974ad906d3d3538"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/nox-py/src/ui/builders.rs:974-982 | libs/nox-py/src/ui/builders.rs:1019-1027 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/ui/builders.rs"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"70de7ff11ba763574521e7cf75803e0d2c345c8b4ebe253ac414aef89097b455"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/nox-py/src/ui/mod.rs:469-477 | libs/nox-py/src/ui/mod.rs:504-512 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox-py/src/ui/mod.rs:469\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":"libs/nox-py/src/ui/mod.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"b212b3f2c90e0d050c1c915e9e0e45503fb6e3cf755b0fa08040497b44c05b1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/nox-py/src/world_builder.rs:1231-1239 | libs/nox-py/src/world_builder.rs:1755-1763 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"bddec7a886c86ee1da3368e3c6a5e564c189b6c2f2f59e0033d6d148fd29bc8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 8): libs/cranelift-mlir/src/lower.rs:4209-4216 | libs/cranelift-mlir/src/lower.rs:4242-4249 | libs/cranelift-mlir/src/lower.rs:4275-4282 | libs/cranelift-mlir/src/lower.rs:4308-4315 | libs/cranelift-mlir/src/lower.rs:4342-4349 | libs/cranelift-mlir/src/lower.rs:4375-4382 | libs/cranelift-mlir/src/lower.rs:4439-4446 | libs/cranelift-mlir/src/lower.rs:4491-4498 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:4209\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":4209}}}],"partialFingerprints":{"codehealthFindingId/v1":"d081d764a3cb624fcb33f2a9fa89cb619d8e7a261533ac2ca8f4fcfc5083f550"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 5): libs/cranelift-mlir/src/parser.rs:857-862 | libs/cranelift-mlir/src/parser.rs:891-896 | libs/cranelift-mlir/src/parser.rs:1805-1810 | libs/cranelift-mlir/src/parser.rs:2041-2048 | libs/cranelift-mlir/src/parser.rs:2930-2935 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/cranelift-mlir/src/parser.rs:2039\u0060 calls \u0060parse_body\u0060, \u0060ws\u0060 and \u0060libs/cranelift-mlir/src/parser.rs:2929\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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"11713fb903a2d389621da4ca5e5755799b2cff988712c69afd42c035bbdc3de2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 5): libs/cranelift-mlir/src/parser.rs:932-938 | libs/cranelift-mlir/src/parser.rs:1262-1269 | libs/cranelift-mlir/src/parser.rs:1299-1305 | libs/cranelift-mlir/src/parser.rs:1433-1439 | libs/cranelift-mlir/src/parser.rs:2340-2345 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8cca3582ccfaa9bb3d3b506a9ca3222dc31011c60bb1091ca395e1dd858c462"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): libs/db/src/merge.rs:400-407 | libs/db/src/merge.rs:595-605 | libs/db/src/trim.rs:204-211 | libs/db/src/trim.rs:331-341 | libs/db/src/utils.rs:196-205 \u2014 before extracting anything, compare \u0060libs/db/src/merge.rs\u0060 and \u0060libs/db/src/trim.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 82 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/merge.rs:400\u0060 it does not close everything it opens, so those exact 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, \u0060libs/db/src/trim.rs:342\u0060 calls \u0060join\u0060, \u0060create_dir_all\u0060 and \u0060libs/db/src/utils.rs:206\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":"libs/db/src/merge.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff0c27d66c7707b5696b7b7ed2f71cc8138fdfaf76623672ea9aecfc533f003b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 4): libs/cranelift-mlir/src/parser.rs:892-898 | libs/cranelift-mlir/src/parser.rs:1806-1812 | libs/cranelift-mlir/src/parser.rs:2440-2447 | libs/cranelift-mlir/src/parser.rs:2931-2937 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/cranelift-mlir/src/parser.rs:2438\u0060 calls \u0060ws\u0060, \u0060parse_region_body_with_block_args\u0060 and \u0060libs/cranelift-mlir/src/parser.rs:2930\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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d8d11fc40041193c4c89f16737a3bd7091d190fbddeae5a58ef5d691a2b421a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): libs/elodin-macros/src/from_builder.rs:38-45 | libs/elodin-macros/src/from_op.rs:24-31 | libs/elodin-macros/src/into_op.rs:24-31 | libs/elodin-macros/src/repr_monad.rs:45-52 \u2014 before extracting anything, compare \u0060libs/elodin-macros/src/from_builder.rs\u0060 and \u0060libs/elodin-macros/src/repr_monad.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 33 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-macros/src/from_builder.rs:38\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/elodin-macros/src/from_builder.rs:46\u0060 calls \u0060iter\u0060, \u0060any\u0060 and \u0060libs/elodin-macros/src/from_op.rs:32\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":"libs/elodin-macros/src/from_builder.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"98652f11d69dab9c1706d41cd3a15199bdaafbf80b92c2a4aab06d78e6e1a0c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/bevy_world_mesh/src/fetch.rs:297-304 | libs/bevy_world_mesh/src/fetch.rs:324-331 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/fetch.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"d891831d641f3f8f71b36c06b99e6daa783f48013234d5d14c22ed7750f710eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/bevy_world_mesh/src/fetch.rs:858-865 | libs/bevy_world_mesh/src/fetch.rs:977-984 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/bevy_world_mesh/src/fetch.rs:858\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/fetch.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"11628bab474d545e90f3ff11e788a5107ea686e1fa1b782390e1d99239220778"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:6390-6398 | libs/cranelift-mlir/src/lower.rs:8352-8360 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:6390\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":6390}}}],"partialFingerprints":{"codehealthFindingId/v1":"6686acd8e757642ee6f9b04d6e785cf0656d15af9a7360af3cbc7f9725558317"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:6416-6423 | libs/cranelift-mlir/src/lower.rs:8384-8391 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:6416\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":6416}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38afb8be3007d15956572e9d87fea234d1155c695e6079f7e0578305d55c2f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:7644-7653 | libs/cranelift-mlir/src/lower.rs:7664-7673 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:7644\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":7644}}}],"partialFingerprints":{"codehealthFindingId/v1":"4507523bd586c2d9422e4b6407ce7c17ad1a5336b62235fdb19370170d87f5f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:7655-7662 | libs/cranelift-mlir/src/lower.rs:7675-7682 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:7655\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":7655}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbbd8324a3c2fce53982baad51ab7dff336acf58062f28a57c7c9efe9bf05990"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:9043-9050 | libs/cranelift-mlir/src/lower.rs:9196-9203 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":9043}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef578a68a3abb6316ca71eff6b530b387b078010a329f8e54e5df7432b6dbd31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:9310-9317 | libs/cranelift-mlir/src/lower.rs:9355-9362 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":9310}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ca4a4443f1c7962673146428191438a2465310a1ef857d7aaa6fbd34f9b40c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/cranelift-mlir/src/parser.rs:1702-1709 | libs/cranelift-mlir/src/parser.rs:1752-1759 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/parser.rs:1702\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"d52fa36ddd97c95a9cdb746328a1d9e68161d74742be8cbeac4f423a0c2f9bd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/cranelift-mlir/src/parser.rs:1760-1767 | libs/cranelift-mlir/src/parser.rs:2982-2989 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/parser.rs:1760\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1760}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3481251486c4db28746166895bb2a5cd68d1ab884ef3a3661447425b0e9241b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20138 lines \u00D7 8): libs/cranelift-mlir/src/tensor_rt.rs:1317-1324 | libs/cranelift-mlir/src/tensor_rt.rs:1365-1368 | libs/cranelift-mlir/src/tensor_rt.rs:1497-1500 | libs/cranelift-mlir/src/tensor_rt.rs:1541-1544 | libs/cranelift-mlir/src/tensor_rt.rs:1661-1664 | libs/cranelift-mlir/src/tensor_rt.rs:1838-1845 | libs/cranelift-mlir/src/tensor_rt.rs:1945-1948 | libs/cranelift-mlir/src/tensor_rt.rs:1949-1952 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/cranelift-mlir/src/tensor_rt.rs:1836\u0060 calls \u0060from_raw_parts_mut\u0060 and \u0060libs/cranelift-mlir/src/tensor_rt.rs:1315\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":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"502af739c25286bf02e44cfa63f2f84684c441fc7bd31a5abac05d8574dd889a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/cranelift-mlir/src/tensor_rt.rs:1784-1791 | libs/cranelift-mlir/src/tensor_rt.rs:1871-1878 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/tensor_rt.rs:1784\u0060 it does not close everything it opens, so those exact 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":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":1784}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f3bbd41a7931727a8e20912151e97458f6692073dfc0b35d2f930b0cf6e71a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/db/cli/src/lib.rs:456-463 | libs/db/cli/src/lib.rs:741-748 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/cli/src/lib.rs:456\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/cli/src/lib.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"c95fb7934cf755078b1bdad3f1c1dc1fd3575dfcf42185e6a4fbc2b7277c2e5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/db/eql/src/formulas/angular.rs:87-94 | libs/db/eql/src/formulas/linear.rs:87-94 \u2014 before extracting anything, compare \u0060libs/db/eql/src/formulas/angular.rs\u0060 and \u0060libs/db/eql/src/formulas/linear.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/eql/src/formulas/angular.rs:87\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/formulas/angular.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3512c7b4aa7dfebae57d4a68ba51993457ce5f2262ca142295e9bd64695c409"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/db/src/export_mcap.rs:379-386 | libs/db/src/export_mcap.rs:1894-1901 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/export_mcap.rs:379\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/export_mcap.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7906a09f1ff364393c090b3e838c0850c0da90844ae7e6c029c61b9c24937fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): libs/elodin-editor/src/object_3d.rs:700-705 | libs/elodin-editor/src/object_3d.rs:739-746 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/object_3d.rs:700\u0060 it does not close everything it opens, so those exact 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":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6c360b86d66d77f40e6793bd9683bf1e8e1c9764c5950e6fcb3ab63b8ed089"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/elodin-editor/src/plugins/cinematic_earth/effects.rs:188-195 | libs/elodin-editor/src/plugins/cinematic_earth/effects.rs:368-375 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/cinematic_earth/effects.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d5bba911559d0d100e902aa9ad5312302d5506aaba5a9268a8ea50c275eb21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/elodin-editor/src/plugins/frustum/mod.rs:579-587 | libs/elodin-editor/src/plugins/frustum_intersection/mod.rs:794-802 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060libs/elodin-editor/src/plugins/frustum/mod.rs:579\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/elodin-editor/src/plugins/frustum/mod.rs:575\u0060 calls \u0060Some\u0060, \u0060get\u0060 and \u0060libs/elodin-editor/src/plugins/frustum_intersection/mod.rs:793\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":"libs/elodin-editor/src/plugins/frustum/mod.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3d53be50e25f761a63acfe34da0f2f16836e918cdbbf07d1a6f90e9e0d2629"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/elodin-editor/src/plugins/view_cube/interactions.rs:136-143 | libs/elodin-editor/src/plugins/view_cube/interactions.rs:147-154 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/view_cube/interactions.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30b5d0538ac8f42488682bb24c80a085fdeb1b53f3b42db0d35487af9727de9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/elodin-editor/src/plugins/view_cube/interactions.rs:1568-1575 | libs/elodin-editor/src/plugins/view_cube/interactions.rs:1579-1586 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/view_cube/interactions.rs"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bf23b64c1ce2307e0c490c39debebfdca96f246b65a7b88a7c1f3623c62c38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/elodin-editor/src/plugins/view_cube/mod.rs:146-153 | libs/elodin-editor/src/plugins/view_cube/mod.rs:155-162 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/view_cube/mod.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"238c89cd3de39bfc61b18f586c7a881718b8987e4898964b97835e811b7ea575"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/elodin-editor/src/ui/gauges/horizon.rs:676-683 | libs/elodin-editor/src/ui/gauges/orientation.rs:115-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 \u0060libs/elodin-editor/src/ui/gauges/horizon.rs:676\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/gauges/horizon.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"138d6c7cb685aae36bf8abd36499e710c727bf3824291d589cc235ad520092d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/elodin-editor/src/ui/inspector/graph.rs:626-633 | libs/elodin-editor/src/ui/schematic/load.rs:1962-1969 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060libs/elodin-editor/src/ui/inspector/graph.rs:626\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/graph.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"de145a84c0ba1cf331c4ab467e6358be51c61a4bc9fcacad8cde1d3f47c62464"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/elodin-editor/src/ui/monitor.rs:107-115 | libs/elodin-editor/src/ui/monitor.rs:210-218 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/monitor.rs:107\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/monitor.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f2c30dc381ce3f5d2605ddda6a0abf34727b265dc1561810ffec29171d30652"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/elodin-editor/src/ui/plot/widget.rs:1951-1958 | libs/elodin-editor/src/ui/plot/widget.rs:2135-2142 \u2014 both copies are in the same file, so extract the block 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, \u0060libs/elodin-editor/src/ui/plot/widget.rs:2143\u0060 calls \u0060kernel_fetch_ctx\u0060 and \u0060libs/elodin-editor/src/ui/plot/widget.rs:1959\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":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":1951}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e22d288280611523fc89d12ea0a689f80a963bcf2f9b5491fc75bee74e979ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/elodin-editor/src/ui/plot_3d/point_trails.rs:343-350 | libs/elodin-editor/src/ui/plot_3d/point_trails.rs:374-381 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"libs/elodin-editor/src/ui/plot_3d/point_trails.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca54cc5377f79d7a469defe7f78a06376d4f98fade17a29a679b84af4506d297"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/elodin-macros/src/from_builder.rs:17-24 | libs/elodin-macros/src/into_op.rs:16-23 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-macros/src/from_builder.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3f61c755d091926218f0fb87f5c9ffd8bb3ceca3e19572ed27f401ec0aeb96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/impeller/bevy/src/channels.rs:468-475 | libs/impeller/bevy/src/channels.rs:489-496 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/impeller/bevy/src/channels.rs:468\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/bevy/src/channels.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"6109c895db970af2548113af505cf972f3b26bb0e161aa34d3f435788e9cb400"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/impeller/bevy/src/lib.rs:2252-2261 | libs/impeller/bevy/src/lib.rs:2301-2310 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/impeller/bevy/src/lib.rs:2252\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":2252}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc260994a11d1c5e63c6dc63ecbfef8a5c62560ae1d8afead35310aee40d219"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/impeller/bevy/src/ws.rs:472-479 | libs/impeller/bevy/src/ws.rs:483-490 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/bevy/src/ws.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f78268a1e7505a9b6a54895229a8e2ed1407f71594ca340a387fff60a9d5835"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/impeller/kdl/src/de.rs:836-843 | libs/nox-py/src/ui/builders.rs:497-504 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060libs/impeller/kdl/src/de.rs:836\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7eb9833402c9c8def5bdb0b570395ab82aa75333a669440d45038e26cb0fd0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/impeller/kdl/src/ser.rs:1249-1256 | libs/impeller/kdl/src/ser.rs:1566-1573 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/impeller/kdl/src/ser.rs:1249\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":"libs/impeller/kdl/src/ser.rs"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fb5c59f05ec3fe802fd403cce1792c5410aa4cbf5564b16f163a0cbbfb75cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/nox-py/src/ui/builders.rs:852-859 | libs/nox-py/src/ui/builders.rs:873-880 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox-py/src/ui/builders.rs:852\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":"libs/nox-py/src/ui/builders.rs"},"region":{"startLine":852}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5c31fa4393e547a12523c1fad0a3430bdf7e085e2662adf5e2a9e27fa973f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): libs/nox/src/array/mod.rs:482-489 | libs/nox/src/array/mod.rs:510-516 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox/src/array/mod.rs:482\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"libs/nox/src/array/mod.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2752b7d4a4615eba73e66a2e3d9a44e4b653eeb66083dddd9864fd4a414be9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/nox/src/noxpr/node.rs:827-835 | libs/nox/src/noxpr/node.rs:876-884 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox/src/noxpr/node.rs:827\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"963ba60a5fec118f75143969c87ad20d93019b4d9aaf7d76efb7f92a48ed411c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): libs/nox/src/noxpr/node.rs:1418-1424 | libs/nox/src/noxpr/node.rs:1702-1709 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox/src/noxpr/node.rs:1418\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f21bc8c4a73fc35a7f2a57cd82cc4dfdc631df84e264dfe4688b76b28877172"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/nox/src/noxpr/node.rs:2536-2543 | libs/nox/src/noxpr/node.rs:2556-2563 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox/src/noxpr/node.rs:2536\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":2536}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0003c013c6c35541a3200f6f7e77f8e4df6fe8ac4f6974904ba72ad65ec860"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): fsw/serial-bridge/src/main.rs:434-440 | fsw/serial-bridge/src/main.rs:453-459 | fsw/serial-bridge/src/main.rs:462-468 \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 \u0060fsw/serial-bridge/src/main.rs:434\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/serial-bridge/src/main.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"13adda8c57cd715c54f6bf863df1faa661b3a1572964a15d6f5fdcf0145a32f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): libs/cranelift-mlir/src/lower.rs:5017-5023 | libs/cranelift-mlir/src/lower.rs:5072-5078 | libs/cranelift-mlir/src/lower.rs:5821-5827 \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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":5017}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6d00173e2feb45ce60aeafbee163606e99d0aa20c617644fa3b590d7a9aedc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): libs/db/cli/src/lib.rs:481-487 | libs/db/cli/src/lib.rs:543-549 | libs/db/cli/src/lib.rs:557-563 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. 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":"libs/db/cli/src/lib.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"29d4721e81d24960bbd76bd3c6ea19543f86b93aba80950846d0add709c696f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): libs/elodin-editor/src/plugins/cinematic_earth/effects.rs:438-444 | libs/elodin-editor/src/plugins/cinematic_earth/effects.rs:455-461 | libs/elodin-editor/src/plugins/thruster_particles/mod.rs:424-430 \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 \u0060libs/elodin-editor/src/plugins/cinematic_earth/effects.rs:438\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/cinematic_earth/effects.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e71ff3befe074ea36ae9e88ace2926cd2dad8c423a848b99701b0948800c3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): libs/nox/src/noxpr/batch_dfs.rs:474-480 | libs/nox/src/noxpr/batch_dfs.rs:505-511 | libs/nox/src/noxpr/batch_dfs.rs:536-542 \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 \u0060libs/nox/src/noxpr/batch_dfs.rs:474\u0060 it begins part-way through the construct above it, so those exact 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, \u0060libs/nox/src/noxpr/batch_dfs.rs:504\u0060 calls \u0060clone\u0060 and \u0060libs/nox/src/noxpr/batch_dfs.rs:473\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":"libs/nox/src/noxpr/batch_dfs.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f4e086de1d58b367f1db21792647b029c25e306398b1adaa8dea519582295e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): fsw/sensor-fw/src/main.rs:519-527 | fsw/sensor-fw/src/main.rs:828-836 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/main.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dd2279bbcf44a5a687bcaea548a29930f2009461a471d0358643da4a8c3184c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/bevy_world_mesh/src/bin/fetch_global_spherical.rs:314-320 | libs/bevy_world_mesh/src/bin/fetch_global_spherical.rs:339-345 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/bevy_world_mesh/src/bin/fetch_global_spherical.rs:314\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/bin/fetch_global_spherical.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"8982ff86a25503b24161cd85b40b33a5b3e6c9409a44b2e2dbca28a0f21c9a3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/bevy_world_mesh/src/bin/fetch_real_terrain.rs:234-240 | libs/bevy_world_mesh/src/bin/fetch_real_terrain.rs:301-307 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/bevy_world_mesh/src/bin/fetch_real_terrain.rs:234\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/bin/fetch_real_terrain.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c469d5dc760b330446c24431f26620db9b94166a730de4bbed832fdfeee2a91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): libs/bevy_world_mesh/src/terrain/terrain_data/tile_tree.rs:412-418 | libs/elodin-editor/src/plugins/world_mesh/mod.rs:533-538 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060libs/bevy_world_mesh/src/terrain/terrain_data/tile_tree.rs:412\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/terrain/terrain_data/tile_tree.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"8064b27ac9505a12c11538784af4b959a4ed35b35e87badb1dd886d7963c2970"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/cranelift-mlir/src/const_fold.rs:1519-1525 | libs/cranelift-mlir/src/const_fold.rs:1531-1537 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/const_fold.rs:1519\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/const_fold.rs"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"79820ef484936e180d7827a748a7c675addb173a1f8a043ff9c404c4bdc86638"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:2232-2239 | libs/cranelift-mlir/src/lower.rs:5955-5962 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:2232\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":2232}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d907bc1d7b704eb695fe794f136ebe42f48ab6b2f91847393ade8f56847ef5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20137 lines \u00D7 3): libs/cranelift-mlir/src/lower.rs:4863-4869 | libs/cranelift-mlir/src/lower.rs:5002-5008 | libs/cranelift-mlir/src/lower.rs:5062-5064 \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 \u0060libs/cranelift-mlir/src/lower.rs:4863\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/cranelift-mlir/src/lower.rs:4869\u0060 calls \u0060alloc_slot_for_vid\u0060 and \u0060libs/cranelift-mlir/src/lower.rs:5064\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":4863}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6880c7590252cc77f67c03124ee4fddc5a86ec05d13cdf4ea8336c7fd4cfe12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:5366-5372 | libs/cranelift-mlir/src/lower.rs:6447-6453 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:5366\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":5366}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df20925abcd6a4e9bd2fd81e9878ba969f37a0105a6927da05612e76f8caff7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:6263-6269 | libs/cranelift-mlir/src/lower.rs:6311-6317 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:6263\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/cranelift-mlir/src/lower.rs:6271\u0060 calls \u0060ins\u0060, \u0060f64const\u0060, \u0060iconst\u0060 and \u0060libs/cranelift-mlir/src/lower.rs:6319\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":6263}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4c18d04f1f689c5da436da2de6916774da2cdd7e780655ad6e7e1064f0bb313"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:6710-6716 | libs/cranelift-mlir/src/lower.rs:6718-6724 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:6710\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":6710}}}],"partialFingerprints":{"codehealthFindingId/v1":"56bdfe20845be33f4fe38b7c489d90a5dcb42661dfa9329cdaada950ec28892a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:7481-7487 | libs/cranelift-mlir/src/lower.rs:8046-8052 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:7481\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":7481}}}],"partialFingerprints":{"codehealthFindingId/v1":"21370366154b7812964355e160c085e8835f26b3f8c5d832ed16c2ad8925a490"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:7826-7832 | libs/cranelift-mlir/src/lower.rs:7864-7870 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:7826\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":7826}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9f89d3330e74467ba8e72edb86ae4420cb341addf2efe44e03ece92a9b2cd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:8095-8101 | libs/cranelift-mlir/src/lower.rs:10175-10181 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":8095}}}],"partialFingerprints":{"codehealthFindingId/v1":"69bf5174bef490ef79668174bbc539d82ec62814e9abd0c294bf44a32343ebae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20137 lines \u00D7 6): libs/cranelift-mlir/src/lower.rs:10822-10823 | libs/cranelift-mlir/src/lower.rs:10867-10873 | libs/cranelift-mlir/src/lower.rs:11134-11140 | libs/cranelift-mlir/src/lower.rs:11447-11448 | libs/cranelift-mlir/src/lower.rs:11558-11559 | libs/cranelift-mlir/src/lower.rs:11657-11658 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/cranelift-mlir/src/lower.rs:11451\u0060 calls \u0060ins\u0060, \u0060iadd_imm\u0060 and \u0060libs/cranelift-mlir/src/lower.rs:10877\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":10822}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00a2e3a4f8197dc696bc92d3a79877c40264ace20cbcf91f4985b86db6d6cb8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:11374-11381 | libs/cranelift-mlir/src/lower.rs:11606-11611 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":11374}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f1069b69fc90fa26c0e851fc245e1b6eee405d20b3ba29ab5defad718d06dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/cranelift-mlir/src/parser.rs:982-990 | libs/cranelift-mlir/src/parser.rs:992-1000 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/parser.rs:982\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d5893b6adcd4654dd93cb9c09effcfb01e515a71007008c4114f9b04e2d53a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/cranelift-mlir/src/parser.rs:1966-1976 | libs/cranelift-mlir/src/parser.rs:1986-1996 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/parser.rs:1966\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1966}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6f8efb3d6fe87963af7d1d74679318993399c99f61c42ef41a6171e8bf9d4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/cranelift-mlir/src/parser.rs:2550-2556 | libs/cranelift-mlir/src/parser.rs:2639-2645 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/parser.rs:2550\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":2550}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ac727bba4983821e30b12fbae1c99638cc74a0c74b24816da83c5826c9d1c59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/cranelift-mlir/src/tensor_rt.rs:972-979 | libs/cranelift-mlir/src/tensor_rt.rs:1040-1047 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/tensor_rt.rs:972\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":972}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab3305a5efea7c1751c5711d104c723ec84ff49574c48944264720e9eb58747e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/cranelift-mlir/src/tensor_rt.rs:1769-1775 | libs/cranelift-mlir/src/tensor_rt.rs:2004-2010 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/tensor_rt.rs:1769\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":1769}}}],"partialFingerprints":{"codehealthFindingId/v1":"65458a380de1af9d23c2731589f0f609469e81e162e37c308d26368fa6c4e69f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/db/src/append_log.rs:64-70 | libs/db/src/append_log.rs:85-91 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/append_log.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"c582a654446d25e665398877bd8e4fbb63f089a85824a5272f380173d690954c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/db/src/bin/bench.rs:479-485 | libs/db/src/bin/bench.rs:498-504 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/bin/bench.rs:479\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/bin/bench.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8075cc377deade697e19165be22235a9c60bddb74eaebdcac30d23bff17da0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/db/src/merge.rs:530-536 | libs/db/src/merge.rs:595-602 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/merge.rs:530\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/merge.rs"},"region":{"startLine":530}}}],"partialFingerprints":{"codehealthFindingId/v1":"666d5418d0d206b54bfe02f333964765cba756b96066d3ac4a875af9874560bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/db/src/query.rs:572-578 | libs/db/src/query.rs:712-718 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/query.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7937c6a7371c9a91d694516c538c33da063e5f900d72d438329d551f559b3a7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/elodin-editor/src/object_3d.rs:703-709 | libs/elodin-editor/src/object_3d.rs:798-804 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/object_3d.rs:703\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"99347ed7fda0dbbe5a547cad2e8a5b01156b34a5def2b4368811392fb320876e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/elodin-editor/src/object_3d.rs:781-787 | libs/elodin-editor/src/object_3d.rs:832-838 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/object_3d.rs:781\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48740bdbb9c5438e3d9150a3804fedc23f7afa862544f8917f90a005bbb963b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/elodin-editor/src/ui/mod.rs:783-789 | libs/elodin-editor/src/ui/mod.rs:856-862 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/mod.rs:783\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/mod.rs"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b60643bd81c4c47d2219110d922a2fca2e6d7b6cab9d92968f0d8853071c608"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/elodin-editor/src/ui/plot/widget.rs:2438-2444 | libs/elodin-editor/src/ui/plot/widget.rs:2560-2568 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":2438}}}],"partialFingerprints":{"codehealthFindingId/v1":"418b10864fc639199f632b06b0c0adf8f638baed72325929fffef141596c230a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/elodin-editor/src/ui/query_plot.rs:483-489 | libs/elodin-editor/src/ui/query_plot.rs:493-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 \u0060libs/elodin-editor/src/ui/query_plot.rs:483\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/query_plot.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"760be3a0822adb4c8a3e7c5b7f4fb0636cc295ed3560d9c0cf230ce980273cb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/elodin-editor/src/ui/schematic/load.rs:531-537 | libs/elodin-editor/src/ui/schematic/load.rs:904-910 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0b81675bd8c085f57a0c6f3b872cf0fc3101ce0f0395c4343c3b436b9acbdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/elodin-editor/src/ui/timeline/timeline_slider.rs:357-363 | libs/elodin-editor/src/ui/timeline/timeline_slider.rs:373-379 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/timeline/timeline_slider.rs:357\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/timeline/timeline_slider.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"971f6dc40b4d9b8224b9020bfa356c0df58eb23524f5a2c0167d3c900035bd5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/elodin-editor/src/ui/window/spawn.rs:130-137 | libs/elodin-editor/src/ui/window/spawn.rs:254-261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/window/spawn.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"af64fb29ded7d9e6f03497b4a978b371bc26a0602c96c16646b0e7c9de7f3713"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/impeller/kdl/src/ser.rs:1424-1431 | libs/impeller/kdl/src/ser.rs:1466-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/ser.rs"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1360ad4f0949bed98607e0a3ae41195bdc961b44a3d02294d0c85ae14c285e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/nox-py/src/db/stream.rs:278-285 | libs/nox-py/src/db/stream.rs:437-444 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"libs/nox-py/src/db/stream.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc17697fd9fd8383c3dd75e58fa2506c2d0866c3603d0a95d1bd694acc157f06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/nox/src/array/mod.rs:935-941 | libs/nox/src/array/mod.rs:960-966 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox/src/array/mod.rs:935\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/array/mod.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8907e7cf69dc66253ff91c28aa54ca93375816f43d469fa4eea2627041abe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/nox/src/jax.rs:223-231 | libs/nox/src/jax.rs:241-247 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox/src/jax.rs:223\u0060 it does not close everything it opens, so those exact 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":"libs/nox/src/jax.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"78fa0a204396ab4b828a9ad82c12f30974679c58ecacdfec9b320de5f1f9fbe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/nox/src/noxpr/node.rs:332-338 | libs/nox/src/noxpr/node.rs:524-530 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox/src/noxpr/node.rs:332\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a8ff962c3840ec917d3c943dc8336b4e26094e4dec3c5ffd7af34051b602558"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/nox/src/noxpr/node.rs:371-377 | libs/nox/src/noxpr/node.rs:561-567 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox/src/noxpr/node.rs:371\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/nox/src/noxpr/node.rs:367\u0060 calls \u0060is_equal\u0060 and \u0060libs/nox/src/noxpr/node.rs:557\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":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79e545281152c810da6fbdfc2fff180da0d130f41e2db3689ae150f878defc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/nox/src/noxpr/node.rs:818-824 | libs/nox/src/noxpr/node.rs:866-872 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox/src/noxpr/node.rs:818\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"829fcb0116ad3707ec65d8955b21a3f920961946b9f493d9f67beae1cfa60a3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/nox/src/noxpr/node.rs:838-845 | libs/nox/src/noxpr/node.rs:888-895 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox/src/noxpr/node.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":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b231aecaaadb3e53a0cf97f74d96a2ff37352774eeaeb2666a2e1f968bf0140"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 13): libs/cranelift-mlir/src/parser.rs:798-804 | libs/cranelift-mlir/src/parser.rs:823-829 | libs/cranelift-mlir/src/parser.rs:1297-1302 | libs/cranelift-mlir/src/parser.rs:1334-1340 | libs/cranelift-mlir/src/parser.rs:1397-1402 | libs/cranelift-mlir/src/parser.rs:1431-1436 | libs/cranelift-mlir/src/parser.rs:1453-1458 | libs/cranelift-mlir/src/parser.rs:1483-1488 | libs/cranelift-mlir/src/parser.rs:1527-1533 | libs/cranelift-mlir/src/parser.rs:2115-2120 | libs/cranelift-mlir/src/parser.rs:2263-2268 | libs/cranelift-mlir/src/parser.rs:2338-2343 | libs/cranelift-mlir/src/parser.rs:2601-2607 \u2014 all 13 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/cranelift-mlir/src/parser.rs:1405\u0060 calls \u0060extract_bracket_ints\u0060 and \u0060libs/cranelift-mlir/src/parser.rs:1305\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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ec34de5404ebaae60ffc7225b46363e54590025addf2861bad3e8af9d07568"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8): libs/impeller/wkt/src/value.rs:115-120 | libs/impeller/wkt/src/value.rs:122-127 | libs/impeller/wkt/src/value.rs:129-134 | libs/impeller/wkt/src/value.rs:136-141 | libs/impeller/wkt/src/value.rs:143-148 | libs/impeller/wkt/src/value.rs:150-155 | libs/impeller/wkt/src/value.rs:157-162 | libs/impeller/wkt/src/value.rs:164-169 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. 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":"libs/impeller/wkt/src/value.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"e616377c1ceb701099e38203940dc3dddd391cbafeebbacb36d3189c616d4bcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): libs/cranelift-mlir/src/parser.rs:1114-1120 | libs/cranelift-mlir/src/parser.rs:2465-2471 | libs/cranelift-mlir/src/parser.rs:2555-2561 | libs/cranelift-mlir/src/parser.rs:2644-2650 | libs/cranelift-mlir/src/parser.rs:2726-2732 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b5c55303d9c1da892d77d4ae3bc49de3ac223ba648b24423a69858c5a4c0fcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): libs/cranelift-mlir/src/lower.rs:10877-10882 | libs/cranelift-mlir/src/lower.rs:11062-11067 | libs/cranelift-mlir/src/lower.rs:11107-11112 | libs/cranelift-mlir/src/lower.rs:11661-11666 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:10877\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":10877}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceccd971688693a5c9f3195f52a25a01e67914bf007897a062efd4615e936aed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): libs/cranelift-mlir/src/parser.rs:1807-1812 | libs/cranelift-mlir/src/parser.rs:1863-1869 | libs/cranelift-mlir/src/parser.rs:2441-2447 | libs/cranelift-mlir/src/parser.rs:2932-2937 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/cranelift-mlir/src/parser.rs:2930\u0060 calls \u0060parse_next\u0060, \u0060ws\u0060 and \u0060libs/cranelift-mlir/src/parser.rs:1862\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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e11645d4bb78c6c8383e4841b6bd90c9b96e356bbcb3b7ff3ee38d560f8fcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): libs/cranelift-mlir/src/lower.rs:7827-7832 | libs/cranelift-mlir/src/lower.rs:7865-7870 | libs/cranelift-mlir/src/lower.rs:7972-7977 \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 \u0060libs/cranelift-mlir/src/lower.rs:7827\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":7827}}}],"partialFingerprints":{"codehealthFindingId/v1":"54929643574d164bfc85e4036794cfec568dfc35b2b09e1c3e534739d59c9ffb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): libs/cranelift-mlir/src/lower.rs:10816-10821 | libs/cranelift-mlir/src/lower.rs:11551-11556 | libs/cranelift-mlir/src/lower.rs:11650-11655 \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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":10816}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0fd5307e941198265ff06cad6d1a460d8a5967fc9a23fd0a7781f8950c3dee8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20136 lines \u00D7 7): libs/cranelift-mlir/src/lower.rs:10825-10831 | libs/cranelift-mlir/src/lower.rs:10874-10875 | libs/cranelift-mlir/src/lower.rs:11142-11148 | libs/cranelift-mlir/src/lower.rs:11325-11326 | libs/cranelift-mlir/src/lower.rs:11450-11451 | libs/cranelift-mlir/src/lower.rs:11561-11566 | libs/cranelift-mlir/src/lower.rs:11659-11660 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:10825\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/cranelift-mlir/src/lower.rs:10822\u0060 calls \u0060ins\u0060, \u0060iadd_imm\u0060 and \u0060libs/cranelift-mlir/src/lower.rs:11655\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":10825}}}],"partialFingerprints":{"codehealthFindingId/v1":"24bd2ddc6da82dda6cdf2de94f27d4bd169699c3706d5373f1d11e7b1133becd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): libs/cranelift-mlir/src/parser.rs:1329-1334 | libs/cranelift-mlir/src/parser.rs:1518-1523 | libs/cranelift-mlir/src/parser.rs:2903-2908 \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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"b48607ed4b58fdbedff5851e015126f2d09855d623ae6564371dc1db3c98dd50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): libs/db/cli/src/lib.rs:267-272 | libs/db/cli/src/lib.rs:303-308 | libs/db/cli/src/lib.rs:341-346 \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":"libs/db/cli/src/lib.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4a169d0798042610114d96fedab80388dbbcb5d62b9e133e63de2136c33aea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): libs/db/src/trim.rs:499-504 | libs/db/src/trim.rs:510-515 | libs/db/src/trim.rs:521-526 \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 \u0060libs/db/src/trim.rs:499\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/trim.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdeea669abb9db3bfed447072ec202e43003657a3185875e257241a14c3d19b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): libs/elodin-editor/src/skybox_db_assets.rs:595-600 | libs/elodin-editor/src/skybox_db_assets.rs:638-643 | libs/elodin-editor/src/skybox_db_assets.rs:672-678 \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":"libs/elodin-editor/src/skybox_db_assets.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"014bd5ab91279081176fff02f3c3c9575ef41c74bac27b25db533dcecc30e61d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/cranelift-mlir/src/interp.rs:1728-1733 | libs/cranelift-mlir/src/interp.rs:1756-1761 \u2014 both copies are in the same file, so extract the block 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, \u0060libs/cranelift-mlir/src/interp.rs:1755\u0060 calls \u0060lookup_ref\u0060 and \u0060libs/cranelift-mlir/src/interp.rs:1727\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":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":1728}}}],"partialFingerprints":{"codehealthFindingId/v1":"815452a893228f54f111692f94b32c1c6a4a7139ba02b06d92e4776be00cafa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20136 lines \u00D7 3): libs/cranelift-mlir/src/lower.rs:3717-3722 | libs/cranelift-mlir/src/lower.rs:9656-9658 | libs/cranelift-mlir/src/lower.rs:9865-9870 \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 \u0060libs/cranelift-mlir/src/lower.rs:9656\u0060 it does not close everything it opens, so those exact 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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":3717}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff4be5a64221e619e807a92bbed303cb7992a8dded1ff4ea9e99e7c45f97e98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:5177-5182 | libs/cranelift-mlir/src/lower.rs:8055-8060 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":5177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2988cd646b41bd65b12fb92d83e23b3402d964c2890a949794600a084414c68"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:8582-8587 | libs/cranelift-mlir/src/lower.rs:8753-8758 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":8582}}}],"partialFingerprints":{"codehealthFindingId/v1":"fec23640201b7dd189d61eed0ac5d2af207533d1d43afe17b51b6c4332272749"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:10914-10923 | libs/cranelift-mlir/src/lower.rs:11096-11105 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":10914}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ee3761e7ed13788b3d8e887b7af73eea49f6219169cd00b8b9ca7975bd28a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/cranelift-mlir/src/parser.rs:1533-1538 | libs/cranelift-mlir/src/parser.rs:2521-2526 \u2014 both copies are in the same file, so extract the block 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, \u0060libs/cranelift-mlir/src/parser.rs:2518\u0060 calls \u0060to_vec\u0060 and \u0060libs/cranelift-mlir/src/parser.rs:1531\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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1533}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8cd4cafb2321c3f3156e20d09209e8247df7f24698e91d14b1b22f43afdab7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/cranelift-mlir/src/parser.rs:1889-1894 | libs/cranelift-mlir/src/parser.rs:1898-1903 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13430bb8279c1d63d1b34c283d95526e1808376501280e618de7b6f879b82b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/cranelift-mlir/src/parser.rs:1959-1964 | libs/cranelift-mlir/src/parser.rs:1979-1984 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/parser.rs:1959\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1959}}}],"partialFingerprints":{"codehealthFindingId/v1":"266656bc3b034f4e7532eba0520dbdf630a23f55ecc515e2a0d9d308961dd5d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/cranelift-mlir/src/tensor_rt.rs:1263-1268 | libs/cranelift-mlir/src/tensor_rt.rs:1285-1290 \u2014 both copies are in the same file, so extract the block 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, \u0060libs/cranelift-mlir/src/tensor_rt.rs:1283\u0060 calls \u0060clone\u0060 and \u0060libs/cranelift-mlir/src/tensor_rt.rs:1262\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":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":1263}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8bdf4a7d703a232a7534265d5fc0fbb4ac6de973b1eb232ea0b90ff53d006c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/cranelift-mlir/src/tensor_rt.rs:1982-1987 | libs/cranelift-mlir/src/tensor_rt.rs:1999-2004 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/tensor_rt.rs:1982\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":1982}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c028b77a4bd88e929d233bb2bbc3151314237f7def823a0d59cbb401756dcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/db/eql/src/formulas/direction.rs:15-23 | libs/db/eql/src/formulas/translate.rs:159-167 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/eql/src/formulas/direction.rs:15\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/formulas/direction.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bd6862d0ad4f77d4c5635e81fae2bbaeb12d42f3be97cf338d9f0a150fd4096"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/db/src/axum.rs:36-41 | libs/db/src/axum.rs:110-115 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/axum.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7266096a356135e89a6a09f3e9e840577982c65b8fba929582bca74e64cdef78"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/db/src/axum.rs:65-70 | libs/db/src/axum.rs:152-157 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/axum.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2591436b0b2472259a912f1bbd90c97cbebac46cab641616739a115f41675c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/db/src/export_mcap.rs:983-988 | libs/db/src/export_mcap.rs:1431-1436 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/export_mcap.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e23ef9d1b1c5daba2c08da3c85d1541b3497be640604efefa15c7798a588700"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/db/src/trim.rs:602-610 | libs/db/src/trim.rs:613-621 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"libs/db/src/trim.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a9f623f56584ad2ab012fa19dc8c4a02b89fe305ff53445e88d7c2be30a022"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/elodin-editor/src/object_3d.rs:528-533 | libs/elodin-editor/src/plugins/display_kernel.rs:461-466 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51c988fe3eed2b7b3000883d8c4ad2cd5fb4328ab8eb2d9425dd81aa8c7d6c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/elodin-editor/src/ui/button.rs:178-184 | libs/elodin-editor/src/ui/command_palette/mod.rs:654-659 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060libs/elodin-editor/src/ui/button.rs:178\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/button.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"b986d31f92601e8e524eaba44190bdf21a6d13b9f3d6ffa67dde152c91596c5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/elodin-editor/src/ui/gauges/orientation.rs:557-564 | libs/elodin-editor/src/ui/gauges/orientation.rs:575-582 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/gauges/orientation.rs:575\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/gauges/orientation.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"22564fe9ec56ff0da5f0e6cbbe695c9dd2170c2540d1ffd7ccc0d26a742e41f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/elodin-editor/src/ui/plot/data.rs:498-503 | libs/elodin-editor/src/ui/plot/data.rs:504-509 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/plot/data.rs:498\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/data.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6c84440c834517d657c55750eb44a1120c81f166a15bae5867353f001a469a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/elodin-editor/src/ui/query_plot.rs:456-466 | libs/elodin-editor/src/ui/query_plot.rs:469-479 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/query_plot.rs:456\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/query_plot.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d891d84d88143c0dd0f5e0726edcaa14de4632e11c4ad3dff856b1d80c960c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/elodin-editor/src/ui/schematic/load.rs:1107-1113 | libs/elodin-editor/src/ui/schematic/load.rs:1123-1129 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/schematic/load.rs:1107\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/elodin-editor/src/ui/schematic/load.rs:1120\u0060 calls \u0060default\u0060 and \u0060libs/elodin-editor/src/ui/schematic/load.rs:1101\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":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":1107}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e6d1f7c402e57c8c16488964c1abc134abed3e4c17cf42c7e6d1bc1b1b848e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/impeller/wkt/src/value.rs:178-183 | libs/impeller/wkt/src/value.rs:185-190 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"libs/impeller/wkt/src/value.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dcbff8a074c2470e1dcffe73fef081fba03912054b305ce4aaa13810e45c980"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/nox-py/src/impeller_server.rs:376-381 | libs/nox-py/src/impeller_server.rs:463-468 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox-py/src/impeller_server.rs:376\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"libs/nox-py/src/impeller_server.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"223ef3259104708ede29bfa5de3bc706a3f1543b0cd867df15eb063812704ff8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/nox-py/src/step_context.rs:263-268 | libs/nox-py/src/step_context.rs:636-641 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox-py/src/step_context.rs:263\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/step_context.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0cd4b991692da0b7243d822c19655420beb33a4c55b9a16e983505852cd2d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/nox/src/noxpr/node.rs:383-388 | libs/nox/src/noxpr/node.rs:573-578 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox/src/noxpr/node.rs:383\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45965eb5eb42cee6d63a93e0ff57aedebbfe200a9283c56b657661d6184b9a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/nox/src/noxpr/node.rs:395-400 | libs/nox/src/noxpr/node.rs:585-590 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox/src/noxpr/node.rs:395\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e2731e83e252225ab052f2bec200987359bfc02c93f08a567514f8b5b5c4d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/nox/src/noxpr/node.rs:406-411 | libs/nox/src/noxpr/node.rs:596-601 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox/src/noxpr/node.rs:406\u0060 it does not close everything it opens, so those exact 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, \u0060libs/nox/src/noxpr/node.rs:401\u0060 calls \u0060is_equal\u0060 and \u0060libs/nox/src/noxpr/node.rs:592\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":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33204826fc7cb6a6d19204f5783908e9d7535c7526de1bbca98cd7f3fb1359b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/s10/src/recipe.rs:311-316 | libs/s10/src/recipe.rs:361-366 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/s10/src/recipe.rs:311\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/src/recipe.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1cb574a9c3894b9b8f594c27fa7504c107570131de09e05c7fd553e1356b05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 12): libs/cranelift-mlir/src/parser.rs:800-805 | libs/cranelift-mlir/src/parser.rs:825-830 | libs/cranelift-mlir/src/parser.rs:858-862 | libs/cranelift-mlir/src/parser.rs:932-936 | libs/cranelift-mlir/src/parser.rs:1299-1303 | libs/cranelift-mlir/src/parser.rs:1336-1341 | libs/cranelift-mlir/src/parser.rs:1399-1403 | libs/cranelift-mlir/src/parser.rs:1433-1437 | libs/cranelift-mlir/src/parser.rs:1455-1459 | libs/cranelift-mlir/src/parser.rs:1485-1489 | libs/cranelift-mlir/src/parser.rs:2117-2121 | libs/cranelift-mlir/src/parser.rs:2340-2344 \u2014 all 12 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/cranelift-mlir/src/parser.rs:1405\u0060 calls \u0060extract_bracket_ints\u0060 and \u0060libs/cranelift-mlir/src/parser.rs:938\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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"5743ce8ab1be90288d3c7140de8341030ed999bb7679fd234e5e258b97f51787"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 12): libs/cranelift-mlir/src/parser.rs:800-805 | libs/cranelift-mlir/src/parser.rs:825-830 | libs/cranelift-mlir/src/parser.rs:1299-1303 | libs/cranelift-mlir/src/parser.rs:1336-1341 | libs/cranelift-mlir/src/parser.rs:1399-1403 | libs/cranelift-mlir/src/parser.rs:1433-1437 | libs/cranelift-mlir/src/parser.rs:1455-1459 | libs/cranelift-mlir/src/parser.rs:1485-1489 | libs/cranelift-mlir/src/parser.rs:2117-2121 | libs/cranelift-mlir/src/parser.rs:2265-2269 | libs/cranelift-mlir/src/parser.rs:2340-2344 | libs/cranelift-mlir/src/parser.rs:2440-2445 \u2014 all 12 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/cranelift-mlir/src/parser.rs:1405\u0060 calls \u0060extract_bracket_ints\u0060 and \u0060libs/cranelift-mlir/src/parser.rs:1305\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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":800}}}],"partialFingerprints":{"codehealthFindingId/v1":"50d38a46a8b7bab8668a643b6911b50ecba77b237cb21001c9c1a9d0a99eccd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20135 lines \u00D7 17): libs/cranelift-mlir/src/tensor_rt.rs:590-595 | libs/cranelift-mlir/src/tensor_rt.rs:1240-1243 | libs/cranelift-mlir/src/tensor_rt.rs:1325-1330 | libs/cranelift-mlir/src/tensor_rt.rs:1363-1366 | libs/cranelift-mlir/src/tensor_rt.rs:1369-1373 | libs/cranelift-mlir/src/tensor_rt.rs:1406-1409 | libs/cranelift-mlir/src/tensor_rt.rs:1444-1447 | libs/cranelift-mlir/src/tensor_rt.rs:1451-1455 | libs/cranelift-mlir/src/tensor_rt.rs:1495-1498 | libs/cranelift-mlir/src/tensor_rt.rs:1501-1505 | libs/cranelift-mlir/src/tensor_rt.rs:1545-1549 | libs/cranelift-mlir/src/tensor_rt.rs:1582-1587 | libs/cranelift-mlir/src/tensor_rt.rs:1625-1630 | libs/cranelift-mlir/src/tensor_rt.rs:1662-1665 | libs/cranelift-mlir/src/tensor_rt.rs:1764-1769 | libs/cranelift-mlir/src/tensor_rt.rs:1779-1784 | libs/cranelift-mlir/src/tensor_rt.rs:1946-1949 \u2014 all 17 copies are in the same file, so extract the block into one function there and call it 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 \u0060libs/cranelift-mlir/src/tensor_rt.rs:590\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/cranelift-mlir/src/tensor_rt.rs:1450\u0060 calls \u0060collect\u0060 and \u0060libs/cranelift-mlir/src/tensor_rt.rs:1324\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":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"d31a6a8293e9866a94884c6985b1aa0b709ed9264bbb530e8e79560b215310c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): libs/cranelift-mlir/src/parser.rs:936-941 | libs/cranelift-mlir/src/parser.rs:1267-1272 | libs/cranelift-mlir/src/parser.rs:1303-1308 | libs/cranelift-mlir/src/parser.rs:1437-1442 | libs/cranelift-mlir/src/parser.rs:1773-1778 | libs/cranelift-mlir/src/parser.rs:2344-2348 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/parser.rs:936\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"a931b8c924c0dcd591f596471bb929c32ecb21471f95b4e79646ecf394fd365d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): libs/cranelift-mlir/src/parser.rs:858-862 | libs/cranelift-mlir/src/parser.rs:892-896 | libs/cranelift-mlir/src/parser.rs:932-936 | libs/cranelift-mlir/src/parser.rs:1806-1810 | libs/cranelift-mlir/src/parser.rs:2931-2935 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/cranelift-mlir/src/parser.rs:931\u0060 calls \u0060integer\u0060 and \u0060libs/cranelift-mlir/src/parser.rs:1805\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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"889df4f711c4732f387da5c558e3a9616aa6b393bd70c5c36884962d3753452b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): libs/cranelift-mlir/src/parser.rs:892-896 | libs/cranelift-mlir/src/parser.rs:1806-1810 | libs/cranelift-mlir/src/parser.rs:2265-2269 | libs/cranelift-mlir/src/parser.rs:2440-2445 | libs/cranelift-mlir/src/parser.rs:2931-2935 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/cranelift-mlir/src/parser.rs:2263\u0060 calls \u0060ws\u0060, \u0060parse_value_ref\u0060 and \u0060libs/cranelift-mlir/src/parser.rs:1805\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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bde5feae515e9809b903e1518922f3977617b7c1f70701fdc0e31e04c423cfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): libs/db/eql/src/formulas/direction.rs:41-45 | libs/db/eql/src/formulas/translate.rs:45-49 | libs/db/eql/src/formulas/translate.rs:87-91 | libs/db/eql/src/formulas/translate.rs:128-132 | libs/db/eql/src/formulas/translate.rs:186-190 \u2014 there are 5 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/eql/src/formulas/direction.rs:41\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/formulas/direction.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d573649266f72dfed4256ca005350cbb69b89782cc269cc62ad5e5a6584f4418"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): libs/db/src/drop.rs:338-342 | libs/db/src/prune.rs:134-138 | libs/db/src/time_align.rs:266-270 | libs/db/src/time_align.rs:299-303 \u2014 before extracting anything, compare \u0060libs/db/src/drop.rs\u0060 and \u0060libs/db/src/prune.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 56 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/drop.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ae2a4b301acd324d41f6fb39e51e93a7f1833161a16b540742bc98262a79f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): libs/elodin-editor/src/ui/sql_eql.rs:59-63 | libs/elodin-editor/src/ui/sql_eql.rs:71-75 | libs/elodin-editor/src/ui/sql_eql.rs:83-87 | libs/elodin-editor/src/ui/sql_eql.rs:95-99 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/sql_eql.rs:59\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/sql_eql.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"701ef73c8f731544b962954496ed6b6fc86993518fe4b4e90077f0c7bc470d31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): fsw/msp-osd/src/db_client.rs:286-290 | fsw/msp-osd/src/db_client.rs:323-327 | fsw/msp-osd/src/db_client.rs:339-343 \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 \u0060fsw/msp-osd/src/db_client.rs:286\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/db_client.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"75043da206dcd0ab488ebd7e62c9ace554666bcbdf2ca0ec1182f21fa272c61b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): libs/cranelift-mlir/src/lower.rs:5748-5753 | libs/cranelift-mlir/src/lower.rs:6265-6270 | libs/cranelift-mlir/src/lower.rs:6313-6318 \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 \u0060libs/cranelift-mlir/src/lower.rs:5748\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/cranelift-mlir/src/lower.rs:6271\u0060 calls \u0060ins\u0060, \u0060f64const\u0060, \u0060iconst\u0060 and \u0060libs/cranelift-mlir/src/lower.rs:5754\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":5748}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebb80893740a1929f4dad0c57cb9327f3a954697a92a6131bcc9890781f83d77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): libs/cranelift-mlir/src/parser.rs:1210-1215 | libs/cranelift-mlir/src/parser.rs:2083-2087 | libs/cranelift-mlir/src/parser.rs:2147-2151 \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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"57635c5f0d59e0b7f725d4e72eb6cfa6a2bac8c27fd3808ba21ba79a08e2db66"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): libs/elodin-editor/src/ui/data_overview/mod.rs:369-375 | libs/elodin-editor/src/ui/data_overview/mod.rs:1225-1229 | libs/elodin-editor/src/ui/query_plot.rs:256-261 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/data_overview/mod.rs:369\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"libs/elodin-editor/src/ui/data_overview/mod.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6fed6e8220f8453420f195124548be6c9c5ae0bf357cb7dae8f999250fd5f80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): libs/elodin-editor/src/ui/plot/data.rs:497-502 | libs/elodin-editor/src/ui/plot/data.rs:503-508 | libs/elodin-editor/src/ui/plot/data.rs:509-514 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/data.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f9d5b1ea5eda2b1248ca0321dc54b18ecfd724dc5b5f53de490f0505d50ede"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): libs/impeller/kdl/src/ser.rs:917-922 | libs/impeller/kdl/src/ser.rs:930-935 | libs/impeller/kdl/src/ser.rs:946-951 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060gauge\u0060 to \u0060\u0026GeoPositionGauge\u0060 in one and \u0060\u0026OrientationGauge\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":"libs/impeller/kdl/src/ser.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f23cd34fb4f9e139e6f8984335bdb436446045cc61b3dacc462cf1c99663044"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): fsw/lqr/src/main.rs:48-52 | fsw/mekf/src/main.rs:123-127 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fsw/lqr/src/main.rs:48\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/lqr/src/main.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de17a228e6d76ab623db116533de05936e190a216e063a97c63b9990d29abd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): fsw/rtsp-streamer/src/main.rs:340-346 | fsw/rtsp-streamer/src/main.rs:349-355 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/rtsp-streamer/src/main.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"9254fc40c1895256ec69cb2eda11da3bd8f982e305c66d05ebe4ab74c7584697"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): fsw/sensor-fw/src/command.rs:86-91 | fsw/sensor-fw/src/command.rs:103-108 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fsw/sensor-fw/src/command.rs:86\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":"fsw/sensor-fw/src/command.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"32af22a5d29790ad805c3d3f9c781cdcd7fff5f72177f416efd68ac6fa7540a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/bevy_world_mesh/src/bin/fetch_global_spherical.rs:384-391 | libs/bevy_world_mesh/src/bin/fetch_global_spherical.rs:445-452 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/bin/fetch_global_spherical.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"7103fa0e841b94cb6dd5768759be059b53ad10794caeffa206675b028088e7de"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/cranelift-mlir/src/interp.rs:759-763 | libs/cranelift-mlir/src/interp.rs:772-776 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"43128872f2dfda66def0f031635b1198f9bdcf80db0f137ebb8c949a53f21a93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:3979-3984 | libs/cranelift-mlir/src/lower.rs:6860-6865 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":3979}}}],"partialFingerprints":{"codehealthFindingId/v1":"7914e53fa85be71bf2b0341a90c7f78fd16b08a0168acd366a3f6ac4bf863017"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:4669-4673 | libs/cranelift-mlir/src/lower.rs:5805-5809 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:4669\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/cranelift-mlir/src/lower.rs:5802\u0060 calls \u0060ins\u0060, \u0060fcmp\u0060 and \u0060libs/cranelift-mlir/src/lower.rs:4668\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":4669}}}],"partialFingerprints":{"codehealthFindingId/v1":"c884073a5e4655d9d874a347d860c4641c66652576e310c7a78eb2a1aac4ecc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:8011-8018 | libs/cranelift-mlir/src/lower.rs:10010-10017 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":8011}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c61b566e186e4088ce95532816698dc90f925b2476d350b00d6ea9000ac4b18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/cranelift-mlir/src/tensor_rt.rs:1244-1248 | libs/cranelift-mlir/src/tensor_rt.rs:1954-1958 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cded20a5e0511570a65e70c4f061a738eaf94524fc91ee3ca68b19b9fc00315"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/db/src/bin/bench-csv-export.rs:120-126 | libs/db/tests_query/csv_export_goldie.rs:154-160 \u2014 before extracting anything, compare \u0060libs/db/src/bin/bench-csv-export.rs\u0060 and \u0060libs/db/tests_query/csv_export_goldie.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/db/src/bin/bench-csv-export.rs:119\u0060 calls \u0060collect\u0060 and \u0060libs/db/tests_query/csv_export_goldie.rs:153\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":"libs/db/src/bin/bench-csv-export.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"6110a90d0c9f4d348b413b4986a4c19f4acaf36602db4c6a88597ecf8738eb24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/db/src/lib.rs:3223-3227 | libs/db/src/lib.rs:3370-3374 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/lib.rs"},"region":{"startLine":3223}}}],"partialFingerprints":{"codehealthFindingId/v1":"62d0ad6359d882a006ba4d1ad789642a6b171bcd6064afad06360b31efca209f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/elodin-editor/src/object_3d.rs:1042-1046 | libs/elodin-editor/src/object_3d.rs:1056-1060 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/object_3d.rs:1042\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4f2a7c16dc5ba8b2ea71d7eeb8405f64359c0c06b3c753730d54058ed93be4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/elodin-editor/src/plugins/frustum/mod.rs:148-152 | libs/elodin-editor/src/plugins/frustum/mod.rs:154-158 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/frustum/mod.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"de348abaf0454a2ffd3e8db8d46f8b4ea7783999ecc209fbf9cfb530b470d83c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/elodin-editor/src/plugins/view_cube/interactions.rs:1628-1633 | libs/elodin-editor/src/plugins/view_cube/interactions.rs:1669-1674 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/plugins/view_cube/interactions.rs:1628\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":"libs/elodin-editor/src/plugins/view_cube/interactions.rs"},"region":{"startLine":1628}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88b71d4fb1df99642f6d3e1555dfc6ef40f7c050601ce794447c33bef5cb186"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/elodin-editor/src/ui/button.rs:178-185 | libs/elodin-editor/src/ui/button.rs:267-271 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/button.rs:178\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"libs/elodin-editor/src/ui/button.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22a321cfdc830473bb6d12e8e25d9cd2f949e233a5f11f431ebccdeffce590f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): libs/elodin-editor/src/ui/inspector/action.rs:41-50 | libs/elodin-editor/src/ui/startup_window.rs:722-732 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060libs/elodin-editor/src/ui/inspector/action.rs:41\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/action.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed57c65b97724fb0be8ce0cac97cee4401587c8d438c182ed27eb6bf4f4f469d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/elodin-editor/src/ui/inspector/viewport.rs:809-814 | libs/elodin-editor/src/ui/inspector/viewport.rs:818-822 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/inspector/viewport.rs:809\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":"libs/elodin-editor/src/ui/inspector/viewport.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"5818d52d003e2a394074b64b04f141bded0cb7bea0065b4e4889655e00a6af28"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/elodin-editor/src/ui/schematic/load.rs:1483-1487 | libs/elodin-editor/src/ui/schematic/load.rs:1499-1503 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/schematic/load.rs:1483\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":1483}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc5b8010098d6b01940751a37f6351ec73b50b87040a970a6041596fd29e694"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/elodin-editor/src/ui/startup_window.rs:824-828 | libs/elodin-editor/src/ui/timeline/timeline_controls.rs:989-993 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060libs/elodin-editor/src/ui/startup_window.rs:824\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/startup_window.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ded99c5b8b96e261094d477e7d1b2484e2b0f5982844f945f7e0f7f803c8ba4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/monte-carlo/src/lib.rs:3590-3594 | libs/nox-py/src/tick_metrics.rs:718-722 \u2014 before extracting anything, compare \u0060libs/monte-carlo/src/lib.rs\u0060 and \u0060libs/nox-py/src/tick_metrics.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/monte-carlo/src/lib.rs:3590\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":3590}}}],"partialFingerprints":{"codehealthFindingId/v1":"47621ff23f04a2149dba32edd0279e067be66262d1841ac569ca4c669e8c3636"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/nox-py/src/db/stream.rs:218-222 | libs/nox-py/src/db/stream.rs:376-380 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox-py/src/db/stream.rs:218\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/db/stream.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4f6cba77f62e8b72057dc9246b02f6baaf5f7f71944fee818d81d48fe68dfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/nox-py/src/ui/builders.rs:1181-1186 | libs/nox-py/src/ui/builders.rs:1188-1193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox-py/src/ui/builders.rs:1181\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/ui/builders.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea62d2a263cd75f4dfd195b8c1de499c40128ffe36fa85cecedc23a2cbf4defc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/nox-py/src/world_builder.rs:1726-1732 | libs/nox-py/src/world_builder.rs:1825-1829 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox-py/src/world_builder.rs:1726\u0060 it does not close everything it opens, so those exact 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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":1726}}}],"partialFingerprints":{"codehealthFindingId/v1":"351cce5de71be6149aa96935ba109d8df9e29c3e059d4f2a83da9f660f3ff9e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/nox/src/quaternion.rs:287-292 | libs/nox/src/quaternion.rs:299-304 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"libs/nox/src/quaternion.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd961e9808408401ec4cecf67aa7d74531c09cae0c129574b6ad5dbfffb6487f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/stellarator/src/poll/ops.rs:230-234 | libs/stellarator/src/poll/ops.rs:546-550 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/src/poll/ops.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"258c761e3c65a8af541cd80abf6eaded6e72ab0b7864fcb829d965ac4e613992"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): apps/inscriber/src/main.rs:50-60 | fsw/aleph-setup/src/main.rs:68-78 | fsw/aleph-status/src/main.rs:72-82 \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":"apps/inscriber/src/main.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"20801823d7b4bdf4066d7d6a15b6f9410f15be963ef2d5fc5b35e80095055b4d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/bevy_geo_frames/src/big_space.rs:29-33 | libs/bevy_geo_frames/src/geo.rs:516-520 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/bevy_geo_frames/src/big_space.rs:29\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_geo_frames/src/big_space.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b0a7070b5b4ca600ad17c0f8dabe88f9e260c449e6aa167e3445c5aace8ae0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/db/src/assets_http.rs:87-93 | libs/elodin-editor/src/object_3d.rs:44-50 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/assets_http.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e6af5dc31ee240312dccf4d12be65d7e13aae85b1644f829c8a3aaeab4813c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/elodin-editor/src/plugins/kdl_document/mod.rs:26-33 | libs/elodin-editor/src/skybox_generation.rs:161-168 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/plugins/kdl_document/mod.rs:26\u0060 it begins part-way through the construct above it, so those exact 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 \u0060config\u0060 to \u0060\u0026impeller_wkt::DbConfig\u0060 in one and \u0060\u0026DbConfig\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":"libs/elodin-editor/src/plugins/kdl_document/mod.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"da61755d9be76c58a1f496e83ecc9b7731cc585b20eb8cf966e8d104ca8b5907"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/elodin-editor/src/ui/gauges/horizon.rs:60-68 | libs/elodin-editor/src/ui/gauges/orientation.rs:53-61 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/gauges/horizon.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae5969274cb0a0fe667051e0024f732762c87b7ab3743fa97ca423afccadeb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/elodin-editor/src/ui/plot/gpu.rs:549-559 | libs/elodin-editor/src/ui/plot_3d/gpu.rs:393-403 \u2014 \u0060libs/elodin-editor/src/ui/plot/gpu.rs\u0060 and \u0060libs/elodin-editor/src/ui/plot_3d/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 4 separate duplicated blocks between them, totalling at least 43 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 \u0060libs/elodin-editor/src/ui/plot/gpu.rs:549\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/gpu.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ff75431464fd551b01f5f36270a9fdf21ee3a9ac3448791289b98d2e327252"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/elodin-editor/src/ui/plot/gpu.rs:790-800 | libs/elodin-editor/src/ui/plot_3d/gpu.rs:582-592 \u2014 \u0060libs/elodin-editor/src/ui/plot/gpu.rs\u0060 and \u0060libs/elodin-editor/src/ui/plot_3d/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 4 separate duplicated blocks between them, totalling at least 43 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 \u0060libs/elodin-editor/src/ui/plot/gpu.rs:790\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/gpu.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af41ba8e284f55f0bcab5c82294d84a42792d015b2ea4bfc56cc631f5e8e10e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): libs/monte-carlo/src/lib.rs:2775-2787 | libs/nox-py/src/monte_carlo.rs:347-359 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":2775}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfa3bfdbc938dc3a99a28a3cdc745b21f59364e6468f12b1938d2eecccc04a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/monte-carlo/src/lib.rs:3493-3499 | libs/nox-py/src/tick_metrics.rs:673-679 \u2014 before extracting anything, compare \u0060libs/monte-carlo/src/lib.rs\u0060 and \u0060libs/nox-py/src/tick_metrics.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 47 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":3493}}}],"partialFingerprints":{"codehealthFindingId/v1":"74ea1f7d7b1f98fd32aa8cf7c258b6035db64d0148f20a8e0f4c7a9126a419e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/nox-py/src/db/client.rs:239-244 | libs/nox-py/src/db/writer.rs:195-200 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/db/client.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ec85e1b64a7d85912b6ad68d2f4f29bfaf90701e4b6bbb20de0c045f770060"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/stellarator/buf/src/lib.rs:200-206 | libs/stellarator/src/buf.rs:173-179 \u2014 before extracting anything, compare \u0060libs/stellarator/buf/src/lib.rs\u0060 and \u0060libs/stellarator/src/buf.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/buf/src/lib.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64e5c800a2a24884ba015a6f467ab559120d76e6ed9d260b87c969baac6a0b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): fsw/sensor-fw/src/bmi270.rs:168-175 | fsw/sensor-fw/src/bmp581.rs:105-113 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fsw/sensor-fw/src/bmi270.rs:168\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/bmi270.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b9363ca401f2e28e428c79aad34444eea9f962fc86fca91380b2a33ce75753f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): fsw/sensor-fw/src/bmi270.rs:181-185 | fsw/sensor-fw/src/bmp581.rs:119-124 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fsw/sensor-fw/src/bmi270.rs:181\u0060 it begins part-way through the construct above it, so those exact 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 \u0060register\u0060 to \u0060Registers\u0060 in one and \u0060Register\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":"fsw/sensor-fw/src/bmi270.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d36c498eedb42bce8808227f999a757e774c1b1152d2ab170ba1c8297267625"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/stellarator/buf/src/lib.rs:98-105 | libs/stellarator/src/buf.rs:84-91 \u2014 before extracting anything, compare \u0060libs/stellarator/buf/src/lib.rs\u0060 and \u0060libs/stellarator/src/buf.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 57 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/buf/src/lib.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2333a5a85741e9a6eaf66f7cd9227ca8b1e0c5d96e0a04c3efa685b1789900d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): apps/elodin/src/cli/cloud/auth/login.rs:149-164 | apps/elodin/src/cli/cloud/auth/tokens.rs:143-156 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/elodin/src/cli/cloud/auth/login.rs:149\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/elodin/src/cli/cloud/auth/login.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"b85413a127d8a0cad1da55e1a3a6f347a117cd108a9d56f9126806fa54b74bbe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): fsw/sensor-fw/src/fm24cl16b.rs:259-272 | fsw/sensor-fw/src/fm24cl16b.rs:286-299 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fsw/sensor-fw/src/fm24cl16b.rs:259\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/fm24cl16b.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ea1177855e2b944dbb5efc2d39bcfd60b62fceee61cbdeae73aba07da819f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/bevy_world_mesh/src/fetch.rs:869-882 | libs/bevy_world_mesh/src/fetch.rs:999-1012 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/bevy_world_mesh/src/fetch.rs:869\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/fetch.rs"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4ad8421449b9a740d74f5356d6af09ded5d37f2d7f499519b971a561af580fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:5273-5285 | libs/cranelift-mlir/src/lower.rs:7806-7814 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:5273\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":5273}}}],"partialFingerprints":{"codehealthFindingId/v1":"f759db7d3cba5f3dd19448ed09e581e8d415cf7e497ea11d6de851e5a8b6c920"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/elodin-editor/src/ui/inspector/object3d.rs:393-402 | libs/elodin-editor/src/ui/inspector/object3d.rs:437-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 \u0060libs/elodin-editor/src/ui/inspector/object3d.rs:393\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/object3d.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ff385023ce34198e36523252ccce3c604a25c3a2ba80078218de14b006f735"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/postcard-c/codegen/src/lib.rs:446-457 | libs/postcard-c/codegen/src/lib.rs:551-562 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/postcard-c/codegen/src/lib.rs:446\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/postcard-c/codegen/src/lib.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f19daf07067fbfdd863334a9c31ef0e21cd3da7c7d08025f42377c6931385e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/elodin-editor/src/ui/inspector/object3d.rs:384-391 | libs/elodin-editor/src/ui/inspector/object3d.rs:433-444 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/inspector/object3d.rs:384\u0060 it does not close everything it opens, so those exact 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":"libs/elodin-editor/src/ui/inspector/object3d.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab33cb01c406f0cce2667cdfa368a6a37a52e96c6235f2017b851c489c43e46d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/stellarator/macros/src/lib.rs:11-22 | libs/stellarator/macros/src/lib.rs:44-55 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/macros/src/lib.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"119c18d3098337603a15e0e2a6e13027fa54394bd8270f57cd3a77710fb69d6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/elodin-editor/src/plugins/kdl_document/systems.rs:321-332 | libs/elodin-editor/src/plugins/kdl_document/systems.rs:400-411 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/plugins/kdl_document/systems.rs:321\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/kdl_document/systems.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3351c5826af1d9ab6eaafccb5707ee478d581d95f1d0ca382c138828a77e0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/elodin-editor/src/ui/inspector/action.rs:49-59 | libs/elodin-editor/src/ui/inspector/action.rs:64-74 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/inspector/action.rs:49\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/action.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"151736567231bccc9340ee738906c111cc40e0e9a99e778b71fce0f1a4b4645d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/db/src/lib.rs:923-933 | libs/db/src/lib.rs:945-954 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/lib.rs:923\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/lib.rs"},"region":{"startLine":923}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15deac89810465f794336515b283fd8dd4d0c95f98d1dd2df8ca7b8ef74be69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/elodin-editor/src/ui/schematic/load.rs:1341-1351 | libs/elodin-editor/src/ui/schematic/load.rs:1973-1983 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/schematic/load.rs:1341\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":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b2d4fbeaac46e95dc2d74132ca9988edd27a0b2622222686b967a1f5227c9db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/impeller/kdl/src/de.rs:1987-1997 | libs/impeller/kdl/src/de.rs:2541-2551 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/impeller/kdl/src/de.rs:1987\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":1987}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf1e553d5be77dbf348699ce0cd06d865acf6ae4cc9ee2ff27c77c18f50cb64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): libs/db/eql/src/formulas/angular.rs:24-34 | libs/db/eql/src/formulas/linear.rs:24-34 | libs/db/eql/src/formulas/norm.rs:5-15 \u2014 before extracting anything, compare \u0060libs/db/eql/src/formulas/angular.rs\u0060 and \u0060libs/db/eql/src/formulas/linear.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/formulas/angular.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d74a4a39c180be378b7e32e5c9ff9725958c1d2000ff0c633967a67296240ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): libs/nox-py/src/step_context.rs:565-585 | libs/nox-py/src/step_context.rs:587-607 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/step_context.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"b759f3c1be9d655bb4e08f4a5f8c0e043d0e1347cc86d2cefbe6e76774e60fb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): fsw/sensor-fw/src/main.rs:686-696 | fsw/sensor-fw/src/main.rs:700-710 | fsw/sensor-fw/src/main.rs:714-724 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/main.rs"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc2dd30b02f7111e2ddf2c986737c1c32ff5f35c0ef629b2db122ccc25bf40a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/db/src/grpc/stream.rs:593-603 | libs/db/src/grpc/stream.rs:620-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 \u0060libs/db/src/grpc/stream.rs:593\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":"libs/db/src/grpc/stream.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9030fdb3e79edcf99799aee0e087cba9131c3fa6ebef7047c0fb3badcc9beb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/db/src/arrow/fft.rs:48-57 | libs/db/src/arrow/fft.rs:128-137 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/arrow/fft.rs:48\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/arrow/fft.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d9885ff047ea610f5246fd7ddc12c55032ae06288a39849d7b5266c8dab568b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): libs/impeller/kdl/src/de.rs:1100-1109 | libs/impeller/kdl/src/de.rs:1122-1131 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/impeller/kdl/src/de.rs:1100\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"513ad9170564bf622d3d1010d12268b4969ad16024a2726ecc481673b9caff67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): libs/elodin-editor/src/ui/plot/widget.rs:1771-1780 | libs/elodin-editor/src/ui/plot/widget.rs:2092-2099 | libs/elodin-editor/src/ui/plot/widget.rs:2291-2298 \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 \u0060libs/elodin-editor/src/ui/plot/widget.rs:1771\u0060 it begins part-way through the construct above it, so those exact 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":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":1771}}}],"partialFingerprints":{"codehealthFindingId/v1":"496cf4edfddc4f08566eeb628d6b273f05131e22b89a0b619be74556ee4281c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/db/src/lib.rs:111-119 | libs/db/src/lib.rs:138-147 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/lib.rs:111\u0060 it does not close everything it opens, so those exact 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":"libs/db/src/lib.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2dcf33fb7ed64d4397e7716e26509baaf83682acf59da73f7cd5a4ec5ae5cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 13): libs/db/eql/src/formulas/clip.rs:68-77 | libs/db/eql/src/formulas/rotate.rs:33-42 | libs/db/eql/src/formulas/rotate.rs:84-93 | libs/db/eql/src/formulas/rotate.rs:134-143 | libs/db/eql/src/formulas/rotate.rs:228-237 | libs/db/eql/src/formulas/rotate_world.rs:33-42 | libs/db/eql/src/formulas/rotate_world.rs:84-93 | libs/db/eql/src/formulas/rotate_world.rs:134-143 | libs/db/eql/src/formulas/rotate_world.rs:229-238 | libs/db/eql/src/formulas/translate_world.rs:33-42 | libs/db/eql/src/formulas/translate_world.rs:83-92 | libs/db/eql/src/formulas/translate_world.rs:133-142 | libs/db/eql/src/formulas/translate_world.rs:231-240 \u2014 before extracting anything, compare \u0060libs/db/eql/src/formulas/rotate.rs\u0060 and \u0060libs/db/eql/src/formulas/rotate_world.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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":"libs/db/eql/src/formulas/clip.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5e70e39d07177a1a8791b58830f908475ea61e4108f115796baeca510f64ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/impeller/kdl/src/de.rs:2185-2190 | libs/impeller/kdl/src/de.rs:2359-2367 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/impeller/kdl/src/de.rs:2185\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":2185}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2fe15f0ab66f68a5013c8001d4889bb937436c397d4e2ade68eab9c8e2f3b67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/db/src/vtable_stream.rs:72-80 | libs/db/src/vtable_stream.rs:119-127 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/vtable_stream.rs:72\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":"libs/db/src/vtable_stream.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2990e10520d612cb02a70da780525f922580aa7f7d2214b37051d0f19bb4bd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): libs/db/eql/src/formulas/abs.rs:29-37 | libs/db/eql/src/formulas/arccos.rs:33-41 | libs/db/eql/src/formulas/degrees.rs:29-37 | libs/db/eql/src/formulas/sign.rs:36-44 | libs/db/eql/src/formulas/sqrt.rs:29-37 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 5 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/eql/src/formulas/abs.rs:29\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/formulas/abs.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a113dfab0fb259a081d5b75e29e5fcfc5711e192d666f56485c372d9f2da8a59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/elodin-editor/src/ui/schematic/load.rs:1543-1551 | libs/elodin-editor/src/ui/schematic/load.rs:1637-1645 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/schematic/load.rs:1543\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":1543}}}],"partialFingerprints":{"codehealthFindingId/v1":"039ec6c3d7aba73f9eefa48f085d67e104717599ca5c7db6696456c3ae865922"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/elodin-editor/src/ui/timeline/timeline_controls.rs:343-351 | libs/elodin-editor/src/ui/timeline/timeline_controls.rs:369-377 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/timeline/timeline_controls.rs:343\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/timeline/timeline_controls.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5cf6b839031694d9d06f8ce6918e1732e68fbd78f74830a34f5b45981a1752e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/bevy_world_mesh/src/terrain/debug/screenshot.rs:50-58 | libs/elodin-editor/src/plugins/screenshot.rs:141-149 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/bevy_world_mesh/src/terrain/debug/screenshot.rs:50\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/terrain/debug/screenshot.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"15882cd2a28466e749c46178227cf2bc9143f561f0ec599323a2d16b625d2ac0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/elodin-editor/src/ui/command_palette/palette_items.rs:1262-1269 | libs/elodin-editor/src/ui/command_palette/palette_items.rs:1451-1459 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/command_palette/palette_items.rs:1262\u0060 it begins part-way through the construct above it, so those exact 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":"libs/elodin-editor/src/ui/command_palette/palette_items.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f7cc48faccaa66cefff3ff58e7959635e457ad6a224d16eb71e857a0cd6fe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:6539-6553 | libs/cranelift-mlir/src/lower.rs:10978-10992 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":6539}}}],"partialFingerprints":{"codehealthFindingId/v1":"b683267c1d1f106b549c9da1be167f662c84bfa6fcaa93a47cdcc2a549384f73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/db/eql/src/formulas/angular.rs:104-112 | libs/db/eql/src/formulas/linear.rs:104-112 \u2014 before extracting anything, compare \u0060libs/db/eql/src/formulas/angular.rs\u0060 and \u0060libs/db/eql/src/formulas/linear.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/eql/src/formulas/angular.rs:104\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/formulas/angular.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff3f9127536c00c98a4a2cb5037c1b58f84d23e60f36a8c4c757b38b1b62ed5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): fsw/sensor-fw/src/fm24cl16b.rs:219-227 | fsw/sensor-fw/src/fm24cl16b.rs:280-287 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fsw/sensor-fw/src/fm24cl16b.rs:219\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/fm24cl16b.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bf94d6e0242cd220840c8ad8bcf523409a2f81caecdd393d5702a77a7c69417"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): apps/inscriber/src/main.rs:223-231 | apps/inscriber/src/main.rs:274-281 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060apps/inscriber/src/main.rs:223\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/inscriber/src/main.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db64d5fc04b0ea87a2cfe227622d1f48a72db3a3dacbbde310113cc6abcfac1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): libs/cranelift-mlir/src/const_fold.rs:639-647 | libs/cranelift-mlir/src/const_fold.rs:661-669 | libs/cranelift-mlir/src/const_fold.rs:684-692 \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 \u0060libs/cranelift-mlir/src/const_fold.rs:639\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/const_fold.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"12aa0a904e1a93f58ee9ba23c326e721a6ec3d04fa4cfa075cfbc0da26ab1440"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/elodin-editor/src/ui/inspector/object3d.rs:336-343 | libs/elodin-editor/src/ui/inspector/object3d.rs:348-355 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/inspector/object3d.rs:336\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/object3d.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ae7c310d8882bc4455d56883708f59f09fde42b3bd94d5b81b9f66f2e8b047"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/cranelift-mlir/src/parser.rs:1362-1369 | libs/cranelift-mlir/src/parser.rs:2455-2462 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1362}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f054e08c203c1ab4b39e84a5aa1bd201cd2206bf77f75aa165062e9a544e7b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/postcard-c/codegen/src/lib.rs:280-287 | libs/postcard-c/codegen/src/lib.rs:398-405 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/postcard-c/codegen/src/lib.rs:280\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/postcard-c/codegen/src/lib.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4bc5505db110464b2c1894bc4041e2041e0037b8d33763b561d24670fce23d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/bevy_world_mesh/src/bin/fetch_global_spherical.rs:365-372 | libs/bevy_world_mesh/src/bin/fetch_global_spherical.rs:422-429 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060libs/bevy_world_mesh/src/bin/fetch_global_spherical.rs:430\u0060 calls \u0060checked_mul\u0060, \u0060context\u0060 and \u0060libs/bevy_world_mesh/src/bin/fetch_global_spherical.rs:373\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":"libs/bevy_world_mesh/src/bin/fetch_global_spherical.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc1699daed55d56c14b99721fe3af26b72692cd96fe38f7a33ad204231217794"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/bevy_world_mesh/src/terrain/render/tiling_prepass.rs:159-166 | libs/bevy_world_mesh/src/terrain/render/tiling_prepass.rs:169-176 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/bevy_world_mesh/src/terrain/render/tiling_prepass.rs:159\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":"libs/bevy_world_mesh/src/terrain/render/tiling_prepass.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"9791f24be38ffda1468f588fac7c74359e4b56bb7b03ab27131fd87dff94a2c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/elodin-editor/src/plugins/thruster_particles/mod.rs:477-484 | libs/elodin-editor/src/plugins/thruster_particles/mod.rs:549-556 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/thruster_particles/mod.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"435b567d56aef2ed30823ea177482cdcceb306ad376fc92b48dc67f6e1145b7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): libs/postcard-c/codegen/src/lib.rs:510-517 | libs/postcard-c/codegen/src/lib.rs:521-528 | libs/postcard-c/codegen/src/lib.rs:578-585 \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":"libs/postcard-c/codegen/src/lib.rs"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"f932da50a8b5f53449e251a564188e7f6be9cda8a9048dd4c50a6663c1e41148"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): libs/bevy_world_mesh/src/terrain/render/tiling_prepass.rs:159-166 | libs/bevy_world_mesh/src/terrain/render/tiling_prepass.rs:169-176 | libs/bevy_world_mesh/src/terrain/render/tiling_prepass.rs:179-186 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/bevy_world_mesh/src/terrain/render/tiling_prepass.rs:159\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":"libs/bevy_world_mesh/src/terrain/render/tiling_prepass.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c00617c6b060c330df49af64a6959cada1e00709ab960f80b876fd360f7621"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): libs/db/eql/src/formulas/rotate.rs:208-215 | libs/db/eql/src/formulas/rotate_world.rs:209-216 | libs/db/eql/src/formulas/translate_world.rs:211-218 \u2014 before extracting anything, compare \u0060libs/db/eql/src/formulas/rotate.rs\u0060 and \u0060libs/db/eql/src/formulas/rotate_world.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 31 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/eql/src/formulas/rotate.rs:208\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/formulas/rotate.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e2664311566c1e2fa7111b1b53c357a34f953b08ffbc8cc178ddbbb660a372"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/impeller/kdl/src/de.rs:1156-1163 | libs/impeller/kdl/src/de.rs:1167-1174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/impeller/kdl/src/de.rs:1156\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":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"0111c28786b924980fd4991aa11cce626962065a1c1fd49f044fdf432ac66524"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): libs/cranelift-mlir/src/lower.rs:10877-10883 | libs/cranelift-mlir/src/lower.rs:11062-11068 | libs/cranelift-mlir/src/lower.rs:11107-11113 | libs/cranelift-mlir/src/lower.rs:11453-11459 | libs/cranelift-mlir/src/lower.rs:11661-11667 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:10877\u0060 it does not close everything it opens, so those exact 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, \u0060libs/cranelift-mlir/src/lower.rs:11452\u0060 calls \u0060ins\u0060, \u0060iconst\u0060 and \u0060libs/cranelift-mlir/src/lower.rs:10875\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":10877}}}],"partialFingerprints":{"codehealthFindingId/v1":"980b542199e8a0a3f9b19e3abd8b328385cb7b5b8cb587a7d1b8a0733e63e8df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): libs/elodin-editor/src/ui/inspector/viewport.rs:561-567 | libs/elodin-editor/src/ui/inspector/viewport.rs:569-575 | libs/elodin-editor/src/ui/inspector/viewport.rs:577-583 \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 \u0060libs/elodin-editor/src/ui/inspector/viewport.rs:561\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/viewport.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"263413457f7b424709ab5b481ad5eac74e5cf58fc75f2de73e1e69320a3512d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/elodin-editor/src/ui/gauges/geo_position.rs:84-90 | libs/elodin-editor/src/ui/gauges/orientation.rs:123-129 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/gauges/geo_position.rs:84\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/gauges/geo_position.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7602bb9e18b8d74ba0944c550626a9d32b3a57c1c4175f8294fd6f7873fe1c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:11201-11207 | libs/cranelift-mlir/src/lower.rs:11304-11310 \u2014 both copies are in the same file, so extract the block 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, \u0060libs/cranelift-mlir/src/lower.rs:11311\u0060 calls \u0060get\u0060, \u0060copied\u0060, \u0060unwrap_or\u0060 and \u0060libs/cranelift-mlir/src/lower.rs:11208\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":11201}}}],"partialFingerprints":{"codehealthFindingId/v1":"183662a51e6e4f15e5c601ead877ce7df3ec2a8eb0a8a4f93016cf785cc5d437"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): libs/nox-py/src/step_context.rs:567-573 | libs/nox-py/src/step_context.rs:589-595 | libs/nox-py/src/step_context.rs:615-621 \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 \u0060libs/nox-py/src/step_context.rs:567\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/step_context.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"099ab64026dd8f2486b6ab450255e169b9d120bbbd290e02e02380fcc1717d11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/elodin-editor/src/ui/inspector/sensor_camera.rs:77-83 | libs/elodin-editor/src/ui/inspector/viewport.rs:916-920 \u2014 before extracting anything, compare \u0060libs/elodin-editor/src/ui/inspector/sensor_camera.rs\u0060 and \u0060libs/elodin-editor/src/ui/inspector/viewport.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 117 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/inspector/sensor_camera.rs:77\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/sensor_camera.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"176da949b95f2004fd2eb5174dba9933a1f8f020aebd8ffaab7a41db7a6b4a86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5): libs/elodin-editor/src/ui/command_palette/palette_items.rs:829-834 | libs/elodin-editor/src/ui/command_palette/palette_items.rs:871-876 | libs/elodin-editor/src/ui/command_palette/palette_items.rs:885-890 | libs/elodin-editor/src/ui/command_palette/palette_items.rs:899-904 | libs/elodin-editor/src/ui/command_palette/palette_items.rs:913-918 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/command_palette/palette_items.rs:829\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"libs/elodin-editor/src/ui/command_palette/palette_items.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd593cd8f2205f0818ec309961ce4ed00e60c77c0687f9b93855ae7b83203dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): libs/impeller/kdl/src/de.rs:2351-2356 | libs/impeller/kdl/src/de.rs:2394-2399 | libs/impeller/kdl/src/de.rs:2515-2520 \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 \u0060libs/impeller/kdl/src/de.rs:2351\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":2351}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3443c3cacb6739db24a8d5eebd058c936f592ea4d2b419b069b65eb101ae61f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): libs/db/eql/src/formulas/angular.rs:36-41 | libs/db/eql/src/formulas/linear.rs:36-41 | libs/db/eql/src/formulas/norm.rs:17-22 \u2014 before extracting anything, compare \u0060libs/db/eql/src/formulas/angular.rs\u0060 and \u0060libs/db/eql/src/formulas/linear.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. 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, \u0060libs/db/eql/src/formulas/angular.rs:43\u0060 calls \u0060angular_count\u0060 and \u0060libs/db/eql/src/formulas/norm.rs:24\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":"libs/db/eql/src/formulas/angular.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8323e0047f87ca007029ff8481d50dd98e2070ff08bd6f337e8d44038c56289"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/nox/src/noxpr/node.rs:2354-2359 | libs/nox/src/noxpr/node.rs:2470-2475 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox/src/noxpr/node.rs:2354\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":2354}}}],"partialFingerprints":{"codehealthFindingId/v1":"8426ea22420a7a27c7192e0b1e934224c8b77a6229f8214afa7a0a6a2a2bf66d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/cranelift-mlir/src/parser.rs:2861-2866 | libs/cranelift-mlir/src/parser.rs:2874-2879 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/parser.rs:2861\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":2861}}}],"partialFingerprints":{"codehealthFindingId/v1":"78988c466d4f8c1008430124b2d71267e6712cdea6e6df2c2a89f146e5dd0378"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/impeller/bevy/src/lib.rs:1446-1451 | libs/impeller/bevy/src/lib.rs:1669-1674 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/impeller/bevy/src/lib.rs:1446\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2f4c0dc0d6ee82b97f952bb976190712ff6536017bda81f558245aee9867a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:5542-5546 | libs/cranelift-mlir/src/lower.rs:8783-8788 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":5542}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8495e7473a773097df37dd3ef7a5653cee43fbefff103733a4e403f957726d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:11046-11051 | libs/cranelift-mlir/src/lower.rs:11091-11096 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":11046}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb44d8a2e2388fdc1a1650c864cca5951bc9ca7179db620376ee49124f9fd3e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): libs/elodin-editor/src/ui/inspector/sensor_camera.rs:87-92 | libs/elodin-editor/src/ui/inspector/sensor_camera.rs:95-100 | libs/elodin-editor/src/ui/inspector/sensor_camera.rs:103-108 \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 \u0060libs/elodin-editor/src/ui/inspector/sensor_camera.rs:87\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/sensor_camera.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"89bd837fb7373b70315316d78cd6c6da9df059a9c3fe1ee5907c1570056d971e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): libs/impeller/kdl/src/de.rs:2019-2024 | libs/impeller/kdl/src/de.rs:2352-2357 | libs/impeller/kdl/src/de.rs:2395-2400 | libs/impeller/kdl/src/de.rs:2516-2521 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/impeller/kdl/src/de.rs:2019\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":2019}}}],"partialFingerprints":{"codehealthFindingId/v1":"f199eb9267fba6da322afd100f8d4c98cded7e91306abc703e9937b55b5d3889"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/cranelift-mlir/src/parser.rs:2165-2170 | libs/cranelift-mlir/src/parser.rs:2449-2454 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":2165}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2bee6b323f1cde9062a6ddee0928211a494f5913311632bb9e2ab8cbe1b799"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): libs/elodin-editor/src/ui/inspector/sensor_camera.rs:87-92 | libs/elodin-editor/src/ui/inspector/sensor_camera.rs:95-100 | libs/elodin-editor/src/ui/inspector/sensor_camera.rs:103-108 | libs/elodin-editor/src/ui/inspector/viewport.rs:1070-1075 \u2014 before extracting anything, compare \u0060libs/elodin-editor/src/ui/inspector/sensor_camera.rs\u0060 and \u0060libs/elodin-editor/src/ui/inspector/viewport.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 117 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/inspector/sensor_camera.rs:87\u0060 it begins part-way through the construct above it, so those exact 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, \u0060libs/elodin-editor/src/ui/inspector/viewport.rs:1076\u0060 calls \u0060configure_input_with_border\u0060, \u0060style_mut\u0060 and \u0060libs/elodin-editor/src/ui/inspector/sensor_camera.rs:109\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":"libs/elodin-editor/src/ui/inspector/sensor_camera.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bbc663ef130d6f8658ca08cf753e85d7a8fda47b1ebf3347652d537e2936386"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/impeller/kdl/src/de.rs:1081-1085 | libs/impeller/kdl/src/de.rs:1201-1206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":1081}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c12e4186281e74e9fb891c86427d219b90f1d22fdc0d84b30f5356f81430b1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): fsw/sensor-fw/src/sdmmc.rs:422-427 | fsw/sensor-fw/src/sdmmc.rs:452-457 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060fsw/sensor-fw/src/sdmmc.rs:422\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":"fsw/sensor-fw/src/sdmmc.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb021418049bad3f192f01af4466e9bbcf1e3d4195ac79ac8a15e739f42240b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): libs/elodin-editor/src/ui/inspector/graph.rs:115-119 | libs/elodin-editor/src/ui/inspector/monitor.rs:41-45 | libs/elodin-editor/src/ui/inspector/query_table.rs:78-82 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/inspector/graph.rs:115\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/graph.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"75badcc21a02f171562d3a9e5511bd33f8430458b8bd9d3d2600f743e8ac3381"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/elodin-editor/src/ui/inspector/data_overview.rs:64-68 | libs/elodin-editor/src/ui/inspector/graph.rs:115-119 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/inspector/data_overview.rs:64\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/data_overview.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"237fe81824fbe9bf0e39f99892317b9979d8385caa139e106884f7752bc7f016"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): libs/cranelift-mlir/src/lower.rs:10908-10912 | libs/cranelift-mlir/src/lower.rs:11046-11050 | libs/cranelift-mlir/src/lower.rs:11091-11095 \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, \u0060libs/cranelift-mlir/src/lower.rs:10913\u0060 calls \u0060sqrt\u0060 and \u0060libs/cranelift-mlir/src/lower.rs:11096\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":10908}}}],"partialFingerprints":{"codehealthFindingId/v1":"27742a23217692256605381d9980f278978cfe9a439c9d247c3e331154da9156"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/db/src/lib.rs:2810-2814 | libs/db/src/lib.rs:3095-3099 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/src/lib.rs:2810\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/lib.rs"},"region":{"startLine":2810}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdf9abae73d1b119baa4c0d8641883a35aea1a8d83904f708c7a5868103e4c8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/impeller/kdl/src/de.rs:876-880 | libs/impeller/kdl/src/de.rs:1468-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":876}}}],"partialFingerprints":{"codehealthFindingId/v1":"876214868e277f0fdad7f68c59a4eb50c9d224a174fc893a572607512e3916ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/db/src/export.rs:655-659 | libs/db/src/export.rs:671-675 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/export.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"a20d2c7648d1a01bffc611d0fdf978324cd02ac34cb0a8ff66f7c142d996d2a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/impeller/kdl/src/de.rs:1249-1253 | libs/impeller/kdl/src/de.rs:2148-2152 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a9a78e3b709dea46d60094f5f6dfec938c71d797bd9e1ca7643bce21e058c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/elodin-editor/src/ui/inspector/graph.rs:449-453 | libs/elodin-editor/src/ui/inspector/query_table.rs:78-82 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/elodin-editor/src/ui/inspector/graph.rs:449\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/graph.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"6daa6d10ec4e6e24a55cf8614fee9b33d34ae1fcac9825eb0a7f2adadfc7cd4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): fsw/lqr/src/main.rs:30-34 | fsw/mekf/src/main.rs:38-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/lqr/src/main.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4466d9043a58f38fd3366da4bce1c609dadc482d4b72812893b47313ff7b7bb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): libs/bevy_world_mesh/src/fetch.rs:687-694 | libs/bevy_world_mesh/src/fetch.rs:704-711 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/fetch.rs"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"68be0d5f14feb576d518705f32bf08b4d95ebb3d38f9292af5fbbe97307c7a08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/cranelift-mlir/src/interp.rs:1426-1430 | libs/cranelift-mlir/src/lower.rs:9664-9668 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc86d11b249240ea8cc60b6b31b03579a604a6a8ba076e76f92d9087519f54bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:4158-4163 | libs/cranelift-mlir/src/lower.rs:6652-6657 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:4158\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":4158}}}],"partialFingerprints":{"codehealthFindingId/v1":"91fa19283330e3f44b25e24fa3b95ba6a899ff86bf3e65e74921525d36053693"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:6565-6569 | libs/cranelift-mlir/src/lower.rs:11011-11015 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":6565}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63a096dfda1edd9c6e0c1095e1a5dd02c5f92ad11bd996ea2fae90b202f11b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:7032-7037 | libs/cranelift-mlir/src/lower.rs:7289-7294 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/lower.rs:7032\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":7032}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c730d927ba6d3b7713a2e5ab508688ce812bf41fd7961890b8032dafd2dc29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:7956-7960 | libs/cranelift-mlir/src/lower.rs:7979-7983 \u2014 both copies are in the same file, so extract the block 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, \u0060libs/cranelift-mlir/src/lower.rs:7977\u0060 calls \u0060get_vals\u0060, \u0060to_vec\u0060, \u0060get\u0060 and \u0060libs/cranelift-mlir/src/lower.rs:7955\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":7956}}}],"partialFingerprints":{"codehealthFindingId/v1":"175a7fefe21d3dd4e17f8acc3d660d338efae4febca32f1a61cddd6118352f09"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/cranelift-mlir/src/lower.rs:11175-11179 | libs/cranelift-mlir/src/lower.rs:11367-11371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":11175}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b953a1d82ebbc52446163980cea9817af4cc801502b96bc0b7a88737118240"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): libs/cranelift-mlir/src/tensor_rt.rs:171-176 | libs/cranelift-mlir/src/tensor_rt.rs:179-184 | libs/cranelift-mlir/src/tensor_rt.rs:187-192 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"f361b28c1b006753bf47e0998850bc7306989765e6406e7a23a6d3f230d01881"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): libs/cranelift-mlir/src/tensor_rt.rs:195-200 | libs/cranelift-mlir/src/tensor_rt.rs:203-208 | libs/cranelift-mlir/src/tensor_rt.rs:211-216 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"255d6d7cb6d6e63da9f827a9852e31582e0b3a3095602f00cc96db6ce5741427"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/cranelift-mlir/src/tensor_rt.rs:348-352 | libs/cranelift-mlir/src/tensor_rt.rs:365-369 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/tensor_rt.rs:348\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"86446d055f8c9f5cc9acf0d81f20b7d1ab9c806372d953bc31ba35cf6297f12a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/cranelift-mlir/src/tensor_rt.rs:561-565 | libs/cranelift-mlir/src/tensor_rt.rs:654-658 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/cranelift-mlir/src/tensor_rt.rs:561\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10f45ee01d4661ee4dde310830b808abb56dd4be85168e9881888fde4620fd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/cranelift-mlir/src/tensor_rt.rs:1831-1835 | libs/cranelift-mlir/src/tensor_rt.rs:1926-1930 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":1831}}}],"partialFingerprints":{"codehealthFindingId/v1":"a77a224affb9d7c8357782111c4fc94c8977519fb3920408089ceee30b03c006"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/nox-frames/src/iers.rs:103-107 | libs/nox-frames/src/iers.rs:108-112 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-frames/src/iers.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc45e68a42ffea7e6bd906c4eca0418b067e377097fded53b05e5d1502a9dbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/nox-frames/src/iers.rs:142-146 | libs/nox-frames/src/iers.rs:147-151 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-frames/src/iers.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d332811cbdc8e16f9d0a1f5fb0e06cd1e87da7b240689b261b424bf6c2b2bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/nox-py/src/graph.rs:278-284 | libs/nox-py/src/graph.rs:315-321 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox-py/src/graph.rs:278\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/graph.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9605149fbe661d2a2e6a8dabb2cccaa5e97f86897d0a8d071319e981570504"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): libs/nox-py/src/spatial.rs:126-131 | libs/nox-py/src/spatial.rs:207-212 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/spatial.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e614f3e9abdbb5523683b7f5918c8b58aa33156f7973afead135b9f840c2e9f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): libs/nox/src/noxpr/node.rs:258-262 | libs/nox/src/noxpr/node.rs:470-474 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/nox/src/noxpr/node.rs:258\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"609d4512e3b00813d1f73cf52a6021d05ab299a6cd9740e88ece374cc7bf2b98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): fsw/udp_component_broadcast/broadcast_component.py:380-396 | fsw/udp_component_broadcast/receive_broadcast.py:363-381 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060fsw/udp_component_broadcast/receive_broadcast.py:363\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/broadcast_component.py"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"e443043e24052d098b548bdd9a380383a1eec08b48fc7b66405f61aabdedad73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): examples/cube-sat-pysim/main.py:216-231 | examples/cube-sat/main.py:237-252 | fsw/roci/adcs/reference-impls/mekf.py:50-65 \u2014 \u0060examples/cube-sat-pysim/main.py\u0060 and \u0060examples/cube-sat/main.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 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 \u0060examples/cube-sat-pysim/main.py:216\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/cube-sat-pysim/main.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"f63de004319c192e5005123f2c33e3b72fbeee81a616fac266dbd585fcf7c6f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): libs/nox-py/python/elodin/__init__.py:225-238 | libs/nox-py/python/elodin/__init__.py:268-279 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"libs/nox-py/python/elodin/__init__.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ee4e34db3a1a7437171b1f742b998efdd7b0b4ebdf57156957a7247f469af2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/nox-py/python/elodin/__init__.py:248-261 | libs/nox-py/python/elodin/__init__.py:309-322 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/python/elodin/__init__.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"e121cb9e6f679db2f40d417b4c75bf1cbed0f657686fbb7111077377ae7931e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): libs/nox-py/python/elodin/__init__.py:371-379 | libs/nox-py/python/elodin/__init__.py:393-401 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060libs/nox-py/python/elodin/__init__.py:390\u0060 calls \u0060semantics\u0060 and \u0060libs/nox-py/python/elodin/__init__.py:370\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":"libs/nox-py/python/elodin/__init__.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a898e8f7c3a570542df1eb9f6966b26e48964f22cb9ac6fb49642404b699c94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): examples/cube-sat-pysim/main.py:172-178 | examples/cube-sat/main.py:193-199 | fsw/roci/adcs/reference-impls/mekf.py:12-18 \u2014 \u0060examples/cube-sat-pysim/main.py\u0060 and \u0060examples/cube-sat/main.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/cube-sat-pysim/main.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc80e57156501268dca5e0bae686e35a8477f7be4555adb0f521158b6472720e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): examples/cube-sat-pysim/main.py:197-201 | examples/cube-sat/main.py:218-222 | fsw/roci/adcs/reference-impls/mekf.py:31-35 \u2014 \u0060examples/cube-sat-pysim/main.py\u0060 and \u0060examples/cube-sat/main.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 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":"examples/cube-sat-pysim/main.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfee41da48d34192a2b842a35e2525f2b68982dc7f632b433111b71ee3952e80"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): libs/nox-py/python/elodin/monte_carlo/quickstart.py:75-81 | libs/nox-py/python/elodin/monte_carlo/template.py:13-19 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/python/elodin/monte_carlo/quickstart.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf2ae50791471cb6e5285cff7fbced6d245edb961a7f9d1016e43ab271dc105"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (3 members, 14 shared lines): examples/logstream/main.py:64-87 | examples/sensor-camera/main.py:69-91 | examples/video-stream/main.py:91-121 \u2014 These 3 members are variants of one another: a block of 14 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/logstream/main.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"265bbb208f07ad78db8ebed4c8574d2f7a90e4696ada624c558c3bc72b3a0b75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): examples/cube-sat-pysim/main.py:342-354 | examples/cube-sat/main.py:363-375 \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":"examples/cube-sat-pysim/main.py"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0284a4021c1b5bf88b507f901804bcea20788a3d111a1fc241e12f79f270615"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): examples/drone/util.py:80-91 | examples/rocket/main.py:201-213 \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":"examples/drone/util.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b96197f5c61c05fb1ad59d1f0b9bd3590b968df9cff728017733198fd2a110d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): libs/db/tests_query/csv_export_goldie.rs:382-425 | libs/db/tests_query/csv_export_goldie.rs:429-484 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/tests_query/csv_export_goldie.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73f0a5b24092cded145c7f477895476d7d42be5085304d0b7edd3a0e96084e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): examples/crazyflie-edu/analysis/plot_logs.py:40-80 | examples/crazyflie-edu/analysis/plot_logs.py:84-115 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/crazyflie-edu/analysis/plot_logs.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e3c05186ea730c2d9139a8df415d3bd92756db0c553fef7ea3689d99ef42f42"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): examples/cube-sat-pysim/main.py:216-237 | examples/cube-sat/main.py:237-258 \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":"examples/cube-sat-pysim/main.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"483af7bbd56bcd3831ee38953af45fff895dceaf252f51cd671d5dd5d00d195b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): scripts/ci/compare_baseline_csv.py:123-141 | scripts/ci/compare_profile_metrics.py:60-85 \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":"scripts/ci/compare_baseline_csv.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a3fc15fef9e43d8d7514fabbb3690faa6d27410d18b83874a55e09f2fdb61a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): examples/rocket-barrowman/analysis/flight_analysis.py:551-584 | examples/rocket-barrowman/analysis/flight_analysis.py:587-615 \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":"examples/rocket-barrowman/analysis/flight_analysis.py"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"03e6ee550a470c46591b946953d4f276ef454193132afdc2fc1038822f8a6e72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): libs/db/tests_query/csv_export_goldie.rs:184-223 | libs/db/tests_query/prim_types_fixture_goldie.rs:262-295 \u2014 These two members are one piece of code written twice and then edited apart: 34 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/tests_query/csv_export_goldie.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"a622870bfcb91191b94a3600f8cd8639d2aa31951ed00d28bcf5063af49768b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): examples/rocket-barrowman/ui/rocket_visualizer.py:329-356 | examples/rocket-barrowman/ui/rocket_visualizer.py:408-436 \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":"examples/rocket-barrowman/ui/rocket_visualizer.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c45c29a0fb6220d9341ba8f45efa7676e5c6c265a43d2f659ae4d1571fb993"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): examples/linalg/sim.py:194-217 | examples/linalg/sim.py:287-322 \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":"examples/linalg/sim.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcaff8181729ef23b99fa4b1ca51475b40ac04e40bc6220d3887966ecf2767a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): examples/crazyflie-edu/config.py:43-65 | examples/drone/config.py:21-38 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/crazyflie-edu/config.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"85756569c503acc23587db6b466bcd1c7c9154a2b766da5ab8a935914bedce99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (48 corresponding lines): examples/betaflight-sitl/sensors.py:398-445 | examples/betaflight-sitl/sensors.py:449-500 \u2014 These two members are one piece of code written twice and then edited apart: 48 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/betaflight-sitl/sensors.py"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1773c55e361d6b8c0705e3965258ff8d393c71a3cf5c7684f5e562422d5aba2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): examples/rocket-barrowman/core/environment/weather_fetcher.py:56-129 | examples/rocket-barrowman/core/environment/weather_fetcher.py:137-189 \u2014 These two members are one piece of code written twice and then edited apart: 53 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/core/environment/weather_fetcher.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"1396b2f3cd4171f4ff48173e9a365eb033db30ccdf0eae223cc68e1c6231cb86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): libs/db/tests_query/query_cli_goldie.rs:65-88 | libs/db/tests_query/query_cli_goldie.rs:132-155 \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":"libs/db/tests_query/query_cli_goldie.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0e94e51c4bee6709c65b44153169ded395ea3189759ef9c60dcc174e8034592"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): libs/db/tests_query/rtsp_ingest_export.rs:35-47 | libs/db/tests_query/sensor_camera_export.rs:39-50 \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":"libs/db/tests_query/rtsp_ingest_export.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2df803d0869252e202315cf8d2e878cee22f0ab7d91da65824882cfc36d243d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): examples/three-body/main.py:84-99 | examples/voyager/main.py:294-308 \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":"examples/three-body/main.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c4f7456dc45b3e0f82195a9da5ab20577ef7444d94906dd743945d144ac1b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): examples/apollo-lander/main.py:51-59 | examples/monte-carlo/main.py:24-30 \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":"examples/apollo-lander/main.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f2675ae9fd9a7213f153d406ce4f2c4636c1f1d66383b138c496efd1dda665"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): examples/betaflight-sitl/controls.py:110-117 | examples/betaflight-sitl/course.py:53-66 | examples/betaflight-sitl/guidance.py:278-283 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/betaflight-sitl/controls.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"17f4a943bb5ad9c948e152f897d942af0bb1b30e7ec9dd04160c4861d435054b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): examples/rocket-barrowman/solvers/barrowman/flight_solver.py:268-273 | examples/rocket-barrowman/solvers/barrowman/flight_solver.py:276-281 \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":"examples/rocket-barrowman/solvers/barrowman/flight_solver.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fe3457a391b3a0a02049fb4a243d7c080d470fac23ff942819d8d70de282f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): examples/ball/sim.py:41-46 | examples/ball/sim_ned.py:43-48 \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":"examples/ball/sim.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"786087b1ff950488d07545154e406ffc8066eb96f779a3c2803570f19926eed1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): examples/drone/sensors.py:146-152 | examples/drone/sensors.py:163-169 \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":"examples/drone/sensors.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"af286bfcbd57e81b522a9309ab2fd2f42ac352e1e8840770d2c048aac3f2cd4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): examples/falcon9/sim.py:1239-1245 | examples/falcon9/sim.py:1249-1255 | examples/falcon9/visual_check.py:116-121 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/falcon9/sim.py"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"05bed50719fed9ae9795699d62b01973668b9ad0e145960171098c8e8ff21548"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): examples/cube-sat-pysim/main.py:451-454 | examples/cube-sat/main.py:472-475 \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":"examples/cube-sat-pysim/main.py"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bcc338afa9f3956a426ef5c5941d1738405651179a03f4e4fee1dda44cf9835"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): examples/betaflight-sitl/controls.py:53-59 | examples/betaflight-sitl/guidance.py:203-209 \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":"examples/betaflight-sitl/controls.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e342e2cfe1f92e9cc4a4342e4b1caf9578aa4f1fd21b4c2985ecd13eb0c9c4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): examples/apollo-lander/reference.py:179-188 | examples/apollo-lander/reference.py:192-202 \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":"examples/apollo-lander/reference.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7168fe1f48787c1ecfd1dc4335099c7f1d28d7ea8f6c901d0a09833399bb23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): examples/cube-sat-pysim/main.py:160-162 | examples/cube-sat/main.py:181-183 \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":"examples/cube-sat-pysim/main.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b45bf6e4f6a6111cce284f8e05eace0159fc9bbf392c265479aa47c9b76831"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): examples/betaflight-sitl/comms.py:392-409 | examples/betaflight-sitl/comms.py:412-425 \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":"examples/betaflight-sitl/comms.py"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d653ab7b44fd9de8839ad6d2db453b18c6ddebd22b879ad30c5dae04bf5663b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): examples/falcon9/reference.py:43-49 | examples/falcon9/reference.py:53-59 \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":"examples/falcon9/reference.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0ab300b429de9825f3ad9addf1743bd328a21841567e6b493694c8848182cd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): examples/rocket-barrowman/core/components/protuberance_aero.py:288-320 | examples/rocket-barrowman/core/components/protuberance_aero.py:442-466 \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":"examples/rocket-barrowman/core/components/protuberance_aero.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"677d34e3b28732d7505560c54e58a18176b6c46832039c949b910a10976f8026"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): examples/betaflight-sitl/vision.py:428-445 | examples/betaflight-sitl/vision.py:456-470 \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":"examples/betaflight-sitl/vision.py"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a5c941307eb4e57ff5aee90a4040ee5b3ac3671711b08103019c84391493bbb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): examples/cube-sat-pysim/main.py:153-155 | examples/cube-sat/main.py:174-176 \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":"examples/cube-sat-pysim/main.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f13721e48ec25830c657621cd3379d8ae95fff41e88eb2b22054a4580e2ca1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 5\u002B corresponding lines): examples/betaflight-sitl/comms.py:150-157 | examples/betaflight-sitl/comms.py:181-185 | examples/betaflight-sitl/comms.py:213-220 | examples/crazyflie-edu/main.py:156-162 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 5 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/betaflight-sitl/comms.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e73211fd7eb1d5934226d1a84f3180d23ed91dc89e4f342887715b769613a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): examples/rocket-barrowman/optimization/ai_rocket_builder.py:136-147 | examples/rocket-barrowman/optimization/ai_rocket_optimizer.py:213-224 \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":"examples/rocket-barrowman/optimization/ai_rocket_builder.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf14bfdc52879b235e0b97f12ad2122a0a6b9939d58b1dc051230d5c01de234"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): examples/logstream/main.py:57-59 | examples/video-stream/main.py:77-86 \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":"examples/logstream/main.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fa419799bde32b0ad19e629bb2aae49537ab78727843f04f52c22ebb57a17b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): examples/rocket-barrowman/core/components/openrocket_aero.py:134-146 | examples/rocket-barrowman/core/components/openrocket_components.py:277-285 \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":"examples/rocket-barrowman/core/components/openrocket_aero.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64ffddba986810208b311631da8d923589346ff1dd849ed8d217bb3c101782b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): examples/cube-sat-pysim/main.py:369-372 | examples/cube-sat/main.py:390-393 \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":"examples/cube-sat-pysim/main.py"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"3578e4e46a406372bf75f1d12660c3b87e24cb4d024f4c9b9cef647ff9ea12a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): examples/apollo-lander/hooks/mc_metrics.py:74-82 | examples/falcon9/hooks/mc_metrics.py:140-143 \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":"examples/apollo-lander/hooks/mc_metrics.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"64bd0ce8fb51da7dbaa694415f2d5fddd4551147fbf999716dcad44e690c20b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): examples/betaflight-sitl/sensors.py:75-80 | examples/drone/sensors.py:95-98 \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":"examples/betaflight-sitl/sensors.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8ebc430e016f0beb1abfadfc40dcff5bd0e6241915259909aad39db852da75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): examples/betaflight-sitl/sensors.py:83-88 | examples/drone/sensors.py:101-104 \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":"examples/betaflight-sitl/sensors.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8fb6af68c7502529ed8fafded6b2b7d3e66f3028fa910e3a175aed0ed49509"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): examples/voyager/chapter1.py:9-13 | examples/voyager/chapter2.py:10-14 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/voyager/chapter1.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6b26f27bc9962fcba99a7ebac79ce7d223cff15393b4e9eee3630b2332e136"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): examples/logstream/main.py:92-95 | examples/video-stream/main.py:126-138 \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":"examples/logstream/main.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08a72eb7390a2a9814af36770a9062830f611d28dda09c2133f36e97dfa1222"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): examples/betaflight-sitl/vision.py:231-232 | examples/rocket-barrowman/solvers/barrowman/math_utils.py:82-87 \u2014 These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/betaflight-sitl/vision.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"8292570ce071b5d34d210d1bf6cdbbac24ec21a11f3dfee1a3c2f46b64298b7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): examples/ball/sim.py:18-28 | examples/ball/sim_ned.py:20-30 \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":"examples/ball/sim.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"de90c23bf46ce50f369b63feda57662b1b7b268442eb293df43b942699e8c2d7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (2 corresponding lines): examples/rc-jet/visual_check.py:102-103 | scripts/boson_ref/lwir_maneuver_sim.py:117-118 \u2014 These two members are one piece of code written twice and then edited apart: 2 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rc-jet/visual_check.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"518ac0be7c89d33e843f366c1262b50969c4b73fd7b21157dbd6c03900110a38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): examples/betaflight-sitl/guidance.py:287-287 | examples/betaflight-sitl/hold_referee.py:19-19 \u2014 These two members are one piece of code written twice and then edited apart: 1 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/betaflight-sitl/guidance.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c537b95981034d0da02356e0e47f721cbd7dd4d5ed0613d3c1317d373157b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/db/tests_query/csv_export_goldie.rs:310-323 | libs/db/tests_query/mcap_export.rs:49-62 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/tests_query/csv_export_goldie.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"efdb7501b78e0e33aacdf1b8f7b860c17387224a23639ae681d38d1a63433f59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): libs/db/tests_query/csv_export_goldie.rs:414-425 | libs/db/tests_query/csv_export_goldie.rs:471-484 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/tests_query/csv_export_goldie.rs:414\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":"libs/db/tests_query/csv_export_goldie.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c76e2af9f8d43b472e2ce7a0716d7d6976aacea9f5dbc5635dd4aa7820af2c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): libs/db/tests_query/query_cli_goldie.rs:75-88 | libs/db/tests_query/query_cli_goldie.rs:142-155 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/tests_query/query_cli_goldie.rs:75\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/tests_query/query_cli_goldie.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd3691d3a31a48f4b1e7476983043b35f8ff616646da96522ffd1e7ef97f4c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): libs/db/tests_query/rtsp_ingest_export.rs:51-62 | libs/db/tests_query/sensor_camera_export.rs:53-64 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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":"libs/db/tests_query/rtsp_ingest_export.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0ecfce78dc5ebf60b4f42df4a28f11d5fa03e7ac005e9a7a7fef10b034eb67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (99\u2013100 lines \u00D7 2): examples/rocket-barrowman/optimization/ai_rocket_builder.py:609-707 | examples/rocket-barrowman/optimization/ai_rocket_builder.py:784-883 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/optimization/ai_rocket_builder.py"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fb4a7fac676704938775858352518536bbe4c9ad31f7ba1c88b8d95009358f5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46\u201375 lines \u00D7 2): examples/rocket-barrowman/optimization/ai_rocket_builder.py:179-253 | examples/rocket-barrowman/optimization/ai_rocket_optimizer.py:276-321 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/optimization/ai_rocket_builder.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66045b0073115c296590dd3376d685e05be28c84bc339ed3476eceaa34641b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (59\u201369 lines \u00D7 2): examples/betaflight-sitl/comms.py:459-517 | examples/betaflight-sitl/comms.py:806-874 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/betaflight-sitl/comms.py"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7ce98ae820e939ba27006dc69e6e9f274074f7ad1d3d9c336179bfd0529c34"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (48\u201359 lines \u00D7 2): examples/drone/control.py:326-373 | examples/drone/control.py:383-441 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/drone/control.py"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d5b177ba42dc362b5bfc73f2c46b3f7c121b4b9792028c393472d8a985e2fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (41 lines \u00D7 2): examples/rocket-barrowman/ui/app.py:2066-2106 | examples/rocket-barrowman/ui/app.py:2108-2148 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":2066}}}],"partialFingerprints":{"codehealthFindingId/v1":"c644062f44e0a2b3976225009bc046cf9ead94c08344233ecc20d92ef5e8129b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): examples/rocket-barrowman/core/environment/weather_fetcher.py:93-129 | examples/rocket-barrowman/core/environment/weather_fetcher.py:153-189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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":"examples/rocket-barrowman/core/environment/weather_fetcher.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d13753ba0bc013e8641400f82461c4a19ee9f08dec238b14cffe9fca2ab9c70"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (34 lines \u00D7 6): examples/geo-frames/schematic.py:119-156 | examples/geo-frames/schematic.py:164-197 | examples/geo-frames/schematic.py:205-238 | examples/geo-frames/schematic.py:246-279 | examples/geo-frames/schematic.py:287-320 | examples/geo-frames/schematic.py:328-361 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/geo-frames/schematic.py: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/geo-frames/schematic.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"233b7223f210ab5097ac4edcdabb7b637d9821c2fb7d9efd0ba5ebfecba3da2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 3): examples/rocket-barrowman/ui/app.py:3127-3155 | examples/rocket-barrowman/ui/app.py:3167-3195 | examples/rocket-barrowman/ui/app.py:3227-3255 \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 \u0060examples/rocket-barrowman/ui/app.py:3127\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":3127}}}],"partialFingerprints":{"codehealthFindingId/v1":"675104bf4a1838b0ecf941e03d4fbe33ef3564d181affcab4799f946d6b48ccd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201327 lines \u00D7 2): examples/rocket-barrowman/ui/app.py:2271-2297 | examples/rocket-barrowman/ui/app.py:2447-2471 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rocket-barrowman/ui/app.py:2271\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":2271}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a9ed1d9c4013b427f6a723b38f92494b1722343e1b56dc1aa50ee3f19cc5b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): examples/rocket-barrowman/ui/app.py:2358-2384 | examples/rocket-barrowman/ui/app.py:2494-2520 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rocket-barrowman/ui/app.py:2358\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":2358}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e06d7e02b8d71af9ec3169410aa071a897ffddd81f1bc698205d64f9e5dea99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): examples/rocket-barrowman/core/data/motor_scraper.py:145-170 | examples/rocket-barrowman/core/data/motor_scraper.py:583-608 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/core/data/motor_scraper.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"9196b54a897ddd0a366bdcb635f92066a08c01eb27c9684022c335d0ea2b070a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): examples/rocket-barrowman/optimization/smart_optimizer.py:1226-1249 | examples/rocket-barrowman/optimization/smart_optimizer.py:1344-1367 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/optimization/smart_optimizer.py"},"region":{"startLine":1226}}}],"partialFingerprints":{"codehealthFindingId/v1":"11106096142b4b27179c9f4757f382daa706595fec1f81519937578162cfdfdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): examples/cube-sat-pysim/main.py:425-446 | examples/cube-sat/main.py:446-467 \u2014 \u0060examples/cube-sat-pysim/main.py\u0060 and \u0060examples/cube-sat/main.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/cube-sat-pysim/main.py"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78cf94e8f602259766acce6faf2c98669b93f8e546b2ca8dc3c0d39b631847c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201322 lines \u00D7 2): examples/rocket-barrowman/optimization/smart_optimizer.py:1178-1199 | examples/rocket-barrowman/optimization/smart_optimizer.py:1314-1331 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/optimization/smart_optimizer.py"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca245c51cca0fa24c75b07f0baa32ddd46319ba005d21b1bdedf4ddb0dc9aea6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): examples/rocket-barrowman/ui/app.py:1948-1967 | examples/rocket-barrowman/ui/app.py:2722-2743 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/rocket-barrowman/ui/app.py:2720\u0060 calls \u0060columns\u0060 and \u0060examples/rocket-barrowman/ui/app.py:1947\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":1948}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1ac12ae39666173c26fee33bef75055a079bd7671097c3e52140d7e84627ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): examples/rocket-barrowman/ui/rocket_renderer.py:268-289 | examples/rocket-barrowman/ui/rocket_renderer.py:295-316 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/rocket_renderer.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"43817202cc88655a7e03a1f5126780f4db0a9f5a22ede94c4b43da2afff69e9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 6): examples/rocket-barrowman/ui/app.py:2254-2274 | examples/rocket-barrowman/ui/app.py:2302-2322 | examples/rocket-barrowman/ui/app.py:2430-2450 | examples/rocket-barrowman/ui/app.py:2768-2788 | examples/rocket-barrowman/ui/app.py:2803-2823 | examples/rocket-barrowman/ui/app.py:2839-2859 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rocket-barrowman/ui/app.py:2254\u0060 it does not close everything it opens, so those exact 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, \u0060examples/rocket-barrowman/ui/app.py:2426\u0060 calls \u0060columns\u0060 and \u0060examples/rocket-barrowman/ui/app.py:2838\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":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":2254}}}],"partialFingerprints":{"codehealthFindingId/v1":"92409beec2d00a80dfb1f1fcc7f6f3ccaa41653ace7881774f7b39cbc4d28a3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): examples/cube-sat-pysim/main.py:249-269 | examples/cube-sat/main.py:270-290 \u2014 \u0060examples/cube-sat-pysim/main.py\u0060 and \u0060examples/cube-sat/main.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/cube-sat-pysim/main.py"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"f111418ebe0281ae795e3534b104d39971f7483f177b8d32fca628fd7a9a1a77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): examples/geo-frames/schematic.py:14-34 | examples/geo-frames/schematic.py:35-55 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060examples/geo-frames/schematic.py:57\u0060 calls \u0060tabs\u0060 and \u0060examples/geo-frames/schematic.py:35\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":"examples/geo-frames/schematic.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f6f586b163cc50989507521912ecb53be34c234a52527a77cb436cf3322b9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 9): examples/geo-frames/schematic.py:107-126 | examples/geo-frames/schematic.py:152-171 | examples/geo-frames/schematic.py:193-212 | examples/geo-frames/schematic.py:234-253 | examples/geo-frames/schematic.py:275-294 | examples/geo-frames/schematic.py:316-335 | examples/geo-frames/schematic.py:357-376 | examples/geo-frames/schematic.py:398-417 | examples/geo-frames/schematic.py:438-457 \u2014 all 9 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/geo-frames/schematic.py:107\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/geo-frames/schematic.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c4a700546804d3dfdb2148b03ed321040744b2a802e1e72bd4a2f05ba4cd13d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 4): examples/rocket-barrowman/ui/app.py:2341-2360 | examples/rocket-barrowman/ui/app.py:2389-2408 | examples/rocket-barrowman/ui/app.py:2477-2496 | examples/rocket-barrowman/ui/app.py:2586-2605 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rocket-barrowman/ui/app.py:2341\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":2341}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ca8d666cbdb8411e0afffe4faa99ac4132ced0cac2e0c0f8e9949a82d7cdbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): examples/crazyflie-edu/main.py:603-622 | examples/crazyflie-edu/main.py:729-748 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/crazyflie-edu/main.py"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d9fbbbb77b515477d337415ef2485ac07d91d86abaf4e66b9d21433d2d05e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): examples/rocket-barrowman/ui/rocket_visualizer.py:217-236 | examples/rocket-barrowman/ui/rocket_visualizer.py:243-262 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/rocket_visualizer.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8026f0c40f1a10a322a675446a34eb4f22fb188d25783a48d083ea2efc9916"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): examples/drone/analysis/estimate_indi_gains.py:24-42 | examples/drone/filter.py:31-49 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"examples/drone/analysis/estimate_indi_gains.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab0f7b492c3f5db1e786126180b4835627bf4ae3078fc372b50fda8b92348eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201318 lines \u00D7 6): examples/rocket-barrowman/ui/app.py:1494-1507 | examples/rocket-barrowman/ui/app.py:1580-1593 | examples/rocket-barrowman/ui/app.py:1698-1711 | examples/rocket-barrowman/ui/app.py:1744-1759 | examples/rocket-barrowman/ui/app.py:2740-2755 | examples/rocket-barrowman/ui/app.py:3328-3345 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rocket-barrowman/ui/app.py:1494\u0060 it begins part-way through the construct above it, so those exact 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, \u0060examples/rocket-barrowman/ui/app.py:1578\u0060 calls \u0060add_hline\u0060 and \u0060examples/rocket-barrowman/ui/app.py:2739\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":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":1494}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbc9ce0d2c0c7c27dd949dd99b52405bbf149f9cd206084b195b6056cfff62b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201318 lines \u00D7 4): examples/rocket-barrowman/analysis/flight_analysis.py:382-399 | examples/rocket-barrowman/analysis/flight_analysis.py:415-428 | examples/rocket-barrowman/analysis/flight_analysis.py:481-497 | examples/rocket-barrowman/analysis/flight_analysis.py:511-521 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rocket-barrowman/analysis/flight_analysis.py:382\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/analysis/flight_analysis.py"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b644ac299f948dc568b9431e9e22bd7efdb05b42a59ba1387256c4db002b4f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 6): examples/rocket-barrowman/ui/app.py:1591-1607 | examples/rocket-barrowman/ui/app.py:1816-1830 | examples/rocket-barrowman/ui/app.py:1840-1854 | examples/rocket-barrowman/ui/app.py:1862-1876 | examples/rocket-barrowman/ui/app.py:1886-1902 | examples/rocket-barrowman/ui/app.py:1910-1926 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rocket-barrowman/ui/app.py:1591\u0060 it begins part-way through the construct above it, so those exact 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, \u0060examples/rocket-barrowman/ui/app.py:1611\u0060 calls \u0060columns\u0060 and \u0060examples/rocket-barrowman/ui/app.py:1857\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":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":1591}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8a015137191a87e66bfa05932fb3cf115168c2767571c4ba216283dcbcc2a91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201317 lines \u00D7 4): examples/rocket-barrowman/ui/app.py:1718-1729 | examples/rocket-barrowman/ui/app.py:2514-2530 | examples/rocket-barrowman/ui/app.py:2757-2771 | examples/rocket-barrowman/ui/app.py:2866-2880 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rocket-barrowman/ui/app.py:1718\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":1718}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d8b78069f1441bd59efb007e897c42836958d86a718ebc860656d7b1e95f6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 4): examples/rocket-barrowman/ui/app.py:1797-1813 | examples/rocket-barrowman/ui/app.py:2737-2750 | examples/rocket-barrowman/ui/app.py:2792-2805 | examples/rocket-barrowman/ui/app.py:3325-3340 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rocket-barrowman/ui/app.py:1797\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":1797}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc73d10a19fc4b6c4ceb970af8428969616612b38f000a42966811aa857a3025"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): examples/rocket-barrowman/ui/rocket_visualizer.py:107-123 | examples/rocket-barrowman/ui/rocket_visualizer.py:130-146 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/rocket_visualizer.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"9538ff11ce3e83227b0f8c7dcd4aed4cd18d5b0a218279828d63008fec19e140"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201316 lines \u00D7 6): examples/rocket-barrowman/ui/app.py:1957-1969 | examples/rocket-barrowman/ui/app.py:2731-2745 | examples/rocket-barrowman/ui/app.py:2749-2762 | examples/rocket-barrowman/ui/app.py:3320-3335 | examples/rocket-barrowman/ui/app.py:3339-3354 | examples/rocket-barrowman/ui/app.py:3357-3372 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rocket-barrowman/ui/app.py:1957\u0060 it begins part-way through the construct above it, so those exact 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, \u0060examples/rocket-barrowman/ui/app.py:2765\u0060 calls \u0060markdown\u0060, \u0060columns\u0060 and \u0060examples/rocket-barrowman/ui/app.py:2747\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":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":1957}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3c94afe8b810c40be9f2a5eff3c5df3d480e53719f4b6039d775a473e7a3b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 3): examples/logstream/main.py:68-81 | examples/sensor-camera/main.py:72-85 | examples/video-stream/main.py:97-112 \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 \u0060examples/logstream/main.py:68\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/logstream/main.py:66\u0060 calls \u0060angular\u0060 and \u0060examples/sensor-camera/main.py:70\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":"examples/logstream/main.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc2300017843503c060c814ce9c4923e0b164f10dc8629efbf29a7afc25212a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 3): examples/rocket-barrowman/ui/app.py:1680-1693 | examples/rocket-barrowman/ui/app.py:1704-1717 | examples/rocket-barrowman/ui/app.py:2173-2188 \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 \u0060examples/rocket-barrowman/ui/app.py:1680\u0060 it does not close everything it opens, so those exact 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":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":1680}}}],"partialFingerprints":{"codehealthFindingId/v1":"408d909f9f5503bdca47fec74173fddffbf32a165a751bec86488a35bcaa04d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): examples/rocket-barrowman/ui/rocket_renderer.py:74-89 | examples/rocket-barrowman/ui/rocket_renderer.py:133-147 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/rocket_renderer.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a503992c60aed7fe29be7e7e85619664bbe7353539ae482a940ac78ab9aff22d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 5): examples/rocket-barrowman/ui/app.py:2412-2425 | examples/rocket-barrowman/ui/app.py:2753-2765 | examples/rocket-barrowman/ui/app.py:2826-2838 | examples/rocket-barrowman/ui/app.py:2862-2874 | examples/rocket-barrowman/ui/app.py:3253-3267 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rocket-barrowman/ui/app.py:2412\u0060 it begins part-way through the construct above it, so those exact 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, \u0060examples/rocket-barrowman/ui/app.py:2426\u0060 calls \u0060columns\u0060 and \u0060examples/rocket-barrowman/ui/app.py:2839\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":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":2412}}}],"partialFingerprints":{"codehealthFindingId/v1":"252777fa4a9ab68e5ec654c6c98926a44de71dc3dd15efb7bd585d5d09d2edb7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 3): examples/rocket-barrowman/ui/app.py:1826-1838 | examples/rocket-barrowman/ui/app.py:1872-1884 | examples/rocket-barrowman/ui/app.py:3158-3172 \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 \u0060examples/rocket-barrowman/ui/app.py:1826\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"d866b51d37add931e0c9391af82f6dbd42ed70aff78c20fac877e381367a21bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): examples/apollo-lander/hooks/report.py:57-71 | examples/apollo-lander/hooks/report.py:79-91 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/apollo-lander/hooks/report.py:79\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/apollo-lander/hooks/report.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"e837c79cfcd882f2052d7dc1d8346b2c34bc2c3f08a6965776443e25c607048c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): examples/rocket-barrowman/ui/app.py:3444-3458 | examples/rocket-barrowman/ui/app.py:3461-3475 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rocket-barrowman/ui/app.py:3444\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":3444}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6363cda71e66e58465cff7db827492fe2ca105f52a071d4e4c1bf4ff4398f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 8): examples/rocket-barrowman/ui/app.py:1505-1516 | examples/rocket-barrowman/ui/app.py:1934-1943 | examples/rocket-barrowman/ui/app.py:2627-2640 | examples/rocket-barrowman/ui/app.py:3134-3145 | examples/rocket-barrowman/ui/app.py:3153-3164 | examples/rocket-barrowman/ui/app.py:3174-3185 | examples/rocket-barrowman/ui/app.py:3193-3206 | examples/rocket-barrowman/ui/app.py:3234-3245 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rocket-barrowman/ui/app.py:1505\u0060 it begins part-way through the construct above it, so those exact 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, \u0060examples/rocket-barrowman/ui/app.py:3167\u0060 calls \u0060columns\u0060 and \u0060examples/rocket-barrowman/ui/app.py:3147\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":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"becc51fd55801b5dbe6c37ec150f0f58a77154ddbacd8c896d8433920368d3fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 6): examples/rocket-barrowman/ui/app.py:1636-1647 | examples/rocket-barrowman/ui/app.py:1796-1809 | examples/rocket-barrowman/ui/app.py:2325-2338 | examples/rocket-barrowman/ui/app.py:2736-2747 | examples/rocket-barrowman/ui/app.py:2791-2802 | examples/rocket-barrowman/ui/app.py:3324-3337 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rocket-barrowman/ui/app.py:1636\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":1636}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de8cd85cf20001e9a0c44c71333dcdf3be08ade72bcec53ef766fc4f63bfaf6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): examples/rocket-barrowman/analysis/flight_analysis.py:376-389 | examples/rocket-barrowman/analysis/flight_analysis.py:460-473 | examples/rocket-barrowman/analysis/flight_analysis.py:475-488 \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":"examples/rocket-barrowman/analysis/flight_analysis.py"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb918ca3cedc17dac7a3a3ec0b3de4d86673e8578b48cd114908f085aee47dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 3): examples/rocket-barrowman/ui/app.py:1568-1579 | examples/rocket-barrowman/ui/app.py:1654-1667 | examples/rocket-barrowman/ui/app.py:1752-1765 \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 \u0060examples/rocket-barrowman/ui/app.py:1568\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/rocket-barrowman/ui/app.py:1566\u0060 calls \u0060columns\u0060 and \u0060examples/rocket-barrowman/ui/app.py:1749\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":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":1568}}}],"partialFingerprints":{"codehealthFindingId/v1":"07d82e23d2462710ed1b6ba7583c5582117cc77e9c3c3779b8c9345b32060922"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): examples/ball/sim.py:76-89 | examples/ball/sim_ned.py:78-91 \u2014 before extracting anything, compare \u0060examples/ball/sim.py\u0060 and \u0060examples/ball/sim_ned.py\u0060 as WHOLE FILES: 90% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/ball/sim.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4d84b484f17ee6f11301fd8d2500f5051d194bb47ca7508fcf78c5701925ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): examples/rocket-barrowman/optimization/ai_rocket_builder.py:914-927 | examples/rocket-barrowman/optimization/ai_rocket_builder.py:932-943 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/optimization/ai_rocket_builder.py"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"16c1ab68f9c6ac45070a9490cb35410c8ac80a1bac723cd81a8ec499df49ee82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): examples/rocket-barrowman/ui/rocket_visualizer.py:61-74 | examples/rocket-barrowman/ui/rocket_visualizer.py:152-165 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/rocket-barrowman/ui/rocket_visualizer.py:149\u0060 calls \u0060get\u0060 and \u0060examples/rocket-barrowman/ui/rocket_visualizer.py:58\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":"examples/rocket-barrowman/ui/rocket_visualizer.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"453932f8de168856963a5c971e36033960a7d545236cb5f20c56050203f88949"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 5): examples/rocket-barrowman/ui/app.py:1469-1481 | examples/rocket-barrowman/ui/app.py:1499-1511 | examples/rocket-barrowman/ui/app.py:1679-1691 | examples/rocket-barrowman/ui/app.py:1703-1715 | examples/rocket-barrowman/ui/app.py:1725-1737 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/rocket-barrowman/ui/app.py:1677\u0060 calls \u0060markdown\u0060, \u0060columns\u0060 and \u0060examples/rocket-barrowman/ui/app.py:1497\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":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d83c79fa0bd4362b675cd411cc842b5b3193308e5c124d946770aea34150c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): examples/rocket-barrowman/ui/app.py:2739-2751 | examples/rocket-barrowman/ui/app.py:2794-2806 | examples/rocket-barrowman/ui/app.py:2903-2916 | examples/rocket-barrowman/ui/app.py:3327-3341 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rocket-barrowman/ui/app.py:2739\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":2739}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9a27fd27b882c0cf54ff67fbba93a915cb8c698a9443bc752c5e91134485c4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 7): examples/rocket-barrowman/ui/app.py:1591-1602 | examples/rocket-barrowman/ui/app.py:1816-1827 | examples/rocket-barrowman/ui/app.py:1840-1851 | examples/rocket-barrowman/ui/app.py:1862-1873 | examples/rocket-barrowman/ui/app.py:1886-1897 | examples/rocket-barrowman/ui/app.py:1910-1921 | examples/rocket-barrowman/ui/app.py:2918-2929 \u2014 all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rocket-barrowman/ui/app.py:1591\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":1591}}}],"partialFingerprints":{"codehealthFindingId/v1":"5494a9282da414ed4002e73fd51acc42e45919ada3018ac22c76d2d74334d550"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 6): examples/rocket-barrowman/ui/app.py:1849-1860 | examples/rocket-barrowman/ui/app.py:1895-1908 | examples/rocket-barrowman/ui/app.py:2739-2751 | examples/rocket-barrowman/ui/app.py:2794-2806 | examples/rocket-barrowman/ui/app.py:2903-2916 | examples/rocket-barrowman/ui/app.py:3327-3341 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rocket-barrowman/ui/app.py:1849\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":1849}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6784f5bd51e8f492f072db3df6b6dfc6ec618ae468f64b2ac7142a0837b3249"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 6): examples/rocket-barrowman/ui/app.py:2287-2298 | examples/rocket-barrowman/ui/app.py:2374-2385 | examples/rocket-barrowman/ui/app.py:2463-2472 | examples/rocket-barrowman/ui/app.py:2510-2521 | examples/rocket-barrowman/ui/app.py:2572-2583 | examples/rocket-barrowman/ui/app.py:2900-2909 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rocket-barrowman/ui/app.py:2287\u0060 it begins part-way through the construct above it, so those exact 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, \u0060examples/rocket-barrowman/ui/app.py:2524\u0060 calls \u0060columns\u0060 and \u0060examples/rocket-barrowman/ui/app.py:2586\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":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":2287}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6f722668b87adab3273edbfc12b41e0787efc99f458fe2bcf906715ab8daed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): examples/falcon9/visual_check.py:184-195 | examples/falcon9/visual_check.py:215-226 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/falcon9/visual_check.py:213\u0060 calls \u0060asarray\u0060 and \u0060examples/falcon9/visual_check.py:182\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":"examples/falcon9/visual_check.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"8915f91fb7da04b0586b1bcd2cc71f57538af4390cb533e6d91ec151a6292381"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): examples/frames/main.py:40-51 | examples/frames/main.py:278-289 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/frames/main.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c388e114357d64e4e0f28829cbfc6d8bfc7e45f326c81426014267b9ed1ce62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): examples/rocket-barrowman/ui/app.py:3455-3466 | examples/rocket-barrowman/ui/app.py:3632-3643 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rocket-barrowman/ui/app.py:3455\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":3455}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0daff3234c4e3eae610d17fe26e9a321781cfceaa768268ca41be55ca32c9e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): examples/rocket-barrowman/ui/rocket_renderer.py:567-576 | examples/rocket-barrowman/ui/rocket_visualizer.py:457-468 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060motor\u0060 to \u0060Optional[Dict[str, Any]] = None\u0060 in one and \u0060Optional[Dict] = None\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/rocket-barrowman/ui/rocket_renderer.py:565\u0060 calls \u0060get\u0060 and \u0060examples/rocket-barrowman/ui/rocket_visualizer.py:456\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":"examples/rocket-barrowman/ui/rocket_renderer.py"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"57817467fad5e6e4f399779607570c4934f4baa869dece831eedc77cf515990d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 9): examples/rocket-barrowman/ui/app.py:1850-1860 | examples/rocket-barrowman/ui/app.py:1896-1908 | examples/rocket-barrowman/ui/app.py:2739-2751 | examples/rocket-barrowman/ui/app.py:2794-2806 | examples/rocket-barrowman/ui/app.py:2903-2916 | examples/rocket-barrowman/ui/app.py:3139-3151 | examples/rocket-barrowman/ui/app.py:3179-3191 | examples/rocket-barrowman/ui/app.py:3239-3251 | examples/rocket-barrowman/ui/app.py:3327-3341 \u2014 all 9 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rocket-barrowman/ui/app.py:1850\u0060 it begins part-way through the construct above it, so those exact 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, \u0060examples/rocket-barrowman/ui/app.py:2902\u0060 calls \u0060dict\u0060 and \u0060examples/rocket-barrowman/ui/app.py:3138\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":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":1850}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b221cae2dc3acacb5673246a307e1856ea41c497310c56f668b9773bc6fea47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): examples/betaflight-sitl/config.py:335-345 | examples/betaflight-sitl/config.py:349-359 | examples/betaflight-sitl/config.py:363-373 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. 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":"examples/betaflight-sitl/config.py"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f96ea75dfbc58fcc667756a8ceb3d4b7ae80c2acb06dcee73d7742bc0e0fa60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): examples/betaflight-sitl/comms.py:541-551 | examples/betaflight-sitl/comms.py:877-886 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/betaflight-sitl/comms.py"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"f15b9432e315ba8509b700764654d5182a65a4954fef207daf4882009ed4bbbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201311 lines \u00D7 3): examples/crazyflie-edu/config.py:245-248 | examples/cube-sat-pysim/main.py:342-352 | examples/cube-sat/main.py:363-373 \u2014 \u0060examples/cube-sat-pysim/main.py\u0060 and \u0060examples/cube-sat/main.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 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. 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":"examples/crazyflie-edu/config.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a7999b67071b324d65391eda3fc4a347047f22f7a62c7d1ff52edaa4098d221"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): examples/rocket-barrowman/analysis/flight_analysis.py:315-325 | examples/rocket-barrowman/analysis/flight_analysis.py:443-452 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/analysis/flight_analysis.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"da873c1aba8e09769e7b342f1a826ea19a8af39a05a5536d00e21124cd22a89c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/db/examples/grpc_full_api_demo.py:116-126 | libs/db/examples/grpc_gse_client.py:137-147 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060libs/db/examples/grpc_full_api_demo.py:116\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/examples/grpc_full_api_demo.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e1bf09bdd49d68162582e729146f2686c906df82d5e886023b9e9548ed5185"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): libs/db/examples/grpc_full_api_demo.py:152-162 | libs/db/examples/grpc_gse_client.py:171-181 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060libs/db/examples/grpc_full_api_demo.py:152\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/examples/grpc_full_api_demo.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"34af47bfa207fbcb90518eef1b431d4416f9b70332b6d3d288319081a9e7b986"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 6): examples/rocket-barrowman/ui/app.py:1468-1477 | examples/rocket-barrowman/ui/app.py:1566-1575 | examples/rocket-barrowman/ui/app.py:1678-1687 | examples/rocket-barrowman/ui/app.py:1724-1733 | examples/rocket-barrowman/ui/app.py:2720-2729 | examples/rocket-barrowman/ui/app.py:3317-3326 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rocket-barrowman/ui/app.py:1468\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":1468}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7bb0ec84bcdb2db52cc5736242fa8be4cea0ebcbc7c38c829a86090ad0fa0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): examples/rocket-barrowman/analysis/flight_analysis.py:391-400 | examples/rocket-barrowman/analysis/flight_analysis.py:466-474 | examples/rocket-barrowman/analysis/flight_analysis.py:490-498 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rocket-barrowman/analysis/flight_analysis.py:391\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/analysis/flight_analysis.py"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36f568b36bfdb2d593ff1f48146875e282528d5b69813332537e1d555c40424"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): examples/rocket-barrowman/ui/app.py:1780-1789 | examples/rocket-barrowman/ui/app.py:1833-1842 | examples/rocket-barrowman/ui/app.py:1879-1888 \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 \u0060examples/rocket-barrowman/ui/app.py:1780\u0060 it does not close everything it opens, so those exact 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, \u0060examples/rocket-barrowman/ui/app.py:1778\u0060 calls \u0060markdown\u0060 and \u0060examples/rocket-barrowman/ui/app.py:1830\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":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":1780}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e4130214023cedc10b2e421ebcfa686813ad096f7d176b65d8575ab8208a25"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): examples/drone/util.py:81-89 | examples/rocket/main.py:202-211 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"examples/drone/util.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3c71134d10bbe2e6b14e7df1619fa14eb2a2cb493e61be4a0b88ae7ee90b542"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): examples/rocket-barrowman/optimization/ai_rocket_builder.py:1193-1202 | examples/rocket-barrowman/optimization/ai_rocket_builder.py:1205-1214 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/optimization/ai_rocket_builder.py"},"region":{"startLine":1193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4cfbb807f488a5260abebf3f5b071aec75113e5a2d4da50fa20f3cf517b4dce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): examples/rocket-barrowman/ui/app.py:4991-5000 | examples/rocket-barrowman/ui/app.py:5004-5013 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":4991}}}],"partialFingerprints":{"codehealthFindingId/v1":"12adf6aa453a1f969c26fcfda36ffedd86f26a8e554ef5c5153f99e3d2a02143"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): examples/rocket-barrowman/ui/rocket_renderer.py:251-260 | examples/rocket-barrowman/ui/rocket_visualizer.py:29-37 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/rocket-barrowman/ui/rocket_renderer.py:247\u0060 calls \u0060get\u0060 and \u0060examples/rocket-barrowman/ui/rocket_visualizer.py:26\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/rocket_renderer.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"993aa87e2c6d9132094a725cecf0cbef0c60f5b465070076433e18f360e2c70f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): examples/rocket-barrowman/ui/rocket_renderer.py:460-469 | examples/rocket-barrowman/ui/rocket_renderer.py:475-484 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rocket-barrowman/ui/rocket_renderer.py:460\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/rocket_renderer.py"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3fe8b81b92bc094453c9983e1c9979f2d2e7ecb9de7865a13156e0e93982c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 6): examples/rocket-barrowman/analysis/flight_analysis.py:359-367 | examples/rocket-barrowman/analysis/flight_analysis.py:374-380 | examples/rocket-barrowman/analysis/flight_analysis.py:399-406 | examples/rocket-barrowman/analysis/flight_analysis.py:458-464 | examples/rocket-barrowman/analysis/flight_analysis.py:473-479 | examples/rocket-barrowman/analysis/flight_analysis.py:497-503 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/analysis/flight_analysis.py"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce858eb60ac6aaf3fd76aea48552ff2b91d9e2c3d3a361fc8e6dddb5429d853"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): examples/rocket-barrowman/ui/rocket_renderer.py:559-567 | examples/rocket-barrowman/ui/rocket_visualizer.py:14-29 | examples/rocket-barrowman/ui/rocket_visualizer.py:442-457 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/rocket_renderer.py"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"e705c51acf80e4738dd386276b446d984351d74bd65aa033dda5d52e4d2b782e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): examples/apollo-lander/hooks/report.py:11-19 | examples/monte-carlo/hooks/report.py:18-26 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/apollo-lander/hooks/report.py"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0526572971edf972e258f9b39d5bf2e8990e8e097cc4f45d7a22e52eb4921e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): examples/betaflight-sitl/comms.py:337-346 | examples/betaflight-sitl/comms.py:673-682 \u2014 both copies are in the same file, so extract the block 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":"examples/betaflight-sitl/comms.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de58b5e670fd95fb233b4e1e9ce8316f65a7dedc1d6d4fcb2fe883209cece49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): examples/rocket-barrowman/ui/app.py:4961-4969 | examples/rocket-barrowman/ui/app.py:4980-4988 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":4961}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec34030d71502aa0d34fdd3863bec381a87cad59001bf4340ac9e65977953042"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): examples/three-body/main.py:91-99 | examples/voyager/main.py:300-308 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/three-body/main.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c37bc591b61e0e9d441762bec741d50333575ccbb6812314b08f5028e81e57ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): examples/frames/main.py:44-51 | examples/frames/main.py:65-72 | examples/frames/main.py:282-289 \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 \u0060examples/frames/main.py:44\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/frames/main.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"731875717c653c5e1e7840063139cadc38aa4a09bc5c7c37307b9c834dc17ef7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): examples/cube-sat-pysim/main.py:121-128 | examples/cube-sat/main.py:142-149 \u2014 \u0060examples/cube-sat-pysim/main.py\u0060 and \u0060examples/cube-sat/main.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 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":"examples/cube-sat-pysim/main.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e2f983171b5e940c23b12de2b81bc2f2041423dd034ea18a4e964bf2eef8ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): examples/frames/main.py:197-204 | examples/frames/main.py:207-214 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/frames/main.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d7544ba7649c514e9664ac56d3f8a9bbe08b6bddb062cf953fe308fbf9c196a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): examples/rocket-barrowman/main.py:548-555 | examples/rocket-barrowman/main.py:556-563 \u2014 both copies are in the same file, so extract the block 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 \u0060comp\u0060 to \u0060el.Query[EulerAngles]\u0060 in one and \u0060el.Query[BodyRates]\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":"examples/rocket-barrowman/main.py"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"5576b75ba01194dfe542012066602993e61a559df1e1231ab8f2122d74a323ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): examples/rocket-barrowman/ui/rocket_visualizer.py:417-424 | examples/rocket-barrowman/ui/rocket_visualizer.py:427-434 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/rocket_visualizer.py"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"20db16e8f833cabaa7191ea3726c69a2361ef59a0ea01b38cbbbc49e9c977ce6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 17): examples/rocket-barrowman/main.py:486-492 | examples/rocket-barrowman/main.py:494-500 | examples/rocket-barrowman/main.py:502-508 | examples/rocket-barrowman/main.py:510-516 | examples/rocket-barrowman/main.py:518-524 | examples/rocket-barrowman/main.py:526-532 | examples/rocket-barrowman/main.py:534-540 | examples/rocket-barrowman/main.py:542-548 | examples/rocket-barrowman/main.py:566-572 | examples/rocket-barrowman/main.py:574-580 | examples/rocket-barrowman/main.py:582-588 | examples/rocket-barrowman/main.py:590-596 | examples/rocket-barrowman/main.py:598-604 | examples/rocket-barrowman/main.py:606-612 | examples/rocket-barrowman/main.py:614-620 | examples/rocket-barrowman/main.py:622-628 | examples/rocket-barrowman/main.py:629-633 \u2014 all 17 copies are in the same file, so extract the block into one function there and call it 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 \u0060examples/rocket-barrowman/main.py:486\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060comp\u0060 to \u0060el.Query[Altitude]\u0060 in one and \u0060el.Query[Downrange]\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":"examples/rocket-barrowman/main.py"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"eacefcb4b42b57f5fd09c2f112c79afa08a86df12d1cc137e9b69558d6ed16a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): examples/rocket-barrowman/optimization/smart_optimizer.py:692-698 | examples/rocket-barrowman/optimization/smart_optimizer.py:708-713 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/optimization/smart_optimizer.py"},"region":{"startLine":692}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f0ee0cf20b28db56a595ef8f45e2c5d50a3b946d69a54e61866e1fc0749ee75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): examples/rocket-barrowman/ui/app.py:1017-1023 | examples/rocket-barrowman/ui/app.py:1034-1040 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rocket-barrowman/ui/app.py:1017\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/app.py"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdde7ae55e85b81817297dbdcdf8dd2531743e2e0dcfaee11d63702818900141"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): examples/rocket-barrowman/ui/rocket_renderer.py:244-250 | examples/rocket-barrowman/ui/rocket_renderer.py:562-568 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/rocket_renderer.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"994e81640dd80caaa272644fff9120256e8da7177feec15071c43f0926a2ffaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): examples/rocket-barrowman/ui/rocket_visualizer.py:337-343 | examples/rocket-barrowman/ui/rocket_visualizer.py:348-354 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/rocket_visualizer.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b7e2e3a18933955e6d7a70aa690c9a82ad5a7136bad067d8b7462d95352fc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): scripts/ci/compare_baseline_csv.py:124-130 | scripts/ci/compare_profile_metrics.py:66-73 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060scripts/ci/compare_baseline_csv.py:124\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/compare_baseline_csv.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9635ad68167afaacb7b5148f6ef8c4f00b6f6cf1e89a8f06116e72cd719a0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 4): examples/rocket-barrowman/ui/rocket_renderer.py:251-256 | examples/rocket-barrowman/ui/rocket_renderer.py:567-572 | examples/rocket-barrowman/ui/rocket_visualizer.py:29-35 | examples/rocket-barrowman/ui/rocket_visualizer.py:457-463 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060motor\u0060 to \u0060Optional[Dict[str, Any]] = None\u0060 in one and \u0060Optional[Dict] = None\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/rocket-barrowman/ui/rocket_renderer.py:247\u0060 calls \u0060get\u0060 and \u0060examples/rocket-barrowman/ui/rocket_visualizer.py:26\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/rocket_renderer.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"4054131da8ad934bfe6923333cfcc64171cb4b7fb78f0fd6c7aa85823133c88f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): examples/cube-sat-pysim/main.py:343-348 | examples/cube-sat/main.py:364-369 | examples/ellipsoid/sim.py:80-85 \u2014 \u0060examples/cube-sat-pysim/main.py\u0060 and \u0060examples/cube-sat/main.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 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":"examples/cube-sat-pysim/main.py"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"12040ee42cf88e1f0940aa3bd288bbb84b758a6d619f60e8bc683072d47dd166"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): examples/cube-sat-pysim/main.py:325-332 | examples/cube-sat/main.py:346-353 \u2014 \u0060examples/cube-sat-pysim/main.py\u0060 and \u0060examples/cube-sat/main.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/cube-sat-pysim/main.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef02519e05c4785b146908a0809437591a32472165502ab1942286308b7c39f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): examples/rocket-barrowman/ui/rocket_visualizer.py:297-304 | examples/rocket-barrowman/ui/rocket_visualizer.py:477-482 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/rocket_visualizer.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"f685bb45086f020c139af35a8d4d17d4ec1428283ca259f222699433c512c666"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): examples/crazyflie-edu/config.py:61-65 | examples/drone/config.py:34-38 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/crazyflie-edu/config.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0084eddc069eef6450c8f1932252d5e69fd508d599643bea9308fe3dd7490b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): examples/cube-sat-pysim/main.py:359-364 | examples/cube-sat/main.py:380-385 \u2014 \u0060examples/cube-sat-pysim/main.py\u0060 and \u0060examples/cube-sat/main.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/cube-sat-pysim/main.py"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"996ab6a97482823c11258dc5e3a3b6453c8b4c6caf3daac422a9f70445dde610"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): examples/cube-sat-pysim/main.py:503-507 | examples/cube-sat/main.py:524-528 \u2014 \u0060examples/cube-sat-pysim/main.py\u0060 and \u0060examples/cube-sat/main.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/cube-sat-pysim/main.py"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53c49fba88c12e675145c43348647f1e93af2ec6ca7d288103fb9e06b12721a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): examples/rocket-barrowman/solvers/barrowman/flight_solver.py:756-760 | examples/rocket-barrowman/solvers/barrowman/flight_solver.py:762-766 | examples/rocket-barrowman/solvers/barrowman/flight_solver.py:767-772 \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. 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":"examples/rocket-barrowman/solvers/barrowman/flight_solver.py"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa097e668f01cd6dc5aac911419cd8ee4ee1cdaec81a152b341018224427f4db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): examples/rocket-barrowman/ui/rocket_visualizer.py:306-312 | examples/rocket-barrowman/ui/rocket_visualizer.py:484-488 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/rocket-barrowman/ui/rocket_visualizer.py:306\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rocket-barrowman/ui/rocket_visualizer.py"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18a6d0eb828e5eb72b5340697e3427ae090c2d68d5a86a7707b56b4f5dc94aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): examples/betaflight-sitl/main.py:178-183 | examples/crazyflie-edu/main.py:84-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":"examples/betaflight-sitl/main.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"345c7f43ac1a3936650bf3038a3dfb41e5e36f09cbf85c466c5d1832ff5bfedc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): examples/cube-sat-pysim/main.py:144-148 | examples/cube-sat/main.py:165-169 \u2014 \u0060examples/cube-sat-pysim/main.py\u0060 and \u0060examples/cube-sat/main.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/cube-sat-pysim/main.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"9638dab81fdc15b1a62109764eb4dbbbab4ed6834f9403e63b597241edebcd9c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): examples/cube-sat-pysim/main.py:283-292 | examples/cube-sat/main.py:304-313 \u2014 \u0060examples/cube-sat-pysim/main.py\u0060 and \u0060examples/cube-sat/main.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 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. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/cube-sat-pysim/main.py"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"55695243428158e2462c43f39c584c78b1cc392a599d67243180db8c0bb84fa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): examples/cube-sat-pysim/main.py:406-414 | examples/cube-sat/main.py:427-435 \u2014 \u0060examples/cube-sat-pysim/main.py\u0060 and \u0060examples/cube-sat/main.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 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":"examples/cube-sat-pysim/main.py"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"83796b427214bcb5248f753cdde86e1e6f04457e72946bdb0dd5f601f838605c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): examples/cube-sat-pysim/main.py:478-484 | examples/cube-sat/main.py:499-505 \u2014 \u0060examples/cube-sat-pysim/main.py\u0060 and \u0060examples/cube-sat/main.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 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":"examples/cube-sat-pysim/main.py"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38a77d3986b33515117d0c2f56170d660103ca8d0f3cc5831562d39e7041913"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/ci/compare_baseline_csv.py:115-119 | scripts/ci/compare_profile_metrics.py:52-56 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/compare_baseline_csv.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"13653dafca8754b8003a10a2142c6eea229bb57917ac3818aec47d1bf71dae5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): examples/apollo-lander/main.py:51-56 | examples/monte-carlo/main.py:24-29 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/apollo-lander/main.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7eebae91282bba60232b92cdba0ffebf23468b83c1f0634f5d37ad23f36c264"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): examples/crazyflie-edu/main.py:629-635 | examples/crazyflie-edu/main.py:768-774 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/crazyflie-edu/main.py"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"864c1b6f18944fe7e32a6d3753731c179f8bbe00c75555bc146c2107e1db76b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): examples/cube-sat-pysim/main.py:105-112 | examples/cube-sat/main.py:126-133 \u2014 \u0060examples/cube-sat-pysim/main.py\u0060 and \u0060examples/cube-sat/main.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 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":"examples/cube-sat-pysim/main.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"12575c1798a56814c2b32732fb8209f8a3d019746f5ea86210f775b75fa1d0bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): examples/cube-sat-pysim/main.py:232-236 | examples/cube-sat/main.py:253-257 \u2014 \u0060examples/cube-sat-pysim/main.py\u0060 and \u0060examples/cube-sat/main.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 17 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 \u0060examples/cube-sat-pysim/main.py:232\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/cube-sat-pysim/main.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69445fc1195b0cb7ef7e3680e95f0baa18de50ef5bacef2cc303bb363e150a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): examples/falcon9/sim.py:832-836 | examples/falcon9/sim.py:978-982 | examples/falcon9/sim.py:1113-1117 \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":"examples/falcon9/sim.py"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"4649262f1493286dca23c5c08dbfafdfcf5feeb85cf535806b37c5280ede249d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): examples/falcon9/sim.py:1241-1245 | examples/falcon9/sim.py:1251-1255 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/falcon9/sim.py"},"region":{"startLine":1241}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b199eef0d3e7358ba1c8e00616adc849e8ff2817c7ed421b46cff4f32cab54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): examples/rocket-barrowman/analysis/flight_analysis.py:567-571 | examples/rocket-barrowman/analysis/flight_analysis.py:600-604 \u2014 both copies are in the same file, so extract the block 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, \u0060examples/rocket-barrowman/analysis/flight_analysis.py:605\u0060 calls \u0060zeros\u0060 and \u0060examples/rocket-barrowman/analysis/flight_analysis.py:572\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":"examples/rocket-barrowman/analysis/flight_analysis.py"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f6accacff3a2464a386929b5cf4041c3d3076990901af3b48d0b2cb13e4e09"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project elodin-db: elodin-db has instability 0.82 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"677070185354bc123a81b273783686c43848919a1f4cda088e58a9b62ebc13b0"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: bevy_ai_skybox: bevy_ai_skybox: 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":"f4894aa654dc1929a03595fc42857099a13f806cb94219916169eb78c834a652"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: bevy_mat3_material: bevy_mat3_material: 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":"6f38642ba7f3ee9a4d2c642e54bdbe8abb7ae43051c4cab197f4e981344dffde"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: blackbox: blackbox: 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":"91be47753d35d52175de431892568784e79086444aba82b79f25c4b1b4a08d42"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: hamann-chen-line: hamann-chen-line: 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":"28413ebfff74fb72af0640aaa039d65242d49d5c87faa7b4f6c6a9ccf8af6f23"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: nox-array: nox-array: 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":"9afcaf4268fc7bc4a0edf5d22e82b33bb194f03d37635e07c3b8ac17310b4812"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: rtsp-ingest: rtsp-ingest: 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":"1503a151eee0a687f44fdf81a6e6e4c875c1e051b6cec8ac73b841088d140266"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: video-toolbox: video-toolbox: 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":"8117b6d907df47160858518e3230a480a855f12ffe2dfe408d7985d4e18173f4"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: wmm: wmm: 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":"cb62ea82e5b0ef005c19522b00a17ce08c0b30d21793fc569ef6cedb61cc74e7"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: bevy_world_mesh: bevy_world_mesh: abstractness 0.01, instability 0.00, distance 0.99 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0f522e8c5e6f7174ea2af7d32736a7325a49effe90c2cb9b062f54befdfedc4d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: cranelift-mlir: cranelift-mlir: abstractness 0.04, instability 0.00, distance 0.96 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ded7a10a8720d83daeb52ceecfdbc213b6e639da37886adb2ef7d5794e0133c8"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: webcodecs-video: webcodecs-video: abstractness 0.08, instability 0.00, distance 0.92 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"287ec8e421ced694bbfef8650eebd162f1def91fd6f49d6bcd4c48960c24625e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: bevy_geo_frames: bevy_geo_frames: abstractness 0.13, instability 0.00, distance 0.88 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4904b04ec8ff3843bf087aaa88598468776f32ede89eae97b9e5fa3852fac422"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: impeller-wkt: impeller-wkt: abstractness 0.02, instability 0.14, distance 0.84 \u2014 zone of pain \u2014 concrete and depended on by 18 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"a6eb2fd76c739ac27053c3147918366e0d9867ede320677ef357acbf120e6413"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: s10: s10: abstractness 0.00, instability 0.20, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 4 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"948fef0b120e9325b044055d18658c3cd542caf7d8ba1764284875a5c310b0f3"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: roci-adcs: roci-adcs: abstractness 0.00, instability 0.25, distance 0.75 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"836c40fc25ccc599fd940daeb4fd0aecdc163cb0b66fddcac122e1c70030f23a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Noxpr (LCOM4 7): Noxpr\u0027s methods fall into 7 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 7 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":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":997}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9d7491a2f8ebfd3f45fc238fc6adb2f776ca990d88b5e381d83e14d7a891f6"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Cli (LCOM4 6): Cli\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/elodin/src/cli/mod.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50137d0ccfd0c971761574d26c7d4a0aff47c5db4f6dd8740f9e725977e2629"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: PalettePage (LCOM4 4): PalettePage\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/command_palette/palette_items.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d3e2346a79c98bb715b54e18fe0389ab9f0bd327239e13750bc5fb9d9f91664"}},{"ruleId":"D12","level":"warning","message":{"text":"Yanked release: tokio: \u0060tokio\u0060 resolves to 1.54.0 in the committed Cargo.lock, and crates.io reports that release as YANKED. A yanked release is one the publisher has withdrawn and asked you to stop using; it keeps resolving only so existing locks do not break. The current stable release is 1.54.1. Run \u0060cargo update -p tokio\u0060 and commit the updated lock."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c595d3b079eb7bc684c32b11de3f0a7be51609de01ae8d3692816eb633a1ca32"}},{"ruleId":"D13","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":"64bd43c2ca819ea62d68739722c33ba6bb0271dd02d120842a85699e1047d6c8"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","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":"2aae0ebe6198e01572786f12365a41a88dd8b9d9741585bca4aaf345a5c6536d"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D14","level":"error","message":{"text":"Banned license: syntastica: \u0060syntastica\u0060 0.4.1 is published on crates.io under \u0060GPL-3.0-only\u0060, which this policy bans, and it is in the SHIPPED closure of this repository\u0027s Cargo.lock \u2014 so it is compiled by everything that builds this repository, not just by its test harness. The expression was read as SPDX, not as text: an \u0060OR\u0060 is a choice and is only charged when every branch is banned, while an \u0060AND\u0060 binds you to both operands and is charged when either is. Replace the crate, or record an accepted exception."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"279ecb3e0a13e8bd74f1cdbac9fb93e96324fcd6bf466798785e82fbc82f9d80"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: syntastica-parsers: \u0060syntastica-parsers\u0060 0.4.1 is published on crates.io under \u0060GPL-3.0-only\u0060, which this policy bans, and it is in the SHIPPED closure of this repository\u0027s Cargo.lock \u2014 so it is compiled by everything that builds this repository, not just by its test harness. The expression was read as SPDX, not as text: an \u0060OR\u0060 is a choice and is only charged when every branch is banned, while an \u0060AND\u0060 binds you to both operands and is charged when either is. Replace the crate, or record an accepted exception."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c3580444fb570e6d5a79b161d13f93ad3e8e62b38fcba9561e1358bae50e7285"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: syntastica-themes: \u0060syntastica-themes\u0060 0.4.1 is published on crates.io under \u0060GPL-3.0-only\u0060, which this policy bans, and it is in the SHIPPED closure of this repository\u0027s Cargo.lock \u2014 so it is compiled by everything that builds this repository, not just by its test harness. The expression was read as SPDX, not as text: an \u0060OR\u0060 is a choice and is only charged when every branch is banned, while an \u0060AND\u0060 binds you to both operands and is charged when either is. Replace the crate, or record an accepted exception."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c8f0b3d469285a1fd9c2ff504819d329a28e7d2b9e5dac98e2bea8dd5642a36"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: ansi_colours: \u0060ansi_colours\u0060 1.2.3 is published on crates.io under \u0060LGPL-3.0-or-later\u0060, which this policy bans, and it is in the SHIPPED closure of this repository\u0027s Cargo.lock \u2014 so it is compiled by everything that builds this repository, not just by its test harness. The expression was read as SPDX, not as text: an \u0060OR\u0060 is a choice and is only charged when every branch is banned, while an \u0060AND\u0060 binds you to both operands and is charged when either is. Replace the crate, or record an accepted exception. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1b6f24c4898433fb8035ef098fab2c1ef51e4b38432be1f26543247d5137a8e2"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: syntastica-core: \u0060syntastica-core\u0060 0.4.1 is published on crates.io under \u0060GPL-3.0-only\u0060, which this policy bans, and it is in the SHIPPED closure of this repository\u0027s Cargo.lock \u2014 so it is compiled by everything that builds this repository, not just by its test harness. The expression was read as SPDX, not as text: an \u0060OR\u0060 is a choice and is only charged when every branch is banned, while an \u0060AND\u0060 binds you to both operands and is charged when either is. Replace the crate, or record an accepted exception."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"843f30f07c95fdda27b3e12b27211b6fc69b86fb32244c9e7ca1fee99efa0d79"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: syntastica-macros: \u0060syntastica-macros\u0060 0.4.1 is published on crates.io under \u0060GPL-3.0-only\u0060, which this policy bans, and it is in the SHIPPED closure of this repository\u0027s Cargo.lock \u2014 so it is compiled by everything that builds this repository, not just by its test harness. The expression was read as SPDX, not as text: an \u0060OR\u0060 is a choice and is only charged when every branch is banned, while an \u0060AND\u0060 binds you to both operands and is charged when either is. Replace the crate, or record an accepted exception."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f7b7d2fcd9c50faf355e14c64fe0b3b8b7da6d371a91f62146d379023bb522b4"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: syntastica-queries: \u0060syntastica-queries\u0060 0.4.1 is published on crates.io under \u0060GPL-3.0-only\u0060, which this policy bans, and it is in the SHIPPED closure of this repository\u0027s Cargo.lock \u2014 so it is compiled by everything that builds this repository, not just by its test harness. The expression was read as SPDX, not as text: an \u0060OR\u0060 is a choice and is only charged when every branch is banned, while an \u0060AND\u0060 binds you to both operands and is charged when either is. Replace the crate, or record an accepted exception."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"28e9f74be54eeecb5c25f1b650b20b94fb447ba293bdad370df6cfc8a2362ffa"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: tft: \u0060tft\u0060 0.1.1 is published on crates.io under \u0060GPL-3.0-only\u0060, which this policy bans, and it is in the SHIPPED closure of this repository\u0027s Cargo.lock \u2014 so it is compiled by everything that builds this repository, not just by its test harness. The expression was read as SPDX, not as text: an \u0060OR\u0060 is a choice and is only charged when every branch is banned, while an \u0060AND\u0060 binds you to both operands and is charged when either is. Replace the crate, or record an accepted exception."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8dcf7d4999186e1db4f15753af9bcab1635257a3e98419235e652c203f946715"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/elodin-editor/src/ui/tiles.rs: libs/elodin-editor/src/ui/tiles.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 116 in TileLayout::ui_system at line 3195. 7 of those changes were fix/bug commits, and the other 10 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/elodin-editor/src/ui/tiles.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":3195}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0207291340ecfc1757ca5f3355cefdee0f8ab106424758b880872eff44d8a02"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/cranelift-mlir/src/lower.rs: libs/cranelift-mlir/src/lower.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 330 in cranelift_mlir::lower::lower_instruction_mem at line 4008. 4 of those changes were fix/bug commits, so the churn is repair rather than feature work. 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/cranelift-mlir/src/lower.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":4008}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce3ebc916b2dc32d808d2178a7e467f8ef3c1f59ec6086d97e7af631c9cf9ec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/nox-py/src/world_builder.rs: libs/nox-py/src/world_builder.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 108 in WorldBuilder::run at line 858. 3 of those changes were fix/bug commits, and the other 10 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/nox-py/src/world_builder.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d48ab87016e09fc01c0401d0b15dd58b81365345a5e2a06d0c7efd94e31b38"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/elodin-editor/src/ui/schematic/load.rs: libs/elodin-editor/src/ui/schematic/load.rs changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in LoadSchematicParams::spawn_panel at line 1192. 5 of those changes were fix/bug commits, and the other 15 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/elodin-editor/src/ui/schematic/load.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab92f48e3ffcd0c722f1c4954eb0825b10f6def5020479a20d3262f559dd901"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/db/src/lib.rs: libs/db/src/lib.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 74 in elodin_db::handle_packet at line 2145. 5 of those changes were fix/bug commits, and the other 7 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/db/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/lib.rs"},"region":{"startLine":2145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a855be0c6ef510407fc944e63f9307356030beb5d01ef8b83b41125c63bbf85e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: examples/betaflight-sitl/main.py: examples/betaflight-sitl/main.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in main._sitl_post_step at line 529. 1 of those changes was a fix/bug commit, and the other 10 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- examples/betaflight-sitl/main.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/betaflight-sitl/main.py"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b5a87fb390b57e418fdb7a42df197b01c5df00f87064849feed0ea9ee67eec"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/elodin-editor/src/object_3d.rs: libs/elodin-editor/src/object_3d.rs changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in elodin_editor::object_3d::compile_formula at line 659. 6 of those changes were fix/bug commits, and the other 10 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/elodin-editor/src/object_3d.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b4bffdd80e5df0b505db6f8cf05f4922deb551c6a0fbd029b411533166ab5c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/impeller/kdl/src/ser.rs: libs/impeller/kdl/src/ser.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in impeller_kdl::ser::serialize_viewport at line 506. 1 of those changes was a fix/bug commit, and the other 11 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/impeller/kdl/src/ser.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/ser.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb72e0ce56569efde65973fe7dfedef164791b8b38ee155e88348d62da6a0390"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/impeller/bevy/src/lib.rs: libs/impeller/bevy/src/lib.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in impeller_bevy::sink_inner at line 1375. 1 of those changes was a fix/bug commit, and the other 10 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/impeller/bevy/src/lib.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"78643baed19a143738ea97670bfd45a3f48998e3a67392e18d4837137945116c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/elodin-editor/src/ui/schematic/mod.rs: libs/elodin-editor/src/ui/schematic/mod.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in SchematicParam::get_panel_from_state at line 164. 2 of those changes were fix/bug commits, and the other 8 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/elodin-editor/src/ui/schematic/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":"libs/elodin-editor/src/ui/schematic/mod.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ccfbffc4251c6e03e938d96ed58b9db15f96c23773306f2612c92d45fbaade"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/elodin-editor/src/ui/video_stream.rs: libs/elodin-editor/src/ui/video_stream.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in VideoStreamWidget::ui_system at line 1514. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/elodin-editor/src/ui/video_stream.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/video_stream.rs"},"region":{"startLine":1514}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d5e7e29c3f269759959f0896d31a5958a2a25eec60b1ed1f9aad2d8582a7fe"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/elodin-editor/src/ui/inspector/viewport.rs: libs/elodin-editor/src/ui/inspector/viewport.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in InspectorViewport::ui_system at line 689. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/elodin-editor/src/ui/inspector/viewport.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/viewport.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce36e0d3a9df2d0fbcaa0cde77335649fdf405ab099c5b220310cce1500215b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/elodin-editor/src/headless.rs: libs/elodin-editor/src/headless.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in elodin_editor::headless::load_headless_scene at line 385. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/elodin-editor/src/headless.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e325a07c11142148c279009b3f4d758f576cac862164b7aba6e0b0f09c19db0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/elodin-editor/src/ui/plot/widget.rs: libs/elodin-editor/src/ui/plot/widget.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in TimeseriesPlot::render at line 1066. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/elodin-editor/src/ui/plot/widget.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bb7efb6dfb17e410c14c5e3a1715f989c7a7fade080407d7fe825de4dd63aef"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/elodin-editor/src/ui/data_overview/mod.rs: libs/elodin-editor/src/ui/data_overview/mod.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in DataOverviewWidget::ui_system at line 274. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/elodin-editor/src/ui/data_overview/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":"libs/elodin-editor/src/ui/data_overview/mod.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ba6993c34114667421c8f89f9d3b4663658ce4f1c6bdf98e2121d504fa9716"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/elodin-editor/src/ui/plot/gpu.rs: libs/elodin-editor/src/ui/plot/gpu.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in elodin_editor::ui::plot::gpu::extract_lines at line 1029. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/elodin-editor/src/ui/plot/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":"libs/elodin-editor/src/ui/plot/gpu.rs"},"region":{"startLine":1029}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78565e02cf492607dddf79c0744b89780f7e2c40c053073d6555b5fcdcbcb4b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/impeller/kdl/src/de.rs: libs/impeller/kdl/src/de.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in impeller_kdl::de::parse_viewport at line 1078. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/impeller/kdl/src/de.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":1078}}}],"partialFingerprints":{"codehealthFindingId/v1":"cccc96206357f8f82f7f39db45868c7c4e722c4f1a380a437a97a5b85e489e30"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/elodin-editor/src/sensor_camera.rs: libs/elodin-editor/src/sensor_camera.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in elodin_editor::sensor_camera::spawn_sensor_cameras at line 675. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/elodin-editor/src/sensor_camera.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/sensor_camera.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4d5c51cc69030d689d4b2f45509b7ba077948915b463d85bf90b5af82fecd1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/elodin-editor/src/ui/timeline/timeline_controls.rs: libs/elodin-editor/src/ui/timeline/timeline_controls.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in TimelineControls::ui_system at line 77. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/elodin-editor/src/ui/timeline/timeline_controls.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/timeline/timeline_controls.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"2774f6c8aa57ae447520f0b15053fa5f1d9324137d3c62569467c4c87fdb01c0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/elodin-editor/src/ui/inspector/object3d.rs: libs/elodin-editor/src/ui/inspector/object3d.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in InspectorObject3D::ui_system at line 56. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/elodin-editor/src/ui/inspector/object3d.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/object3d.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f0c6d9a917e33d5bc1339d64d6305f4996853b47adf734c7e5b6566a135b23"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/elodin-editor/src/plugins/frustum/mod.rs: libs/elodin-editor/src/plugins/frustum/mod.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in elodin_editor::plugins::frustum::draw_viewport_frustums at line 264. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/elodin-editor/src/plugins/frustum/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":"libs/elodin-editor/src/plugins/frustum/mod.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"7568604502e55d3580f724ef96728a0e4de25fd524c09a1dc18554903bca8b6c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/elodin-editor/src/ui/plot_3d/gpu.rs: libs/elodin-editor/src/ui/plot_3d/gpu.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in elodin_editor::ui::plot_3d::gpu::extract_lines at line 936. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/elodin-editor/src/ui/plot_3d/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":"libs/elodin-editor/src/ui/plot_3d/gpu.rs"},"region":{"startLine":936}}}],"partialFingerprints":{"codehealthFindingId/v1":"107eea1ab29c0eb31cec5966fff780284dc141c9b66c09d593a2b06a67fc0235"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/db/src/main.rs: libs/db/src/main.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in elodin_db::main at line 386. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/db/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":"libs/db/src/main.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc53280eb8dcb474be8171447eb01f6e569d36dd9fc374a2349797ec06b99b05"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/nox-py/src/impeller_server.rs: libs/nox-py/src/impeller_server.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in nox_py::impeller_server::prime_schematic_assets at line 127. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/nox-py/src/impeller_server.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/impeller_server.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c720fbd47da02af0df455de87f7485b051ede1db0b38e79eedcc12c923300c11"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/elodin-editor/src/plugins/frustum_intersection/mod.rs: libs/elodin-editor/src/plugins/frustum_intersection/mod.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in elodin_editor::plugins::frustum_intersection::draw_frustum_ellipsoid_intersections at line 409. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/elodin-editor/src/plugins/frustum_intersection/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":"libs/elodin-editor/src/plugins/frustum_intersection/mod.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f455ffdb7a4f38bc7723e3ced10529d31be1c8e057545b4602726ef97bd2dc7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: examples/betaflight-sitl/guidance.py: examples/betaflight-sitl/guidance.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in MissionController.update at line 397. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- examples/betaflight-sitl/guidance.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/betaflight-sitl/guidance.py"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea4ac309684426ec9d5f164646f418774142f1a715fddea9aba01510c4481a0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/elodin-editor/src/ui/plot_3d/point_trails.rs: libs/elodin-editor/src/ui/plot_3d/point_trails.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in elodin_editor::ui::plot_3d::point_trails::sync_point_trails 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-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/elodin-editor/src/ui/plot_3d/point_trails.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/plot_3d/point_trails.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e95cecfd883559c3b4eaa82ad81b13c06e10c1d7fbbbdcd8e04b186c415ab48"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/elodin-editor/src/ui/inspector/graph.rs: libs/elodin-editor/src/ui/inspector/graph.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in InspectorGraph::ui_system at line 60. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/elodin-editor/src/ui/inspector/graph.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/graph.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c84cf6509002bfa427dc712607b97839ee9aeebe8e318306222cccf288a4fb2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/elodin-editor/src/ui/query_plot.rs: libs/elodin-editor/src/ui/query_plot.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in QueryPlotWidget::ui_system at line 201. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/elodin-editor/src/ui/query_plot.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/query_plot.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c9c2dded8abff8ea42ffc96988c1d12b8d385bb14ffa3b01fcdff3b97656e8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/cranelift-mlir/src/parser.rs: libs/cranelift-mlir/src/parser.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in cranelift_mlir::parser::parse_sort_op at line 1922. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/cranelift-mlir/src/parser.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1922}}}],"partialFingerprints":{"codehealthFindingId/v1":"974e44144ce815cd78f881ba1a51a112e37e6988f83a734b9de6b80f92fc632a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/ci/compare_baseline_csv.py: scripts/ci/compare_baseline_csv.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in compare_baseline_csv._compare_file at line 179. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- scripts/ci/compare_baseline_csv.py\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/compare_baseline_csv.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b21d5bb900e2f35f008c35a8a554584fb9cb6b088fbbc4a8f6a383da60a038"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/db/src/follow.rs: libs/db/src/follow.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in elodin_db::follow::run_follower_inner at line 354. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/db/src/follow.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/follow.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"372bb9d4c9256201dba5e6247553b2ce40f38fdb2fc1b3193d52dbb5ca9132eb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/cranelift-mlir/src/interp.rs: libs/cranelift-mlir/src/interp.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in cranelift_mlir::interp::reduce at line 1476. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/cranelift-mlir/src/interp.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2be2f51706a85522e1e3c956305fde9e60699f87cfcbaece23eeff1b9812784"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: apps/elodin/src/cli/cloud/upload/mod.rs: apps/elodin/src/cli/cloud/upload/mod.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in elodin::cli::cloud::upload::run at line 537. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- apps/elodin/src/cli/cloud/upload/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":"apps/elodin/src/cli/cloud/upload/mod.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd69bb687871d9038b1bee722314d0b7659a846bbf8d205253fbee2fbabb1efb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: libs/elodin-editor/src/plugins/kdl_document/systems.rs: libs/elodin-editor/src/plugins/kdl_document/systems.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in elodin_editor::plugins::kdl_document::systems::handle_open_document_from_active_requests at line 229. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/elodin-editor/src/plugins/kdl_document/systems.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/kdl_document/systems.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"214f4a1f627496f6182b04e3056aeed5d0483094e96d782ab3830bbabcf6e669"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: libs/bevy_geo_frames/src/geo.rs: libs/bevy_geo_frames/src/geo.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is GeoFrame::bevy_O_ at line 140), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CFix: Restore absolute orientation and y-up. (#845)\u201D; \u201Cfix(editor): keep Y-up GLBs and planar terrain level after frame\u2192Bevy. (#793)\u201D; \u201CFix: Fix ECEF translate; add ned_to_ecef() and co. (#774)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/bevy_geo_frames/src/geo.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_geo_frames/src/geo.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b90a4140b1d5bd2e58d8bf123290ad2ccac3e88e22003c312adc87ad332085a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: libs/cranelift-mlir/src/ir.rs: libs/cranelift-mlir/src/ir.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is ScalarValue::as_f64 at line 128), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201CFix Cranelift gathers over per-entity tables, along other axes, and in windows (#946)\u201D; \u201CFixes from #922: Cranelift matches jax-cpu (#938)\u201D; \u201CFixes from #930: Exec.run, JaxSim, Cranelift SSA ids, mekf (#936)\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 14:03:52 -08:00\u0027 --until=\u00272026-11-13 14:03:52 -08:00\u0027 --full-history --no-merges -- libs/cranelift-mlir/src/ir.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/ir.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"398bcaa81cc12e32a33a049dc9cfcad7b827b6eabb4025672620d53103d1b6eb"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 15 significant file(s) lose their only recent owner: libs/monte-carlo/src/lib.rs, libs/cranelift-mlir/src/parser.rs, libs/db/src/grpc/ingest.rs, libs/s10/src/recipe.rs, libs/db/src/trim.rs, libs/db/src/export.rs, libs/db/tests_query/csv_export_goldie.rs, libs/cranelift-mlir/src/ir.rs (\u002B7 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6d7a2f9c4dac914a853377bf43e6031159e102a531781f546066d494a7cd88cb"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 7 significant file(s) lose their only recent owner: libs/elodin-editor/src/ui/timeline/playback.rs, libs/elodin-editor/src/ui/gauges/geo_position.rs, libs/elodin-editor/src/plugins/gpu_info.rs, libs/elodin-editor/src/plugins/editor_cam_input.rs, libs/elodin-editor/src/ui/inspector/gauges.rs, libs/elodin-editor/src/ui/inspector/timeline.rs, scripts/ci/sensor_camera_tracy_analysis.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"54f0687c782f786a037a928cfb26982f03ba51546c519cbdc51f5344c75755f7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle gracefully \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":"libs/stellarator/src/uring/mod.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"974170d880be1bf052f0d3bdcc482bfc5a1402ccb76e410c2083231737c49e3f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: not sure when this happens what we should do \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":"libs/stellarator/src/uring/ops.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a4ad064a165105ae35ec394d95eb1639bd6742ee75166e832bb4bec5e86656"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/src/poll/mod.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"255af4b59c9f2efb8afd118a1fce17d8562a109269e4df5ddd5198ec2587705e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/globals.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"f160110f067d4fd3ef6fee2874776df35dc98bbd10d4ff9660adff6018defd76"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(sphw): fix me \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":"libs/nox-py/src/graph.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe165d84ab59e5fd56790fddc150ba8cc8fc7db017b9af96f8d4478f30eb9804"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fix noxpr -\u003E jax tracing so that reshaping is not needed \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":"libs/nox-py/src/linalg.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"4578c54bf32f410212236a4c9ad064ee2023297454d64ce66375ddba9679c187"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Don\u0027t allocate a string to test a string. \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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"41515ed04aea19db01fb14808e2f688beef7fabe30585598dbbf17c79eecc36b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider changing this \u0060name\u0060 field to \u0060id\u0060. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8a4796f7dbc565a21bf355c4ee0cef83a1aaf9a19e3924d1ea79db2fd926f4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(sphw): use varadict function \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":"libs/nox-py/python/elodin/__init__.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e104cb2eb6246ce62d07765181083dd54975f2128d866d12ee73b10581978c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Check for division by zero \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":"libs/nox/src/quaternion.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c4ee004af1bf65773968fd7bd649a317dbf21daa0d0ad8b69e83f1e381a8a9c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use fixed slice instead \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":"libs/nox/src/quaternion.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"656d9eae4b65542becc4fceb7a1b51f25d77ca29b0f595ecbd56eb3fc1f3155f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: use fixed slice instead \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":"libs/nox/src/quaternion.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb80b8c92930aa739b4c21c85d80080743ab790cbb4339e2dd32b23f5e0afad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(shane): I want this around for compatibility testing with batch-dfs.rs. \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":"libs/nox/src/noxpr/batch.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3f53c50d99ab95dbc8525d54b84323160ef44248f388910a6bba6a0d45ade7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle scalars \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":"libs/nox/src/noxpr/batch.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f40a0bbf47b592fa61881e8d55394afed192bdabd36d731052a513d843fc956"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: calculate this type \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":"libs/nox/src/noxpr/batch.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"9037c5bb73272d6b9ee7e09977f3da512bce88e02d575b4d873946dc5289e0f3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: dynamic update slice is a special case of scatter, add this when we add scatter \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":"libs/nox/src/noxpr/batch.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29cd722eec6059d2874e38127a592165931e7e4f91ccf09d3792bda3324fdd5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: handle conflating batch axes \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":"libs/nox/src/noxpr/batch.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c56484adc9f6a3535e5acc4ee5443b537a20279d225cdf48c2764363356881"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(sphw): we have to figure out if we can batch calls at all \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":"libs/nox/src/noxpr/batch.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"f37fe0dd64b16d7bac2af033fdf2615fcc3929a187bea483cb1975f9e30c6653"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(sphw): to make mutable params work again we will need to make some changes to this function \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":"libs/nox/src/noxpr/comp_fn.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f8771ba1b984c61f97fd0af324b293072584db4a2b5675046d58816807dd0fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(sphw): ensure that all shapes are the same, except for a particular dim \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":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d0175e87f9f31061633f67ed17c962abe9b62743203f29417296d70c413c77"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(sphw): ensure that all shapes are the same, except for a particular dim \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":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":1682}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c63addb2df4cdf7ad895c7372e0469b33c75f80a56cdfdcdef519a0d18e547"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(sphw): We will need to masks out the unused triangle to ensure that it is zero, \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":"libs/nox/src/noxpr/repr.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"91103ab801acdbf27976c0015de1251d888420bfe74846a300d8c4642a817a1d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider making this an enum so we can round-trip color names. \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":"libs/impeller/wkt/src/lib.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"59d3a48ee0e3a855801290aa88a857bab8f0b8d487af80985811ec37bf435038"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider changing it to store [\u0022a\u0022, \u0022b\u0022, \u0022c\u0022]. \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":"libs/impeller/wkt/src/path.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe993efb74076d8fc2745bfaa8a239f280947f1057abc9d7bb936c8613aec08"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider using the \u0060Display\u0060 or \u0060ToString\u0060 trait. \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":"libs/impeller/kdl/src/lib.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28ead0671d7495c9f1bdc2e09db58375fcc63c2a7e6a1f4910239eebe93f611"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider using the \u0060std::str::FromStr\u0060 trait. \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":"libs/impeller/kdl/src/lib.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c63c29ac300599fb3464d7f986c50bacca95723d4e38441a81924d51bab2ab6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This runs fairly often, and it registers a system each time. We \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":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":2249}}}],"partialFingerprints":{"codehealthFindingId/v1":"1367e624e3d4837544633b4338af5040c1defe818a2f1a6fe1f2baf30752df06"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Set the descriptor path once it is known. \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":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf66529e7bccac22b0099617e7a83636e47d5f29817bd5705d0a70df46652fc9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Can got back to .get() when bevy_defer is updated past 0.15.1. \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":"libs/elodin-editor/src/ui/window/placement.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b13d73aa4cef36fb13e87678f198c2aa7b23e9e91b0c6482ee6fb13eee0d01"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Can got back to .get() when bevy_defer is updated past 0.15.1. \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":"libs/elodin-editor/src/ui/window/placement.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e9d242ba4531eeac77b21eb9a4a58ee4835bb3141afc90debd41c892c2707c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Consider changing this to a warn once per error value. \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":"libs/elodin-editor/src/ui/plot_3d/mod.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b10bb297f5598c39cd8169b18ee4d2555afa3fb47ea558a0a58d145941497073"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: cmd_btn \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":"libs/elodin-editor/src/ui/command_palette/mod.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba153caf51f31cc63777b9a58eebe185f5e8cf05056a2c13043773a58632db28"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: maybe mean this as well? \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":"libs/db/src/vtable_stream.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6f0a8e9af37a0f4e9e83a3f3d1f769a563a2798d96c5ba3bab895f7de2c2b4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: This should be discovered dynamically from the database \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":"libs/db/examples/rust_client/src/control.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb75ce05d7788f0cbcca46e5d8aad561b526eee47fa65b631a639bbb047c513"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo: adjust this code for pixel sizes larger than 4 byte \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":"libs/bevy_world_mesh/src/terrain/terrain_data/gpu_tile_atlas.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1113e1203fd292f039bf662402863b7b8396003487e4e9bddabc5ec3a0746fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo: build customizable loader abstraction \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":"libs/bevy_world_mesh/src/terrain/terrain_data/tile_atlas.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49791a2f4c83c33cfdd55984c10400dd342e905ec5acaa8edf2736a27111431"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo: Handle this better \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/terrain/terrain_data/tile_atlas.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3c6600a5b916a195003f11079fb8f43f85a2a54ea1970a77d4dc863bd142fe9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo: implement better loading strategy \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":"libs/bevy_world_mesh/src/terrain/terrain_data/tile_atlas.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9e8a903e198ff3b5c3653116d8b14d7477137467fcce12d592d075686c4136"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo: make this customisable \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":"libs/bevy_world_mesh/src/terrain/render/terrain_bind_group.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7db603aa2162e016b0f6ac908547bc71d64039793d8a907cc05b40fe038bf01"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo: mem take using \u0026mut world? \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":"libs/bevy_world_mesh/src/terrain/preprocess/gpu_preprocessor.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e51c0c73d18a3184e7e673dedc25e03436dd7a859298cf4495eba2cfcf6c3b4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo: store tile_coordinate, task_type, tile_dependencies and tile dependencies \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":"libs/bevy_world_mesh/src/terrain/preprocess/preprocessor.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"0266667503dcdcf6dfc156c4be05c9cade06a0bc88efb43387812a843e4646f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Todo: keep in sync with terrain transform, make this authoritative? \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":"libs/bevy_world_mesh/src/terrain/math/terrain_model.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fcb3c21cccba30f38caca71c68759935ae7b1707e851c4329d1b9c5e1838e66"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(sphw): bring this function into rust \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":"fsw/roci/adcs/src/mekf.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"c10ab7bc61370a0c07c90771389ae6ba5522aef17665d08bff4e63fcd168f63b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Implement per-surface force calculation like RocketPy \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":"examples/rocket-barrowman/solvers/barrowman/flight_solver.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6b2c02f85ed550c240d22f89d51e8e4d257c791fa00c7a0a52c9234c241787"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Debug Kane/RTT - the T-matrix assembly or moment application is incorrect \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":"examples/rocket-barrowman/solvers/barrowman/flight_solver.py"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d4889be996f30ce65ebf1e92b6a8a638c474ea8c31d713435b7e8330ca1e29"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Implement mass reduction logic \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":"examples/rocket-barrowman/optimization/ai_rocket_builder.py"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f296b6891d7c319ae60b958a4f5a89796588158f49deb3e4c55db26b59fc086"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Separate structural vs motor inertia properly \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":"examples/rocket-barrowman/core/models/rocket_model.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"c309a0700e5c78d673d4babf46c82907854f905287836c9e394efded05c03783"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: These compasses are rotated such that they\u0027re correct with \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":"examples/geo-frames/schematic.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3fdb569b017095f8ac1d851d95254a56ce842e5fc1178ce56ffe1ede9e9e76f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: limit yaw error to the maximum that would saturate the output when yaw rate is zero \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":"examples/drone/control.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d65240f239e03fa04b9916880a2060e34f75e4efaa52300ba277e66b7f8e189"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: incorporate GNSS, barometer, etc. \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":"examples/drone/mekf.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"410ef508a4244d7dc15679e8a906692529328913dfbf0aedaf6fcd982c8bf584"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Any schematics call for this? No. Consider adding one. \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":"examples/cube-sat/main.py"},"region":{"startLine":561}}}],"partialFingerprints":{"codehealthFindingId/v1":"d56956f6122ae33d31e7dfb311783e60f7c6a54678b8d7822dae5fc1eefbe9b4"}},{"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 \u0060libs/s10/src/main.rs\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b2f9267b79b49f0ad9a037167f136e941b1a1bd24a2180ff9eb62afc97a411"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060libs/elodin-editor\u0060 (87536 LoC, 596 module-visible types across 30 directories) overshoots its size bounds. 4 of 57 build unit(s) (Cargo, Python) overshoot their size bounds, lowering Project Cohesion to 8.7/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":"libs/elodin-editor/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca88abb3b06f6ca31407c822906867889ee1af51beea4e87aaca0d575f0ad52"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060(repository root)\u0060 (29975 LoC, 330 module-visible types across 43 directories) overshoots its size bounds. 4 of 57 build unit(s) (Cargo, Python) overshoot their size bounds, lowering Project Cohesion to 8.7/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":"Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47e8df767bfc37da3227cdd4038c0a9e51cc4af34f700a3047c62f87429ba9d"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060libs/nox-py\u0060 (20329 LoC, 204 module-visible types across 7 directories) overshoots its size bounds. 4 of 57 build unit(s) (Cargo, Python) overshoot their size bounds, lowering Project Cohesion to 8.7/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":"libs/nox-py/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30c1f6a7eb39126349c983be3ab1b72e01abb1e42e1d851a564ddd675b47cad"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060libs/bevy_world_mesh\u0060 (9490 LoC, 97 module-visible types across 11 directories) overshoots its size bounds. 4 of 57 build unit(s) (Cargo, Python) overshoot their size bounds, lowering Project Cohesion to 8.7/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":"libs/bevy_world_mesh/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa01b3407e1e1e2f19a4f1486a9e684d3f795bf749945721b7819722f38575c7"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0f9ce27c79c3632444186b76ff409097cdfcc01de40d6ba9d56a23f81d457c73"},"properties":{"commitSha":"032f46368bec7600b689315a00e6aa5398245fb6"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a8e4144fba1c675615a41c8e0c9206967212fd9c457073221bb59743c14fe5b1"},"properties":{"commitSha":"923ce398aa4f9959b212ee2290a0a4789f56c82f"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"559732ca9b06bb269bef0bccb88688b9a93ee81dc8ba73ad35b7375f8fa5dbef"},"properties":{"commitSha":"492e67773282ff0aa82b01a24e475c40115a0f1e"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6c83949134faf18483ac045c75e38c205f4b35fa115a92591b6f1900c79af627"},"properties":{"commitSha":"efa61520a2d037bd9440eb4445cbd99231e2f740"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2871824975646202d20d9451eb841bb48ef6d55bb2b42cef443b46203fcb2bdc"},"properties":{"commitSha":"3b24c8db6b382eb5759a28c6c8d33e5915be402d"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9282390558522c0703215a145fb32104310b12def89b6219a07a780fde2d7eff"},"properties":{"commitSha":"3b24c8db6b382eb5759a28c6c8d33e5915be402d"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e1d2ded8f9a104501750abab90df2f98d00673c43428248056d96e61c8ba0121"},"properties":{"commitSha":"5dab89f3b18034e8a67ed32afe7ce2af4ab2d540"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f1810d8fb11ca36efbe6bed30b99117fc8ea27a34706ed83ae34d4ba8397d24"},"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":"8b4cc739d5cf8247c0fc5873ded475a1de997230513486b156e2f6823a28df0d"},"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":"68f35b07e124439b78c9eedb63599e737f3a3fc9b8ca7e5debe5e5eec25c1ac2"},"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":"36499aad081e27aa24fdb8d2a8a494aeaf16975162d422e841747495c58f1393"},"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":"483dab14a2212696f049bb667b8f7df48d4cec34881b8362dbd6aa61df67e9e7"},"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":"4daa67c2bbd4b4bb90d80bd622cf76e34afd23d4b81c6aa67352988b5bf3711b"},"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":"7b119018b324d5a1dc5f0c3511e80f5437df6cf43a230a2c542536600cb43f1d"},"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":"69ee6323b0f00d9041d332f2844fc9c6e2a4691993a6202b61a1cc1414ea9b3b"},"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":"e86f139ac2350ef5c36212bf94f12d9d469f2e9146847bb4c1dbafd8204d6360"},"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":"b81c57f5401e51077b366f2d5f87466d5ab4c4ea10117925d4a8989d41c12912"},"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":"271e6b7ef1f6fb2a0f783af683e9f0596eab114386f75e150b87e83156e02e0b"},"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":"b21ef51d97f04d1a8b921e635aca9ef4e877341aa2c3b0f6eaeabc61234774b6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"06daafe2709e468287b505c00bf9feb366987173d1ade4b317a3c3dfe35f4e51"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6819b36024d45f5f0e1d43e74427f1e72c7d8dae5d09101e0f966a51bf6829ab"},"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":"f1b966c70d2e5f6ab697ac6d268d54938c60e802d8ea58ea6ff9cb7e10a35f70"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae59d5e9dd2c30e110a21be3f2f3e4339df91ffb4154cfcf5f17bedb858ec684"},"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":"6504d8d1633fd2629c17cb911821ef9d4b240f323d5e1ebac2df01ac4726a04a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"f4c98c98541a54b0a01af4adaa864ceaab9a6f71372985da44cfe686401ae741"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1de4e8df69f8ea88743a72dc79ebdff0df14ccb12667fe14ae5c33266501ddc5"},"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":"8a18117a538367e5f14e5210d589f8e39bb15d6855c7799f0f398227df284598"},"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":"64478662fa5e1544368a8d37a73d78bfc90ea789fe52460bc2794d70b8e273b3"},"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":"e7aea5ad354bb944fe749ff0e5f574830ccdd11e2edd1cb16678dd3d93b52205"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"5a0307a0e95589e470722eaa1f6edefde899ff9d045423b92eaede73ef396b02"},"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":"59bdb5a1e8e9e2536fc49c741fcb4259a61a8678fc811d3adeb596662203897f"},"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":"04b15c1d822501a1f3b0513e178960337673a790f4f183f2453907ced2d2833f"},"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":"fb4a23173542d7a1718b502d857067e50a3ab2bcd9e6cbc8252c0d9b2bd57371"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"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":"d7ae70f403e4a89bfa13296f4cc05026afda1e2136b812f6bc05df9ac397b212"},"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":"fe628f142220e4dfe267449c7ce846fcc2a35f2ed1964a0c92dc0252c24f3159"},"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":"612edae7cd992128bfd0e776556308786695fbc1c78e9976482eb315878ab76f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"e82730618804717bbbb33bba10c46a1fcb69c3690ae1edb86b64e4015a154684"},"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":"5820d2832b24c301dfa745945b6d73762e17d6f8190921e1bba42ea7ccd769f9"},"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":"d2542699b904854fe2d3bb29c559aae2c03652694d5ce26390e798fe91bdf8a8"},"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":"42258b6c2e744d9f693624d265ebcd66e609b619505d4f3f75e763620e5fdc65"},"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":"0af232b1737bddbf1dfd03b1e99ab1f3b8a6e3d76c20394baddb153e6da05ad9"},"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":"1823670305e43a169b48fbd917e572e29e7aa49da335641c631705df063824a1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"1ffee9df4ccf5e69420725ee88195dcd006639d3be26fc593420b91aacd34a8c"},"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":"d541a0eb3b2dbe5998fdd42a98fc8d42f993bd63318277a56aeb54e15c268e50"},"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":"88f25264c5fe536df7cfdba3a95adb8754fe0aecf302c691f6a983a5332a7402"},"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":"a816ce056aae481771bb94fdba0bb56e66b5add36e25a4049cd77c2d494e1a4e"},"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":"01c86d50e58381d439b5a7e1d27502331074f2b2b42584e6c77159fbf315e8e2"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"0934a832acd9841e5534be3105f0ea719332ead682561188564b6e54d134aa5c"},"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":"f2dc972f17fa20a1f573d7d07c9de47b1f8809076cf000d306898508647c1c1f"},"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":"d6e45b8ca1cf2f11a0b8e6c713ba8fd3f6d5296d9219cd71cb9bc824418eee2c"},"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":"b045f06583c9b465f808666ab807bb301b75e163408a0670ffe050a381f461f6"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"a7274b1e34b3efd98c3b2344216b0c8a6ebfd98a059d9e20177c743765e08a02"},"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":"f82a94b547e583107475ce443fc06e8d421287b4914413339b69fa88eebfa9dd"},"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":"f42c03e80baa9514f26014ebb83776c4860e43cffdbe71121cbc44c291862faa"},"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":"f2b8911780baeb504dffa2337c54124dc30299f5ccea5ed3e9f3d4505fabdd06"},"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":"4574ee854b5dd9204bc38ff95eb03255b5e8e6b0db2dc35a90d63d84763fd53b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"134e96fa557a22dfe5be9d2848c95ff8c5f4969bca01716a1f275081f21006b0"},"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":"160344bee8aa0d91db4a1d99d0837d43eadd239c33182f2e78e8d996f1ed8421"},"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":"2e92484af1fef3b4dcb7c78ad7c99b2e3ef9afcbadf8a52158104508ba920832"},"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":"9e05a9afdb159c3b4e03fba36ee6c997dfff609cf8e7411f86b673ca79d09a53"},"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":"1d11b483dfcf915b1cf80342d758e26c1a3f32b269afb2615b61f8aa4d116443"},"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":"9de570ca3a56512cda49170c09efaa1f321d88a387048953fa9cfc476660e0fd"},"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":"d3863a2595bb228753ae718bfb2db02eb99929aa10f09e1bd606c6259c16041d"},"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":"6d7d90df32a41d0b22764ca9e9e277f2d3d8367397fe4cefab8be788bc8b8cbf"},"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":"3b97a9e70a240e925b9e9a70b9a1ac96fefdf955f05ddbaf81e9b02e40678b66"},"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":"7d0b1f1b6e42174c545e1063d548a603c1ae6668b5cf7b3f28dacec5ce96be02"},"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":"6de1e4d6ac5ba9c2d838d05cfb1440ae16805fb52908cceba1f2f6be089d8094"},"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":"ddf3586d5dde8b59bc7edc23de9a00b4d92d1eaa177a8d4923ee13e12a5e7b31"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","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":"85c80dabfc82b8417a87f8cb7f9f7a085abe258275e85c93a403e4631e15a9ec"},"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":"de3a39e75f51264ac6be925c7c61272a39646c8dcbb83d2a75a7237b000241d4"},"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":"133d3a53052114213a13539cf652bef6c113b81701f28ea2e3e1c691620d8ed0"},"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":"1fa40eaad61e0a0bbf312f1986c12a18f26cd8e9a36aebeadb71a390e64cc943"},"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":"d56b4752984d269fe9a43db1bc4d3b74d10d1134b1c7afa69ec0bfec1c246e1c"},"taxa":[{"id":"CWE-95","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9c3115644aa9b5669f3270b8d10fa0456a8ba8add72f98d5964fc0685263b96b"},"taxa":[{"id":"CWE-200","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"41199e5f9964a5d5f767319f0a4298584d0d59deb0a94d250588f7c355c26f87"},"taxa":[{"id":"CWE-200","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"d65024a98d8de12cf9a92b66372fa3ec762c1ff83a91ed9adebdc8c34a5ad855"},"taxa":[{"id":"CWE-200","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"176189fa6b68ffad8defa375832704e3c9dbc907fa7c6896798cad5639440689"},"taxa":[{"id":"CWE-200","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"fe30e2e958c0fba0adc7ef8f7840661f97a06c3d9baa9742381b7a4e0931d53f"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"9a15570ce4a751f33bcd22675cdc1c12a769d7c9cea6b3ec663ba6dbba55251b"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"cbcfd6b58bbccefb64e836bc49e8a132d82778d16b343ba53e8a5acc0cd87dca"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"2068ce4b4934a116a885b3c5047cb1c894fd1a8c8d45ac47e1a845c58da9ca64"},"taxa":[{"id":"CWE-502","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08: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":"a7091fb74d4f3706519d5e7a6db5d948c85705bf933edc0f3e66a1a3a43a0a7d"},"taxa":[{"id":"CWE-200","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01: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":"b311e3dc5beec80ed24d90bfa8eb9b4186986955fb86e3b2296885f6c2b3b623"},"taxa":[{"id":"CWE-191","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"81d8dac1cef798253b7a2fa19ab87cd02278fc963271517208b1b44ab505ff3a"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1297df965b2c4eff10da11050ef737e5eb1012290ee363f292d6ad0103306b58"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9e2f905bb29a23522bc0adae8f5d745b916ab47fb294adeeb598cd848e3fe91d"},"taxa":[{"id":"CWE-939","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"266e4a943c0f3a8014d5bc0ecc47f30c1341ab6585e98d34520135f22c54768f"},"properties":{"dependency":{"package":"pillow","version":"11.0.0","advisory":"[GHSA redacted]","aliases":["BIT-pillow-2026-112390","BIT-pillow-2026-112391","BIT-pillow-2026-112392","BIT-pillow-2026-112393","BIT-pillow-2026-112394","BIT-pillow-2026-112395","BIT-pillow-2026-112397","BIT-pillow-2026-112398","BIT-pillow-2026-112399","BIT-pillow-2026-112400","BIT-pillow-2026-112401","BIT-pillow-2026-112402","BIT-pillow-2026-112403","BIT-pillow-2026-112404","BIT-pillow-2026-112406","BIT-pillow-2026-112891","BIT-pillow-2026-112892","BIT-pillow-2026-112893","BIT-pillow-2026-112894","BIT-pillow-2026-112895","BIT-pillow-2026-112896","BIT-pillow-2026-112897","BIT-pillow-2026-112898","BIT-pillow-2026-112900","BIT-pillow-2026-112901","BIT-pillow-2026-25990","BIT-pillow-2026-40192","BIT-pillow-2026-42308","BIT-pillow-2026-42310","BIT-pillow-2026-42311","BIT-pillow-2026-54058","BIT-pillow-2026-54059","BIT-pillow-2026-54060","BIT-pillow-2026-55379","BIT-pillow-2026-55380","BIT-pillow-2026-55798","BIT-pillow-2026-59197","BIT-pillow-2026-59198","BIT-pillow-2026-59199","BIT-pillow-2026-59200","BIT-pillow-2026-59204","BIT-pillow-2026-59205","BIT-pillow-2026-96636","BIT-pillow-2026-96637","BIT-pillow-2026-96638","BIT-pillow-2026-96639","BIT-pillow-2026-96640","BIT-pillow-2026-96641","BIT-pillow-2026-96642","BIT-pillow-2026-96643","BIT-pillow-2026-96644","BIT-pillow-2026-96778","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-165","PYSEC-2026-2249","PYSEC-2026-2250","PYSEC-2026-2252","PYSEC-2026-2253","PYSEC-2026-2254","PYSEC-2026-2255","PYSEC-2026-2256","PYSEC-2026-2257","PYSEC-2026-2874","PYSEC-2026-3451","PYSEC-2026-3453","PYSEC-2026-3454","PYSEC-2026-3493","PYSEC-2026-3494","PYSEC-2026-3495","PYSEC-2026-3496","PYSEC-2026-4326","PYSEC-2026-4327","PYSEC-2026-4329","PYSEC-2026-4330","PYSEC-2026-4331","PYSEC-2026-4332","PYSEC-2026-4334","PYSEC-2026-4335","PYSEC-2026-4337","PYSEC-2026-4338","PYSEC-2026-4339","PYSEC-2026-4340","PYSEC-2026-4341","PYSEC-2026-4342","PYSEC-2026-4343","PYSEC-2026-4363"],"severity":"critical","fixedVersion":"13.0.0","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6f091dea30d664068e5be56cdd034c467f7940b5f824b0b1e4b4c6fb7e5338a3"},"properties":{"dependency":{"package":"pillow","version":"12.2.0","advisory":"[GHSA redacted]","aliases":["BIT-pillow-2026-112390","BIT-pillow-2026-112391","BIT-pillow-2026-112392","BIT-pillow-2026-112393","BIT-pillow-2026-112394","BIT-pillow-2026-112395","BIT-pillow-2026-112396","BIT-pillow-2026-112397","BIT-pillow-2026-112398","BIT-pillow-2026-112399","BIT-pillow-2026-112400","BIT-pillow-2026-112401","BIT-pillow-2026-112402","BIT-pillow-2026-112403","BIT-pillow-2026-112404","BIT-pillow-2026-112405","BIT-pillow-2026-112406","BIT-pillow-2026-112891","BIT-pillow-2026-112892","BIT-pillow-2026-112893","BIT-pillow-2026-112894","BIT-pillow-2026-112895","BIT-pillow-2026-112896","BIT-pillow-2026-112897","BIT-pillow-2026-112898","BIT-pillow-2026-112900","BIT-pillow-2026-112901","BIT-pillow-2026-114501","BIT-pillow-2026-54058","BIT-pillow-2026-54059","BIT-pillow-2026-54060","BIT-pillow-2026-55379","BIT-pillow-2026-55380","BIT-pillow-2026-55798","BIT-pillow-2026-59197","BIT-pillow-2026-59198","BIT-pillow-2026-59199","BIT-pillow-2026-59200","BIT-pillow-2026-59203","BIT-pillow-2026-59204","BIT-pillow-2026-59205","BIT-pillow-2026-96636","BIT-pillow-2026-96637","BIT-pillow-2026-96638","BIT-pillow-2026-96639","BIT-pillow-2026-96640","BIT-pillow-2026-96641","BIT-pillow-2026-96642","BIT-pillow-2026-96643","BIT-pillow-2026-96644","BIT-pillow-2026-96778","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-2253","PYSEC-2026-2254","PYSEC-2026-2255","PYSEC-2026-2256","PYSEC-2026-2257","PYSEC-2026-3451","PYSEC-2026-3452","PYSEC-2026-3453","PYSEC-2026-3454","PYSEC-2026-3493","PYSEC-2026-3494","PYSEC-2026-3495","PYSEC-2026-3496","PYSEC-2026-4326","PYSEC-2026-4327","PYSEC-2026-4328","PYSEC-2026-4329","PYSEC-2026-4330","PYSEC-2026-4331","PYSEC-2026-4332","PYSEC-2026-4333","PYSEC-2026-4334","PYSEC-2026-4335","PYSEC-2026-4336","PYSEC-2026-4337","PYSEC-2026-4338","PYSEC-2026-4339","PYSEC-2026-4340","PYSEC-2026-4341","PYSEC-2026-4342","PYSEC-2026-4343","PYSEC-2026-4363"],"severity":"critical","fixedVersion":"13.0.0","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"423f274256610b856f3942a60913dc49a565101cee85efcf47763acdd9238028"},"properties":{"dependency":{"package":"pyo3","version":"0.23.5","advisory":"[GHSA redacted]","aliases":["[GHSA redacted]","[GHSA redacted]","RUSTSEC-2025-0020","RUSTSEC-2026-0176","RUSTSEC-2026-0177"],"severity":"high","fixedVersion":"0.29.0","relation":"direct","declaredRange":"0.23.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f5ae954299f4e54a7d44fcc2fd42e4c2a8ab0dbaddecdffa5b5ce5993c331fda"},"properties":{"dependency":{"package":"jupyter-core","version":"5.7.2","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-1477"],"severity":"high","fixedVersion":"5.8.1","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"515cd62d1c98f277bf20896c72e39169dbc25aac9002a256dae02ae779a91961"},"properties":{"dependency":{"package":"tornado","version":"6.4.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2025-265","PYSEC-2025-266","PYSEC-2025-267","PYSEC-2026-140","PYSEC-2026-1974","PYSEC-2026-1975","PYSEC-2026-2287","PYSEC-2026-3387","PYSEC-2026-3388","PYSEC-2026-3389","PYSEC-2026-3928"],"severity":"high","fixedVersion":"6.5.6","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"32c61799ea12afd28b6135da666ec933b4279f8feffe94ac81501e920b038c11"},"properties":{"dependency":{"package":"arrow-data","version":"55.2.0","advisory":"RUSTSEC-2026-0442","aliases":["[CVE redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"57.3.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":"9d7e2f5e4e133844171b9412d83e460349b527553e21e4eb5d4f1e038ed6831f"},"properties":{"dependency":{"package":"atomic-polyfill","version":"1.0.3","advisory":"RUSTSEC-2023-0089","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":"b066a2b58ae4db7be6d042309847a8825c9fbea4c10daa49bc531dab4309fb0b"},"properties":{"dependency":{"package":"atty","version":"0.2.14","advisory":"RUSTSEC-2024-0375","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":"fd5c585b8c54c369819773fdb0ddd1383b1d0b3ca7573d38678c34407fbff305"},"properties":{"dependency":{"package":"atty","version":"0.2.14","advisory":"RUSTSEC-2021-0145","aliases":["[GHSA redacted]"],"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":"4975822701b3b96654c82dada9bad969e348a6adefa52cd3bba1b6cfd71c3bb7"},"properties":{"dependency":{"package":"bincode","version":"2.0.1","advisory":"RUSTSEC-2025-0141","severity":"medium","relation":"direct","declaredRange":"2.0.0-rc.3","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":"80b5c22beae306eb623d7a60ec13361ab89285e1cc30fcf5b8daa2e87ffb5c69"},"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":"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":"bbe030f8c1c144f826bad4cbbd83ebd5ea8dfc9162bb9621a856f9f966813acf"},"properties":{"dependency":{"package":"lru","version":"0.12.5","advisory":"RUSTSEC-2026-0002","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"0.16.3","relation":"direct","declaredRange":"0.12","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.12.5","advisory":"RUSTSEC-2026-0253","severity":"medium","fixedVersion":"0.18.2","relation":"direct","declaredRange":"0.12","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":"705e8761c5e609601c0419d94a8bad1aeb6aee434f48ec4660c92e8bf534c9de"},"properties":{"dependency":{"package":"number_prefix","version":"0.4.0","advisory":"RUSTSEC-2025-0119","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":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","severity":"medium","relation":"direct","declaredRange":"1.0.14","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.1","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":"95686d8e64236c3c2c566e482859faf67a5bbd9dbeebb6f4df8aab56c3496281"},"properties":{"dependency":{"package":"proc-macro-error","version":"1.0.4","advisory":"RUSTSEC-2024-0370","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d469c4cdd0b2892278c4ee90c01a5a8ea4872a98733c483777e04c904cfebdfc"},"properties":{"dependency":{"package":"proc-macro-error2","version":"2.0.1","advisory":"RUSTSEC-2026-0173","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":"64363d74ce1f052fae524dc374bd082dc62972fb05982f1a96c21eb7c322e135"},"properties":{"dependency":{"package":"pulldown-cmark","version":"0.13.4","advisory":"RUSTSEC-2026-0414","aliases":["RUSTSEC-2026-0433"],"severity":"medium","fixedVersion":"0.13.5","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.5","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"1.1.6","relation":"separate-copy","declaredRange":"0.38","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":"d38736f2611cc8a68dd6d9310c78b5d2d83dfcca00f3553b710b7486c0d08717"},"properties":{"dependency":{"package":"ruzstd","version":"0.8.3","advisory":"RUSTSEC-2026-0344","severity":"medium","fixedVersion":"0.9.1","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":"5c430f51c25d079e0fdc603f98de7a08790e1dfa5aeeb424f2d1aba5456169e1"},"properties":{"dependency":{"package":"thrift","version":"0.17.0","advisory":"[GHSA redacted]","aliases":["BIT-thrift-2026-43868","[CVE redacted]","RUSTSEC-2026-0435"],"severity":"medium","fixedVersion":"0.23.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":"b99c63b86fa491be484b34be898f3f455b04a0fda0b717012d67bc5e78d9038d"},"properties":{"dependency":{"package":"tokio","version":"1.54.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","RUSTSEC-2026-0384"],"severity":"medium","fixedVersion":"1.54.1","relation":"direct","declaredRange":"1.34","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c356dafc2d2f879539349393edf47ceccc3e0771bf15e4dae816abd8594fd25c"},"properties":{"dependency":{"package":"ttf-parser","version":"0.25.1","advisory":"RUSTSEC-2026-0192","severity":"medium","relation":"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.5","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.2","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"06e8dc8c07565b965cad3fead890e0d682e96e4f994ab4a0654e3f10afe7962d"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","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.3.0","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.3.0","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.3.0","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.3.0","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.3.0","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.3.0","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.3.0","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.3.0","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.3.0","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.3.0","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":"77d4d5d4357ce0a5ade8f6f76c84914f1a2c80f9fe7358d9854254b760de650a"},"properties":{"dependency":{"package":"zvariant","version":"5.15.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.15.1","advisory":"RUSTSEC-2026-0372","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":"421a986a90edb329fce5f27504749b890987948ea7ec4495a200319891adf072"},"properties":{"dependency":{"package":"fonttools","version":"4.54.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-1389"],"severity":"medium","fixedVersion":"4.60.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":"f328d9bd641b505f232f5ab9e37079bda6f7a6c48b6f2d31987c30e0cbfceee9"},"properties":{"dependency":{"package":"pygments","version":"2.18.0","advisory":"PYSEC-2026-2987","aliases":["[CVE redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"2.20.0","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"59bcd8b6f588df0de1b3caa37e016dc8283c6670d4fa7e69ebe54617d7405387"},"properties":{"dependency":{"package":"bare-metal","version":"0.2.5","advisory":"RUSTSEC-2026-0110","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":"4d86f5ac630319c125d7440261157bba62ee69152c46e641a8d9bda7d7d61184"},"properties":{"dependency":{"package":"bare-metal","version":"1.0.0","advisory":"RUSTSEC-2026-0110","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":"f53de4e7750261823172bfabd4f62e0ee983c2d1b98b797148dca2bb6aa45fff"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","severity":"medium","relation":"direct","declaredRange":"1.0","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":"986a1bd247ef37db6eceb4741895bb390a86df8a3c6ce1205e43e661d2ca6029"},"properties":{"dependency":{"package":"proc-macro-error2","version":"2.0.1","advisory":"RUSTSEC-2026-0173","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":"486b8efc5c3b164275c25cba6107c8714989974700906d39f08e8d9277cc4431"},"properties":{"dependency":{"package":"anyhow","version":"1.0.102","advisory":"RUSTSEC-2026-0190","severity":"medium","fixedVersion":"1.0.103","relation":"direct","declaredRange":"1.0","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":"642939baa7d328d5cf96f177df123dd0f50c2f6e398b596b07b0a6ca3ba63085"},"properties":{"dependency":{"package":"bincode","version":"2.0.1","advisory":"RUSTSEC-2025-0141","severity":"medium","relation":"direct","declaredRange":"2.0.0-rc.3","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":"72cef1aa80e67709b1d703030737799418237c22af28471ed6b6c15dc0c5e7bd"},"properties":{"dependency":{"package":"crossbeam-epoch","version":"0.9.18","advisory":"RUSTSEC-2026-0204","severity":"medium","fixedVersion":"0.9.20","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":"9bd37bf1f8dc964518f11a70cdd7b105a280491378f8317e1accc4d28f2e28e8"},"properties":{"dependency":{"package":"event-listener","version":"5.4.1","advisory":"RUSTSEC-2026-0221","severity":"medium","fixedVersion":"5.4.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":"cca09c91248dfa8d3059cc12bad45e09271707c70627df385dbdb4fafb745b14"},"properties":{"dependency":{"package":"lru","version":"0.12.5","advisory":"RUSTSEC-2026-0002","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"0.16.3","relation":"direct","declaredRange":"0.12","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":"d233f9148cf3730d52ce23ed7785f532359c7cc508099b026a235251993ee4d1"},"properties":{"dependency":{"package":"lru","version":"0.12.5","advisory":"RUSTSEC-2026-0253","severity":"medium","fixedVersion":"0.18.2","relation":"direct","declaredRange":"0.12","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":"b2d7d8b07848f6b4c2580edb30604345b182bb89e422bc176aece9870f9f9225"},"properties":{"dependency":{"package":"memmap2","version":"0.9.10","advisory":"RUSTSEC-2026-0186","severity":"medium","fixedVersion":"0.9.11","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":"b848a37ec1d59b1885c63d5ca9c69e93138867cd03441ce228fd041d419d40ca"},"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":"99f6d5349903753846d5766bdda1bc156c68094ecf4cddbeefba8d018c472a34"},"properties":{"dependency":{"package":"quick-xml","version":"0.39.2","advisory":"RUSTSEC-2026-0194","aliases":["RUSTSEC-2026-0195"],"severity":"medium","fixedVersion":"0.41.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":"81f5e3d574fa48d80d6bf367c1646fe41f9279819909150fc87699e9af0c4a59"},"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":"cc3658f495dd89faba05fdebdaf3ff552a019e603e110167d355b30a6d96bfc0"},"properties":{"dependency":{"package":"rustls","version":"0.23.40","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":"d02a2e9f3663fd9c6caaa08e065cb1a3fdd82a1a25ff0261c833cd453343a989"},"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":"14ab77db73a75134bb9020fdcf9eb27f5697d38af442b68d45d5f83b73a8f2b2"},"properties":{"dependency":{"package":"ruzstd","version":"0.8.2","advisory":"RUSTSEC-2026-0344","severity":"medium","fixedVersion":"0.9.1","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":"9bde8ccb5339b178d61a35f37fb58b0b1092598a06b02170f199a0b9159914ef"},"properties":{"dependency":{"package":"ttf-parser","version":"0.25.1","advisory":"RUSTSEC-2026-0192","severity":"medium","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ab9d2a4d2f07a65809a5816b7e18a211229592a6642477a6cb34ad088b338b44"},"properties":{"dependency":{"package":"webpki-roots","version":"1.0.7","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":"33c698201d69666707a210ba31e95f2cd1eae495769c70c9bf314aa6c9651ab9"},"properties":{"dependency":{"package":"anyhow","version":"1.0.100","advisory":"RUSTSEC-2026-0190","severity":"medium","fixedVersion":"1.0.103","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":"bb2c6e8a982d01804e15f6120e1ea33fb8dadc09a5613929601db80337701c37"},"properties":{"dependency":{"package":"atomic-polyfill","version":"1.0.3","advisory":"RUSTSEC-2023-0089","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":"698b79d8d5c80d3f2ded4203d3081219eb1c1ef4b006ddb1857989611ac0c606"},"properties":{"dependency":{"package":"event-listener","version":"5.4.1","advisory":"RUSTSEC-2026-0221","severity":"medium","fixedVersion":"5.4.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":"2a898629c5415c7d1b42120e5fddf778ec143bda169d5bb09aa36f947291e72f"},"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":"d0c5473770517b4907b17633511405bfe14f0e255863b0821d06d1f14151633a"},"properties":{"dependency":{"package":"rustix","version":"1.1.2","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":"991f87bf5bc92b651979a76d6102d6f2cb726207241200e93262fdf37b25efb6"},"properties":{"dependency":{"package":"stack_dst","version":"0.8.1","advisory":"RUSTSEC-2026-0272","severity":"medium","fixedVersion":"0.8.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":"24cd14ff49aca387d5f424f4389f78724a7208c3059b3b50cdc320a0261de1f1"},"properties":{"dependency":{"package":"tokio","version":"1.47.1","advisory":"RUSTSEC-2026-0386","severity":"medium","fixedVersion":"1.51.6","relation":"direct","declaredRange":"1","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":"82804b860450cb4d278c5d73382dabcb82f01aeb6359bf24da3bfef8e913a6c4"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"0e7ea832ee146c0c510380099c1779f6a35d4d761a16d9243576e90f365e4194"},"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":"8d52e6b825448151da5562618b509602a22119e3420c562c69f88bbe01fda721"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92db36d3cac2b278f9d38522cca899e69309b9bf6d4c1498d71184af1a03d1da"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/scheduler.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5433ea182601e2774a6db924fe63c256f5f4b6491c6fa63f8dcf8039e8a0b1"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/array/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7cb1334973e418dd00f0898f165d23a04847b0c55e8e12d53b609cf54bcbd62"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/wait_queue.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"851645011a6d3f0e427ba61a226080c0ffbea6037a897f888bf49e598705755b"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/roci/adcs/src/tests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b5ef0575cdf8e9d4aeae26172857ca5e9e2eab72c1fc56a6dd379e9f3bde762"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/task.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ee62463107292bb999525020745d8e7a789f24380bd37d48ffb44395a9a7fa"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/util/src/io.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4862e1e83f28083c8c787e6e16a9e1d1ea473deb6ad5c242f60aa7d65f41c715"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/semaphore.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71d33c6f266f69b6d0eda7f3c150aa77edbb23156043d94e88ad392cabf24385"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/wait_map.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c92c5b390b94a99884f306ce95a753eab10cd63ca47b206bbd76ba3035e6aa37"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/cli/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9206f4b7590ad41c1c1d516019293c95484613f329f2e0932ac188d970b233"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/batch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad786b9039e7effa51f373f66bf33c74915507f539c7b8f2e6e1467129f1e65"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/tensor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e51b31b1477bf1541c76e40b7d044d920275ae648c3675c71cdefd69b6def21"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/sdmmc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ef216b4f6d997d76f4b343cd9fe80dff70eafc3fe72c8e3a37af20ae055741"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/wait_cell.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2292deac65b7da828c4e196329007248ff032ed9abc2ff4fc4182f8adec563ea"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/postcard-c/codegen/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebc4d67a8744bc2c01b8728b4554a8ee4209b4216b7fb94f0c20e6d7f188847"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/spatial.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80dad5411b8e8daba56d19427ce57672b82307027e1ba9adb137c941317330e"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/util/src/sync/cell.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae9e3605c239f10d649f2649c3559a483c37585c775cbbb766a88f8c04e4d088"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/time/timer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f7c954a2ef80a6d9fd6c739a6608110af72e2446da9776bc1034e22f6bc8d5"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/jax.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a3c2d90a7d7ff2f793f617bc3d0968a02ed3272443ff2c889dae1e63be1d6a"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/mutex.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdb5e2b85e0df34e576ea4aedfb887cc520c294961bd7144986d8a1599c12b2"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/bmm350.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c129e387879b6e49f1f254d9e9de73573cc35ee7b1d17f298d7d76871b853cf"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/util/src/io/cursor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"546a0bc2a55743cb0d07e73a9b9f061990832e589d8e2635e5cb2682247a1338"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/spatial.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"753f0f7ca7e0880f4a1b5a3c0f405cd41c445a74291079364bd93d6a0cef2e75"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/roci/adcs/reference-impls/magical.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a76b0c8033dcf41b6e0cf01cf746e4b455300bba412b9604362f0258ea64563"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/loom.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae09afef31292075ce786a9486ab6f839d9d6fecbdd72f0beae6a710e4fee22"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/rwlock.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6605595fd6c1c4e7ddc8996e97a4456871a15e8736f5eb30287669680ad997be"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away, so if it breaks, no one currently understands it. It does carry its own tests, so the behaviour is pinned even though the understanding is gone: schedule a read-through, using those tests as the specification, before the next change lands here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/task/state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6941fbce7ece7af08084c4fab560aa5cb536a011adc030af6de615706a2679"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 128 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: libs/stellarator/maitake/sync/src/blocking/rwlock.rs, libs/stellarator/src/poll/ops.rs, libs/elodin-editor/src/ui/button.rs, fsw/roci/adcs/src/ukf.rs, libs/stellarator/maitake/src/time/timer/wheel.rs, fsw/sensor-fw/src/dronecan.rs, libs/stellarator/maitake/util/src/mem/maybe_uninit.rs, libs/stellarator/maitake/sync/src/util/maybe_uninit.rs (and 120 more) (155 orphaned of 523 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 523 of the 668 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/blocking/rwlock.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fddf38d53256f45b3c96bae273de71713266592c25096d9e9d5bbb7bd616113"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/src/poll/ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9707316ac83c4c72c924620772f9ccc55dbd204546564cdde1b99b2b5c60aed"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/button.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df5c492af6722e6ab36973db17cb9d1357e7d85176e54c85b7d1e1433f0f389c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/roci/adcs/src/ukf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48971f5687bcca75532052bc19a55a1add5dac16311b8a1a5691c58239396b1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/time/timer/wheel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62ea8c5372e4f30d0392d9b15880e491500f7f07841f033e38f7f9ee0ad29dd"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/dronecan.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28744104d78292d6d98bd2a533575413d65a91566e1dec763391ee5f44e4318d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/util/src/mem/maybe_uninit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4336de1f5a0d019990c93a9d0f47e8078063978c92af441116955dbeedeb70"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/util/maybe_uninit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bbf67992a2818011d3038455201508ec158abd568deaacebc2b1021278af7e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/time/clock.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c68016563e93e261528a9353fdca58c66a8adc8b5ba9f562cf5cb363732450"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/wkt/src/value.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f03d829bc86feee542e67857e1d9bb6392b0bc177e1608b7c909b2463445342"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/loom.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f711458b1f8166816c7260a9b7911e1c468a00b4fc9b8dfdcfc711e1c66124"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/blocking/mutex.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"efaf03bdeaa724ac8c1ada134b938342e7ac4705c2b1a7a33e3ec2d0e737865e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/rwlock/owned.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b68ebcf2e6e17272773317cd3205cc3dfc59512bbcc0769bf0e058f8208d6946"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/roci/src/tokio.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"162afa3da1974148f871c76989419f5d273ef844f1fcadf703caae04c834c17d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/repr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2f67d6f9257a31c6b766ae78306a623872d789cc329c62d6c917b60e5ab393"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/quaternion.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"588adfcc85280ef3e10de8f526d8a77a2f811693521add788a978c8e1982e342"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/blocking/default_mutex.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc9c7b3da88cbc07ac4eb7dc2267e7b8e8902e13a3a8553cb3cffc47d43b411"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/spin/once.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14f7e51d1efb171c8062c2a1a6d9c1f346603d2ce66009e04270e5981af934f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/bsp/aleph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d3f7868406d57dde4915a4a996e603825685c3ce8e7f1b1a7f2c7f58487f94"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/src/uring/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3787c43dddcd8b85ee1582e15abd84df08a53040f7a005b7d3051d233a842c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/scheduler/steal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0d71466428438f24e02aec8584f61d0801465408059385c67045274b486150"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/task/join_handle.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a0679542b6a6c8e648590e0b46f809db5548776500664f459a0946effeeffe"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/bmi270.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c3f0fa2fbe610f4f74fbcf2f551f8fe66a153f311ebcf857f9ff79c3e06f95"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/aleph-setup/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d128f66d0191e9cfb3723b74cc76555c406033c84d7c6d4fe106faea2da250"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/roci/adcs/src/mekf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe62f0c6a306ff6fe241744b1b829020bc9486b5b6cf2bdf2e04cc336775e635"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/roci/adcs/reference-impls/ukf.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3abc3ecd1140dd575d090187c7baa8f3e1b9f055ab2e01a246bad1d99910f7"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/util/src/fmt.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"472db01e6250c72665993cdc63bd9a444e4b86135fdf36f69ddd38c3c3bc3db5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/src/uring/ops.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"579b1c3cb3eb8ebcfc9441fef3ad6a5fcf6dc938b5d27c2e499a482ecc6ec177"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"apps/inscriber/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb1366b9aa5c54c078a7295600fe3d42908868daf1a70de7663517fba9590d90"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/time.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7182ee3ee9af43dac13bb3611adb73bd90929c2ab98f468e1f5ca5a6ee3ed4b3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/blocking.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"517f7e0529b9d8851db6ecbedbcc272b4b9039beb5755c529884d36888004c61"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/usb2513b.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5e857a570472dde183f4cd63f5265f2398ed790f69982ff1bb9b3f3667c1acb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/buf/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ee4123813066cf7bfc704c14a19f36549b4beb7569ae0b116cc95458a166b8"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/fm24cl16b.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a51eb7dbd550f913f6d113fb48c0d8940a9fa880a58a047af41cf1822209ff"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/task/builder.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"133bf1d9278e049df2a4457755c5a08ecff45421e5fa3c127f73fe14eea83c16"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/crsf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2944350be0345ad2321075d5156114bcdec9a3a0539a0b54944b1d7d6277cf00"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/spin.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34fbdee47879a5959d5eac48e3471a19fbe2e083677e71be2e594b420b068d0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/src/buf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c8044ae15949d41e51085bb0db901fc31244994f89e261ba5775c3f5ecf5a0"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/adc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a92b0b015397d144c5277f60c11dd7e6c034825fe3fe56f05de06e45144b67e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/util.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35b5bac782f496f0fea60cf6c1e82d1410bbed7651e9272a863ffe05673ebb9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9ce97f9384f85e6cc25221a8cd5f20dc02e1b284e4e97ee858f8d711e704c27"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/label.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c913e39ec51788c3e09bf751a855dd27aa4312a030462b67e5a3bd2d54d6e6c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/repr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7cb57fe44ca379bde76b6fcb8a69dd68288ee46073666df6e3b16713c7de24"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/array/repr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85ccb67d9b2e7cc983c06b95de06db23001209ad29fdbf26dc00b49a88eed8d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/blackbox.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1980dadb04f44bbd3fd3399d5a6884590657a9697bae4c9c26040a667248ba4"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/util/src/io/impls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25c9da8d6e34ee87390f9e90a8b76a0a52d2908ffab7e250885605966636d70"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/i2c_dma.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65a9883c73e7098b9e158802236f0a317feb8229952f41bde7b9d0bd4fc1bda"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/src/fs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28c98f8ac26fd1042541d5abb4a1a3621c084ca80dd0953c9e28a28350a37aac"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/src/buf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"239c58ea01673203ab0e598311b556fd37293442a97b0bf7695d4e86db0fb0ac"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/util/src/io/error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c376ee944c9592935e22dd6e6c288856ebf4dcda13f27bd0b3b4fd70fc359d50"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-frames/src/iers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7a2a3010ea41a9ba7186e18d7a78ca11ddc7c9927301fd65df998168cf4c6b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/src/os.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d639e0560df1bb16bfe9ed3fb2397cafc7260a416f347cb9a26409ea5f239cf3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/util/src/sync/spin/mutex.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea09eb1bb27158929d29c79ac37de582051ea40d2c3f916e80e98d752abc417e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/video-streamer/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d91b141a88bb2b9a9d6691e0c13a6977fb3e093900a61899b723a5a94f70c6df"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/aleph-status/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc81ec012cc3d68a683da7deb4b9797851ba490b167a37fa3f75b07ca80ab908"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/src/util.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0000c58a3810bc163488c7bcf0763aa06c46e6ec090d14f263612ed33d63e92"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/time/timeout.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f760bbe3d206cc4b407a1c8c7d201b8e8ebf0410590f76a1cf0f2712a655a9a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/widgets.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4e54ed458486d172d084e83f66e66923091073076064ae5df654044643da3c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/time/timer/sleep.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e5f6ec8e17b2ed28a83f8d147d29c49247c24d2b726eb6d7da50075cf0616c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/peripheral.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e431475b6ae6728d5f1bf73bd149e81d2706b00a225b400df5d965115d4058"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/theme.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1f5ebe3a20e7dd817eb4e6a84f837e96ec2d867ddb71ac0d33bae5e9769ee9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-frames/src/earth.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a973b724c88b26eb235152f321a7537dce30268fbeebe9ff015a0f73e1007438"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/src/com_de.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b618d226bc09c63a0f4d8f5a6cbf0b45a83f32205b547250285f693439f10e9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/array/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0af0cd496ff9a708f03a6666855d299732aaa05081ec7dae2cdd8e3340e5bb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/stellar/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec825c30e853264eb8406d18d21352a9956a508a9422e3ffd90cd743b6139d9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/comp_fn.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"41db427d8191fca3508e7490b4408fc4a7ab9465624215497329500441fbc585"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"aleph/modules/mk-esp-contents.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"39960fba3afda3f1ed0b4885caacadd609c19734c4b5d2593c8e2939a3dcaba1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/wmm/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99587d5b6df35a82ad3ac85a26b0e41c8c07a809e3156debf2c3cd7a9f91c60"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/can.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de20e869abe09c16696392113ea9c566810ef9831a1209322d16c8c917a56d31"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/util/src/io/util.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ce62cf0af2d74c679927c18a89b80821addda30ece34a2bd60282ceae71332"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/hierarchy.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff5ab7a5f338f68d14a9c56bdd49d1aa5adff02cd32bf81fa01d237beea60ad"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/matrix.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c97b6f3be11c85e15f09a344b84307e2e0c21d1f120df3d1597628fb31da459"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/fields.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"206abbaf5417b4af41f088c53d919432ce851bd94edac3a49aee849380ebb41c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/bmp581.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60d0cd55bf1bbfcaa91b5c06c41f3103f5ae9b17056bea4d21a35751764e98c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/util/src/error.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77af3eddf3cb79a8f06468f5b6bec5322cd32634bdace5d5e50f5339f502e7d3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/util.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa1a3c8b33cbc11a00d0f43b9795f39c6bca811a78fbcf0f14b8da0d07fb675"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/src/nox_impls.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fccd162567e9698d7eb54bab15c2452a239be50e4cc86eed37a6244d390c587"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/images.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ef24a346224dda388b1b95940a5263532497a23a83936890a3d538c06826f1b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/dshot.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1532f8fa1ff944cb0f22cf106a4a889b5125fb3ed6c658195237382857cbfc6"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/wmm/src/coef.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"618bb4ccf1a0ca1a1847a05055cd6cd2253322c9702888ed536b351470dece31"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/arrow/fft.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7457ebe04012b2965243ddaee20ff40327ad684634c3624064e3e1e7971c60"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/roci/adcs/src/yang_lqr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39a83a4060c56e7cac49f6c465a5a90282bf90a4c82c6d85063511605898113"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/tensor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b15e5efc873198c0c8190877ab0510fc839b158fc17f44f3b7952c9a6d7eebb"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/src/net/udp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"64839e8816f7a7816fda833c5e0566d51512404c8b74a9a5dabbd4bef2d4815f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/dim.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9223c8d7c42055609eb828fbf967e47d8d16af21af6789ae9e729a02064576d5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/vector.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e8b73f561d227d6a1bae4deac21f897c7bacab9deccdacf47484d9ddbacf476"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/src/net/tcp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9f5efa3dc655b06fccb0eb3ba523f68aae1b5d497a4238ac10bc4999c6f385"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/stellar/src/ext.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"38feaa5b83279598d949c9bd572f9799c77afaca4d34462d16eaa520fb87517f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/roci/adcs/src/magkal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc05491d29664386eb041110edcd47fe27db9ed2453dc7525c2b779c57c2cdd"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/roci/adcs/reference-impls/mekf.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32fc16ad08a1c029d53052eb03aa80ab75c8ad4993fa7d938346441db7c23b1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-macros/src/repr_monad.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e5f49a31f24799cdddf9edd5b000738e86cfc5690a471292d1774603b2784c"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/src/serial.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2912876d859e77d80598f0ea52fea459899291bdf43661ddb19215be9790476"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/src/struc_con.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df639edc5c428c81117d0b50e24848e86a6c9d89940cd683ee63726c4beae3f"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/mrp.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5058f3ed1c957e442db1dce7c5dd3d02b48161ea21f3416445a1184a37fd9d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/array/dynamic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5224afc6eb373ddc4350f14c7cb0dbc3ee246aad646190a646fe00dff02554d9"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/aleph-setup/src/iwd.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc28367d0cb52544821a2d6b3978cbc5bea0a739e4cdb44c52e8a12e86b5c056"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/video-toolbox/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7beca241ee64b5d873d36d55c809b527526835bdefd82c5113e694e87071dfb1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/util/src/sync/cache_pad.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd2dfad88bd7b54d90056445764fe357c8ffcd6a45f2c86274e1ed646dbb07a"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/util/cache_pad.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e9b95075fcdd2c7000e1ecf83cc26eb32e57251508cf92a4c537746dc2bd47"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/bbq/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d2a8aa5fb2b74af8c29b7c80e39f87aa06388f7b5d073726704726d02f66aa"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/time/timer/wheel/tests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a437a4be3238e8b5f275fd8fee9100e1a80cc37c46527db08ac863d72ef0e204"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/frame/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f896282519804b0951f3af91cd27dd8976ba0caeb38f04c5bb23455d663276"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3fa1caef5d7d39446b96c1eb36b2ab49132bc238484a40d926ebf7373f3fe1"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/util/src/math.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4871d7053ee350f620c1df5163eb463fec4b2de8b1d5c95803121a90aaac675e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/roci/adcs/src/magical.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef2bb2d58cb41f43f90260835a7906da30295e52455e7c58627e59c258cec82"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/macros/src/as_vtable.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef12d7e71c9b776dbb418cb6521a73a195dd150abdc73593be90252adebdd83e"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/monitor.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d0ee56b7eaac06a82cdd81c69f7f363b938f1ed74a241a8b9041dcce7f1360"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/trace.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d12b57f17b33fa04a7fa15835d466fff43135f880c8ae7b00bbbc4dcb8558a3"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/integrator/semi_implicit.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d165d8904710e6869b3377591d68ab19eaae3ff2416d4e1e82d8dda261f8b23"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/util/wake_batch.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7c27290a195cb42b8009530630062688f6dbbeccbba130c97cfd3f76017058"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/healing_usart.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1acf0c88b4fdd02bec648af9c16231f9f1b86d8886ef56dc53e8ea99f5b5d13"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/roci/adcs/src/triad.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"038e210b32e3ba0f3286b44f78e8a6fcebc1f1265ebeef7d92fbd414b416e014"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/action.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b52bab0957b33b1cfe0e8291df06f974e8148fe4697dd4a6de14d99b1572bb54"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/wkt/src/path.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42501a09d6172a395c7794ceaf970ff09ce165573b4ad6214fe4e1e10431145"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c2c7ca72231cca51ffd558fccbabd22dd888f65f51453103dbc5175e63cb736"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/lqr/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25f94632ce9c1a4fcdc88797af72e555d717c7c6be9123d17d5af130db9da0a5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/task/storage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1da3022816d3cd347514810b4c09f687a047f49d086310d3c64fefbbab964d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/macros/src/decomponentize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e5fc95c971176569f13d4b9a87d9c397612da273a16e9af6efb0309e709af5"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/task/id.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ad2031c502adeeba5668516485633f10339f004f1aacdc2fc2e2a3ce41ac357"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/dma.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b274955ffe0d8cbbce015d7431ccc68f804ded11fb23378c7159403384a21034"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/util/src/loom.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a80985b11d3f0e6b6ff60eb453a86baf93a60e09b870641e10cb3229e5de0b"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/time/timer/tests.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d6da7ebf8ca30a31d5dd90880637516da8e52b3c6aeabfd3ba301e3fde11208"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/macros/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"682a4183dc1dd5263cf0eeb4581f08dfe08d4df4e0662972708a6acad3821af2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/roci/src/drivers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c378522fb5f8bffb29735ce6da4d01e19149fddc531074cb76c45693b63ce8d"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/control.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05370f2db3fd97f41c420ed5868f926e717988f07fb9f3376b252fb49f17e1fc"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/util/src/macros.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb6bfbc42a56229a5942a97f01e23c7450e767118fc8af58565cb9018a145c2"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-macros/src/component_group.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1dd2ab00b69d8b15aa8105c3805f4fdca7cda1f46a1ff56e4374e622137f41"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b0507423521d640b27f09ea6ffe38a0c1925fa2a0b7bc751c8a1546cf84b80"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: mod.rs \u2194 de.rs: \u0060libs/elodin-editor/src/ui/schematic/mod.rs\u0060 (context elodin-editor) and \u0060libs/impeller/kdl/src/de.rs\u0060 (context impeller) sit in DIFFERENT parts of the tree yet change together 76% of the time (22 of the 29 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 22 shared commits counted here, the most recent 3 are \u0060f8bff7e2\u0060 feat: Frustum up-direction. (#860) (at that commit the file was still \u0060libs/impeller2/kdl/src/de.rs\u0060); \u0060b7707ad8\u0060 feat(editor): smoothing for the viewport follow camera. (#764) (at that commit the file was still \u0060libs/impeller2/kdl/src/de.rs\u0060); \u006009839848\u0060 feat(editor): artificial horizon gauge. (#753) (at that commit the file was still \u0060libs/impeller2/kdl/src/de.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7f040370dae575798379943911128e03aba8d339f2c91c337dff2d658d3277"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: mod.rs \u2194 ser.rs: \u0060libs/elodin-editor/src/ui/schematic/mod.rs\u0060 (context elodin-editor) and \u0060libs/impeller/kdl/src/ser.rs\u0060 (context impeller) sit in DIFFERENT parts of the tree yet change together 76% of the time (22 of the 29 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 22 shared commits counted here, the most recent 3 are \u0060f8bff7e2\u0060 feat: Frustum up-direction. (#860) (at that commit the file was still \u0060libs/impeller2/kdl/src/ser.rs\u0060); \u0060b7707ad8\u0060 feat(editor): smoothing for the viewport follow camera. (#764) (at that commit the file was still \u0060libs/impeller2/kdl/src/ser.rs\u0060); \u006009839848\u0060 feat(editor): artificial horizon gauge. (#753) (at that commit the file was still \u0060libs/impeller2/kdl/src/ser.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45cac9aa05102c30f930f705e9fd27938cc462d2edf4c91d017bafebbcdb24e1"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: object3d.rs \u2194 ser.rs: \u0060libs/elodin-editor/src/ui/inspector/object3d.rs\u0060 (context elodin-editor) and \u0060libs/impeller/kdl/src/ser.rs\u0060 (context impeller) sit in DIFFERENT parts of the tree yet change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00604899f019\u0060 Feature: Add error covariance to ellipsoid. (#744) (at that commit the file was still \u0060libs/impeller2/kdl/src/ser.rs\u0060); \u0060775fa7d0\u0060 Enhance ellipsoids for covariance matrix visualization. (#522) (at that commit the file was still \u0060libs/impeller2/kdl/src/ser.rs\u0060); \u00608e33768f\u0060 Object Icons (#504) (at that commit the file was still \u0060libs/impeller2/kdl/src/ser.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/object3d.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1947a67227e2a5e957482a0fd17bc8494a82e4ea2adb354183ef939be05f69b3"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: lib.rs \u2194 jax.rs: \u0060libs/nox-py/src/lib.rs\u0060 (context nox-py) and \u0060libs/nox/src/jax.rs\u0060 (context nox) sit in DIFFERENT parts of the tree yet change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00606ac90ab1\u0060 Add python wrapper around unscented kalman filter (#668); \u00600f253ba1\u0060 ELO-211: Compile systems to XLA Computation (#598); \u0060dfff5ea2\u0060 feat(nox-py): bump pyo3, polars, numpy (#441) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e654ebf03ae82cee94380a790d1e06ad8c4224102f025f3e6bbb0c34b7cc273c"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: object3d.rs \u2194 de.rs: \u0060libs/elodin-editor/src/ui/inspector/object3d.rs\u0060 (context elodin-editor) and \u0060libs/impeller/kdl/src/de.rs\u0060 (context impeller) sit in DIFFERENT parts of the tree yet change together 70% of the time (7 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00604899f019\u0060 Feature: Add error covariance to ellipsoid. (#744) (at that commit the file was still \u0060libs/impeller2/kdl/src/de.rs\u0060); \u0060775fa7d0\u0060 Enhance ellipsoids for covariance matrix visualization. (#522) (at that commit the file was still \u0060libs/impeller2/kdl/src/de.rs\u0060); \u00608e33768f\u0060 Object Icons (#504) (at that commit the file was still \u0060libs/impeller2/kdl/src/de.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/object3d.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"45663d5dd10be3f7df66794cc252b167f39b6899821a3f81a62017c3d9bd652c"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: load.rs \u2194 de.rs: \u0060libs/elodin-editor/src/ui/schematic/load.rs\u0060 (context elodin-editor) and \u0060libs/impeller/kdl/src/de.rs\u0060 (context impeller) sit in DIFFERENT parts of the tree yet change together 62% of the time (23 of the 37 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 23 shared commits counted here, the most recent 3 are \u006009839848\u0060 feat(editor): artificial horizon gauge. (#753) (at that commit the file was still \u0060libs/impeller2/kdl/src/de.rs\u0060); \u00604899f019\u0060 Feature: Add error covariance to ellipsoid. (#744) (at that commit the file was still \u0060libs/impeller2/kdl/src/de.rs\u0060); \u00605d8f746f\u0060 feat(editor): geo-position gauge \u0026 orientation gauge. (#739) (at that commit the file was still \u0060libs/impeller2/kdl/src/de.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da046cd84e06daa5585160c8ecd2c1711f3633546f89f918c5b00e53ee0365e4"}},{"ruleId":"D35","level":"error","message":{"text":"Boundary-crossing change coupling: tiles.rs \u2194 ser.rs: \u0060libs/elodin-editor/src/ui/tiles.rs\u0060 (context elodin-editor) and \u0060libs/impeller/kdl/src/ser.rs\u0060 (context impeller) sit in DIFFERENT parts of the tree yet change together 58% of the time (21 of the 36 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) \u2014 the bounded-context boundary may be in the wrong place, or one context is leaking into the other. This is the behavioural boundary violation a static scan can\u0027t see. You can check this without leaving the row: of the 21 shared commits counted here, the most recent 3 are \u0060f8bff7e2\u0060 feat: Frustum up-direction. (#860) (at that commit the file was still \u0060libs/impeller2/kdl/src/ser.rs\u0060); \u0060b7707ad8\u0060 feat(editor): smoothing for the viewport follow camera. (#764) (at that commit the file was still \u0060libs/impeller2/kdl/src/ser.rs\u0060); \u006009839848\u0060 feat(editor): artificial horizon gauge. (#753) (at that commit the file was still \u0060libs/impeller2/kdl/src/ser.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"042341b8064d6cf26b32f5578d5f3a7abc1d05a157d1f6bb442d84ca750552ce"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: object3d.rs \u2194 load.rs: \u0060libs/elodin-editor/src/ui/inspector/object3d.rs\u0060 and \u0060libs/elodin-editor/src/ui/schematic/load.rs\u0060 change together 80% of the time (8 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060b70a5655\u0060 Allow for local kdl and asset development (#763); \u00604899f019\u0060 Feature: Add error covariance to ellipsoid. (#744); \u00603e500fd8\u0060 feat: Persist schematic assets in DB Asset Server  and serve them ove\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/object3d.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc6387d207298d2133592b239ba66d283297449876ce09808550bf6c3cb92858"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: palette_items.rs \u2194 object3d.rs: \u0060libs/elodin-editor/src/ui/command_palette/palette_items.rs\u0060 and \u0060libs/elodin-editor/src/ui/inspector/object3d.rs\u0060 change together 80% of the time (8 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060b70a5655\u0060 Allow for local kdl and asset development (#763); \u00603e500fd8\u0060 feat: Persist schematic assets in DB Asset Server  and serve them ove\u2026; \u0060f0873dcc\u0060 Centralize Dynamic Array Broadcasting in \u0060nox\u0060 . (#635) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/command_palette/palette_items.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4a9c91424b75e655841012e893e9b67dee1e4d3da9e29cb07ff22c658fa5b9"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: graph.rs \u2194 widget.rs: \u0060libs/elodin-editor/src/ui/inspector/graph.rs\u0060 and \u0060libs/elodin-editor/src/ui/plot/widget.rs\u0060 change together 53% of the time (10 of the 19 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u006036f90f36\u0060 Elodin Editor Telemetry Mode (#737); \u006052e116d7\u0060 Chore/bevy egui 0.36.0 (#398); \u00605c66528a\u0060 refactor: multi-window palette targeting and pane render routing. (#379) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29ea51b8e82825eeae284d03e5eebed50e19236c6fb7bb9adb18137eceeb917"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: graph.rs \u2194 tiles.rs: \u0060libs/elodin-editor/src/ui/inspector/graph.rs\u0060 and \u0060libs/elodin-editor/src/ui/tiles.rs\u0060 change together 53% of the time (10 of the 19 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u006036f90f36\u0060 Elodin Editor Telemetry Mode (#737); \u006052e116d7\u0060 Chore/bevy egui 0.36.0 (#398); \u00607dba6c5c\u0060 chore: Command Palette Cleanup; doc: Command Palette. (#380) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"220b69c5db30e08fb4fb0f1b7559caecd519778095841b7a4f9705b8cf314841"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 tiles.rs: \u0060libs/elodin-editor/src/plugins/navigation_gizmo/mod.rs\u0060 and \u0060libs/elodin-editor/src/ui/tiles.rs\u0060 change together 50% of the time (15 of the 30 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 15 shared commits counted here, the most recent 3 are \u00607b351e40\u0060 Fix: UI input pass-through with explicit pointer ownership. (#637); \u0060df965c03\u0060 fix: Preserve frustum sources in inactive tabs. (#622); \u006038eef8b5\u0060 Fix: Render layer allocation overhauled to fix exhaust issue. (#603) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/navigation_gizmo/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba3ac47770487a0d55cfd251eac4e58a4d7919b01cc74f6aa6c25ed839ceffa"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: colors.rs \u2194 widgets.rs: \u0060libs/elodin-editor/src/ui/colors.rs\u0060 and \u0060libs/elodin-editor/src/ui/widgets.rs\u0060 change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u0060851fcf34\u0060 ELO-178: Editor Status Bar (#483) (at that commit the file was still \u0060libs/elodin-editor/src/ui/widgets/mod.rs\u0060); \u0060d20332fe\u0060 ELO-285: Editor Command Palette (#460) (at that commit the file was still \u0060libs/elodin-editor/src/ui/widgets/mod.rs\u0060); \u00600ad93773\u0060 ELO-257: Switch to GPU based plotting  (#400) (at that commit the file was still \u0060libs/elodin-editor/src/ui/widgets/mod.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/colors.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc52f21e2ac44ab4ab4fd450230b2d58bb005c1f10d0702e9046a8b938b8581"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"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":"b3ee784c2d1a2bea9d728fb727a57d9bf93582783669c8ddf940a565a075c1e2"}},{"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":"fd60466ef691cd8569f99bb0b1d2c38b8dde6ab3be44adfa67448bbb6684cd65"}},{"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":"1e64092bacbeb227dc24a111b840833a9903f1b85123c58836ff44270eaddc0a"}},{"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":"9d05aab47791d0e01958969435ae6edc0f4e41c5b8c6b5ba895c8a4f9cde50d5"},"taxa":[{"id":"CICD-SEC-4","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":"acf2bfab54704ada202a247df310a4bc395851eaeb11f8297c2aeb57062bd23e"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"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":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060map\u0060 is a shipped function whose whole body is still \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/graph.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"97a01ec78f8583b18cd9aadb65e86bef86b97b3efc8c91ab82dd5d9af1fd8c1d"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060inner\u0060 is a shipped function whose whole body is still \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/graph.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6672fdde359ed3ba9b088d05d005e6d385b374fd88368c680c3d928c11afd4"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060from_inner\u0060 is a shipped function whose whole body is still \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/graph.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba8f3afc1a08ba03573a708ba3f82ec966e7fe485b69b88d18176e2b6e79b1a"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060output\u0060 is a shipped function whose whole body is still \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/graph.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea332c07395e1441feede44dd88f64f40a7640bfa040173a9bbcdeffeddfe20"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060output\u0060 is a shipped function whose whole body is still \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/graph.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"574fa06733e9677b9f32799cb169de181881d96aab33cc09fdaea6f909eda14b"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060unflatten\u0060 is a shipped function whose whole body is still \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/graph.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"27444a842e99e372444ce5064d6d9b72cfcef504823f55c33700eb2039ab65c2"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060from_array\u0060 is a shipped function whose whole body is still \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/graph.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6ba1d7be5991a029ff9ebfe388ae12304c57c08304f703f7c88e9807445857"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060broadcast\u0060 is a shipped function whose whole body is still \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 generated scaffolding that was never completed. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/array/mod.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"92446c9fea8c815d0e4e8c48ccd0424a7dc8e9332a2302078c60d34896d6616f"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060print_header\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":"apps/inscriber/src/main.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"84afeb80660490ce7b8b5954b2e1d0fddfdc15acfd17e7e38bec3bd9f6607448"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060print_header\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":"fsw/aleph-setup/src/main.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c70141c997d6ef757d963a23bae1e9e8720653b6316e4897a056e02802e1153"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060print_header\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":"fsw/aleph-status/src/main.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f188a2f93833809359402bbe598e23291077902666ec432263495db54f8f9eb"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060set_property\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/gstreamer/src/lib.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f0aae2553d772d985d6f989babbdaa4ff88817aa778c945b893fb7624de16c"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060property\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/gstreamer/src/lib.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a5d5b4718cb0eb5993079c5d1890e443241cee6b19714187af41a396d94a1e"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060update\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/roci/src/csv.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d743bc5161fa9783639c29ddf256717a5dca177da7e10fc88536a430eb6e18c1"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060from_bytes\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_world_mesh/src/terrain/terrain_data/mod.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"75945b68bb44f121e836aa0da84756ba0258039fd1ae87bdaa7b5ab1257e6278"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060skip_line\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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":3370}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6e71c36476b9f913ee36a90b3c81d50c3b7de4fc2b18076fd5113c3d09a0f5"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060skip_to_newline\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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":3376}}}],"partialFingerprints":{"codehealthFindingId/v1":"49bcaaa11079da5ec90405bb0a0b20c5cf2a8ec0c86aa1641ecde5ca17f4ef47"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060skip_until_brace\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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":3382}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5424ea92822ecd102e14786f997b97de08fc65625ab3247741bf2fe46713a26"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060empty\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":"libs/elodin-editor/src/wasm_cut.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab2a44c5240c66285e742a29a6022f0288c78acd169941e78a601a158f3312a"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060consume_matching\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":"libs/elodin-editor/src/wasm_cut.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc962cd8594b265c8360c3ced9225f602709fa36d259c61487e3bd791646b6e"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060note_local_clear\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":"libs/elodin-editor/src/wasm_cut.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33db08c7b78ba5dd4b455cce67aee4eda34d3e78f7286a11c50e5e7e861125d"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060map\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-macros/src/repr_monad.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18799727efa57da9c6ba1688d41f8ee30874a395ae80a1bd430d357efd6557d"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060msg_connection_packets\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":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":2600}}}],"partialFingerprints":{"codehealthFindingId/v1":"37acc5f07b0f7e5cff3bbbe024bdad9f75161862393ac589b61f8548ceb00941"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060map\u0060 is a shipped function whose whole body is \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 scaffolding that was never completed, and a panic on the first call. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/graph.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a216883e289f416dd5b8ddb0c848414121b25bcbb45b9ea6641ad3a40fb1634"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060inner\u0060 is a shipped function whose whole body is \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 scaffolding that was never completed, and a panic on the first call. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/graph.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"b973414ff4703f58c0d5f20ec3c3b40d9fa794d49b34e412e1f5274b581ea026"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060from_inner\u0060 is a shipped function whose whole body is \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 scaffolding that was never completed, and a panic on the first call. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/graph.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56536722dd51868180e99e557221aa37aeb36cf7370bfd16f809964fa94f7b1"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060output\u0060 is a shipped function whose whole body is \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 scaffolding that was never completed, and a panic on the first call. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/graph.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"745ad81720e6de26327423d0808f6b77b4a477726ec41f1cbf9a22c5a36e4b2a"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060output\u0060 is a shipped function whose whole body is \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 scaffolding that was never completed, and a panic on the first call. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/graph.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"6633ce60a302129cc7e7a0f38635e86050530b774e6573c16239a3105b32343e"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060unflatten\u0060 is a shipped function whose whole body is \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 scaffolding that was never completed, and a panic on the first call. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/graph.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa4be359ae9a246cee4573b8251ee0823208819a945fbf5bbfa6b2030bdc374"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060from_array\u0060 is a shipped function whose whole body is \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 scaffolding that was never completed, and a panic on the first call. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/graph.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a7d2ad71e8ff94ad85b606932dc27072a338919fa3265b18e352d76374ec13"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060reshape_with_shape\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/array/mod.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac037ad08bdae8e09f8a8645a67293b29ee457b572fbe7666f4320bb50ad770"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 body is todo!() / unimplemented!(): \u0060broadcast\u0060 is a shipped function whose whole body is \u0060todo!()\u0060/\u0060unimplemented!()\u0060 \u2014 scaffolding that was never completed, and a panic on the first call. Implement it or remove the dead surface."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/array/mod.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a3f074be2fd49c9144648a13577e543dec8c1007588355c742db8523882695"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060broadcast_with_shape\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/array/mod.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e7e8f190dc9c7da50940d1e5fa875eb81e5d4ddbc31fabea906eed4a90a05c"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060visit\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/jax.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a6fc362ad7625e0c1698e21fdfc4eca339483b13279f57bea5e724938ad625"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060visit\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/jax.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3263a1900be34e612e521987cbbd602b89eb41603d58f85301c74dd10aae4f"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060visit\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/jax.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f557bbe9923b2c648b0b627b59b649afbdb503fcae6511120c83670c4639a9"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060visit\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/jax.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"437bfbd35c9700ee31dad65549bcb2f4f501b8c867b85ead0b5a800bb1f3d742"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060visit\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/jax.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d788f327ddba936a397f5bad8a70d8e1f0d391e364bd2606b4314ad2c0b86090"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060visit\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/jax.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d53dfb33af21e7088117c4171fc895c03d3322982a426f55371bf50d600cded"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060dtype\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/jax.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbb2eda1960e5c3a8605968bb1a3de6070b42255b8b598d37de3526a92a9f3e6"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060dtype\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/jax.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6af3b322d4b1ea20ee01d2d5bb0ebd0242ebe854a765a41bb662f27a1991546"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060dtype\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/jax.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"a526fcd2ba48626a328f08a0165e193a2fcee1aa24e5927fd97b5415ff754c75"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060dtype\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/jax.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c54bfb10f916516b1c928db5841db2692418773234b1c774d74ee23a6c3b79"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060visit_inner\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/batch.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e803fe0326db312841b08829f012ad8c4a2b0f41e5dbab55a14e64c36aa02f"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060visit_inner\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/batch.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b81a69e728c755e8a3078b3cdd98d6e673a6659aa573d8b206a8d0d156f9448"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060visit_inner\u0060 does real work, but one of its branches is \u0060unimplemented!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/batch.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9bc3d9e5fe01dd6e642e56b23b7fc367b916f799fb79ec9bd90e42b3516778"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060visit_inner\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/batch.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"917f80d40cd2ec138a7fc0edb0117d4e297f3611af4e28235e9221ab048cb3f5"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060visit_inner\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/batch.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e65ea7a90cc0c4f4e2c90d3942c01fe7f413a3de84110733799596f08993e9c"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060visit_inner\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/batch.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"8801e6974d4f05bd45104dcca9309dabd86d2fe5a63ffbeda037eadb57672a49"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060visit_inner\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/batch.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bf3d164041fb877ec81f47f59013c62916572dc41041b1d50ce8f7fb952cb7"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060process_scan\u0060 does real work, but one of its branches is \u0060Err\u0060 with a \u0022not implemented\u0022 message \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/batch_dfs.rs"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"dee79820224c4657533bcb3297c091ab302f7d2ef9110481735494fd753bed9e"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060process_scan\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/batch_dfs.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc648b452a660115bf94bb07eb5b544762160522dd3bffe46290edb1b1e00ab7"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060cpp_variant_type\u0060 does real work, but one of its branches is \u0060todo!\u0060 \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/postcard-c/codegen/src/lib.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b56f4933efcebfca2d8da3e62f7f0f19ae8fe5648853a0a70fac2c804d5b9a6"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060_maitake_header_nop\u0060 does real work, but one of its branches is \u0060unreachable!\u0060 with a \u0022not implemented\u0022 message \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/task.rs"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"767fc20d2d986a3156fab9313abce5e1c2b4e7ad5a6bc3bce4db1ee3aa3cb55f"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060_maitake_header_nop_deallocate\u0060 does real work, but one of its branches is \u0060unreachable!\u0060 with a \u0022not implemented\u0022 message \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/task.rs"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"4568138098ee796e94294a8909557661d4b53ffc4dc43100a02b09f113264996"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060_maitake_header_nop_poll_join\u0060 does real work, but one of its branches is \u0060unreachable!\u0060 with a \u0022not implemented\u0022 message \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/task.rs"},"region":{"startLine":1326}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f2e22d28bad409aecb63d9905cec3372a5aff8d89341a95fcbd9ee89323b743"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060_maitake_header_nop_wake_by_ref\u0060 does real work, but one of its branches is \u0060unreachable!\u0060 with a \u0022not implemented\u0022 message \u2014 a case that was never written, and a panic the first time it is reached. Implement the case, or return an error that says why it is not handled."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/task.rs"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e6e3b4a9e0d107e95836f87b2fd9d1a7467f18727a3722a4190a42a5e082e3"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060wait_for\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":"libs/stellarator/src/util.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"e185b255bc4136cdef6a950a474416278f58b351c3b97fc70cba3a2a4770be57"}},{"ruleId":"M2","level":"note","message":{"text":"ADRs not easily discoverable: 1 ADR-shaped document(s) detected by content \u2014 \u0060libs/stellarator/README.md\u0060. They are not under a conventional ADR folder (docs/adr/) and are not named NNNN-title.md, and this check found them by their decision signature rather than by where they live \u2014 so a reader who does not already know these paths has no route to them. Detected by content signature only: records kept outside the repository, or written without a Status/Decision/Consequences shape, are not visible to this check and are not counted here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ea921cf64dae701abd877090b3279ff10d03c2e3250e26c8c299d7c5665e0d3f"}},{"ruleId":"M4","level":"note","message":{"text":"README/code drift: libs/s10/README.md names Python 3.10 or later, but libs/nox-py/pyproject.toml:7 requires \u0060requires-python = \u0022\u003E=3.13\u0022\u0060: the package does not install on Python 3.10. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents\u0027 own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/README.md"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"614b0101c70b0b1994186e455cad8f9d8faaaf6789335db73e8d808e95b6dd6b"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 22/40 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060.\u0060, \u0060apps/elodin-web\u0060, \u0060apps/inscriber\u0060, \u0060fsw/aleph-setup\u0060, \u0060fsw/aleph-status\u0060 and 13 more."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060Cargo.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":"Cargo.toml"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"b58f1258ac0739cd1e0a2e83a9aae67bcefcf633d7f90f15ee6eb51c19cdb530"}},{"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":"apps/elodin/src/cli/cloud/mod.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6014e69635976e35e0d6a51b68b26439067944815cbf1c92a6b2cfbe327e5e7"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::get(\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":"fsw/aleph-setup/src/main.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"505423ccb674e0a37552d66591e3372b7882f0badb6865cd5b9a4dd238e31961"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060reqwest::get(\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":"fsw/aleph-setup/src/main.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"90d0431a50d45a8bb4cc4711badff225ca1802fc4026c1b3ef62b0fd3e23cc16"}},{"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":"libs/elodin-editor/src/plugins/web_asset/mod.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"442a76d891966b61df69bcdf175ca1e34b3cfc42d1043546db1cc39c55f92ef0"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060main\u0060 is async and calls block_on \u2014 a blocking call inside async code stalls the executor thread, and every task scheduled on it for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/main.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f3b221207c5f56c2f8be9fdc5d31d528c5362b3eafe1f2180ccf61245b7bc6"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060monitor\u0060 is async and calls thread::sleep \u2014 a blocking call inside async code stalls the executor thread, and every task scheduled on it for as long as it runs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/src/liveness.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ac09d11bdac977e79268350896c412df946fc434da93146cf168ae5cfaee2f"}},{"ruleId":"X1","level":"warning","message":{"text":"Blocking \u0060thread::sleep\u0060 inside an \u0060async\u0060 body: This \u0060async\u0060 body is polled on an executor\u0027s worker thread, and \u0060std::thread::sleep\u0060 blocks that thread: for the whole delay no other task scheduled on it makes progress \u2014 the Rust form of blocking on a task. Use \u0060tokio::time::sleep(\u2026).await\u0060 (or the runtime\u0027s own timer), which suspends only this task. Where the blocking work is not a sleep but a synchronous call that cannot be made async, move it off the executor with \u0060tokio::task::spawn_blocking(\u2026).await\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/src/liveness.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc41fd88ba23ef55a9e92c0343f1223f5cb2d7e2cdc3e5652216f3b929dc81b"}},{"ruleId":"X1","level":"error","message":{"text":"\u0060block_on\u0060 inside an \u0060async\u0060 body: This runs a future to completion from inside an \u0060async\u0060 body, which is already being polled by an executor. tokio\u0027s \u0060Runtime::block_on\u0060 and \u0060Handle::block_on\u0060 panic (\u0022Cannot start a runtime from within a runtime\u0022), and \u0060futures::executor::block_on\u0060 parks the worker thread on a future that may need that very thread to make progress \u2014 a deadlock. The future can simply be awaited here: \u0060fut.await\u0060. Where a synchronous function in between forces the bridge, make that function \u0060async\u0060 too, or run the bridge off the executor with \u0060tokio::task::spawn_blocking(move || handle.block_on(fut)).await\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/skybox_db_assets.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d0acf41451c91cfbaa4a230dd8c4f9ed168a514aece993bfbea54faea34929"}},{"ruleId":"X1","level":"error","message":{"text":"\u0060block_on\u0060 inside an \u0060async\u0060 body: This runs a future to completion from inside an \u0060async\u0060 body, which is already being polled by an executor. tokio\u0027s \u0060Runtime::block_on\u0060 and \u0060Handle::block_on\u0060 panic (\u0022Cannot start a runtime from within a runtime\u0022), and \u0060futures::executor::block_on\u0060 parks the worker thread on a future that may need that very thread to make progress \u2014 a deadlock. The future can simply be awaited here: \u0060fut.await\u0060. Where a synchronous function in between forces the bridge, make that function \u0060async\u0060 too, or run the bridge off the executor with \u0060tokio::task::spawn_blocking(move || handle.block_on(fut)).await\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/skybox_db_assets.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c2c9e8805b5ec9257ffab92f0f4b6eb65b050c85f86721287318dbbadb9274"}},{"ruleId":"X1","level":"error","message":{"text":"\u0060block_on\u0060 inside an \u0060async\u0060 body: This runs a future to completion from inside an \u0060async\u0060 body, which is already being polled by an executor. tokio\u0027s \u0060Runtime::block_on\u0060 and \u0060Handle::block_on\u0060 panic (\u0022Cannot start a runtime from within a runtime\u0022), and \u0060futures::executor::block_on\u0060 parks the worker thread on a future that may need that very thread to make progress \u2014 a deadlock. The future can simply be awaited here: \u0060fut.await\u0060. Where a synchronous function in between forces the bridge, make that function \u0060async\u0060 too, or run the bridge off the executor with \u0060tokio::task::spawn_blocking(move || handle.block_on(fut)).await\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/skybox_db_assets.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f988023ec437a28cb6b6b6c5e21e785f7fda6a4d93fb9a551853ccd20586d87"}},{"ruleId":"X1","level":"error","message":{"text":"\u0060block_on\u0060 inside an \u0060async\u0060 body: This runs a future to completion from inside an \u0060async\u0060 body, which is already being polled by an executor. tokio\u0027s \u0060Runtime::block_on\u0060 and \u0060Handle::block_on\u0060 panic (\u0022Cannot start a runtime from within a runtime\u0022), and \u0060futures::executor::block_on\u0060 parks the worker thread on a future that may need that very thread to make progress \u2014 a deadlock. The future can simply be awaited here: \u0060fut.await\u0060. Where a synchronous function in between forces the bridge, make that function \u0060async\u0060 too, or run the bridge off the executor with \u0060tokio::task::spawn_blocking(move || handle.block_on(fut)).await\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/main.rs"},"region":{"startLine":767}}}],"partialFingerprints":{"codehealthFindingId/v1":"deaaf4e67d6733ac99b27f250aab7b37b632a3dd2a0340d4978975ee9c5dba49"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(document, dict) or \u0022root\u0022 not in document\u0060 appears character-identically in 2 files \u2014 libs/nox-py/python/elodin/terrain_prepare.py, scripts/export_photo3d_cache.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/python/elodin/terrain_prepare.py"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd138f52d4caad46c1d7cabc7511a9e809f409d8dec5de2ace0ab5447bbd0bed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parts.scheme != \u0022https\u0022 or parts.netloc != \u0022tile.googleapis.com\u0022 or not parts.path.startswith(\u0022/v1/3dtiles/\u0022)\u0060 appears character-identically in 2 files \u2014 libs/nox-py/python/elodin/terrain_prepare.py, scripts/export_photo3d_cache.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/python/elodin/terrain_prepare.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd84fb10f3d560aa647860f005549bc4577aa48ab58d708d9690cdb37d6e3f1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!smoothing.is_finite() || smoothing \u003C 0.0\u0060 appears character-identically in 2 files \u2014 libs/impeller/kdl/src/de.rs, libs/nox-py/src/ui/builders.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fb725592f088224aa5c895ff881e974a9dad0d7669a47dd19ac59cd38814416"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060args.is_empty() \u0026\u0026 matches!(recv, Expr::ComponentPart(_))\u0060 appears character-identically in 2 files \u2014 libs/db/eql/src/formulas/angular.rs, libs/db/eql/src/formulas/linear.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/formulas/angular.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"56aa5cd5e659f0971e6ae478cc457878b61bb2551c6a23cc3a1e7c3049dce989"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cache.last_stream_activity \u0026\u0026 last.elapsed().as_secs_f32() \u003E STREAM_RECOVERY_TIMEOUT_SECS\u0060 appears character-identically in 2 files \u2014 libs/elodin-editor/src/ui/log_stream.rs, libs/elodin-editor/src/ui/video_stream.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/log_stream.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97ac0248064287d8f223e14223a755a89cae22c221d02c45daf95002a1d4b7d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060config.create_frustum \u0026\u0026 config.frustums_up_marker_overlay \u0026\u0026 config.frustums_up_marker != FrustumUpMarker::None\u0060 appears character-identically in 2 files \u2014 libs/elodin-editor/src/ui/tiles.rs, libs/elodin-editor/src/ui/video_stream.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"9602fa961b34ded29b6f58fb5f4d0d8691d9edc5eb58bd7369fa081143759772"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cursor.x \u003E= min.x \u0026\u0026 cursor.x \u003C max.x \u0026\u0026 cursor.y \u003E= min.y \u0026\u0026 cursor.y \u003C max.y\u0060 appears character-identically in 2 files \u2014 libs/elodin-editor/src/plugins/view_cube/interactions.rs, libs/elodin-editor/src/plugins/view_cube/picking.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/view_cube/interactions.rs"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"42eede485946e27d26d82b1eea0cf252f4119265eb6f0e67cd79c4134df3eec5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060dir_name == \u0022msgs\u0022 || dir_name == \u0022db_state\u0022 || dir_name == \u0022schematic\u0022\u0060 appears character-identically in 3 files \u2014 libs/db/src/drop.rs, libs/db/src/prune.rs, libs/db/src/time_align.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/drop.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f676362d737dec51f3a362f1eaa96448da9b02ab60100a97b9226d24cb20ee0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060end \u003C= self.init_len() || begin \u003C= self.init_len()\u0060 appears character-identically in 2 files \u2014 libs/stellarator/buf/src/lib.rs, libs/stellarator/src/buf.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/buf/src/lib.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"9229725c2ce9c7a21150ccb0c5352af92b3005892ecdc9121483788f8805fc07"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060error_covariance_cholesky.is_some() || error_covariance.is_some() || error_covariance_cholesky_kernel.is_some() || error_covariance_kernel.i\u2026\u0060 appears character-identically in 2 files \u2014 libs/elodin-editor/src/object_3d.rs, libs/impeller/kdl/src/ser.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":2274}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3ee9384cf27c4342f2a1ba99b36ae0e98d242ebce851c521d9ef81b6c397a5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expr \u0026\u0026 (elements.len() == 4 || elements.len() == 5)\u0060 appears character-identically in 2 files \u2014 libs/db/eql/src/formulas/direction.rs, libs/db/eql/src/formulas/translate.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/formulas/direction.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"49abd00fae4b3364078dbc268038961b7a91cf39036012fb75ed3f386072902b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060min_timestamp \u003C= max_timestamp \u0026\u0026 min_timestamp != i64::MAX\u0060 appears character-identically in 2 files \u2014 libs/db/src/merge.rs, libs/db/src/trim.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/merge.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"11fb40a3c848142884d0168a7421a56e390fc7c46404608f567bd7746212a524"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060path.starts_with(\u0022db:\u0022) || path.starts_with(\u0022http://\u0022) || path.starts_with(\u0022https://\u0022)\u0060 appears character-identically in 2 files \u2014 libs/elodin-editor/src/ui/schematic/load.rs, libs/impeller/kdl/src/rewrite.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"5184b285d53bca11f9d780cb395d916aeab9415d3016e478a486d5ca59d10d2f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060range.start \u003C= self.inner.init_len() || range.end \u003C= self.inner.init_len()\u0060 appears character-identically in 2 files \u2014 libs/stellarator/buf/src/lib.rs, libs/stellarator/src/buf.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/buf/src/lib.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9c1b489803edeeb2489ec173bddbd0129ce46e484e570ba7cf11206ada2b09"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060remain == 0 || index \u003C config_size - remain\u0060 appears character-identically in 2 files \u2014 fsw/sensor-fw/src/bmi270.rs, fsw/sensor-fw/src/bmi270_spi.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/bmi270.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"11491f0b6b38ad068e5096262ed7361460e5d1e4af88c9687daddbb1631a0c9e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sample \u003E self.sample_count \u002B 1 \u0026\u0026 self.sample_count != 0\u0060 appears character-identically in 2 files \u2014 fsw/sensor-fw/src/bmi270.rs, fsw/sensor-fw/src/bmi270_spi.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/bmi270.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"87b39395986b81df34f4e1b2f4b802f487c8a317eeb34dfb74e88ba9a9b41eb8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sources.is_empty() || targets.is_empty()\u0060 appears character-identically in 2 files \u2014 libs/elodin-editor/src/plugins/frustum/mod.rs, libs/elodin-editor/src/plugins/frustum_intersection/mod.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/frustum/mod.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff8358be3be081df3e0d968e2d3d495be8b07c75f6f250b8e0549ec03d091703"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060start == placeholder_start \u0026\u0026 end == placeholder_end\u0060 appears character-identically in 2 files \u2014 libs/elodin-editor/src/ui/inspector/query_table.rs, libs/elodin-editor/src/ui/query_table.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/inspector/query_table.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44b8262924a585cf77e4c15c4e7c4b73772834eb63005ba2bf3899e25351caf"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060where_clause_predicates.is_some() || !bounds.is_empty()\u0060 appears character-identically in 4 files \u2014 libs/elodin-macros/src/from_builder.rs, libs/elodin-macros/src/from_op.rs, libs/elodin-macros/src/into_op.rs, libs/elodin-macros/src/repr_monad.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-macros/src/from_builder.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0c5c8724b45479baf516f9f29d3f63b427fb8e77429a56e9dff6029a7846e7a"}},{"ruleId":"X12","level":"warning","message":{"text":"Match arm is unreachable \u2014 an earlier arm already matches it: The arm \u0060b | a * b, ReduceOp::Maximum\u0060 can only be tried when the arm \u0060b\u0060 on line 1504 did not match \u2014 but every value this arm matches, that one matches first, so it never runs (rustc: \u0060unreachable_patterns\u0060). Move the more specific arm above the more general one, or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a61d4a8db5ca9fbc60a388e8302f7f202f1b18fa384362ea8aea37d9e7ce1fa"}},{"ruleId":"X12","level":"warning","message":{"text":"Match arm is unreachable \u2014 an earlier arm already matches it: The arm \u0060ReduceOp::Minimum\u0060 can only be tried when the arm \u0060b\u0060 on line 1504 did not match \u2014 but every value this arm matches, that one matches first, so it never runs (rustc: \u0060unreachable_patterns\u0060). Move the more specific arm above the more general one, or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d69a26acff8492f28d286187577eb440240f8e8b53f6f1b4074bd98cfdeb50"}},{"ruleId":"X12","level":"warning","message":{"text":"Match arm is unreachable \u2014 an earlier arm already matches it: The arm \u0060ReduceOp::And | ReduceOp::Or\u0060 can only be tried when the arm \u0060b\u0060 on line 1504 did not match \u2014 but every value this arm matches, that one matches first, so it never runs (rustc: \u0060unreachable_patterns\u0060). Move the more specific arm above the more general one, or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"948897ab1fe5f635280eef5bbf4b0c7ce03953a9bda87747ba8b8415429d9a43"}},{"ruleId":"X12","level":"warning","message":{"text":"Match arm is unreachable \u2014 an earlier arm already matches it: The arm \u0060b | i64::from(a != 0 || b != 0) ,(ReduceOp::Add, _)\u0060 can only be tried when the arm \u0060b\u0060 on line 1521 did not match \u2014 but every value this arm matches, that one matches first, so it never runs (rustc: \u0060unreachable_patterns\u0060). Move the more specific arm above the more general one, or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":1522}}}],"partialFingerprints":{"codehealthFindingId/v1":"678ebb5d17934070011fcfda7869e67f14d33b92266d5f029166a123836f3885"}},{"ruleId":"X12","level":"warning","message":{"text":"Match arm is unreachable \u2014 an earlier arm already matches it: The arm \u0060( ReduceOp::Multiply, _)\u0060 can only be tried when the arm \u0060b\u0060 on line 1521 did not match \u2014 but every value this arm matches, that one matches first, so it never runs (rustc: \u0060unreachable_patterns\u0060). Move the more specific arm above the more general one, or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":1524}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc908d3ba8789f93f57f3bd287242a472018862f8e34345fbdd3a5f189b35b18"}},{"ruleId":"X12","level":"warning","message":{"text":"Match arm is unreachable \u2014 an earlier arm already matches it: The arm \u0060( ReduceOp::Maximum, ElementType::UI64)\u0060 can only be tried when the arm \u0060b\u0060 on line 1521 did not match \u2014 but every value this arm matches, that one matches first, so it never runs (rustc: \u0060unreachable_patterns\u0060). Move the more specific arm above the more general one, or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61ca08feda68a40347e122522d50da0014753db1b1ce391460e03c3b28fb51f"}},{"ruleId":"X12","level":"warning","message":{"text":"Match arm is unreachable \u2014 an earlier arm already matches it: The arm \u0060b |(a as u64).max(b as u64) as i64 ,(ReduceOp::Minimum, ElementType::UI64)\u0060 can only be tried when the arm \u0060b\u0060 on line 1521 did not match \u2014 but every value this arm matches, that one matches first, so it never runs (rustc: \u0060unreachable_patterns\u0060). Move the more specific arm above the more general one, or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ecd59fb3fbf33b3dab219cd19bd543d0d04bc0a2b487354771e2383c0998238"}},{"ruleId":"X12","level":"warning","message":{"text":"Match arm is unreachable \u2014 an earlier arm already matches it: The arm \u0060b |(a as u64).min(b as u64) as i64 ,(ReduceOp::Maximum, _)\u0060 can only be tried when the arm \u0060b\u0060 on line 1521 did not match \u2014 but every value this arm matches, that one matches first, so it never runs (rustc: \u0060unreachable_patterns\u0060). Move the more specific arm above the more general one, or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":1526}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4797e4506da3e9a2ebd401a21bf09d6f8e3352c533bb73c65b4f330c75c2846"}},{"ruleId":"X12","level":"warning","message":{"text":"Match arm is unreachable \u2014 an earlier arm already matches it: The arm \u0060( ReduceOp::Minimum, _)\u0060 can only be tried when the arm \u0060b\u0060 on line 1521 did not match \u2014 but every value this arm matches, that one matches first, so it never runs (rustc: \u0060unreachable_patterns\u0060). Move the more specific arm above the more general one, or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":1528}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a623af7a1ba411312ec722faa71336d18096ee915adc67df6748a6c5b9627f"}},{"ruleId":"X12","level":"warning","message":{"text":"Match arm is unreachable \u2014 an earlier arm already matches it: The arm \u0060( ReduceOp::And | ReduceOp::Or, _)\u0060 can only be tried when the arm \u0060b\u0060 on line 1521 did not match \u2014 but every value this arm matches, that one matches first, so it never runs (rustc: \u0060unreachable_patterns\u0060). Move the more specific arm above the more general one, or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":1529}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd55367248ea66d96731e6fa2a4bff5411a93287cf71ea95482c6deb6e520e3d"}},{"ruleId":"X15","level":"warning","message":{"text":"Length read from the parsed input is spent without ever being bounded: \u0060len\u0060 is read from the bytes being parsed at line 267 (\u0060u32::from_le_bytes\u0060), then used to size a \u0060vec![\u2026; n]\u0060 at line 268 \u2014 and nowhere in its scope is \u0060len\u0060 compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with \u0060memory allocation of \u2026 bytes failed\u0060 \u2014 an abort, not a panic, so no \u0060catch_unwind\u0060 intercepts it and the whole process dies; a 64-bit length past \u0060isize::MAX\u0060 panics with \u0060capacity overflow\u0060 instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound \u0060len\u0060 against the bytes actually remaining and a maximum the format allows before allocating."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/rtsp-streamer/src/main.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9190eb51275f58d294e75d910b08e9ea89859384e0f4f55a0cdf97682a4325"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060poll\u0060 is public and takes a \u0060JoinHandle\u0060 as its receiver from its caller, and it calls itself at line 250 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 \u0060poll\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/src/lib.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"490dd2b3483d6dc0df4531b2d98444592de0d54c452aa222b62c06a1bcd49b5c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060as_fd\u0060 is public and takes a \u0060BorrowedHandle\u0060 as its receiver from its caller, and it calls itself at line 92 with a piece of the document (and at line 101, line 102) \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 \u0060as_fd\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/src/os.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"e43308f47c5596ca4f62bcf10123249bbbae146372f0b8b225e02beb9a8d4f08"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060as_handle\u0060 is public and takes a \u0060OwnedHandle\u0060 as its receiver from its caller, and it calls itself at line 46 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 \u0060as_handle\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/src/os.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e985b71f545fece780060a3242222048b1287c835739ae631c4dcc3434e8982"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060try_clone\u0060 is public and takes a \u0060OwnedHandle\u0060 as its receiver from its caller, and it calls itself at line 53 with a piece of the document (and at line 54) \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 \u0060try_clone\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/src/os.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"03cc9c6908773af62ecc33584336e9bbe347a323e67377e7c6b0379bf23ea4b6"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060as_raw_fd\u0060 is public and takes a \u0060BorrowedHandle\u0060 as its receiver from its caller, and it calls itself at line 81 with a piece of the document (and at line 82) \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 \u0060as_raw_fd\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/src/os.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"9463b0fcc84120696d630af8866afc5eb86b5831dc6b92b820e0d22ff2a1d509"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060get\u0060 is public and takes a \u0060UnsafeCell\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 \u0060get\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/util/src/sync/cell.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ff81f521200217154c2363690cf3adf8968cc1f052584386c75f7b5690853b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060lock\u0060 is public and takes a \u0060Mutex\u0060 as its receiver from its caller, and it calls itself at line 156 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 \u0060lock\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/loom.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f6d15aa22bc82ff7c7957b4f1d9ec397c5e4878c38517c99ff685edbc2bf8a5"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060try_lock\u0060 is public and takes a \u0060Mutex\u0060 as its receiver from its caller, and it calls itself at line 126 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 \u0060try_lock\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/loom.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd610e0b89735bd2e18da136fcb7dc4e159e1028c80eb36bc09fd89578daa5e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060fmt\u0060 is public and takes a \u0060Mutex\u0060 as its receiver from its caller, and it calls itself at line 174 with a piece of the document (and at line 195) \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 \u0060fmt\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/loom.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"670e4efb4a8bd67cf7798e0a63351b21d9d1b22b83b600f990d3c3191a3fdae1"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deref\u0060 is public and takes a \u0060MutexGuard\u0060 as its receiver from its caller, and it calls itself at line 182 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 \u0060deref\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/loom.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad135452ad30ee2b833ec3928ba08a405a805e4f98ff2cf0b5e2ed007c5312ec"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deref_mut\u0060 is public and takes a \u0060MutexGuard\u0060 as its receiver from its caller, and it calls itself at line 189 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 \u0060deref_mut\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/loom.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f556d80917d9be446cba6fd2537cb3a23ce596db34f7c576a628ea15955d143"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060get\u0060 is public and takes a \u0060UnsafeCell\u0060 as its receiver from its caller, and it calls itself at line 338 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 \u0060get\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/loom.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"afeab8f7cea59a67c92f84639280220344bb85ae149d885134b9355297e982e5"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060into_inner\u0060 is public and takes a \u0060UnsafeCell\u0060 as its receiver from its caller, and it calls itself at line 351 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 \u0060into_inner\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/loom.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a816806504fc1cf2582cf9aab71335d3823f58186d6ff94b3b1927930cc655d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060into_inner\u0060 is public and takes a \u0060Mutex\u0060 as its receiver from its caller, and it calls itself at line 224 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 \u0060into_inner\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/mutex.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ee93bad5c76c140318dce5d892551080a02bc72fc71227d417c11c3d34e5b2"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060poll\u0060 is public and takes a \u0060Lock\u0060 as its receiver from its caller, and it calls itself at line 357 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 \u0060poll\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/mutex.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecdf6dc054159a078b15e2037647de74a35cb237604bcb428fb466368c909056"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deref\u0060 is public and takes a \u0060MutexGuard\u0060 as its receiver from its caller, and it calls itself at line 386 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 \u0060deref\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/mutex.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"a366a1d2eb97800fafd9c70cfa06346035c6fcc35b1835560d1b6b2c8dda034c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060fmt\u0060 is public and takes a \u0060MutexGuard\u0060 as its receiver from its caller, and it calls itself at line 412 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 \u0060fmt\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/mutex.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a1c45d7b797f84bd3a2d59c9ea3e8b256bd05e3eb3d50d72518734cffeeb2c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060wake\u0060 is public, takes a document from its caller (line 500) and hands it to \u0060load\u0060, which calls itself at line 627 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 \u0060load\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/wait_map.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aecb040a557bdf0798a5338f87fddabb98cc98be2d15f27bc81fb113ed9ad86"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060wake\u0060 is public and takes a \u0060WaitMap\u0060 as its receiver from its caller, and it calls itself at line 541 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 \u0060wake\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/wait_map.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"b29649a5dc3a43046a1efdbfca6f68f52223444bd4e44765169ec3bad7624469"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060wake\u0060 is public, takes a document from its caller (line 466) and hands it to \u0060load\u0060, which calls itself at line 971 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 \u0060load\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/wait_queue.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff8bbb85629b2463d93b274717d6afbc3b889b454ebab2bddfae25152b8ac06"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060wake\u0060 is public, takes a document from its caller (line 466) and hands it to \u0060compare_exchange\u0060, which calls itself at line 991 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 \u0060compare_exchange\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/wait_queue.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b0efb072e23091169be1ec62fe4d64cb2ef0c22222cf87ebcd5ecb712ff55b4"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060wake\u0060 is public and takes a \u0060WaitQueue\u0060 as its receiver from its caller, and it calls itself at line 506 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 \u0060wake\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/wait_queue.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b095b7a5114c0ab89fc5311737bf358db0f0154482dbd2593c9a4b7ae4d5bc2"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060into_inner\u0060 is public and takes a \u0060Mutex\u0060 as its receiver from its caller, and it calls itself at line 128 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 \u0060into_inner\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/blocking/mutex.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"648761ed23dfd77b1da901796c44e1d49b9dae681cd5ff8e75bbdb5bc3d800e5"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060with_lock\u0060 is public and takes a \u0060Mutex\u0060 as its receiver from its caller, and it calls itself at line 172 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 \u0060with_lock\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/blocking/mutex.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f71b25db4b852697b7e0f0508fc5fbdc301bb1ef5596f3656bced324b2a171"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060try_with_lock\u0060 is public and takes a \u0060Mutex\u0060 as its receiver from its caller, and it calls itself at line 205 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 \u0060try_with_lock\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/blocking/mutex.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"491207e4acc89eb4bbf1cb1553c3674509e5acf928797e7ba3f6a10c2d58debf"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060try_lock\u0060 is public and takes a \u0060Mutex\u0060 as its receiver from its caller, and it calls itself at line 242 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 \u0060try_lock\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/blocking/mutex.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbcfacae54e47b3eef588ba5d7c57092adcb6e0b82d433da659fc4762049a1b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060lock\u0060 is public and takes a \u0060Mutex\u0060 as its receiver from its caller, and it calls itself at line 263 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 \u0060lock\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/blocking/mutex.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8420f073d9d9650ccbd2596e4e70fd483685ff3b3a189699689af83afed1f2"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deref\u0060 is public and takes a \u0060MutexGuard\u0060 as its receiver from its caller, and it calls itself at line 345 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 \u0060deref\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/blocking/mutex.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9d1ed6bc98dfb9aee9dd68e14c3e46a92b430949b91bb6744f5ef85c8c540d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060as_ref\u0060 is public and takes a \u0060MutexGuard\u0060 as its receiver from its caller, and it calls itself at line 368 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 \u0060as_ref\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/blocking/mutex.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"973a0656a28f416fe590276f5c806fcf322a3ebad4eeaaf24032343d3b54980b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060as_mut\u0060 is public and takes a \u0060MutexGuard\u0060 as its receiver from its caller, and it calls itself at line 379 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 \u0060as_mut\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/blocking/mutex.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3e4a2f180e415c325f88a64d47eeb8412ba542022a4aa3fd6adf8f49475c58"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060fmt\u0060 is public and takes a \u0060MutexGuard\u0060 as its receiver from its caller, and it calls itself at line 400 with a piece of the document (and at line 410) \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 \u0060fmt\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/blocking/mutex.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"0400a76d79400597a38d5b4234af8141c7258f12308b30ccb94379fe7f83184f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060try_lock\u0060 is public and takes a \u0060Mutex\u0060 as its receiver from its caller, and it calls itself at line 90 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 \u0060try_lock\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/loom.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b8f0842fc194ddb610c8fe89345657a2916ec311b03013cd812766be8b3bf00"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060lock\u0060 is public and takes a \u0060Mutex\u0060 as its receiver from its caller, and it calls itself at line 95 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 \u0060lock\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/loom.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"438d3451d66059fd179451fce076852c309b059b787a81dd2123e7495db81434"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060get\u0060 is public and takes a \u0060UnsafeCell\u0060 as its receiver from its caller, and it calls itself at line 231 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 \u0060get\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/loom.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"98210612a8dbaf8aa377fb4d529648d751cc5bad0f02ba495c32e682c85f8705"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060enter\u0060 is public and takes a \u0060Span\u0060 as its receiver from its caller, and it calls itself at line 113 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 \u0060enter\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/trace.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"47161f9ef4f4c750fab8f2ecd80d8a5997dbad6f0a7cfd0bfbe4be44711ff8af"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060entered\u0060 is public and takes a \u0060Span\u0060 as its receiver from its caller, and it calls itself at line 121 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 \u0060entered\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/src/trace.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"c411ad910c335dd52709b9afc87dcb1fad7ad847fc283d79e12bf1ec65faa2e7"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060recipe_weight\u0060 is public and takes \u0060recipe: \u0026Recipe\u0060 from its caller, and it calls itself at line 39 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 \u0060recipe_weight\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/src/admission.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ad838f7c0df08b08fe04bef12003eb4592ea2d2353bbcabcbb76467e2e9bb2f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060run\u0060 is public and takes a \u0060Recipe\u0060 as its receiver from its caller, and it recurses at line 133 through \u0060run_with_readiness\u0060 and back with a piece of the document (and at line 134, line 135, line 137, line 204, line 323) \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 \u0060run\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/src/recipe.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"999efeaea9fdccad49e9c13b826ac40f95ae900079af7eb4b5f275a0d9c227cf"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060watch\u0060 is public and takes a \u0060Recipe\u0060 as its receiver from its caller, and it recurses at line 149 through \u0060watch_with_readiness\u0060 and back with a piece of the document (and at line 150, line 151, line 153, line 256, line 374) \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 \u0060watch\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/src/recipe.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5cdcf7fba5bec79463c48070e55a2e63e81bdabbaa44f8562e9ca6102ed63f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060clone\u0060 is public and takes a \u0060ShapeIndexer\u0060 as its receiver from its caller, and it calls itself at line 340 with a piece of the document (and at line 341, line 342, line 343, line 345) \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 \u0060clone\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/component.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6acf29857019071f7cece568bd9fd4637415f64bb853d0f9db7171cd1d20f53"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060indexes\u0060 is public and takes a \u0060ShapeIndexer\u0060 as its receiver from its caller, and it calls itself at line 413 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 \u0060indexes\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/component.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52933cf64bbb24ee1faeaeec7ce51c5dc109f960fd98558b1f62306ec64e205"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060fmt\u0060 is public and takes a \u0060EntityId\u0060 as its receiver from its caller, and it calls itself at line 24 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 \u0060fmt\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/entity.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"0701d1ffed6d369c5acfe9dfcc74876b75a27c579b010579cb784d3732a0363a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060to_rust\u0060 is public and takes a \u0060Recipe\u0060 as its receiver from its caller, and it calls itself at line 201 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 \u0060to_rust\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/s10.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"078d5c195ab11f784d50c198f06cc46c7ac9befce6932ba026c7f574281a8e4f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060inverse\u0060 is public and takes a \u0060Quaternion\u0060 as its receiver from its caller, and it calls itself at line 372 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 \u0060inverse\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/spatial.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d12dddee2007f5a90d8c8a1a24af44cd61cb74b85d27f80c9355727ea51eb70"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060integrate_body\u0060 is public and takes a \u0060Quaternion\u0060 as its receiver from its caller, and it calls itself at line 377 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 \u0060integrate_body\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/spatial.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"28dc7812c8b2c2dfd1d1d730cb8a2d37de3cfe29501776607b7b8bc412480d19"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060visit\u0060 is public and takes \u0060expr: \u0026Noxpr\u0060 from its caller, and it recurses at line 99 through \u0060visit_unary_lax\u0060, \u0060visit_binary_op\u0060, \u0060visit_binary_lax\u0060 and back with a piece of the document (and at line 116, line 117, line 118, line 119, line 120, line 121, line 122, line 123, line 124, line 125, line 126, line 127, line 129, line 130, line 144, line 145, line 146, line 147, line 148, line 149, line 150, line 152, line 157, line 165, line 170, line 175, line 184, line 189, line 190, line 210, line 222, line 226, line 239, line 240, line 244, line 255, line 258, line 267, line 271, line 282, line 291, line 292, line 293, line 304, line 314, line 323, line 352, line 358, line 365) \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 \u0060visit\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/jax.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"40c5f4ab0643162ae6885f9fbcd7dc302ec08e164e5e182e85dd6606131c9a83"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060next\u0060 is public and takes a \u0060ChildrenIter\u0060 as its receiver from its caller, and it calls itself at line 121 with a piece of the document (and at line 123, line 126) \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 \u0060next\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b168db8aedf127ca7021251d5d719ec3b8a8661fe6e53809d1bd57644f4c5f24"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060is_equal_modulo_ids\u0060 is public, takes a document from its caller (line 1934) and hands it to \u0060is_equal\u0060, which calls itself at line 1970 with a piece of the document (and at line 266, line 269, line 272, line 275, line 278, line 281, line 284, line 287, line 290, line 293, line 296, line 299, line 304, line 305, line 310, line 311, line 312, line 313, line 314, line 315, line 316, line 317, line 325, line 328, line 339, line 344, line 349, line 354, line 359, line 367, line 378, line 379, line 389, line 390, line 391, line 401, line 402, line 412, line 413, line 420, line 421, line 426, line 427, line 428, line 433, line 445, line 450, line 455) \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_equal\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":1970}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ca903e26eb52b1bc714479c5ecaabd2709765e7aef01ae8f5b6b247a4fcb06"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060visit\u0060 is public, takes a document from its caller (line 2333) and hands it to \u0060pretty_print\u0060, which calls itself at line 676 with a piece of the document (and at line 683) \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 \u0060pretty_print\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07ae3775608d59db93aaf8dd93fa4a9c689125a3815369481057fdeb9f74a08"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060ty\u0060 is public and takes a \u0060Noxpr\u0060 as its receiver from its caller, and it calls itself at line 1342 with a piece of the document (and at line 737, line 740, line 851, line 854, line 1345, line 1348, line 1365, line 1372, line 1411, line 1433, line 1443, line 1455, line 1457, line 1468, line 1477, line 1491, line 1494, line 1524, line 1526, line 1531, line 1548, line 1556, line 1558, line 1559) \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 \u0060ty\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"c077f15a3ec44aa99e35c8e7245bbb6da8ae143af8deffb55239a0b83f82c19b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060element_type\u0060 is public and takes a \u0060Noxpr\u0060 as its receiver from its caller, and it calls itself at line 1577 with a piece of the document (and at line 1582, line 1583, line 1589, line 1590, line 1591, line 1592, line 1593, line 1594, line 1595, line 1597, line 1598, line 1599, line 1600, line 1602, line 1604, line 1616, line 1627, line 1628, line 1629, line 1630) \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 \u0060element_type\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":1577}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7f39381a80aacb85d0333b795698705c5f636c6527143d43934c390e242c75"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060visit\u0060 is public and takes \u0060expr: \u0026Noxpr\u0060 from its caller, and it recurses at line 2146 through \u0060visit_binary_op\u0060 and back with a piece of the document (and at line 2149, line 2155, line 2156, line 2157, line 2158, line 2159, line 2161, line 2165, line 2169, line 2173, line 2176, line 2177, line 2178, line 2180, line 2181, line 2184, line 2185, line 2186, line 2187, line 2188, line 2189, line 2191, line 2192, line 2195, line 2199, line 2203, line 2207, line 2212, line 2216, line 2217, line 2225, line 2231, line 2232, line 2237, line 2238, line 2239, line 2243, line 2244, line 2252, line 2256, line 2257, line 2258, line 2266, line 2272, line 2273, line 2282, line 2283) \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 \u0060visit\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":2146}}}],"partialFingerprints":{"codehealthFindingId/v1":"a567268d8cb717d8c9d820cf0fbf88b48212a9f043446a4cb000b627a264805b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060visit\u0060 is public and takes \u0060expr: \u0026Noxpr\u0060 from its caller, and it recurses at line 2353 through \u0060visit_binary_op\u0060 and back with a piece of the document (and at line 2364, line 2386, line 2387, line 2390, line 2396, line 2402, line 2403, line 2404, line 2405, line 2406, line 2407, line 2408, line 2409, line 2411, line 2412, line 2417, line 2419, line 2420, line 2430, line 2436, line 2442, line 2448, line 2454, line 2460, line 2469, line 2480, line 2486, line 2492, line 2502, line 2508, line 2509, line 2525, line 2535, line 2539, line 2554, line 2555, line 2559, line 2577, line 2579, line 2596, line 2598, line 2599, line 2600, line 2613, line 2626, line 2632, line 2652, line 2653) \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 \u0060visit\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":2353}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaffe72b7e1782ed5876534377a8984855319cd6239f7d31ba2d68f98a6df214"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060collapse\u0060 is public and takes a \u0060Panel\u0060 as its receiver from its caller, and it calls itself at line 729 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 \u0060collapse\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/wkt/src/gui.rs"},"region":{"startLine":729}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f449a429f31a9a2fccc16d7a15f7fda68821acc66d0dd5d83f5b96e6fb64607"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060viewports\u0060 is public, takes a document from its caller (line 774) and hands it to \u0060collect_viewports\u0060, which calls itself at line 797 with a piece of the document (and at line 802) \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 \u0060collect_viewports\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/wkt/src/gui.rs"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"61258900e16c6b7b616615161e497a5fe4bd15a3e135df2aae27617575eb3cbc"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060merge_json\u0060 is public and takes \u0060base: \u0026mut serde_json::Value\u0060 from its caller, and it calls itself at line 2156 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 \u0060merge_json\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/wkt/src/gui.rs"},"region":{"startLine":2156}}}],"partialFingerprints":{"codehealthFindingId/v1":"775bf195e7ef3e1c4fa84e08aef6034ba662c5afb7b67623bda17e474a22ad15"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060visit\u0060 is public and takes \u0060op: \u0026Arc\u003COpBuilder\u003E\u0060 from its caller, and it calls itself at line 788 with a piece of the document (and at line 792, line 793, line 794, line 798, line 799, line 803, line 804) \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 \u0060visit\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/src/vtable.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a15a696d5904c06a0193bf3e9a4739e826b93efd38145cacd93c9aa8bf5ff07"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060initialize\u0060 is public and takes a \u0060PalettePage\u0060 as its receiver from its caller, and it calls itself at line 200 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 \u0060initialize\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/command_palette/palette_items.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d18a3a15f6318db42be1c91d3b6ebe50a7c5a490affddbf3d75c24beea86878"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060visit_dependencies\u0060 is public and takes a \u0060SchematicWindow\u0060 as its receiver from its caller, and it calls itself at line 181 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 \u0060visit_dependencies\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/kdl_document/types.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7db5ed63c6ca511b41d7552d5e6ce7f40a1125b11e702ac6875b839c515ecaa"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060supports\u0060 is public and takes \u0060expr: \u0026Expr\u0060 from its caller, and it calls itself at line 46 with a piece of the document (and at line 47, line 48, line 53) \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 \u0060supports\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/eval.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"03386f4f8069d4c7ec05840885538ee179e1e082f7659e31fd4252ac55d4eba0"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060evaluate\u0060 is public and takes \u0060expr: \u0026Expr\u0060 from its caller, and it recurses at line 66 through \u0060formula_eval\u0060 and back with a piece of the document (and at line 79, line 85, line 86, line 89, line 144, line 145, line 146, line 147, line 148, line 149, line 151, line 165, line 166, line 176, line 177, line 178) \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 \u0060evaluate\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/eval.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69901a94617eea8d18f3fae3ac88b25d5d599c7486f1b87f0cb9990a2239753"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060to_sql_time_field\u0060 is public, takes a document from its caller (line 266) and hands it to \u0060to_table\u0060, which calls itself at line 181 with a piece of the document (and at line 184, line 186, line 191, line 200) \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 \u0060to_table\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/lib.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eb811bfed3e99731ad750753670ff5b3da713c13e18b851585a1d1f8ed594c4"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060to_sql_with_options\u0060 is public, takes a document from its caller (line 284) and hands it to \u0060to_qualified_field\u0060, which calls itself at line 218 with a piece of the document (and at line 221, line 223) \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 \u0060to_qualified_field\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/lib.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aeabab76f314514609a4aadec8b3a9c70ed39ad45d633c2e73d967f863199ef"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060to_sql_time_field\u0060 is public and takes a \u0060Expr\u0060 as its receiver from its caller, and it calls itself at line 272 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 \u0060to_sql_time_field\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/lib.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"57166037368a328af2844a3f6a519b6d0fd9dac4e74e974ed15e2e3d05fa87a1"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060to_sql\u0060 is public and takes a \u0060Expr\u0060 as its receiver from its caller, and it recurses at line 280 through \u0060to_sql_with_options\u0060 and back with a piece of the document (and at 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 \u0060to_sql\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/lib.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb5b6343d0c6bb7c7263535de991c6a4330b9c930d827a5e62fd09848e0c8c5"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060parse\u0060 is public and takes \u0060ast: \u0026AstNode\u0060 from its caller, and it recurses at line 649 through \u0060parse_orientation_flag_arg\u0060, \u0060parse_method_arg\u0060 and back with a piece of the document (and at line 532, line 534, line 547, line 550, line 675, line 678, line 688, line 693, line 694, line 699) \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 \u0060parse\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/lib.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"868b77ca17ff993156c37ce013b174245f10dc76a72b98cd4fc93f7d83b4fa89"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060flatten_comma_args\u0060 is public, takes a document from its caller (line 49) and hands it to \u0060flatten_nested_pair_tuples\u0060, which calls itself at line 60 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 \u0060flatten_nested_pair_tuples\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/eql/src/formulas/mod.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e154d0b6b928bb79f6a3718ffd8f87ac75168e40f6141c997fb80913d9fffd6"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060request\u0060 is public and takes a \u0060Client\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 \u0060request\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/cli/src/lib.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea23eec0a5b1aee37ce775a40180f9da3e87302e9284b917e73f5994064f8bd7"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060stream\u0060 is public and takes a \u0060Client\u0060 as its receiver from its caller, and it calls itself at line 263 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 \u0060stream\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/cli/src/lib.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bbff21d4de4fff7b0cf678c2906c6f5021627b979baad4c3bd4000d4eea30b8"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060send\u0060 is public and takes a \u0060Client\u0060 as its receiver from its caller, and it calls itself at line 196 with a piece of the document (and at line 255) \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 \u0060send\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/cli/src/lib.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"55aeec555ab8143224ab5adbcc97cd9c1438e272adb8bd22dbf65c1b0f2024f0"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060count_body_instructions\u0060 is public and takes \u0060body: \u0026[InstrResult]\u0060 from its caller, and it recurses at line 100 through \u0060count_nested\u0060 and back with a piece of the document (and at line 111, line 113, line 115, line 116, line 121, line 122) \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_body_instructions\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/const_fold.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c19df57ab4f0f05b9bb2b70d1d1daa571af53942aafb8f96b1cbba78841f755"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060rewrite_aliases_body\u0060 is public and takes \u0060body: \u0026mut[InstrResult]\u0060 from its caller, and it recurses at line 1564 through \u0060rewrite_aliases_instr\u0060 and back with a piece of the document (and at line 1674, line 1675, line 1680, line 1744, line 1752, line 1766, line 1779, line 1780) \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 \u0060rewrite_aliases_body\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/const_fold.rs"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd47a1dd1222691bafa9d744ac25c9d8551c7e8f238e35934590c68c90fb7094"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060operand_ids\u0060 is public and takes \u0060instr: \u0026Instruction\u0060 from its caller, and it recurses at line 2052 through \u0060collect_body_operands\u0060 and back with a piece of the document (and at line 2053, line 2059, line 2101, line 2108, line 2119, line 2131, line 2132, line 2159) \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 \u0060operand_ids\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/cranelift-mlir/src/const_fold.rs"},"region":{"startLine":2052}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fd1dff191a2ee55b3bd019c90301c3ae03f799d9f7c87b1997fea7515de2457"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060clear_interrupt\u0060 is public and takes a \u0060DmaChannel\u0060 as its receiver from its caller, and it calls itself at line 69 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 \u0060clear_interrupt\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/sensor-fw/src/dma.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7c77d6a0d727f202e222794326d4a120a3a4dee1e5b39e6ea9ceea5c4ec113"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060update\u0060 is public and takes a \u0060State\u0060 as its receiver from its caller, and it calls itself at line 54 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 \u0060update\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/roci/adcs/src/magkal.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec37638ed743dfeb6275f83fdb4a5d5d65b088453c0ae34ecd40f92af16ca632"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060update\u0060 is public and takes a \u0060State\u0060 as its receiver from its caller, and it calls itself at line 351 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 \u0060update\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/roci/adcs/src/ukf.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"660b97659f8f354d418c648ac58e753be0cf3c0e47e24519e147b0ce8c5abef1"}},{"ruleId":"X18","level":"warning","message":{"text":"Raw handle taken from an owned value and never reclaimed: \u0060Rc::into_raw(ctx)\u0060 (line 208) gives up ownership in exchange for a raw handle \u2014 the value\u0027s \u0060Drop\u0060 will no longer run \u2014 and nothing in the crate\u0027s code ever reclaims a \u0060Rc\u0060 from a raw pointer (\u0060Rc::from_raw\u0060). The memory or descriptor stays allocated until the process ends, once per call. Pair the hand-out with its reclaim (a \u0060free\u0060 function that rebuilds the owner with \u0060from_raw\u0060 and drops it), or keep the owning value."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/video-toolbox/src/platform.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f43c6c9cc49450f7bc7db78dc288ca6b8a021201fddb3ba0a9756d701fdb04"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060buf\u0060 (line 435) is a \u0060BufWriter\u0060 this function owns and never releases: no \u0060flush()\u0060 (or \u0060into_inner()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/arrow/mod.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"115e5a5349f086ba44fea2db6dc931e5a055c04d67dcf4ad47b7764f05058c52"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060buf\u0060 (line 447) is a \u0060BufWriter\u0060 this function owns and never releases: no \u0060flush()\u0060 (or \u0060into_inner()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/arrow/mod.rs"},"region":{"startLine":447}}}],"partialFingerprints":{"codehealthFindingId/v1":"db9072527aaca89ae616f4cac3468c8f0fbb4b341cfbf4972ca3312b72f85166"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060buf\u0060 (line 458) is a \u0060BufWriter\u0060 this function owns and never releases: no \u0060flush()\u0060 (or \u0060into_inner()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a buffered writer that is dropped flushes and throws the error away, so a failed write reports success. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/arrow/mod.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef9ade6cc21a88717005a0099766244d9ce71d60557cc2c2ec4f2f647f3dd48"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is only ever logged: \u0060DeviceAuth.user_code\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but the only production code that touches it writes it to a log or the terminal. 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":"apps/elodin/src/cli/cloud/auth/login.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"434a8aa77e27e886c7b03f12c45e4257d7304b3da0d87cedc775869eb0ed4bad"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is only ever logged: \u0060DeviceAuth.verification_uri\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but the only production code that touches it writes it to a log or the terminal. 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":"apps/elodin/src/cli/cloud/auth/login.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"4318da04efa846974e488775a310ccdb0815f2f2df2d22359309ec28bdda4ede"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Config.glb_url\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":"fsw/mekf/src/main.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa17c2c3f25baeb055d14df6c9166ad463487f83eddad7ce6cab8ad2f38edcf5"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060BlockadeMetadata.imagine_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":"libs/bevy_ai_skybox/src/lib.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d3c6e464069005f11f8420655b1da8f762c306b2747f3f86aa5896336ade9a"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SkyboxManifest.version\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. 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":"libs/bevy_ai_skybox/src/lib.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"97d57f7d3f3ae1f7fcab6234bdf71f5c347dee72233ed7a987067c1a8511a8c3"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060RunArgs.http_addr\u0060 is offered as a command-line argument 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":"libs/db/src/main.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0ecfaf3c6b70db5cea4b9d81010c39d55ed8d054b3b95a1a8c58dd93dfdc53d"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060RunArgs.grpc_auth_token\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. 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":"libs/db/src/main.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"3abc97e6297ac677b661549c31695e0c9992d311f99adaf3458d4963f2843b77"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060RunArgs.no_grpc\u0060 is offered as a command-line argument option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. 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":"libs/db/src/main.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b4ccca84e4fd817c4b263c55a4be21d918d88bdd4d9f78f5159c52acccbf81"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060FixTimestampsArgs.yes\u0060 is offered as a command-line argument 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":"libs/db/src/main.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a87330e9c24dcbcb05894cdbe47b6fe08c3f18f8b7ddb7bac5b0a5cd5b8641"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060PruneArgs.yes\u0060 is offered as a command-line argument 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":"libs/db/src/main.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ead465af3d301dc4e2cecdfc5575ad6fe86fd8065375c641a5e8ebf868d8dcf"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060TrimArgs.from_start\u0060 is offered as a command-line argument 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":"libs/db/src/main.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b29823b58bcde1f4b1750b265ba5485b02b4b81b563bbc41b8b5f6032a64a4b"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060TrimArgs.from_end\u0060 is offered as a command-line argument 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":"libs/db/src/main.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"95234c1ec32308e9bc3a5a3d21d8106ee4746cc083d4e0f9de4c11d0f69120d3"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060TrimArgs.yes\u0060 is offered as a command-line argument 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":"libs/db/src/main.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc7ac5e4cf4b59713c6260fff5bdabbf337dc04480425efe20559664252b98f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060TruncateArgs.yes\u0060 is offered as a command-line argument 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":"libs/db/src/main.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"242c69a6f7d708da457e48a102be8d4f1b087dc4972b97660fc6af64a6fa835b"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060TimeAlignArgs.all\u0060 is offered as a command-line argument 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":"libs/db/src/main.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c7dc525dbe872ce24177d86b9543394410d1bb9072b820c2fcaab4935eaf57b"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060TimeAlignArgs.yes\u0060 is offered as a command-line argument 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":"libs/db/src/main.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32cb5b5675cc112cc3a5fe2f91f8637305890a649875bc8dafb73f01e63b48b"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060DropArgs.all\u0060 is offered as a command-line argument 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":"libs/db/src/main.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dae73f2238d75d470a2afb9ae1600706c749a81359e6a4200a644cdb1baa49f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060DropArgs.yes\u0060 is offered as a command-line argument 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":"libs/db/src/main.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"075514013a18b72422814bb4a9ad601c9641dc23099055c4c368cfe0eeef975d"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MergeArgs.db1\u0060 is offered as a command-line argument 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":"libs/db/src/main.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac109cfa8a32143dc7117fd05ad75a421793cd22f9b65454d6bff641c59f797"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MergeArgs.db2\u0060 is offered as a command-line argument 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":"libs/db/src/main.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b989a7ce06ea11557c11ecf098364987c5924f42bbc81d6acba58cffb3f7124"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MergeArgs.prefix1\u0060 is offered as a command-line argument 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":"libs/db/src/main.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d1b4f59f8905d75cd68afba8acb482cee3bc9e825083511986576471908fcf"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MergeArgs.prefix2\u0060 is offered as a command-line argument 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":"libs/db/src/main.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bffcaa4d5b0a1f024712476179e3ad93a5bd4e8677896bef6a0215078c5eaf7"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MergeArgs.yes\u0060 is offered as a command-line argument 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":"libs/db/src/main.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"009f857091d8b08b727f3538513cb2e495550951967c1afdfb74076cd6e1f15a"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MergeArgs.align1\u0060 is offered as a command-line argument 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":"libs/db/src/main.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efc3f89d2f767594bda637b228fdb24da7d84e60afc63d4f72252e6d040b17c"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MergeArgs.align2\u0060 is offered as a command-line argument 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":"libs/db/src/main.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88eeef4d32c28b4f36ceb3b7f0f476dc0f6824df0da0b9d3bc9148ce6b61d11"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060MergeArgs.from_playback_start\u0060 is offered as a command-line argument 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":"libs/db/src/main.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7021f6376b923e2086c2eb553dcfcb7ce9bbc64d75ab0ba4b65382c0b23145"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ExportArgs.mono_ns\u0060 is offered as a command-line argument 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":"libs/db/src/main.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dbe6c15787c8264364b98e4224407ea0ed0edd3f5b63a023822db671c888b86"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ExportArgs.mono_us\u0060 is offered as a command-line argument 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":"libs/db/src/main.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3f69885a1d7b6bf7d8032ccced2f739273a13b946a646e0214723772311c70"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SensorCameraConfig.camera_model\u0060 is offered as a configuration-file option, so whoever configures the program can set it \u2014 but no production code reads it. A test asserts that it parses, which proves the key is read from the input, not that it does anything. 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":"libs/impeller/wkt/src/gui.rs"},"region":{"startLine":2193}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bf52f4be0230dd12578196e0ea4d1b3a2d8e5956ab214df34b3f21cd422d95"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ResourceSample.elapsed_ms\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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"007bfaacafb74a8581755da5eb741be3a90fec79e0877ebdd773d3f63383b61b"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ResourceSample.cpu_min_percent\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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6ce80de8b184a6f911d299233584d1620d59469bbd433c222f526662149a7d"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ResourceSummary.peak_cpu_core_percent\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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a1d730c0c79ce9747cf905f6dd883ab9a61d513edbc3a0202b30dbb6bc99ae"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ResourceSummary.peak_memory_used_kib\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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e4c497a272083f51c1fdc577dc8a7d535654af4400c990406ee746ace17755"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060ResourceSummary.peak_campaign_disk_bytes\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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"2182f186993b38c9fbdad25c050ce87b31af48a72c21b5732f0cd24ab95861ca"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060Tensor.phantom\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":"libs/nox/src/tensor.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b80c478cc991d3c1f103ce9d7738acf8ff35e6492f726f42d78c529944aae3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 65 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.error(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.error(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/broadcast_component.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7e9a9bf10068a81d8cf0ce3bce055b6f8151910c13243385a827ebfd68847b6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 81 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/broadcast_component.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"df126a51462aa2f5403dd7a6bf5f2b613be414b003b6a14bbaff86fbb6abfa43"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 83 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/broadcast_component.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"253ba1440f0deb1256c3d365398b708528f8be0d8c206007d26776e1f610d96d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 97 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/broadcast_component.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a705ab1f85355f52130c8c2f6909470f65e5be231019d7e4c151fa56a9c12b1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 118 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.error(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.error(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/broadcast_component.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"1609f0cb29fe1424f528820dc7ad326d6215fa5181da11fad4556c07aac7dd8d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 193 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/broadcast_component.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"4399095c895231d49b26940eb98572cce03be09a01b50c68eafd9b64526fe16c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 198 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/broadcast_component.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b2a75e37172ab35dcd8eba6042b72bd56d6fe5ce602b0266bc25015695624c9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 200 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.error(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.error(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/broadcast_component.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f6d3c59511cd08f4d14e4495aeedba804050c57b615f6979ba4b75143867a2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 207 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/broadcast_component.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d0f34e0dd038d3d5b7c784ef4d7b57641fa94aa33b926ebfa3c4255438a4c88"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 209 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.error(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.error(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/broadcast_component.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4895eb2a22eb420bcbc7b733aba6745a8d7baece8abef114d0a017fd1e8b0b8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 220 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/broadcast_component.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9863a73ed7a9cb550b27ec1dd868a88b74da8431a36cf9fd71f143cf5fa7a30"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 238 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/broadcast_component.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bfda8d8012b398fed35f6f7b5cff5c628d5e81de083e02238b95f99167129af"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 253 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/broadcast_component.py"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c1c75f50a467fb9fc41d1fc894b7723358a1b0d2934a870952822cc3b5d43e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug\u0060 at line 264 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.debug(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.debug(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/broadcast_component.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6f6481409d8c1b9edd6620966b17c8f4fbd414a8b7ae01ccc972a1b01f27a5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 429 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/broadcast_component.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ab2424c76250ac03e5d03c9b23033e3ce26384eb2521ebeb9b7ddd3401bdb4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 434 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/broadcast_component.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c15519e8dc90e2cb15b0258835ae0aa8535252cb0295dd6b599d686e16b2dfa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 128 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/receive_broadcast.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b0812065c6841c89ee136fae5af685a1deeafaee202f870bebe5d211221cd54"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 130 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.error(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.error(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/receive_broadcast.py"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e3c9b937a1f6791479b971dc5bfa50b56bdf7474b4dc32324a09572c7c56b5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 137 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/receive_broadcast.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ddad96a53102702121e34dc2a32e66d9d260a2692f53fabd3ff52350076086"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 139 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/receive_broadcast.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ba0b03dd290ed3be9b017e7325d3e9ddeea8e651d429464d4a26e4ae189613"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 162 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/receive_broadcast.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2dd297eae20083ae3e570d43840924d7c41c266d5ff50affdca0bd54215184e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error\u0060 at line 181 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.error(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.error(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/receive_broadcast.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1e8337bdfc958f16b7e02f8b4df07951d1d14d21a9fb183da2e9ace607e4655"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 226 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/receive_broadcast.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b561c717c55f52ca11bd5f991c7f2e6745197bed75ce6eb3f9de3db5746adb"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 304 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/receive_broadcast.py"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"39b3f05c12e0a28832b55a20f93f6b6a8a53de52005f1971603804f5b6ba21aa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 428 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/receive_broadcast.py"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde293a60888ccd31a2ded6fbcd05af49b0d97b23b5c1cc153e362bfb19641c1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 438 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.warning(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.warning(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/receive_broadcast.py"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f95ac358379e1e361147e462db9984e92bb3d4968ae3ffddef1eb09613fb32"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info\u0060 at line 445 is handed an f-string as its message, so the logger receives one finished string \u2014 the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: \u0060logger.info(\u0022order %s moved to %s\u0022, order_id, status)\u0060 with the standard library\u0027s \u0060logging\u0060, which keeps the message and its arguments apart on the record, or \u0060log.info(\u0022order moved\u0022, order_id=order_id, status=status)\u0060 with structlog."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/udp_component_broadcast/receive_broadcast.py"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef288e0212834d4fa8d5810f8b05bec6692eec3329360433b66c9b91d7bbeef"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 35 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/stellarator/maitake/sync/src/util.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6963d22b3ee4e9b7f563976998e9d26fedbc98bd693ab5d617d1c7079d5623"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 19 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/src/liveness.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fafa4bfb3d8d668593d2ff9961edc6555a573a565b4c74388beebc8b16f80b6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 24 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/src/liveness.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca000b2f978442ffcf5e5e97477b6aa5f4bff9f45e9a73a2cf94acbc7b7f419"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 34 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/src/liveness.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4e8605e9e892d7a7647394cc394757c84949ec18c8cac95b5591818f785c06"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 51 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/src/liveness.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba4ccb95a6085aaff95918bb04178808f62281b9127a9de0a0b3e10af332994"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 66 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/src/liveness.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e795e0c90b741652006db106e759e7cbed6df03ff8fd17a467eeadb2cb4c949b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 73 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/src/liveness.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b69b3b6b073ce0bfdf040cd8d0d07af859a671f35af9b1f21cac479e399b8d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 92 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/src/liveness.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2e75571eda4524b347b7d66849b68ac844dadc8b046a1b6ef4a427996d3780d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 630 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/src/recipe.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"58700db22c5c3642922582915d3c7956a8a02528cdd1463eac85551508fef4e9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 643 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/s10/src/recipe.rs"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd028b2749291fb30ba81fdb62fa834653da7813154023cf61f60655f0214cd1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 310 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/impeller_server.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4d1c118d1edc2e4b0313758e5d1f901058319a25eebbbb659972be41becf4d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 323 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/impeller_server.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"d59fc09b80ed20af15d0b1e6eaa133ba7745bb76492bbb1a645b41a5183423ee"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 627 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/impeller_server.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"369596a75e06977792fc2624576c004ddbe27f8a25129cebbc2c2ce0c9a32141"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 780 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/impeller_server.rs"},"region":{"startLine":780}}}],"partialFingerprints":{"codehealthFindingId/v1":"157f1db99ebad0e0b7e6c960f1d07da03e5d32806952f331100f12f6423bd00c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 833 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/impeller_server.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d27987cf979ec0164fd16cc201c116252dd680bebeba802dce6c1a4a54a9049"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 392 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"32267bae98f3a291cf22e5c3887e07fdb8aafc422c36fccbfd8b80cafba810db"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 401 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"559c3be9c488b91703b7f631e0b5b1bf8e477745af28052f7ece4e9a93fe9be6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1071 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":1071}}}],"partialFingerprints":{"codehealthFindingId/v1":"61ecbf2b05a21b0fe0e86d3fc86ec3c62fe1f04ba525d6b5e317a5c9f3f27be4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1077 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":1077}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd07f390e9180b46c703312bbed832f42c5a9f6d0cba98c4e5670d660750853b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1110 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"71709e5464631de785476d101a5cf805a65dd9af08b4123506c38c01487b9903"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1116 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"1faa6662109f2703f12e2c995f84eeefbe227fb07ed19fd25ae45524e508e59d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1150 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":1150}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a824dc88451bdadc1c922f1a0473069d94eca2bb71079c8889efdb942fc4df"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1932 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":1932}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ba91e3f4dc25b1aad48fb19e8ecbe5eba82f33f78c6d34444f2c2e4c66e345"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1938 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":1938}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb79da7e98f0a98bcddab255245a7ca7f686f75feebbb50330b0bfee5b82af4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1942 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":1942}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd67af0b6ebf10ee75e0ce39dacc1dda723f04f86386e54479470a38c29b558c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1982 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":1982}}}],"partialFingerprints":{"codehealthFindingId/v1":"77458945ba52eaa4343dab856d7098fda950da971b12b962d0a018bc6d781019"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 2000 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef857c450d033acd535d5405cb4497df277168de0b74fb04d4073077f11a17ed"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 446 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/db/client.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcfb42679e2a679f482a2d79f5e0af2398338f4dfd15e352a1af39daba3ffed"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 824 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/db/client.rs"},"region":{"startLine":824}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbaf2ac27e9da513c218002aaef0dc6c5e745924b2649cc49d3c26fb08e08dd1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 884 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/db/client.rs"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd5977d80257ab2f7ed4ed635027409d26181b1606e3224170f77c05c1c1627"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 300 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/db/stream.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eff74ba585654ba34b1ff0ba57df26c359dc1639d7ee8ab1b3d9d134adf8fe6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 336 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/db/stream.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"c127703753f224775de88799627de92b10fab17db9f1feec92d9c77aa26f91cd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 384 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/db/stream.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1c99afcab5b7a27f35d2a3ba826b23ac0c9b5c20a101995a85073f9f78f05f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 450 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/db/writer.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56b1a4d978dcc744daed7fa724ac442813333f0b31a1c05826cdc14764e2468"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 480 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/db/writer.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da1dca75998b8b15fb09e9146362a145a71b02a7d197bbe26b0b37a3336fab6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2149 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":2149}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed5675bfa501b13fd759f8d11cf18805d1de2db86bfeff97ac4c958d23ab6a9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2186 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":2186}}}],"partialFingerprints":{"codehealthFindingId/v1":"6853e7401f09088c0c00b63c9b055b0ae64213101fff2fc1df91cbc1210c9a30"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2251 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":2251}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2843306e5c553b1b094c2e66ec7fa4efb10b804d9d36215e3021a505f92a8d1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 416 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf31b216cc51695246c66595385ad3406746afdcc491a7750035ad3d2cf77264"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 470 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"d99f57653e6a889f11ae86c4f312ed06150707eb6a58f847e369222a3b6dced0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 482 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56a0ce3338d834d1b23430846c3b42e1201e68a7c62b3e01c5a2dacf38d42a6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 520 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb107507942cb05464b7f8158abb0bd599269d644ea89b3f5f022ac82c3ee7a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 559 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e5875595df4071124ea09db0d8691ed6a9a9bafce213a1836a430a793fe6285"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 723 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca9a6cc28bc22767b85d7e25869d77cbd4181271f70349d4be33675d94feebf3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 872 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e7a880b88264e01ef769edd6e21b5dd0f1684a1da63d054852c024f5018676"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 887 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd0741db9c4006746d5b5ae82ec0749d13800f265e904329db3b394c0b3248d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 892 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"129450d2b6a0fb06203249662dfe67726da528e1acb884d62c1038775fda7238"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 931 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2be0ff78b8991e0a79d794a42d8296eb23109e84f3699bf518cdf968c13d72"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1011 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"624221ee99a644e9129c27334e6f0a8eacfa2de6ad31be8c0c7f52d9e36fd32e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1041 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"0771bbe9eb2428021935aa5da49253c052982675b23283535b581d3abb2af393"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1134 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"fafe8e34ae57b7d5b7ee203595ec161cd026b6f28370336ec36e3c8a012303e4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1177 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"19459ea9d86643ae3beba31ff52c67be9e9f5d0fda001ac2a6df8b197872adac"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1240 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7fddcc9ed3265637b666835b50b78ae97f21fd2b5210e283c0483ac5e551fdd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1349 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ff6e3e7d553314695c1ede9f9a5c039f39052c63d33ab6e362cf17698d6837"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1360 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/headless.rs"},"region":{"startLine":1360}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48da29ef0bfc14faa6e29190f9a874b36824fb4163b5d231b9a98e7435af231"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 26 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/icon_rasterizer.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e4e68c47a6dcf33edd873db4db3d3138a6478e553663607192484fca89b4ba3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 75 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/icon_rasterizer.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"621f44b5e0d407c936001afe3d00346c31970acd474f6babc94a06affc6b186b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 87 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/icon_rasterizer.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"018e08a6b058172a20a6f791e85ffec96b352cd768fbaec886d61041dc0b22f2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1741 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/lib.rs"},"region":{"startLine":1741}}}],"partialFingerprints":{"codehealthFindingId/v1":"10d8c004d6a87aa028026fdb9f719b88fbc5287b4024588fc1587054a61b0168"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1534 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":1534}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea340bfa73081a288647ee5d1b14a70f96f12448aa9e94525280a379bf0ba80"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1538 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":1538}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f728f877b667a3d3ff484b5c9ee472a1d0ce211b0383b26e813629a072afa4b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1545 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"a190f6fa65f2bf0798c4658e08a1a32c9eacd13246e54cce4d903a98cda9b73d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1550 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":1550}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd0fa7f64de799b8220eb4254232f1e4d2eefc9626c52dca73a368003ab8900"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1558 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":1558}}}],"partialFingerprints":{"codehealthFindingId/v1":"544ea08ba1866c8e4d509b1bcaa5d024fefe03beea5f8b4fdf47dc8075266bf3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1619 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":1619}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30934e449bdf5cdf61dc43240ce8edc195b9c993b2dc66148bb445cb8e2c0b5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1631 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":1631}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd3ccf237b7ac47ce0a666601cd9b45f346248bc502190dafd6bea1000a491d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1638 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"20546b01a40878548df2f276d844c5fbbfe32536959d0bb69eec485eb7307e44"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 2049 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":2049}}}],"partialFingerprints":{"codehealthFindingId/v1":"103a9ea4084897d953ff79f8e6329acf63a128e88a904b9270f02613400975fc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 107 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/run.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b66e32fd97206578c995de127f75d016d62f46d76483e32018d37b1a7905573"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1620 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/sensor_camera.rs"},"region":{"startLine":1620}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ecd88ce00f47c90f29a93c8cdd3b4b51a9645bd8969d1bd3766c39829a4b8c5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 44 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/sensor_h264.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bdef49e7570a46da0bcc9e973b8aca418dc85d3bf27d2989067f6cba62e3ae5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 51 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/sensor_h264.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"30efdc140c50c06205892bb480b8cc3769154c5558df5e9d64dadaa6ca91be59"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 60 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/sensor_h264.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"234b3491b99cb5972de78fcc701949adcdb5c8d7cab32a953e0078b5a3703fc3"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 345 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/sensor_h264.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"7801a8caac7915231faa38f0090c8957e5d55acf8bc553286d9bc896fcb46484"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 46 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/actions.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bbbb3adc324eaeec72d8463cee1e22c0a2b9820ae8c7e52efe1a60c1a852a84"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1889 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":1889}}}],"partialFingerprints":{"codehealthFindingId/v1":"abc3ecc869c7d3ae5b6964028a7484e2172a772307d177522b9bda9309d0e1fc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 2053 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":2053}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6aa73a87b777f8158a42dab143e37447ebe4e55ef69548ec877e1b85378176"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 250 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/window/spawn.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"087754229332e5a3183c12d11c1e0db009d1135776e27c3b430be4d83fc1a57d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 738 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":738}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eff55fb9711860f429b851fb855ea446f5635f7e6217250f6a68054c2f3479c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1092 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":1092}}}],"partialFingerprints":{"codehealthFindingId/v1":"729a0d0ff64adfa1949b6e85896b636bb38ee7fa6fec941258890d140b2a4e4b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 377 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/hw_stats.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4276fec367ec4f3506120550076df6109faa7677dbd5860ac9bf36c286847e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 389 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/hw_stats.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"33304ac348fc682e24bcdfc4b9195c1e1cab3fce6fda644c5a2adbab738087fa"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 178 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/render_layer_alloc.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a530f935983bf414a0369d7a00191b479ba7f49a768abb47db0d13225467520"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 158 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/screenshot.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd138ad6f35fda3d72ae79bf79c4f86a522a971d6e256d0d661f49c8aec35c2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 169 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/screenshot.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"4664b8686d86c907447af8e3fa48995f33b9f1715ef8cc1a3306de4a691c79dd"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 177 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/screenshot.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"76713d5cd2d95aff16530bcf62e4ab91b82bc4e4929671499472f6dd0d6dea57"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 185 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/screenshot.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bb1ea6d3b0a6491ef98d888653df79abc6e9fabce55cf4ab1d41a51463b0b65"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 655 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/thruster_particles/mod.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ffeb39a96e2595d0e63785cb2f14fcaa05351431d84de076ed4ec9b81c0ad0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 917 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/thruster_particles/mod.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c4d84dc6cf1a82ef4ea007f765fa09b2c51333b05f8834eeb8de77b5421ff6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 19 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/kdl_asset_source/mod.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8213dfa30f6a2373875e4e787df6cc475361ae97858b86c95171211e511ec268"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 32 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/kdl_asset_source/mod.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"213dff2ebed96d3c72b30b9c41398dc962e7162668c22582d7d8910b536d27e0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 34 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/kdl_asset_source/mod.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"108b2bca344c86b1bfeb25cb3a8d02877c0f2c32203fbc3812bea6cf55101a99"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 39 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/kdl_asset_source/mod.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"74157079087b62217b74b3576d1e1dcf61dcb853e6b0f5e7e341cf121dedf539"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 53 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/kdl_asset_source/mod.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79feb36a4abe2e7099ae1779afc4ce124fdc024aa0096ae7f4a3de4437aef8f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 625 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/gizmos/mod.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd3b4953e950a72a298f44841074968edcca5641f80f45c8e9651852f065387"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 26 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/env_asset_source/mod.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"33466822ea3a1be6a8c0a5f43ea17363dc62390a9ae97edfafe28b3f5e3ff917"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 28 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/env_asset_source/mod.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ee92f486563f629a62932e9ca180425f0f32a5ddbfe78b3fb819cf27d6bf5d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 31 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/env_asset_source/mod.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba213b2af0dbb3dd22e4345a813fe4f88e1bb9a0a0abbcabe2b2566f8e87c7ad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 42 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/env_asset_source/mod.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f20c76080287accf410eed26894c28ed834afd81bb04029e3b782272318d74"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 47 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/plugins/env_asset_source/mod.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9912a860df3d20a420f7682c08bb6fd04dd70d5a56e152e91bef4f9fc5a95ff"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 50 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/cancellation.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"f82a4404f783bbbe8ffa5040be48030b6d318aca9a4b27cfd499fab7d559ea17"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 57 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/cancellation.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4bb9a180d88c1a0aa59bc1bf288388e3defd94e8035f739464b0bb18ca593f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 85 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/follow.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd7e10e8538bff0f1b8d7b3d8cbf59013ed25684cd483cefb3a5511ec9cd88d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 91 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/follow.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c858e79bd0e2fa33d9a140152861927d3102b331182b2193f3713df093212e12"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 230 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/lib.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab1f8dcf33ede4cb5f8420f0135801b6bca4077d6c6763038c569eae2a1850a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 666 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/lib.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c153987489c85496f442397a2735a4d06f2e69fe8021429d833ab52c85a4cc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 679 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/lib.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d94661623d4079471705cc9df87d0827d2c594002e43f24338f067586570e90"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 693 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/lib.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48f12ead9e3097f0de4c7b40e767c0ff3906dd1b13a1ff9bc0fa5523fbf7c3e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 707 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/lib.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf96b69395958b6c1dae09696ecefc67ca40a20f47f19b656885c8b9182b8a9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1816 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/lib.rs"},"region":{"startLine":1816}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6f893826220155afe5db0721453dbe58d5dff179560a54e5f3cba459ee3139"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1857 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/lib.rs"},"region":{"startLine":1857}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4a7cad6f40c3076c0a718377781f7bb37c643a6e78b181f808efad1ff5f14f1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 2811 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/lib.rs"},"region":{"startLine":2811}}}],"partialFingerprints":{"codehealthFindingId/v1":"b47f7f5f0bcf2b9ce81879780c1790ea7c5adc6972812730d6a701ce35fcfe84"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 3096 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/lib.rs"},"region":{"startLine":3096}}}],"partialFingerprints":{"codehealthFindingId/v1":"9674d6121928e48ffe802e563f496686495769ce91b0f23b965f498cb875d308"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 142 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/vtable_stream.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"e251087f0d7af1fd073ca95c505d6ab0e03c1854d12c04fd3c36494f0f121560"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 150 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/vtable_stream.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1f3a863bdf4ac2e1c46e7c1441b0078243e9ef31f2a079580aa57710d7fa54"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 391 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/arrow/mod.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b8fd17a8205bcdd55ac4666e97336969ae4a8169b607526870ccdad2fcd4700"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 404 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/arrow/mod.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75610dafe6638aae2b439a0ace596b1ebbb0bd8dd9df6bed23fd74c6eaf4d5a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 473 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/arrow/mod.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"564f53bf1987860bd874ae32ed3604270749830510eab7363f64aabed3a54523"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 479 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/arrow/mod.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6ec6a1a27931d434c057062a162d2eff6f5298afc28d857b05036170e64db7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 483 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/arrow/mod.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e62300d4674e6991dbf861464b6732c61891f4bad5bd26aae85042b9aff107"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 512 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/db/src/arrow/mod.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"01430002e149173503a994fb683a241ffee7f70046a79ff91539b940fedce48f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 418 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_ai_skybox/src/lib.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a6504e052556560454f416445f55ad1fae9d0d538d0e5d68523060a836c793"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 436 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_ai_skybox/src/lib.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a8cec8bba9afcf505092101c4caee55799af0a4e0c06da4f821dffbb3d9da0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 444 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_ai_skybox/src/lib.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04ff4ec6417c985362345e284feb6a6fe5cee31bd65ea637081febb79f7dc9f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 462 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_ai_skybox/src/lib.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e2bce765babdb0c6f1ef68dfb77fe07f48ab6cec8612f35b0626830e2e1b51"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 816 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_ai_skybox/src/lib.rs"},"region":{"startLine":816}}}],"partialFingerprints":{"codehealthFindingId/v1":"281e39c05da0e8a8acefa9a50548fbe4389fbc9cc29f4e1686562e90a2719113"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 966 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_ai_skybox/src/lib.rs"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2e8676f8ed07bc0758d4160f88f8d59516dcf21253de5f3d78141faa235ee8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 985 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_ai_skybox/src/lib.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"6299aa165d1313cb45db7d0147f5f54063263bfd7fcd45bf39e4ec288c521559"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1034 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_ai_skybox/src/lib.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82fd011bd89c5df90ff53f2fc5bb9446a6f2a94fc52778e42d436f7ae892560"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1063 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_ai_skybox/src/lib.rs"},"region":{"startLine":1063}}}],"partialFingerprints":{"codehealthFindingId/v1":"647a5effa7a7da3128fded8a45d50fa1be4751529ac3b418e6525fbc64454732"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1127 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_ai_skybox/src/lib.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ded3b5c511de45d3f29be538efa77402925c88f0b968ef338373fe977ee21d2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1164 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_ai_skybox/src/lib.rs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"e01b1305e7d747b980c790abfdebcf1894e9722dcb1ebc05a80169c75cc5bc3f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1166 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_ai_skybox/src/lib.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"e76c68d62ded7c68d88915c033f7b57e4869d8ba7ed4848e53890b0a8ec7cd34"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1220 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_ai_skybox/src/lib.rs"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9aa4785525ef3e19a579308694d98f2d6138df69f5f3977f890d35958f869e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1237 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_ai_skybox/src/lib.rs"},"region":{"startLine":1237}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f239874934cc0b6e32eeb2c3e9a9e258dd8bcb8b601c7e95c54c8aca5fa15c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 1287 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_ai_skybox/src/lib.rs"},"region":{"startLine":1287}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e32163c2d1475a38c165d31ca72741b966f8967125a7b32f11dd5a06145d31"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 1418 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_ai_skybox/src/lib.rs"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ac871a3902fa0e88aa3834e334af72204afeebff4d526021d5295cd603287c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 1427 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_ai_skybox/src/lib.rs"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0eff77fda68bcceb57815bd86d8c670869589092ca973f05c5553bcf0620678"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 1434 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060error!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/bevy_ai_skybox/src/lib.rs"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"6307036043ff74e9aee7dc4b5a93344f6a7ac12f28e338ab0e9461d03e4cb5a9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 217 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/config.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"16aceb28cbd4d2c3dc3d11c83fea259ebe4a765071fa0862db6e4f63f7f2bd3b"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 68 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/db_client.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"55cbc6f5202f66d73569bef3526c49e525757248e2f892df03d6bd106ecc0341"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 84 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/db_client.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a616b6518c84b6e232dc5e26555afbd6273321fb12c77bb0a64bfc9c121102"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 111 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/db_client.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d75fe1781511f8513192e9ed240f830cfb8a9ca76ac29135e1805e057c8b6c85"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 125 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/db_client.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ccb2f007af8645a86542899ccc96737a4591f5fe86f4a45a48c3c8ede1b321"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 128 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/db_client.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"b59767271b0e3dee8571d20f1ef5157e5d08496997e6b0062ec90251898429e6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 133 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/db_client.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d4ba295b9f754f8b12c51aa5d3891252ad548a89904ecb3a2a9af875b1c88f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 139 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/db_client.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"dec70499dcf9f585465c7d0b3ab6745151b25666918ad6035251b588902d62c1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 142 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/db_client.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bce6918b43f281c17bac9a67eebc0a00159b1be41749246f2260d995c4d2dd9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 149 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/db_client.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafdf6192bfe6ce7c4c33e324a0d1e391f37831423d4811d601e1e2ed2c1c3ad"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 165 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/db_client.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae87206ac827ce7bfbe267ae0ec78a7fc247230c3d305facc5527d3cfcf48e46"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 173 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/db_client.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e73308a030b49829568ca892169c51c220987aa3d3871177d2aba03db8664f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 175 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/db_client.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf989495cb121c755c9181412aa6b5df80aa23f30f415349655dd87509a8f8f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 193 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/db_client.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"db01ac39381436acc9a32aae630a31b5dceea4c21629f2dfcecf46d9f0b8fc31"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 205 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/db_client.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"d425db88fa89c35f8a7ec05ee4dd2c2b4a8c03c31f8d564b1366c51c9adba976"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 226 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060warn!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/db_client.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff877556d3943086859b84d3fdb566a9dfd66b32ca0fc3ee835ae2fcec20ea56"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 228 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/db_client.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1290707fa55bdc1de778822ffdaed32b31b217c2351f9d57871755d60a145c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 291 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/db_client.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc948630b3b91babafe0ed5afe93759cd5b94b34435dbb09c6dc207957ffc953"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 309 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/db_client.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"5942c92959c366cb8e7ba3af56f2b280f338054fa89fca392d08e4ec1bca195a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 328 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/db_client.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"686d19859931a654c1518d32793f78c4f1d014fe6568043af7595f8ae30e3608"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 344 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/db_client.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac69ed8fc94b8a5cbfe4a82c60c1429909f9d679f076424e38a41480ca388e4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 80 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/main.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6ef54e19222a0af44c1ed9cacc3371e761f6e4f820aaa45c95b80f214c00f5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 91 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/main.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cbd71263305b1ee09767614ab97a855454a2ccf294327503dfe7ce5cea6ec7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 98 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/main.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"197bb9ec405e5e051dcf38b6055a96636d9bec973c6becfc8212ee2279bcb1c4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 106 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/main.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e99f8f444535052eb85b1e40b84c953adea85ad1db593e1ed742c882b7e2fc0"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 127 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/main.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"79eac5eab82801d230fcfd21e5341e7f150f3040f9955207b97fa2465572278f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 168 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/main.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ff75c7217a6797af26f8782b606e16726fc44fe7f0dfce40950fe3d4c96b925"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 169 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/main.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d78396909830b57e376b2d3d1331570f24b407af46630f4c5c23986f0da67e9"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 56 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/backends/displayport.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c7b936d6677584f42d1d1df06caeba732264a7e718621e984b1e94f9ff603a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 86 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/backends/displayport.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"818e6194318b00103744d1ad264398833d4d6690600cb1c1b07e4aab0c9ea2d7"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 113 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/backends/displayport.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe1b563f1902f87782dfec05258f011405dacedf96449a350918fd6a890fe3f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 161 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060trace!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/backends/displayport.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"3873f47ce1b5c44b863c5eb54ab976b6a64cd1c338c9f647fd005b12d9891981"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 190 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060debug!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/backends/displayport.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"420434143259c25299478ac90bfcf3e53cc56bdd037bfb69b88e4c86fdd993b8"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 204 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/msp-osd/src/backends/displayport.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"55daed79b2c054b4520104a24288e0e53c4483b24bc1fb329cb88ce18a8369b8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bindgen::Builder::default().header(\u0022vendor/GeomagnetismHeader.h\u0022).clang_arg(\u0022-Ivendor\u0022).newtype_enum(\u0022logLevel_t\u0022).derive_partialeq(true).derive_default(true).derive_debug(true).no_copy(\u0022(.*)Msg_C\u0022).parse_callbacks(Box::new(bindgen::CargoCallbacks::new())).generate()\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":"libs/wmm/build.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecaa74a25cc168cfc3ba4caec4b210192fd638ba384f7827923e8eb017f467df"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060env::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.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":"libs/wmm/build.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"229fde15815059756083b3297da4a048c4ee7fb0f06c70da0b0e2c7c6253dfb4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bindings.write_to_file(\u0026bindings_path)\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":"libs/wmm/build.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f8f7147a1bd557fde738a42f17a6975c4918d5c486fd882e28dbda9537708a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::File::open(\u0026bindings_path)\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":"libs/wmm/build.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74298e558d91d42885e6f35bc80a67c789eb9d8bcda377e6e82f6a5364f8167"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::File::open(\u0026bindings_path).expect(\u0022Failed to open bindings.rs\u0022).read_to_string(\u0026mut content)\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":"libs/wmm/build.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9816efb3f55795b0d1854b55a0da8cfbb71711245aa38cc59856148ee10e9a5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::File::create(\u0026bindings_path)\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":"libs/wmm/build.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"79da33a356d5bf281972f9eee9ae976256c7ae84056ea1a17e0955a1e80e7a48"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::File::create(\u0026bindings_path).expect(\u0022Failed to create bindings.rs\u0022).write_all(processed_content.as_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 \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":"libs/wmm/build.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3499c618ffda449a210ef0bf1d018156a7cf6e58bf5bab4b40be4a874ccdcd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060WMM.iter().map(|(n,_,_,_,_,_)|n).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 \u0060magnetic_model\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":"libs/wmm/src/coef.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1473d83e99f2b13b3fb3c20e33c8c1d957098c44dcd1d36cb49aad37bc4d6d3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner.queue.pop_front()\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 \u0060pop_pts\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":"libs/webcodecs-video/src/decoder.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b43cd652f43b1e7d450980ca8f3f2a233cb13be57b4d8115f31f622e30c360c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner.queue.pop_front()\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 \u0060pop_pts\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":"libs/webcodecs-video/src/decoder.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"29aab907e0dc6821dde115a7de1bea14ba789bbdaf7bbe3db9634e40e5451ad1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner.queue.pop_front()\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 \u0060pop_upto\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":"libs/webcodecs-video/src/decoder.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ad8a8711464b5215fedf9f22bbcf41830ddff6f2e3b9ba39bfcffb165edd32"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NonNull::new(param_sets.as_mut_ptr())\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 \u0060create_format_description\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":"libs/video-toolbox/src/platform.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae8082f532c24f5abc5a6b117aeb02254e7f97a6fa63e9bc2ec0b8bb35739d6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NonNull::new(param_set_sizes.as_mut_ptr())\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 \u0060create_format_description\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":"libs/video-toolbox/src/platform.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"caefd9844b9749962f386604f87b4b45e2483aa840e143f7af8f1b9248a130dd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NonNull::new(\u0026mut format_description)\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 \u0060create_format_description\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":"libs/video-toolbox/src/platform.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85ff8898826325e77c1fdd09b2e8fa4ca69b68d76978ff30a0b911f8b71b32d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Retained::from_raw(format_description 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 \u0060create_format_description\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":"libs/video-toolbox/src/platform.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb129ff3fb41128d7ad5d6045a2ca81eae7db072b4c24b7843b68ce13bb4119"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NonNull::new(\u0026mut block_buffer_out 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 \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":"libs/video-toolbox/src/platform.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"8439b3f8b11b143e9c65d1c54d522a168ff9d8c223167825e6068c112e40768a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Retained::from_raw(block_buffer_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 \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":"libs/video-toolbox/src/platform.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40f6ac1aa6759a53f4a2935f6cf4c2da643020a879a6cfa10f6bc0f662b150a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NonNull::new(\u0026mut sample_buffer_out 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 \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":"libs/video-toolbox/src/platform.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"17059e3ba896a731eaa1a3df4ad59181f7c06d9f66a41635796b4f7b53c6001e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060n.checked_add(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 \u0060try_slice\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":"libs/stellarator/src/buf.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"81de1a8fec12b977733baefb49928a9848b7b4d05938d7a840d28f05e6f84458"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NonNull::new(self.as_ptr()as*mut MaybeUninit\u003Cu8\u003E)\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 \u0060stable_mut_ptr\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":"libs/stellarator/src/buf.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"da0d0709e08cec431fa14a7d0ccfdc668065a9d74a6ba3628f187719499f84dd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060n.checked_add(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 \u0060try_sub_slice\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":"libs/stellarator/src/buf.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fabe31acadf36b0212c1b005ff4ba9099f5eaa2da77a44ee6cd8a583c1f27d2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buf.try_slice(total_read..)\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_exact\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":"libs/stellarator/src/io.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde30b6ead7dc066f64cef827c56b100519b54473546374562c9e0349d014cfb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buf.try_slice(total_written..)\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 \u0060write_all\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":"libs/stellarator/src/io.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"df730a65982252075733dd518af3a4f6fc84b0a3950d4d3ec9929cf016e848e1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buf.try_slice(total_read..).ok_or(Error::BufferOverflow)\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 \u0060recv_growable\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":"libs/stellarator/src/io.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9dc85768f4f5086df4d483b517d92a902a97fe0e3b904f141d496c472ab3fe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060len_buf[..L::SIZE].try_into().map_err(|_|())\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 \u0060recv_growable\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":"libs/stellarator/src/io.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fcbe0301170e8a6df2e4af69c06823877b67800d4c80468c57ff4f282d2ecc9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060exec.take()\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 \u0060run\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":"libs/stellarator/src/lib.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"a81078abec84d9d16ae875cd1e120a0b5d1176add940a5f87fa9d51390d22845"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060exec.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 \u0060with\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":"libs/stellarator/src/lib.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b83e534d89896fb64c3467032b8c42d0fcedd8141896441d4328171fceddeca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060exec.reactor.try_borrow_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 \u0060with_reactor\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":"libs/stellarator/src/lib.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9f76d88a153b9544131fed22f1dc2b6f95895bbca173fe1600318266ed1267"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060this.handle.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":"libs/stellarator/src/struc_con.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab584ccc9cbe7b1378e1af13b8ddd86d5c84ae055b2d5f75268826eb8a7845f7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tokio::runtime::Runtime::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 \u0060tokio\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":"libs/stellarator/src/struc_con.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d87c711158d130fb4a56e99bc9899b4c606c33ee44ccaa3a99e54ba14a1a10"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.push(\u0026sqe)\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 \u0060cancel\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":"libs/stellarator/src/uring/mod.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9cdf91a14801b0dcb48cfdb27d87f94cd6d201184e972ce6eceeb3be5ed08a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060r.uring.submitter().submit_and_wait(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 \u0060cancel\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":"libs/stellarator/src/uring/mod.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5536418034cebbd96c8abd2c88d462fc0de7bf682eec8de6ba1c7bc1c48ca3c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::try_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 \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":"libs/stellarator/src/uring/mod.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4d0efdadc308b941932508ad34e244f321be0444633dd1544540709cb7b487"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.states.get_mut(completion.id.0)\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 \u0060poll_completion\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":"libs/stellarator/src/poll/mod.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"56c5789c6ec5a03203eae5cb03cc0949e733ba03ba576e63e7e40d2fca9fb8db"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.submit_op_reactor(op_code.get_ref(),*completion.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 \u0060poll_completion\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":"libs/stellarator/src/poll/mod.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5fd6f87f0d8dec4b1adbe528ece1f47441f66a714cdc22172cf2cf91927bdc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::submit(op_code)\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 \u0060run\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":"libs/stellarator/src/poll/mod.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"564c913430240419a28caea947622fa92e217e8ffff04ad1dbe0d44c75ecc258"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::try_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 \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":"libs/stellarator/src/poll/mod.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d979437e5602f4a388e4e530c03f4317e76a6ec14b3fbd466a7d2d94beeb778"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buf.take()\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 \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":"libs/stellarator/src/poll/ops.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcb8e5bb4bb46cd34ebfe5932f6932f4359aa061846ad967ef67215510c47eb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buf.take()\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 \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":"libs/stellarator/src/poll/ops.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"31fb79a94be2695d96bb0c9e58b6c115d86917f2163126266f9c7df979cc5d94"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060this.sock_addr.take()\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 \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":"libs/stellarator/src/poll/ops.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd013d88cc138904d12d055bd72dbb97e82a290dc3b37eb9946a357a0f665257"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buf.take()\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 \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":"libs/stellarator/src/poll/ops.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"044edf7539d2654eeb1b12e5adf95bb31198ae93b216abeb1ee05148301cf1db"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060addr.as_socket()\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 \u0060peer_addr\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":"libs/stellarator/src/net/tcp.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"397d3b132fad86655ee90ef6061b01072f055e62aba52dcdb9c85c6dde5150fc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060addr.as_socket()\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 \u0060local_addr\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":"libs/stellarator/src/net/tcp.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea58498b80761d07f40ed83326cfa98cb4e5547c25bad56af8e0d8e23943fcb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060addr.as_socket()\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 \u0060local_addr\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":"libs/stellarator/src/net/udp.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2802ce562cf383fd745c8623a04d1b6682905437294d572dec4bc36011e3f81b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.0.lock().map(|guard|MutexGuard{guard,#[cfg(feature=\u0022tracing\u0022)]location,_p:PhantomData,})\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 \u0060lock\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":"libs/stellarator/maitake/sync/src/loom.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"38e46e46ff809199642afd456374778ac84c8c619b406be8a144a13d9d2edfa6"}},{"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 \u0060lock_owned\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":"libs/stellarator/maitake/sync/src/mutex.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd11eaae73d9c3fc59fa07dd05bd526faf759724e4b21b6b8a24930c21ade43"}},{"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 \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":"libs/stellarator/maitake/sync/src/rwlock.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"df4aa6022f97401dfe95e958c1fb5a8f3c8c71ce6b98835b8b9e37c9f5d5a1d5"}},{"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 \u0060write\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":"libs/stellarator/maitake/sync/src/rwlock.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e02c3fa548af04b00637662f68df4998c1da5c7e72cc24b079f43b12bd5eaf5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lock\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 \u0060poll_acquire\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":"libs/stellarator/maitake/sync/src/semaphore.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b178da0156aaa4debf278cfb8158736656b5277499b82ac1e5d8f0647b3c8c1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060waiters.queue.pop_back()\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 \u0060add_permits_locked\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":"libs/stellarator/maitake/sync/src/semaphore.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7983545d747ba6f446142168bca91e94b892daeb15d31eab4df3c3e7f3600ac"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060val.take()\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 \u0060wake\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":"libs/stellarator/maitake/sync/src/wait_map.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1946f84ef55273402821e137b3b77871cc693ecc63d78a4e4f6c196f95326e3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060val\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 \u0060wake\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":"libs/stellarator/maitake/sync/src/wait_map.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"43d0027f61f7f6d3c17d002af0d9858554a9c7bd3d0d6f9956148af9f1750589"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::try_from_bits(bits)\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 \u0060from_bits\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":"libs/stellarator/maitake/sync/src/wait_map.rs"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd7863e7bb3179bf6427a4e839376414a9b74c32c224942cd67b27f9503e602"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.compare_exchange(state,next_state)\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 \u0060wake_all\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":"libs/stellarator/maitake/sync/src/wait_queue.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b3124eb828c5b294bb204d1d95ec527bf43a8907c0b4ff61810e7e3d592a55"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060queue.pop_back()\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 \u0060wake_locked\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":"libs/stellarator/maitake/sync/src/wait_queue.rs"},"region":{"startLine":1019}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8fa6eed481899ee310c1dfc43d7be686c7290d22694d99d2c4a0ffc1a9a0159"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.try_init(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 \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":"libs/stellarator/maitake/sync/src/spin/once.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a9da2ceef53e24321aa7bd3bd42826643f378376c79467d52ddea8dcd57b64"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.get_if_present()\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 \u0060fmt\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":"libs/stellarator/maitake/sync/src/spin/once.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1bcbde875af7e086fe79988454c0b363540149904c49f2c2db97ec8be8ed3a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(*current).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 \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":"libs/stellarator/maitake/src/task.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"7179576d27017711d08eba220b43230f18dc1d222da2216315689676b9a9bf8e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NonNull::new(ptr)\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 \u0060non_null\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":"libs/stellarator/maitake/src/util.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a772d8cf4bb73d65c99bf73296a21d45d636fa6ade0328c2f97414f6f085df5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::try_now()\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 \u0060now\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":"libs/stellarator/maitake/src/time/clock.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a80566244461e904f186bea154fa6c94e44501242591151430ab959dc19687"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.checked_add(other)\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 \u0060add\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":"libs/stellarator/maitake/src/time/clock.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ade0278c6408e717b666986856c1701392f9801f295b2829056c4d5197e86b2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.checked_sub(other)\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 \u0060sub\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":"libs/stellarator/maitake/src/time/clock.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9119ebc3765925419b24dc1de12c5b12780af098c92649898228580a486ac89"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate_name(\u0022stellarator\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 \u0060stellar_crate_name\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":"libs/stellarator/macros/src/lib.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2a45fbe4c865d7422418aa95e3c8715700b7804b33971313317c10b3369153"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060n.checked_add(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 \u0060try_slice\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":"libs/stellarator/buf/src/lib.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"be47668b31b478fcc5637c2517ecb2aa149687efb03bf4ab9ce52f072abd4aa2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NonNull::new(self.as_ptr()as*mut MaybeUninit\u003Cu8\u003E)\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 \u0060stable_mut_ptr\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":"libs/stellarator/buf/src/lib.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e3453eba576b044edfd079fb25e800a1f3dea57cc23aac3d5f216360b99d28"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060n.checked_add(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 \u0060try_sub_slice\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":"libs/stellarator/buf/src/lib.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c3305e21b807b1bfa51f3a8e8dc138ff23c8343828f5505e3314abfb7587ed"}},{"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 \u0060acquire_run_slot_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":"libs/s10/src/admission.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"a488f4d1e1fc28a8e6770b83ffcb1628794adc5c5cb28c04c5814533926d64eb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buf.as_slice().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 \u0060monitor\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":"libs/s10/src/liveness.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"df428ccba64f23c3e5dd909351ff28e742076ed05204e5462b61cb8747ca1b92"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060input[i..].chars().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 \u0060expand_env\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":"libs/s10/src/probe.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c5284edae111793e023090a452ee40991652f0c205352ac9040cf15bdc13b3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060channels.remove(\u0026name)\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 \u0060run\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":"libs/s10/src/recipe.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b2f4c9f4ce15f4ec424172c3d019394cf2f0db593f692d109479edc32272b3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060channels.remove(\u0026name)\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 \u0060watch\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":"libs/s10/src/recipe.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2bb2382c11eabdef329bf296cfebf04062314920a15fd81e871eada37e0046"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060joined\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 \u0060await_group_members\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":"libs/s10/src/recipe.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8e30be223a3dbca41f5107c4f1e3cffcf291f097d4eedd99af5b32d99ed4ed5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rest\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 \u0060await_group_members\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":"libs/s10/src/recipe.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce05b2b6630ecb2db9b774c46eeaa4537dfd454812d7ab82f857714c6d4426a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::canonicalize(\u0026self.path)\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 \u0060watch_dirs\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":"libs/s10/src/recipe.rs"},"region":{"startLine":906}}}],"partialFingerprints":{"codehealthFindingId/v1":"2491456481131cc536bb04a02dc722e985c41628de221173d9af0d0b50b60c9a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.parent()\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 \u0060watch_dirs\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":"libs/s10/src/recipe.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dbc3f8e888b7d0cdd528eae101838733858c356e6fad53414d739216a038a07"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.parent()\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 \u0060watch\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":"libs/s10/src/sim.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"23604dba432ae9918916ddaf340a1854a154cf9151cecb28785eece3106932f7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060env.get_template(\u0022header\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 \u0060hpp_header\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":"libs/postcard-c/codegen/src/lib.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"daea5a037e3cb3ccaf1ba9f3ab0205002ae0791c87caab85c3e20775a124aa77"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060env.get_template(\u0022struct\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 \u0060generate_cpp\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":"libs/postcard-c/codegen/src/lib.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b6a536746bc5f67271978d996abed9cfa59c74e215bcb5da9c415c8e51a291"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060env.get_template(\u0022enum\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 \u0060generate_cpp\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":"libs/postcard-c/codegen/src/lib.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"463ebbe445c1bbfe1b8e884a5914315105cbb10e223518bc0e510f0ccba08a3a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060env.get_template(\u0022new_type_struct\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 \u0060generate_cpp\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":"libs/postcard-c/codegen/src/lib.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"667c54506c4b426958415a6fe35dcdea8e55ebd104dd59ffe4d3abb3c45b732f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060world.column_mut::\u003CT\u003E()\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 \u0060insert_into_world\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":"libs/nox-py/src/archetype.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"be560a914d81382070852ee407cb63c4da032fe073b7fc54d076df56e1d01771"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060component.ty\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 \u0060index\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":"libs/nox-py/src/component.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d2e518b3fb7eb848a906cabfb2556e8f0829ab1ff11391b6ab7febd4a6b3637"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060val.ty\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\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":"libs/nox-py/src/component.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"5828f1b73beb2f2eddb3a64b0878f9ee52a4683ec17fe54c94500fe50b45f8dc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Py::new(py,new_indexer)\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":"libs/nox-py/src/component.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9d747ad4bf9a2592619878acbac264ef59d25a5cd0fb09fca6d1a1f998726f5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Py::new(py,new_indexer).unwrap().into_py_any(py)\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":"libs/nox-py/src/component.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5669b5d3415cbf587ad0c61242acfab0757d91110c728e9cb1ee805b0a14b5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060PyList::new(py,\u0026items_py)\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":"libs/nox-py/src/component.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"19236ed40f8f3639f91f2351834036fa1d8551bdb143c9ecccc65db97d8ba798"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060PyList::new(py,\u0026items_py).unwrap().into_py_any(py)\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":"libs/nox-py/src/component.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b34abc68700b5eac15a21912aec0c61527011ca4f618592f6ab0ad239cac7e5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ProgressStyle::with_template(\u0022{bar:50} {pos:\u003E6}/{len:6} remaining: {eta}\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 \u0060run\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":"libs/nox-py/src/exec.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"8807f67410454f3a2a6da5ca0ac2bcb3b6420a4dd0daac0933cf977308d79f89"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060query.map(|tick:Tick|Tick(tick.0\u002B1))\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 \u0060increment_sim_tick\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":"libs/nox-py/src/globals.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b99bdf10031ab3bc44f9ec8c0e60f7542950fce440a758c9cd4ecbbed62d8e5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060impeller::schema::Schema::new(impeller::types::PrimType::U64,[2usize])\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 \u0060schema\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":"libs/nox-py/src/graph.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb8cb9521dbd3fe9f2858eae5fb0bd0150ae306d280e7fa2ba9983613cb2124"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060builder.world.column::\u003CE\u003E()\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 \u0060param\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":"libs/nox-py/src/graph.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c0978bf66f64d2d10120d2c82594c010dfac300d833509fe7fcf9ce6c4bd824"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ty.parse_value(buf)\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 \u0060param\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":"libs/nox-py/src/graph.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"34aa5769f482307a5b62c2969dd26a75e462b7c44d84505d2c17a9eea0d97cc3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(0..col.len()).map(move|_|{let(size,value)=ty.parse_value(buf).unwrap();buf.advance(size);E::from_value(value).map(|e|e.to_edge())}).collect::\u003COption\u003CVec\u003C_\u003E\u003E\u003E()\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 \u0060param\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":"libs/nox-py/src/graph.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"57f35f0c1120ef6d58f7f788d6de3cad795c51ae5c98e5a7340d4440e09f7d8e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buffer.shape()\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 \u0060add_source_axis\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":"libs/nox-py/src/graph.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d6e7748d0aae52fae4dcf851d5dfaac649980959143ad4e8066ac841ccedee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060e.shape()\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 \u0060edge_fold\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":"libs/nox-py/src/graph.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de0b5dfd9bc2c828950423cb35c39bf670f0588c020fb7c32e2c217f6ba4ca9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.shape()\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 \u0060edge_fold\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":"libs/nox-py/src/graph.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ed08288a1b40ee88206bcb02bff8074ff8ca485a6fef136acb6e449841f9d1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.element_type()\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 \u0060edge_fold\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":"libs/nox-py/src/graph.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab5d05a3a307cb1a222b97bacefcc6b00e023c34e19d28d41c142d20be0c4cb7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060e.shape()\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 \u0060edge_fold\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":"libs/nox-py/src/graph.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b9fc9209e10fb0d7302b104811159bad3fe1bb73b08ee96ddd290978029a93"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Noxpr::vmap_with_axis(vmap_fn,\u0026axis,\u0026vmap_args)\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 \u0060edge_fold\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":"libs/nox-py/src/graph.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77b8568471214daba5429b684f6148f376e8b28d8e9d3fe7042d9e2ff39b2dc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output_array\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 \u0060edge_fold\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":"libs/nox-py/src/graph.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c9aeddecb67c62e7dc15364c0dada09e6b8ee105ed6e29b1aa6d4a2010b3ee"}},{"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 \u0060run_with_cancellation\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":"libs/nox-py/src/impeller_server.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"0781faa41976387c7bdf12409a4d0555111f8ed4388d8a2caa6c4052da0a6c89"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060.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 \u0060run_with_cancellation\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":"libs/nox-py/src/impeller_server.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"214e5400dbd2129a2114d748b639286aa72c05487a620d950a7b8a305f7189f4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bytemuck::try_cast_slice::\u003C_,u64\u003E(column.entity_ids.as_slice())\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 \u0060init_db\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":"libs/nox-py/src/impeller_server.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f6702f69e229240a6a4684eb3bf2f58e5ead772bf9d2474abac3fa688c26616"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.get_component(pair_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 \u0060init_db\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":"libs/nox-py/src/impeller_server.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9eeffaea7f1285d7858710ac3c74555aa17cb876f143518a547e489fb4ee12"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bytemuck::try_cast_slice::\u003C_,u64\u003E(column.entity_ids.as_slice())\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 \u0060copy_db_to_world_for_world\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":"libs/nox-py/src/impeller_server.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14a2fb30d25ff890548b4670807f265d5a341a1d20b19da789e39fee1215519"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bytemuck::try_cast_slice::\u003C_,u64\u003E(column.entity_ids.as_slice())\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_pair_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":"libs/nox-py/src/impeller_server.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a952e6e258cca1480f70df296b62decd8d6bba61b9a087ef29ee951f7628590"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bytemuck::try_cast_slice::\u003C_,u64\u003E(column.entity_ids.as_slice())\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 \u0060commit_world_head_for_world\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":"libs/nox-py/src/impeller_server.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"909f492d2d60aa1094e0e9cd3528d06727eac297356fcbec63d7cbac5a2e5922"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060get_pair_ids(\u0026world,\u0026wait_for_write)\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\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":"libs/nox-py/src/impeller_server.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"372308919b25450b68a7590f0145d61f4782bff42a9dd38e4cb5b225980cab76"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060update.shape()\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_var\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":"libs/nox-py/src/query.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ee4d725750078afd2f0c67210f2b6b22c8a8ae4c2f0b48ec2147cc0c90da602"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ComponentArray::\u003CT\u003E::param(builder)\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 \u0060component_arrays\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":"libs/nox-py/src/query.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9912a05c3ea3f3b28c64eda0219e46eb162cdc86fb8994f858b4e04150fbc8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060query.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 \u0060param\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":"libs/nox-py/src/query.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da60a73284dc6c9c45695ba1d7bfd9be88c3fb4a5e570dc29b9275eb0ea4735"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060G::component_arrays(builder).fold(None,|mut query,a|{if query.is_some(){query=Some(join_many(query.take().unwrap(),\u0026a));}else{let q:Query\u003C_\u003E=a.into();query=Some(q.transmute());}query})\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 \u0060param\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":"libs/nox-py/src/query.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41976fad2ddda36b2911bce7ce9cbaca2b0e700df7e837c67741745db671d83"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060outputs.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 \u0060output\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":"libs/nox-py/src/query.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3565220038143ea1b47987b508e0761fe6dcbb7668a8bef7b4c993213ba89cc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.output(builder)\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 \u0060insert_into_builder\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":"libs/nox-py/src/query.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f9c374ad305215827619c8bc3f3ff2fc800c4fd1914d13955102260e09083a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060G::component_ids().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 \u0060insert_into_builder\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":"libs/nox-py/src/query.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e3af5e5089d4d10b45dbdfa364395691dd5bdbe4428824f02291461f8d2cb6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buffer.shape()\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 \u0060filter_index\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":"libs/nox-py/src/query.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca15ae17c8219dd0ce87ac0652799ff9ab1017ebbd325c47b0c731dd0e19662d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buffer.shape()\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 \u0060batch1_to_batched_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":"libs/nox-py/src/query.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea695a4a77c408df93f2cf93429a3ced7ea6002e13c5e27a4548ef6bfcc20ad"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buffer.shape()\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 \u0060squeeze_entity_axis\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":"libs/nox-py/src/query.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8c501845f15d7d44c3f48841eeab1188059cfde0efb07fde3e7610f6444de8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060query.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 \u0060from_builder\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":"libs/nox-py/src/query.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbbe3d169d4cb83b119e040f0a8a3d3d9d87a20dd3cf58de5fa45b91297e2871"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060outputs.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 \u0060output\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":"libs/nox-py/src/query.rs"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"789bb302b8dbd50d74b09537577aa2f84cc0182e4bfef9be609f36fa54922a97"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060q.map(|force:Force,inertia:Inertia,pos:WorldPos,vel:WorldVel|{let q=pos.0.angular();let q_inv=q.inverse();let omega_body=\u0026q_inv*vel.0.angular();let body_frame_force=q_inv*force.0;let angular_momentum_body=inertia.0.apply_inertia(\u0026omega_body);let gyro_torque_body=omega_body.cross(\u0026angular_momentum_body);let net_torque_body=body_frame_force.torque()-gyro_torque_body;let ang_accel_body=inertia.0.solve_inertia(\u0026net_torque_body);let lin_accel_body=body_frame_force.force()/inertia.0.mass();let body_frame_accel=SpatialMotion::new(ang_accel_body,lin_accel_body);let world_frame_accel=q*body_frame_accel;WorldAccel(world_frame_accel)},)\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 \u0060calc_accel\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":"libs/nox-py/src/six_dof.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f23afbbae7ad3272b44f3d4181d63afdb9c8d82ad82afb13b1a0b13c0b4f28c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060q.map(|_|Force(SpatialForce::zero()))\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 \u0060clear_forces\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":"libs/nox-py/src/six_dof.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"3410294639495ab305a8cf8004e6139b46faefcf88f96d36727d85ded530010c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060world.column_by_id(slot.component_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 \u0060output_ty_from_slots\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":"libs/nox-py/src/system.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47f54fcf0256fd04576abb40eb767050a87483ee0f85a5f1b0cbf4b7511a305"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060output.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 \u0060to_compiled_system\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":"libs/nox-py/src/system.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4e665891ed872125947e941b76d76a02621b42eaf1c02fdd1346acba2fa137e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.world.column_by_id(id).ok_or(Error::ComponentNotFound)\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 \u0060init_with_column\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":"libs/nox-py/src/system.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"d396c7b6d5f0644e41c985960000c97a7eddb15c5fe704bf84b41754f39655e2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060world.column_by_id(id).ok_or(Error::ComponentNotFound)\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 \u0060insert_into_builder\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":"libs/nox-py/src/system.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"47cbf0f729868bc45ef5094b5edbd91a9844b15924b738793238a50e2968cd9a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060world.column_by_id(id).ok_or(Error::ComponentNotFound)\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 \u0060insert_into_builder\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":"libs/nox-py/src/system.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc037dac30d1ec1567a38e2a62930df63b41b0d7a2ac464541284d85efa61e1a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060world.column_by_id(*id).ok_or(Error::ComponentNotFound)\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 \u0060insert_into_builder\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":"libs/nox-py/src/system.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b4adca3168eec445a1035217d4fc81e30c6e4d7f32d8e0df77557dd7882c72"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060builder.world.column_by_id(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 \u0060compile\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":"libs/nox-py/src/system.rs"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4f89547531973681c32e5fb06f0fd94fab0b19dd9d9985f73ba8cc92328418"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::graph::Edge::from_value(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 \u0060compile\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":"libs/nox-py/src/system.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1f1a6bd26098db2fc02224c1f810e486818d9805f87c9482f3a7364d28e2bb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060builder.world.column_by_id(slot.component_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 \u0060compile\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":"libs/nox-py/src/system.rs"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae9234b72a1d8185bc7d96bf8fa95d6b1fe7409cf9e2fbec65eb0e2ec4afcdb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060py.import(\u0022jax\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 \u0060compile\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":"libs/nox-py/src/system.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f6406ce15e1e634d959b64fd08b7d17f498019634e9958f36bbc99d41a4f9f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::ffi::CString::new(py_code)\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 \u0060compile_jax_module\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":"libs/nox-py/src/system.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"15cec1765ca1823ff7dffc9416fb9153c31c9be8e554da237b69e0fdd369d014"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060func.into_py_any(py)\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 \u0060noxpr_to_callable\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":"libs/nox-py/src/system.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a0cf7e77259549d28f6f166dcec766ed031524f7c52699acd4b1831e5f09e6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::str::from_utf8(\u0026bytes[..first])\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 \u0060format_commas\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":"libs/nox-py/src/tick_metrics.rs"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"2538eeed397f53e6cc13126799f34cf3b451be9abf08362ea42595eb0090a749"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::str::from_utf8(chunk)\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 \u0060format_commas\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":"libs/nox-py/src/tick_metrics.rs"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"b903c75d82971027ee4cb5215118ffddbf95c51b0fb729adcda357545f1d036e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.column_mut::\u003CSimulationTimeStep\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 \u0060set_globals\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":"libs/nox-py/src/world.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"30abec993171c11f79da6211b37d73930b89e0adbf1016b3df778c507db3eaf5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.metadata.component_map.get(\u0026id)\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 \u0060column_by_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":"libs/nox-py/src/world.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"db76e216a926c57a6dec13314a0da0ab76718a77cda382167194805149a0bbb9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.host.get(\u0026id)\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 \u0060column_by_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":"libs/nox-py/src/world.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"5071985ffeb92188d50666950c25aa3ca8abc0758d8fb7071023a835b9bae656"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Signals::new([SIGINT,SIGTERM])\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 \u0060install_signal_handlers\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7bc27765d96b84dce7e14a1560fc14715972851efca7136b1a41abd814fb5e0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060component.ty\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 \u0060insert\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"824067df632e618c2bda43915d679f5ce12f4bf8b0b130a789c80a3dba9794fb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tokio::runtime::Builder::new_current_thread().enable_all().build().map_err(|err|miette!(\u0022rt err {}\u0022,err))\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 \u0060run\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb8620d3d116ef183e3ec8e2f55d4713d40e63875515b8d42a56eebe4dc4ff0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rt.block_on(run_recipe_with_token(\u0022world\u0022.to_string(),group,false,false,s10_token,))\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 \u0060run\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9509e2bb7a4dcfcfcca6d0e82404dd29cbdf9367982595e9d360df0b8ab8cb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(\u0022elodin-sim-runtime\u0022.into()).stack_size(256*1024*1024).spawn(move||{on_python_runtime_thread(||{stellarator::run(||{crate::impeller_server::Server::new(db_server,exec).run_with_cancellation(move||{let cancelled=if let Some(ref func)=is_canceled{Python::with_gil(|py|{func.call0(py).and_then(|result|{result.extract::\u003Cbool\u003E(py)})}).unwrap_or(false)}else{false};if cancelled{cancel_token_for_loop.cancel();}cancelled},move|tick_count,db:\u0026Arc\u003Celodin_db::DB\u003E,tick_counter:\u0026Arc\u003Cstd::sync::atomic::AtomicU64\u003E,timestamp:Timestamp,start_timestamp:Timestamp|{if let Some(ref func)=pre_step{Python::with_gil(|py|{let tick_count_py=tick_count.into_bound_py_any(py).unwrap_or_else(|_|{py.None().into_bound(py)});let ctx=StepContext::new(db.clone(),tick_counter.clone(),timestamp,tick_count,start_timestamp,pre_step_cancel_token.clone(),);match Py::new(py,ctx){Ok(ctx_py)=\u003E{if let Err(e)=func.call1(py,(tick_count_py,ctx_py)){tracing::warn!(\u0022pre_step error {e}\u0022);}}Err(e)=\u003E{tracing::warn!(\u0022failed to create StepContext: {e}\u0022);}}});}},move|tick_count,db:\u0026Arc\u003Celodin_db::DB\u003E,tick_counter:\u0026Arc\u003Cstd::sync::atomic::AtomicU64\u003E,timestamp:Timestamp,start_timestamp:Timestamp|{if let Some(ref func)=post_step{Python::with_gil(|py|{let tick_count_py=tick_count.into_bound_py_any(py).unwrap_or_else(|_|{py.None().into_bound(py)});let ctx=StepContext::new(db.clone(),tick_counter.clone(),timestamp,tick_count,start_timestamp,post_step_cancel_token.clone(),);match Py::new(py,ctx){Ok(ctx_py)=\u003E{if let Err(e)=func.call1(py,(tick_count_py,ctx_py)){tracing::warn!(\u0022post_step error {e}\u0022);}}Err(e)=\u003E{tracing::warn!(\u0022failed to create StepContext: {e}\u0022);}}});}},interactive,start_timestamp.map(Timestamp),cancel_token,)})})})\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 \u0060run\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f040401f33d4a5cae6c90a619f270bc0b125ff4d33771bc1166d2c161a4610"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.world.column_by_id(*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_dict\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":1888}}}],"partialFingerprints":{"codehealthFindingId/v1":"37328380e9741e43497c2d4f7d8d897c6ca094a9e89623c26af033e41e47ab53"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060world.column_by_id(*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 \u0060build_jited\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":2193}}}],"partialFingerprints":{"codehealthFindingId/v1":"287670d6708d73694606b74c0a26473cb14663ccfcf7c0c3614e340dbeb58a18"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u003C[u8]\u003E::ref_from_bytes(data)\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_jited\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":2219}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d3c93f10528234986d23d318dcdaac548b479eb6d75562592be55e98c9eef0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060PyArray::from_slice(py,slice).reshape(dim.into_dimension())\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_jited\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":2222}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcdb60454c7bb6721320002086fb9ad8918129941b4da2e309e74a6793938a13"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u003C[u16]\u003E::ref_from_bytes(data)\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_jited\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":2227}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e6381a1f1ad057987fbe3bedda87f4bf296fdc404cd5d8dee070d80394008b2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060PyArray::from_slice(py,slice).reshape(dim.into_dimension())\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_jited\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":2230}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe060f340eca53f6cccd2a9c41de132c69fbe119619e8943b8eaaa8763019815"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u003C[u32]\u003E::ref_from_bytes(data)\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_jited\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":2235}}}],"partialFingerprints":{"codehealthFindingId/v1":"eca1c29f2c1d454fa7f303c7524b604d67936b86d8dc5279afa5c5eadd9b0c73"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060PyArray::from_slice(py,slice).reshape(dim.into_dimension())\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_jited\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":2238}}}],"partialFingerprints":{"codehealthFindingId/v1":"346061dad3f8f932f3200e7b5c02b9c7928ff2918f06d78ebac5c49388fd51cf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u003C[u64]\u003E::ref_from_bytes(data)\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_jited\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":2243}}}],"partialFingerprints":{"codehealthFindingId/v1":"2df403eed1770f42fae85e8f8c6b6fe1a7d9a36516cceaa44512c98e9d7436f0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060PyArray::from_slice(py,slice).reshape(dim.into_dimension())\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_jited\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":2246}}}],"partialFingerprints":{"codehealthFindingId/v1":"9030a12e918489aeec04b0518c17df868ff5f05f865594abf66291c55667808a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u003C[i8]\u003E::ref_from_bytes(data)\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_jited\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":2251}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f17872d9191e48a55cf0818e46ddf1054e71ab6b527bd7c3dbe238688750f1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060PyArray::from_slice(py,slice).reshape(dim.into_dimension())\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_jited\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":2254}}}],"partialFingerprints":{"codehealthFindingId/v1":"db33872a474fb18aa92d1c37c35b77cbbd1ca12f584a1e5b18e5a397246f8541"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u003C[i16]\u003E::ref_from_bytes(data)\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_jited\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":2259}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa8973fa500c55408b157a99437f0ab3455d0528d554deaaa50fbda872a2a46b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060PyArray::from_slice(py,slice).reshape(dim.into_dimension())\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_jited\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":2262}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a6ac44f4fdbba6075957ff11ae7b5814f5540a59db1cc357c11a83efe08ad1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u003C[i32]\u003E::ref_from_bytes(data)\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_jited\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":2267}}}],"partialFingerprints":{"codehealthFindingId/v1":"10a950774b71431cda982938a5e07dda9feb582bed28cf1baa8f2f53c99fb89d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060PyArray::from_slice(py,slice).reshape(dim.into_dimension())\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_jited\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":2270}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d6ce6e02ce1cf7f23a4488c17d0c62901d6e875ccd7f2033e83c0519ad02af"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u003C[i64]\u003E::ref_from_bytes(data)\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_jited\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":2275}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cb7d0e006c1b2ab6d16c4e702d8e8b3338c4879ac7914501280c7069550b497"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060PyArray::from_slice(py,slice).reshape(dim.into_dimension())\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_jited\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":2278}}}],"partialFingerprints":{"codehealthFindingId/v1":"76fbbf53e6461006d1c8e69431aa4460490a93aad661c9b169c14203d2724283"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u003C[f32]\u003E::ref_from_bytes(data)\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_jited\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13e445c3e746d7c45b22741a6837eec98f368b0e6f7497d9293b89cf9189483"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060PyArray::from_slice(py,slice).reshape(dim.into_dimension())\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_jited\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":2286}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a45a9191f06a446f94d0f1119e4917e4fe83d42659c195d4fd5703a2fa13a7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u003C[f64]\u003E::ref_from_bytes(data)\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_jited\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":2291}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcdeb734db2a2c5f867f26b9720ec71724f80e68e5a83c14e31bf6d3d6ca4a2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060PyArray::from_slice(py,slice).reshape(dim.into_dimension())\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_jited\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":2294}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd193a1826db19887534ba10b001cf733378771d3640c73da64b2b9a73a2ddff"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u003C[bool]\u003E::try_ref_from_bytes(data)\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_jited\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":2299}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ac86c92a14772d9c3760a0640a3567a063c4e0645a1d68ef2eafd792dc39d6b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060PyArray::from_slice(py,slice).reshape(dim.into_dimension())\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_jited\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":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":2302}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54eb5e008f5f09221cf0d664019e6271ff1222fb221c4773b8f50829b2475e5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060query.map(|v,a|v\u002Bdt*a)\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 \u0060semi_implicit_euler_with_dt\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":"libs/nox-py/src/integrator/semi_implicit.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fac8cfb581b7ae5331bc2c59f2673d303a3b0a5ba52a8cec57c62d84254aefc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060query.map(|x,v|x\u002Bdt*v)\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 \u0060semi_implicit_euler_with_dt\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":"libs/nox-py/src/integrator/semi_implicit.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcce5f4fa765bfa44fa030ca77c15ead3f7060892a7d26052af81cb88e09b5db"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060query.map(|v,a|v\u002Bdt.clone()*a)\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 \u0060semi_implicit_euler\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":"libs/nox-py/src/integrator/semi_implicit.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f605a9014cf29abe71619421ad6adeeb8016049568e8548f6246a953a650672"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060query.map(|x,v|x\u002Bdt.clone()*v)\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 \u0060semi_implicit_euler\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":"libs/nox-py/src/integrator/semi_implicit.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc85b383f04b742f79c28b8bfdf80f861803bf0c39811f532fe5314bb0b5441a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060client.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 \u0060request_worker_loop\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":"libs/nox-py/src/db/client.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bdc82433e9277aaa24f11aafca5795cfb15aed4be9162a29001346119522a30"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::spawn(move||stellarator::run(f)).join()\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_on\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":"libs/nox-py/src/db/mod.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e572539c0b1cf317dcea37d3707c5527b2c917f3da3362af945f1ba1976ce12a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060item.take()\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 \u0060push\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":"libs/nox-py/src/db/stream.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f82bc4f40978de1f28588ee89202024e398a903e94cf9179037baf574311bef"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060conn.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 \u0060send_row\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":"libs/nox-py/src/db/writer.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"55711f64c9534fb66494d5644b6615da151572e3936a2369a9ac42bc3f8b780a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060which::which(\u0022python3\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 \u0060find_python\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":"libs/nox/build.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4ff714080713b59d884de5162580bf57ccd499541e8d6b16466a8d98da52a7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::process::Command::new(python).arg(\u0022-c\u0022).arg(cmd).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 \u0060run_python_command\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":"libs/nox/build.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4177b8fed99b61e8178c0e90f9886a5a052ab491faf624350996264a950fe38c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060String::from_utf8(output.stdout)\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 \u0060run_python_command\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":"libs/nox/build.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bc396595ad103b4a222855e8c47e9f5e3c176cb4409eb1829b737d28bda071"}},{"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.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":"libs/nox/build.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"721c0b5b0d9670f433ec9cb47946fda4fff104662a27f98ad6073a8abc04cd6a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::create_dir_all(\u0026python_dir)\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":"libs/nox/build.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b667d3fb47ab9aba60aef2d112c343ac8e99b4dcced50ff76735bec117282f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060shared_lib.file_name()\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":"libs/nox/build.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"0874b0970153accf5e7477aeefa4ee95a0334cf20da9098befeda20d805e9922"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060py.import(\u0022jax.lax\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 \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":"libs/nox/src/jax.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0560ea0b335810e45e0ea14f8ab6e8022e0ff1c4ee540c0db68b638d6458b8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060py.import(\u0022jax.numpy\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 \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":"libs/nox/src/jax.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c8f912f898093bbd78b125b0ba664f4faf54559cf9c69f8582f04060f0ff7b3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060py.import(\u0022jax.numpy.linalg\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 \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":"libs/nox/src/jax.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"793d0c473698e2ae1bdc1eb091c40ca2a3f546fe22c6e535784a05727aef5e99"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060PyTuple::new(py,elems)\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 \u0060visit\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":"libs/nox/src/jax.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b697099c191b6cbfa7072bd2ca58cc126aa73fbbb51cb5e4acc2a18717d2365a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tuple.into_py_any(py)\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 \u0060visit\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":"libs/nox/src/jax.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6914a238b1cf484fd0288f2672ede1e8974b530759515d3571758a263d43980b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x.into_py_any(py)\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 \u0060visit\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":"libs/nox/src/jax.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc789bdbaac199a8433790f5f22d9897f1ecc84ace999adb9737629c10713f32"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Python::with_gil(|py|{jax.call_method1(py,\u0022__getitem__\u0022,(g.index,)).map(|x|x.into_py_any(py).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 \u0060visit\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":"libs/nox/src/jax.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff79d76fa5f7b3a0a58c0dd101a5ae0ff07d44af4545114d885deec8760fc1f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060PyTuple::new(py,args)\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 \u0060visit\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":"libs/nox/src/jax.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef57805304b34dcd9360dfe96f6ba684ef42fde1a720b517b608121a7899643f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060.into_py_any(py)\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 \u0060visit_comp\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":"libs/nox/src/jax.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f6036a199f7ea5c1da9e7a3a1bfa0bd51514793f7c17bd03427b57d7a7b143"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060py.import(\u0022jax\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 \u0060lower\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":"libs/nox/src/jax.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0b9b1d714447952143bf355ddbf9c788bb2da73395856631c7c97d42948f5d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.visit(\u0026s.initial_state)?.move_batch_axis(self.out_axis)\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 \u0060visit_inner\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":"libs/nox/src/noxpr/batch.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"20bdedf70af159cf8d19ccc5bfa695ce0a9456fc77aa8b48a0ccaa8778f3f65d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060.move_batch_axis(axis)\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 \u0060visit_inner\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":"libs/nox/src/noxpr/batch.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fd254408f2278319c68dedb1128fca19bde8772b65a0b03dcc5e9b283bdb51"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stack.pop().ok_or(Error::Internal(TraversalError::ChildNotProcessed))?.move_batch_axis(self.out_axis)\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 \u0060process_scan\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":"libs/nox/src/noxpr/batch_dfs.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d41e428b0b4dc49dbb1c4175ff036449aacb62681813ef122e71f7a0ddcb7b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060.move_batch_axis(axis)\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 \u0060process_scan\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":"libs/nox/src/noxpr/batch_dfs.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef35933868d80e55c3240eb7626affc32d5f5d4d2f3c3f60bc8382b4253d96bb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060args.first().ok_or(Error::VmapArgsEmpty)?.shape().ok_or(Error::UnbatchableArgument)\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 \u0060vmap_with_axis\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":"libs/nox/src/noxpr/batch_dfs.rs"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"f677e730eb8c1279bd5affb0f2e98ba695de46ba8afc166fdf9b7fdc6d740e22"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060arg.shape().ok_or(Error::UnbatchableArgument)\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 \u0060vmap_with_axis\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":"libs/nox/src/noxpr/batch_dfs.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7af611f1aac82828b0c4b18438f4f0743164eb11ce7e9b6b07c599afe41207"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tracer.walk(\u0026func.inner)\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 \u0060vmap_with_axis\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":"libs/nox/src/noxpr/batch_dfs.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e78189cc72d15c88773582ff3586e5b7ad18827c4bec2cc9ebe47d221e80ec"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060expr.move_batch_axis(tracer.out_axis).ok_or(Error::UnbatchableArgument)\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 \u0060vmap_with_axis\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":"libs/nox/src/noxpr/batch_dfs.rs"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc83a39bf6749fe715e62612216fcaea3f53238fa403b203c12bfacd76cc05d5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.shape()\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 \u0060broadcast_to\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":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cc352c611a4ffeec3b5381aa34013d0716a3dc3758c972acd0c2fce538d2591"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060py.import(\u0022jax.numpy\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 \u0060shape\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":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":1765}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be593952eb5c25842c19286d850b697a76ed8e2fb5a65345375862608fba185"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.ty()\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 \u0060collapse_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":"libs/nox/src/noxpr/node.rs"},"region":{"startLine":2071}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d2f57d0e84c8e7651edf87633b405213ecbf1da903bee7ea615b9851c2f42b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060arg.shape()\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 \u0060shape\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":"libs/nox/src/noxpr/repr.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e5428d1eb55911b419e61d9843fb320cc3f0e9a660f7b5cabe678c156a78604"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060a.shape()\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 \u0060stack\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":"libs/nox/src/noxpr/repr.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbecda859e4b62dc5af1d277bece803609dee44a7e4bf5ae10580e3fa59088a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060arg.shape()\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\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":"libs/nox/src/noxpr/repr.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"7550a9298ab7df002043a4e640ad3a8a1e0ce72f7be93498b8731efae94d7f95"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060arg.shape()\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 \u0060copy_fixed_slice\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":"libs/nox/src/noxpr/repr.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"084da1fcef75c5067034610be5ecc0d9008cac734160e09debff2dd4739feed3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060arg.shape()\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 \u0060transpose\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":"libs/nox/src/noxpr/repr.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"675ed2b032ac1ed289fbd2a66506da47efee967ad8e7a35b440e7af53e31e1be"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060diag.shape()\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_diag\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":"libs/nox/src/noxpr/repr.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"26522f7fa8114c0ffd3d70399ccb255e79e2ecd48c6097f50d44dd284face6c4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060arg.shape()\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":"libs/nox/src/noxpr/repr.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"10aab5f4db02ce0008824d4e9e16365585a4dd676c0401a5cf06e90c5c459c1f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060arg.shape()\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 \u0060map\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":"libs/nox/src/noxpr/repr.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee11d7189ac2824e8e0dcc6a0064d7f8bc82adeb31487c1f939eb874786aff9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Noxpr::vmap_with_axis(func,\u0026[0],std::slice::from_ref(arg))\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 \u0060map\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":"libs/nox/src/noxpr/repr.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b01990eef08cf99848f1c771e6d2ac2751eee1c7305b6da4083cc3855083d7f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060arg.shape()\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_iter\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":"libs/nox/src/noxpr/repr.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"4297348ea5f6c1b423a698038f9bdd6433fa0284d2f598b7938291eeb5f9f799"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060T::create_r1(arr.buf.as_buf()).reshape(\u0026shape)\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 \u0060from\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":"libs/nox/src/noxpr/tensor.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ef629eb4665ff0b84124241db97880eda922826d7c3ff8568da86e9f598e3ca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.broadcast_iter(shape)\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 \u0060reshape_with_shape\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":"libs/nox/src/array/mod.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7ba1756132ab50d05e8d79441156dd72abf602075fdd230c8f9a58fd8bd4b9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.broadcast_iter(broadcast_dims)\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 \u0060broadcast_with_shape\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":"libs/nox/src/array/mod.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"7da29f4280a44a7fd5b442b4a7b0e5f2bed80f367f7c459a653975521d0020b3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060matmul_dims(dim_left,dim_right)\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 \u0060dot\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":"libs/nox/src/array/mod.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f5621f26400b221e4dde48395d712c7bcc19063b27081b2d7c11822bc67290"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out\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 \u0060map\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":"libs/nox/src/array/mod.rs"},"region":{"startLine":1102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7c772722012b049384fe2fab0388dc2ecc76e5b9b1ac393acdbc88840a7af0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dynamic::DynArray::from_shape_vec(shape,self.buf.as_buf().to_vec())\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 \u0060to_dyn\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":"libs/nox/src/array/mod.rs"},"region":{"startLine":1109}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f76eb3f6e8b59e500c9247fa597e704a05f9456dd9ba53d8f969b68f5fffe9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Array::concat_many(args,dim)\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 \u0060concat_many\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":"libs/nox/src/array/repr.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd064ac687f16a06ca72df1d71fb989ffda4d94f6c31918df36761398de51b6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Array::concat_many(args,dim)\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 \u0060stack\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":"libs/nox/src/array/repr.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f840c4e444fd2570eb7c541e5f56c252e971f557f3c2858cda3ac4843577708"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060DynArray::from_shape_vec(SmallVec::from_slice(self.shape),self.buf.to_vec())\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 \u0060to_dyn_owned\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":"libs/nox/src/array/view.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b719e8eb0091e78c330475c511d19932db9eb1ca1b717da943d5e24b5ae8d23"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060last_metric\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 \u0060run_with_retries\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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":1946}}}],"partialFingerprints":{"codehealthFindingId/v1":"3941140834adffde9bf215c564bb104fc6fd5753148a0398d80a46308e3d6abf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060port_guards.take()\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 \u0060run_one\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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":2174}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b262e73a7822f4e464aeeb8f4c29fff4fd464ec8cb7459c951beae9b8377b73"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060impeller::schema::Schema::new(impeller::types::PrimType::U64,[0u64;0])\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 \u0060schema\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":"libs/impeller/wkt/src/lib.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f803b051a3185a2c95ca5615eb019a85beaa7a5fdda8f5cbb63d47232a3a849"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060impeller::schema::Schema::new(impeller::types::PrimType::F64,[0usize;0])\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 \u0060schema\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":"libs/impeller/wkt/src/lib.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"50bf571aa6f664300d082d9a40fbdddfee46904ff17bff7c031fd91a6122b4a1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060impeller::schema::Schema::new(impeller::types::PrimType::F32,[0usize;0])\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 \u0060schema\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":"libs/impeller/wkt/src/lib.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a534bfabbc5e71a056f0b1b6938a1370484e62eaf1177f4f896d683e9964e6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060impeller::schema::Schema::new(impeller::types::PrimType::F64,[7usize])\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 \u0060schema\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":"libs/impeller/wkt/src/lib.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fedf72758b45ddeeaa4b904e69e64d7e770daa1aa6d5f854e857b3d83ec8f1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buf[..4].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 \u0060apply_value\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":"libs/impeller/wkt/src/lib.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"489f7e936141e6dcbb8dce9ebf30e4ac8653ea617bd7af22c5fa21dc4face65b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buf[4..].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 \u0060apply_value\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":"libs/impeller/wkt/src/lib.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"4469ea1b3b5f48f0e2ad2529c49321ee2bf1464ee9f03a68d78ed2a178cbc56b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060impeller::schema::Schema::new(impeller::types::PrimType::I64,[1usize])\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 \u0060schema\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":"libs/impeller/wkt/src/lib.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"54fb78ef218b5109eb397363a9286b89de944ec23d82cdc6bd2ce379e6dc15a6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.path.last()\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 \u0060tail\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":"libs/impeller/wkt/src/path.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e983f9bf68ecb7c9b86d5767ce3d19b12c3281c59e2b26f95a5e590ef71d046b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060last.name.split(\u0022.\u0022).last()\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 \u0060tail\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":"libs/impeller/wkt/src/path.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ac6ff31164bbd0568e8f05727d6fd2176a09b04229c8b2bc8c2ae2fb4fa62a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060impeller::types::ComponentView::try_from_bytes_shape(self.as_bytes(),self.shape(),self.prim_type(),)\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 \u0060as_view\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":"libs/impeller/wkt/src/value.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"883ddcbb84b87b55e7dd75ae714a6bb6a9c454df14c8d4125a9e2caf019b6d0f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Schema::new(\u003C$ty\u003E::PRIM_TYPE,[0u64;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 \u0060schema\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":"libs/impeller/src/component.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"61bd74e8fd8e1c6aff4ec4565adc0c9f5448b8640cd37f879b8761d4d2c4629f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Schema::new(\u003C$ty\u003E::PRIM_TYPE,[N])\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 \u0060schema\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":"libs/impeller/src/component.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c627d45f6c297923aefa3c79c5a3d3e0e1364ac0260fb929afef47086631e53"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Schema::new(T::PRIM_TYPE,[7usize])\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 \u0060schema\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":"libs/impeller/src/nox_impls.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0042e50d2aa2421bd6b275bb902d6c2381f7e0a34f12f5cccbffc5ac4251c15"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Schema::new(T::PRIM_TYPE,[6usize])\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 \u0060schema\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":"libs/impeller/src/nox_impls.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb0729fb1b99af96be69423a73705bf252c425f58879961e3f2f79a9ddd6b30"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Schema::new(T::PRIM_TYPE,[6usize])\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 \u0060schema\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":"libs/impeller/src/nox_impls.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8e5461ea2ee948df1f59a2e5dc4ccd8f3568385d00d38dd5e8bcd4defcebfb1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Schema::new(T::PRIM_TYPE,[7usize])\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 \u0060schema\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":"libs/impeller/src/nox_impls.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ae47951f00269c19bf2d9d364e9c2221e834fdca53aaf4e5dd7fbec5e7ce16"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Schema::new(T::PRIM_TYPE,[4usize])\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 \u0060schema\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":"libs/impeller/src/nox_impls.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"23fe2f22bee93154e77ddc38a7e5b9494f9b583c8fc674e627601398dde6db1e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Schema::new(T::PRIM_TYPE,D::DIM)\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 \u0060schema\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":"libs/impeller/src/nox_impls.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"809c844c36328809cf5af9ce30b3b6b97c1e8cf4d05dbdffdf5969afef918bbe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u003C[usize]\u003E::ref_from_bytes(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 \u0060shape\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":"libs/impeller/src/schema.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"1695630a836dce1372f42b9b874cecb39931147a9274eff3b87532aa1e81f241"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060view.buf().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 \u0060from\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":"libs/impeller/src/types.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0b027fafb2953a54b3dd030bedb67a5b6d7de3fd1b6a5e9c20125991ebe39a6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060postcard::serialize_with_flavor(\u0026self,\u0026mut msg)\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 \u0060into_len_packet\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":"libs/impeller/src/types.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"e924ca3928a09a599cce2628eefe0611d88fac788d87c586591f8c779227042f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060len.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 \u0060pkt_len\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":"libs/impeller/src/types.rs"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a9fa141ed21b766f63cd2aa595d113bf5b03148b924026df4253b9ea68012ca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Packet::try_ref_from_bytes_with_elems(\u0026self.inner[4..],len.saturating_sub(PACKET_HEADER_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 \u0060as_packet\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":"libs/impeller/src/types.rs"},"region":{"startLine":721}}}],"partialFingerprints":{"codehealthFindingId/v1":"14dc0d6fb7db2bf72ecc6d4c51c07bb3d55a017e0ae4fbc18f1ce7f000c7f0c9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Packet::try_mut_from_bytes_with_elems(\u0026mut self.inner[4..],len.saturating_sub(PACKET_HEADER_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 \u0060as_mut_packet\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":"libs/impeller/src/types.rs"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36e3accbf351c133b7617917c6b358b237d2d120aaaedeb501af71e221aac3c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060postcard::to_allocvec(\u0026data)\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 \u0060ext\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":"libs/impeller/src/vtable.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2931aaf9aefc579d5b4818edfd421738e09d3f3732e895817b4a4b8495ae658"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::populate_vtable_fields(\u0026mut fields)\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 \u0060as_vtable\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":"libs/impeller/src/vtable.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"228ac280bf272294b2e72729a32692747004d73ee20ad7a442fbb05dfe6a3a1b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(out,\u0022\\\\u{:04x}\u0022,c as u32)\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 \u0060python_string_literal\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":"libs/impeller/kdl/src/python.rs"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"3060fd044131a7455c199045029f9f5948e592c11b011032fc556a03c2a74901"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060url::Url::parse(\u0026format!(\u0022http://{authority}/\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 \u0060authority_base_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":"libs/impeller/bevy/src/channels.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd8754d83ecf757cc61a4efabf5f6d71f73bd5feee703768030645ec2388c08f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060text.parse()\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 \u0060authority_from_base_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":"libs/impeller/bevy/src/channels.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af1caec8bd5188e48c2ef62b7b9d47aa7ab6219840ff76cd3a62a9f2259b406"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060base.set_scheme(scheme)\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 \u0060ws_urls_under\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":"libs/impeller/bevy/src/channels.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"88b43104d3085850a8662b7bbbf78b49d0f2cb6b6500026bc6dd28ccc9cb8e00"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060world_sink_state.get_mut(world)\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 \u0060sink_inner\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":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c1b7fbbd46c638e825873aac7600433991250bdbaf0dd6c0da8b587f5992ff"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060msg_sink_state.get_mut(world)\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 \u0060msg_sink\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":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":1632}}}],"partialFingerprints":{"codehealthFindingId/v1":"611d1e50c69512b0ca9f441c602bbc925455bb2ff14d0286c8a05f7cc7d50e9b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.0.to_le_bytes()[..2].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 \u0060packet_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":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":1912}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce2752e9c4e9bf76055f4cf343b4b6696602556b6b9a5382c11a25ab4b3073a2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060world.get_resource_mut::\u003CPacketIdHandlers\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 \u0060apply\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":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":2152}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f65b83dd5c9c3669649c74f52b0943be75da2b352c139f076606024dbba9aa5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060world.get_resource_mut::\u003CPacketTx\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 \u0060apply\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":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":2156}}}],"partialFingerprints":{"codehealthFindingId/v1":"93d05899b6c2fbf6b0fdf5c9527dd426ede3cbfde83aebecfd06da65962d3910"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060world.get_resource_mut::\u003CPacketIdHandlers\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 \u0060apply\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":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":2160}}}],"partialFingerprints":{"codehealthFindingId/v1":"46aba685305011594e227394d81fe3e9ecc1e38adb3efa6db7d7f9cb456fed03"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060world.get_resource_mut::\u003CPacketTx\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 \u0060apply\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":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":2219}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a73c877df93a628a2e0a7e3595f3456b441bd0fa00052f100c9932dffd8847"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060world.get_resource_mut::\u003CRequestIdHandlers\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 \u0060apply\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":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":2223}}}],"partialFingerprints":{"codehealthFindingId/v1":"3052cecb8fb3ce3e92599f4470fed3bd34ec46b590cca2fa9bb056fc49e079c0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060world.get_resource_mut::\u003CMsgRequestIdHandlers\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 \u0060apply\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":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":2284}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d15639a5d661e15718b0c2772f0bfdf5652ee7f5c9be076c513fdad7a79dad1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060world.get_resource_mut::\u003CMsgRequestIdHandlers\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 \u0060flush_msg_request_queue\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":"libs/impeller/bevy/src/lib.rs"},"region":{"startLine":2333}}}],"partialFingerprints":{"codehealthFindingId/v1":"07c2e32a364d3ba6f345bbf9cfcbe26934d4facd30c30f62908f0c5e905b02e6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060frame[..4].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 \u0060valid_frame\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":"libs/impeller/bevy/src/replay.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdadad96c7befcb252ef788de4a6407222a2159cf7d8e51952b4771f82250a5f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.0.take()\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 \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":"libs/impeller/bbq/src/lib.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"2199e3d7c539c0f0f071f3a034612b25fa3c9ffddda6a490c708060881e209ce"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.0.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 \u0060inner\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":"libs/impeller/bbq/src/lib.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b84cb58cfbdfd530819c90a6e4317e58a9f7712f9b7dbe5e5dd547bda9312f16"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Archetype::from_derive_input(\u0026input)\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 \u0060archetype\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":"libs/elodin-macros/src/archetype.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"45448f77c20f311475b3c96dfd5c4aff75b20e02730b789532a7e1e77301bc00"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data.take_struct()\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 \u0060archetype\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":"libs/elodin-macros/src/archetype.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5cf7d601b8f0e34fea98fa9058cd8ad7f04f50d04265d84beb7c681096c40a8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060f.ident.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 \u0060archetype\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":"libs/elodin-macros/src/archetype.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7911b9f1a5d82784cefa707170f88e3110d35e4e3b15c50d6795e6fc6d0c4573"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Component::from_derive_input(\u0026input)\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 \u0060component\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":"libs/elodin-macros/src/component.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"d481bfdccabd2cce9c747e69afe56bc544c7f7ba4180d493af716fe0db495931"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data.take_struct()\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 \u0060component\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":"libs/elodin-macros/src/component.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f233806fa018d752875f582146cd8cf7f91e1061f87163ce89e59c9bcac0a05e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ComponentGroup::from_derive_input(\u0026input)\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 \u0060component_group\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":"libs/elodin-macros/src/component_group.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3bc56008b91a4e0f5e6015e0b75e8212ef8955b0f6de2fe6648d5288f19fe33"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data.take_struct()\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 \u0060component_group\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":"libs/elodin-macros/src/component_group.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49b84a31bcac3443362fc66e2c25b32cdefc5577bc322b8efd3eb886af9aac2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060FromBuilder::from_derive_input(\u0026input)\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_builder\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":"libs/elodin-macros/src/from_builder.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"159c278d59dfda55143c10b7fb02687f247062c741d216bd5a4cde694b0de0bc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data.take_struct()\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_builder\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":"libs/elodin-macros/src/from_builder.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3766ee6cc0d188d95e478976894ca50b49f614ecc06f6603b0cfb4d6b82bc915"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060FromOp::from_derive_input(\u0026input)\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_op\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":"libs/elodin-macros/src/from_op.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbb4740f838d53ca3ec3cef6bbee9289b18436157bb1a27caab8561b8a6fed3c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data.take_struct()\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_op\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":"libs/elodin-macros/src/from_op.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"245763f706138ab99b5dfa667c05bf58be9662575ba7fcd9117b22b68b3738bb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060FromBuilder::from_derive_input(\u0026input)\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 \u0060into_op\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":"libs/elodin-macros/src/into_op.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6bcaec4e3d7184b983dba507527b8c4e519c60634f6bd5e1060b8f131506367"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data.take_struct()\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 \u0060into_op\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":"libs/elodin-macros/src/into_op.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4848fe113288de273a18efe810732f0159c5f7232b3f7c7823f305870fc63e39"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate_name(\u0022nox\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 \u0060nox_crate_name\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":"libs/elodin-macros/src/lib.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"7784dda04ad87c0dc2c193fae0151f09bbcaf87cbc4f978080f11242bee72d9f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ReprMonad::from_derive_input(\u0026input)\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 \u0060repr_monad\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":"libs/elodin-macros/src/repr_monad.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66cba5f31c5e6552a77f00a85fdb824f558e5e099bc46c3a88b1b77d4835ee3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data.take_struct()\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 \u0060repr_monad\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":"libs/elodin-macros/src/repr_monad.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe90528f0581a00e6dba5da27ef4f6d9f50479417f926e89d167ef76ec4c71e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fields.fields.iter().map(|f|f.ty.clone()).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 \u0060repr_monad\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":"libs/elodin-macros/src/repr_monad.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4f69498945f36374d0386493bd8c48bccafbf19693f98342f94f3375074d1d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fields.fields.iter().enumerate().map(|(i,f)|{if let Some(field_ident)=\u0026f.ident{quote!{#field_ident}}else{let i=syn::Index::from(i);quote!{#i}}}).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 \u0060repr_monad\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":"libs/elodin-macros/src/repr_monad.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e9bde60beb4031fc0bcc537f60061c09b2fb3e42e585efa94f903ab97b6e53c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060generics.params.iter().filter_map(|p|{let syn::GenericParam::Type(t)=p else{return None;};Some(t)}).find(|t|t.bounds.iter().any(is_repr_bound))\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 \u0060repr_monad\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":"libs/elodin-macros/src/repr_monad.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1219398caa000e2639d29c276fbfa31ddba84722bceeae714c7e4ec92feb653"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060FontRef::try_from_slice(data)\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 \u0060rasterize_material_icon\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":"libs/elodin-editor/src/icon_rasterizer.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6760f528fc3999daf8940d82479303891fa4d325c9d9c13a5088af24d1d929a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060query.single_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 \u0060spawn_ui_cam\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":"libs/elodin-editor/src/lib.rs"},"region":{"startLine":1184}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4521dfc41cb9640fdfc0c86cffc0d1903252df31426f338608c6a9a41090e6d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060winit_windows.get_window(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 \u0060handle_drag_resize\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":"libs/elodin-editor/src/lib.rs"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8663f54d1677f08ea56feb0242893e346959fc9c25c99787b2cd3c1b3facd2e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060image::ImageReader::with_format(std::io::Cursor::new(png_bytes),image::ImageFormat::Png).decode()\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_icon_windows\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":"libs/elodin-editor/src/lib.rs"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"e70be87ef2a908f6310b72a873561542ecc7d0e5bccc558d5bd368b53e3592f0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.path.first()\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 \u0060sync_object_3d\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":"libs/elodin-editor/src/lib.rs"},"region":{"startLine":1846}}}],"partialFingerprints":{"codehealthFindingId/v1":"5419e68233adf157793345f1afa307dce8e09440af6c1e27b5cf3d73d6753f0a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060directories::ProjectDirs::from(\u0022systems\u0022,\u0022elodin\u0022,\u0022editor\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 \u0060dirs\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":"libs/elodin-editor/src/lib.rs"},"region":{"startLine":3050}}}],"partialFingerprints":{"codehealthFindingId/v1":"35d16628e3bd32481fa9f8b2bbce21b4671445352284cf0bca2d466eedf728b1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Array::from_shape_vec(smallvec![7],result)\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_spatial_result\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":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"17520566b8788e1615613a5751a67c2c1af427626c77859622cb00e11dc7cb00"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Array::from_shape_vec(smallvec![3],result)\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_vec3_result\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":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"d34598057b67d9967bcd5e93791182c804ffa1b02b846dfbe3c104583944e840"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Array::from_shape_vec(smallvec![values.len()],values)\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 \u0060compile_sample_formula\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":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2257e10a606a94f9ed1668f5b74908056ecc8f3f00824d0d1c783b6a2e8e4b1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Array::from_shape_vec(smallvec![values.len()],values)\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 \u0060compile_eql_expr_with_ctx\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":"libs/elodin-editor/src/object_3d.rs"},"region":{"startLine":1098}}}],"partialFingerprints":{"codehealthFindingId/v1":"927f3a7d7d62a906a06cd2fd9ab375c4dc559c6f1f9b7048306fb37e2eae0b43"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060hifitime::Epoch::now()\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 \u0060run_recipe_at_with_execution\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":"libs/elodin-editor/src/run.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd1b2e90ce1b4e2bd0183fedb212c875cc8f263d5cb82adfd961b140990bbbe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060src_image.texture_descriptor.format.block_copy_size(None)\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 \u0060image_copy_driver\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":"libs/elodin-editor/src/sensor_camera.rs"},"region":{"startLine":1643}}}],"partialFingerprints":{"codehealthFindingId/v1":"d085a1db468ee4cbe5d1e3110f12e60f3141552cb7cbe6c12cd661da92c05b81"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::num::NonZero::\u003Cu32\u003E::new(padded_bytes_per_row 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 \u0060image_copy_driver\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":"libs/elodin-editor/src/sensor_camera.rs"},"region":{"startLine":1667}}}],"partialFingerprints":{"codehealthFindingId/v1":"14665a004310638a4f7c65e8d8402475db77d804d6e4efd823ee8016d91c9644"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060impeller_cli::lua()\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\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":"libs/elodin-editor/src/ui/actions.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf069cffe060f1db0bcf5a567b08f366df070aa031b1968df5df4e50ae69dcb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.action_tiles.get_mut(args)\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 \u0060ui_system\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":"libs/elodin-editor/src/ui/actions.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70ee1b419ca616f287e6c43ab635f59a9afbb6e80324437e1123f18b54d493c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060variant.dark\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 \u0060load_user_presets\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":"libs/elodin-editor/src/ui/colors.rs"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea8afd0f882363917af521784211c5eddca5ef81b7f2a79648a1f3a4c3185c2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060preset.light\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 \u0060resolve_variant\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":"libs/elodin-editor/src/ui/colors.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2bfe796ecf9c7b2f7c4d69bd7c0d8e4db8f8b90e8772cd1966ebf76c633583"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060registry.presets.first()\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 \u0060set_to_preset\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":"libs/elodin-editor/src/ui/colors.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2cc8fa10d16f38ff4f958b44976bc5c0c9889331a6cad918c3a866aa3042d10"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060world.get_resource_mut::\u003CAssetServer\u003E()\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_world\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":"libs/elodin-editor/src/ui/images.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"006c75d54fcec07bbd952db5d927fda8062e06ffa013f5c8a1b8f5b05964bf34"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060target_window.and_then(|entity|window.get(entity).ok()).or_else(||window.iter().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 \u0060ctx_system\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":"libs/elodin-editor/src/ui/modal.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2321e1a08facb61549c846a1789587a809f19e41f11e91302a98b6a1f9ab8ae"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060web_time::SystemTime::now().duration_since(web_time::UNIX_EPOCH)\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 \u0060show_message\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":"libs/elodin-editor/src/ui/modal.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"33911464cb0afa819d592db0ac17e7d87c3d02dcbdeded406171e4bc9f063461"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x_col.as_any().downcast_ref::\u003CTimestampMicrosecondArray\u003E()\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 \u0060extract_x_column\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":"libs/elodin-editor/src/ui/sql_eql.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"311c163b1ec8a147d7fddbeba593dc9f03843c1ecb43f39ada6c9dc3770b3cee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x_col.as_any().downcast_ref::\u003CTimestampNanosecondArray\u003E()\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 \u0060extract_x_column\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":"libs/elodin-editor/src/ui/sql_eql.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"90fdc32d9e23dcc6047f45e754563b5aa658085f34de4a76a966c30b84c92cef"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x_col.as_any().downcast_ref::\u003CTimestampMillisecondArray\u003E()\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 \u0060extract_x_column\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":"libs/elodin-editor/src/ui/sql_eql.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"60bd9d24b26fa604841559b584c0047f82c43a8d0b3e6fa1d3e3dee86a9b1b04"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060x_col.as_any().downcast_ref::\u003CTimestampSecondArray\u003E()\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 \u0060extract_x_column\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":"libs/elodin-editor/src/ui/sql_eql.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca311f1ff9c694469481cf4c813f975e042d7ab19d20476d91623bdb6c4e8c2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060array_ref.as_any().downcast_ref::\u003CFloat32Array\u003E()\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 \u0060array_iter\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":"libs/elodin-editor/src/ui/sql_eql.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6c6bdb140c39e27260ccd25d36b1ceba7fc00fa9c5c32d47a0ac01c97500ea"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060array_ref.as_any().downcast_ref::\u003CFloat64Array\u003E()\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 \u0060array_iter\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":"libs/elodin-editor/src/ui/sql_eql.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce240b632ea6156ff0922fdedcf36f8d914beaf0279942cfe969546ceb8be45c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060array_ref.as_any().downcast_ref::\u003CInt32Array\u003E()\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 \u0060array_iter\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":"libs/elodin-editor/src/ui/sql_eql.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3036603b1cce00a7dbc0dace29d1f750b5adf8ab425edde11e37ee39cf4c6f4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060array_ref.as_any().downcast_ref::\u003CInt64Array\u003E()\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 \u0060array_iter\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":"libs/elodin-editor/src/ui/sql_eql.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"10dbc316af529296d076445e2dc92de429f040e8043344a9de37ae7271a49ff6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060array_ref.as_any().downcast_ref::\u003CUInt32Array\u003E()\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 \u0060array_iter\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":"libs/elodin-editor/src/ui/sql_eql.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db8ba2803b9250765e582543287b45dba536344aed0a10bbc0c7e543b36bb67"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060array_ref.as_any().downcast_ref::\u003CUInt64Array\u003E()\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 \u0060array_iter\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":"libs/elodin-editor/src/ui/sql_eql.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ae5a318f8b4400c964080ab9c7bd5a6b8c19a5cc83901f2e179225bf410ad9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060array_ref.as_any().downcast_ref::\u003CTimestampSecondArray\u003E()\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 \u0060array_iter\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":"libs/elodin-editor/src/ui/sql_eql.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c43207017a473c808d03ceb865cf674d6393e48f990e1069bf48c925fc3fe3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060array_ref.as_any().downcast_ref::\u003CTimestampMillisecondArray\u003E()\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 \u0060array_iter\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":"libs/elodin-editor/src/ui/sql_eql.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cef148c884ee0ae84e37c60cca7ba5e9d3a81d5a04b12c6813f5e394e2ea69b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060array_ref.as_any().downcast_ref::\u003CTimestampMicrosecondArray\u003E()\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 \u0060array_iter\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":"libs/elodin-editor/src/ui/sql_eql.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0e5a2c4ccb53fb23a39addc6bcbfbc4097772075a8114327eb3f2d59bf3b15"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060array_ref.as_any().downcast_ref::\u003CTimestampNanosecondArray\u003E()\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 \u0060array_iter\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":"libs/elodin-editor/src/ui/sql_eql.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47b3b8dd0c955b5e5d51fde0256929550f56ff5e3d71ccb14626ff7538a9e58"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060array_ref.as_any().downcast_ref::\u003CFixedSizeListArray\u003E()\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 \u0060array_iter\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":"libs/elodin-editor/src/ui/sql_eql.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b6b025c688b41fb992766df4edff86830c7ce58dfc4a06d78c75b0251fde7e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060e\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 \u0060switch_to_main\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":"libs/elodin-editor/src/ui/startup_window.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4761a42015974254743ccf73a16f9d8b368df21271bd4b1226d0f593a3f082a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060hifitime::Epoch::now()\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 \u0060open_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":"libs/elodin-editor/src/ui/startup_window.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88a6c02cbcfa604fc30bda4a5af921b8c6b4fbc50493d72ca52c2b1d45f143f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tokio::runtime::Runtime::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 \u0060open_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":"libs/elodin-editor/src/ui/startup_window.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b30fcca154d653ade478db87e9a9264e0ed53f5011eb61fa34337d3680bc8e7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rt.block_on(crate::run::run_recipe(cache_dir,file,stellarator::util::CancelToken::default(),))\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 \u0060open_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":"libs/elodin-editor/src/ui/startup_window.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0775c7d767a174eba13d359e9154281c85fb529f098b60a20cb5afde122a666"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060hifitime::Epoch::now()\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_connect\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":"libs/elodin-editor/src/ui/startup_window.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13c6826c56214e0fb5e129bfb6d674b3ee241fabddbfd273f7b9a19b189cf23"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060hifitime::Epoch::now()\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_connect\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":"libs/elodin-editor/src/ui/startup_window.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"44fa43aa02774abdd3491b0472b65d125fd84ae6540c3c98a1e0c9c7f386da7e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::read(\u0022C:\\\\Windows\\\\Fonts\\\\SegoeIcons.ttf\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 \u0060configure_default_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":"libs/elodin-editor/src/ui/theme.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"443445210e85f56eb072bff837fde20c90cfc2647f38a7191e57e95ecc4bbd99"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tabs.active\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 \u0060ui_system\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":"libs/elodin-editor/src/ui/tiles.rs"},"region":{"startLine":3256}}}],"partialFingerprints":{"codehealthFindingId/v1":"66917173e231d2f45baa4e26d2f92367ca597ae5c2b3a6d75a0d92dd0dfe9045"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Format::from_str(\u0022%Y-%m-%dT%H:%M:%S\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 \u0060format_wall_clock\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":"libs/elodin-editor/src/ui/time_label.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a4a5f1fe057ff57dd574dce5b2486dc572f5fdba51767bfa5f0c3a2cbbf2afb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Format::from_str(\u0022%Y-%m-%dT%H:%M:%S\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 \u0060time_label\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":"libs/elodin-editor/src/ui/time_label.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"42651faff604ef28a7bf648f26a6461c4e8360ceea9674b63b46e6e6d951d77c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Format::from_str(\u0022%f\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 \u0060time_label\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":"libs/elodin-editor/src/ui/time_label.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"5635b96444b6254f5be99a1d283236c18587b7243a502f12998fb9494983cb7d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.raw_frames.keys().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 \u0060evict_raw_frames\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":"libs/elodin-editor/src/ui/video_stream.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41b28fa2a92f8a81c02208a86ba6e4e92fb6d4272787d68e6ec668b15394b04"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.raw_frames.keys().next_back()\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 \u0060evict_raw_frames\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":"libs/elodin-editor/src/ui/video_stream.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeb22012d902069252640e26ba3f231c2ef9f9742e930c216458e2ed3909ff5c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.raw_frames.keys().next_back()\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 \u0060trim_to_raw_span\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":"libs/elodin-editor/src/ui/video_stream.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"70943f884fb439954116486cb54b8bd9749d2128d99ef18e85157ca289f56e0f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060openh264::decoder::Decoder::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 \u0060decode_video\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":"libs/elodin-editor/src/ui/video_stream.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"187fe6ce07d9bb3376b948dd0c0d8337b9abada92db7e8f045af4f06b0a6955f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060openh264::decoder::Decoder::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 \u0060decode_video\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":"libs/elodin-editor/src/ui/video_stream.rs"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b85027065238641d7bc16d57b14a8d5ca8e12d00850494dd3e143e5c2697f6a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060video_toolbox::VideoToolboxDecoder::new(frame_width.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 \u0060decode_video\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":"libs/elodin-editor/src/ui/video_stream.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6ce67e657764108137957b48311ce33b32ef2563c2098e2710551d7c4f73f1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060video_toolbox::VideoToolboxDecoder::new(frame_width.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 \u0060decode_video\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":"libs/elodin-editor/src/ui/video_stream.rs"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"644f7f10a8d12c1494cc947c40972fc9642bf67ae6e909fd5e4ad552b519fad3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cache.last_decoded_ts\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 \u0060ui_system\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":"libs/elodin-editor/src/ui/video_stream.rs"},"region":{"startLine":1637}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d728232d0c6422f715477b64e0056fd367d6e16a051e40fb8614fb0ce8a482"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.get(world)\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 \u0060params\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":"libs/elodin-editor/src/ui/widgets.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4862d4356011e17a9da7b270514a1e5776195bbca140961dac5d04c731cc61a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.get_mut(world)\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 \u0060params_mut\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":"libs/elodin-editor/src/ui/widgets.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ded310d4718d23058e9f367e00cea89a754d3cbf819a1505a2651ca579d6d8a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.add_root_widget_with::\u003CS,With\u003CPrimaryWindow\u003E\u003E(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 \u0060add_root_widget\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":"libs/elodin-editor/src/ui/widgets.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01754c1f6ab23f20a72e60aff5215f262413d80176bfe9f31a7b7263f7a44c8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(1..=count).min_by(|\u0026a,\u0026b|{let score=|columns:usize|{let rows=count.div_ceil(columns);let mut score=0.0;for row in 0..rows{let cells=columns.min(count-row*columns);score\u002B=cells as f64*(aspect*rows as f64/cells as f64/1.6).ln().abs();}score};score(a).total_cmp(\u0026score(b))})\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 \u0060grid\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":"libs/elodin-editor/src/ui/window/arrange.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d520c04b7fe9d99272ae8be721fedd208827c2038270862dec6627732724ed"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060windows_state.get(*entity)\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 \u0060sync_windows\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":"libs/elodin-editor/src/ui/window/spawn.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"823abfbf69057287f4f6ed73f72920549292913e9e39ede454b5122a972e3021"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060main\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 \u0060sync_windows\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":"libs/elodin-editor/src/ui/window/spawn.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"962c9db940fde0d8fa1dd3e2a8a95232a5ec3e9c48371e2a86b1b03e42846e53"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060miette::GraphicalReportHandler::new_themed(miette::GraphicalTheme::unicode_nocolor()).render_report(\u0026mut buf,diagnostic)\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 \u0060render_diag\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":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"9082931c87e7ec1b51f32214e079f086e2441654d820ed319570e93f6c98f1bc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.window_states.get_mut(primary_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 \u0060load_schematic\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":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb0c85f022c5a892c58a04aa33880fd0635ae8aec061dd3a1ff793f03a5915b4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.window_states.get_mut(*self.primary_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 \u0060load_schematic\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":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43c19ef35038b0ec1b896bb7e07217c1244607752c4311ab2129d415c294e69"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060load.task.as_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 \u0060poll_pending_window_schematics\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":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"695be5e843c20bf842a6bb253839b92c593ef4da741946933e001f3c4c2df16a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.window_states.get_mut(primary_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 \u0060load_default_data_overview\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":"libs/elodin-editor/src/ui/schematic/load.rs"},"region":{"startLine":1726}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb64690623b32c1ac394df0d2da353117340b6fa8378fb125efed1b1a7afb05"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060line_assets.get(line)\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 \u0060extract_lines\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":"libs/elodin-editor/src/ui/plot_3d/gpu.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"70460ffccbbea98e5a81b5fc30e35c6c9ecc3bfe5a10dbefd628b517d25ce82b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060draw_functions.read().get_id::\u003CDrawLineData\u003E()\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 \u0060queue_line\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":"libs/elodin-editor/src/ui/plot_3d/gpu.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"2901b90e3995020ef18291ba2c7521e68fa778c6c2731e3e987b2915c6991f41"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060assets.get_mut(line.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 \u0060push_value\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":"libs/elodin-editor/src/ui/plot/data.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f61576128bda2d53b6b91ff31fad6d59561964104951efe13984e99be10ea2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NonZeroU64::new((INDEX_BUFFER_LEN*4)as u64)\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_to_index_buffer\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":"libs/elodin-editor/src/ui/plot/data.rs"},"region":{"startLine":1711}}}],"partialFingerprints":{"codehealthFindingId/v1":"964495fc0d3e7b1a2927842c37d346c94eed409695c83b04bc9333cdd3e0a59f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NonZeroU64::new((INDEX_BUFFER_LEN*4)as u64)\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_to_index_buffer_with_step_mode\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":"libs/elodin-editor/src/ui/plot/data.rs"},"region":{"startLine":2713}}}],"partialFingerprints":{"codehealthFindingId/v1":"370d9241993cf50904a5d14959c7a63327201c24acbb049c7587cc20dd18062e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NonZeroU64::new(value_buffer_bytes(self.data_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 \u0060binding_size\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":"libs/elodin-editor/src/ui/plot/data.rs"},"region":{"startLine":6586}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3579f074464e027d6f36982eb49b49461996cc3c8334b03e41107fc6c59eba"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060draw_functions.read().get_id::\u003CDrawLine2d\u003E()\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 \u0060queue_line\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":"libs/elodin-editor/src/ui/plot/gpu.rs"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"5901bdf74be6775bfe994971c4406c707569cb2cf15b72431008d8938dbe6ac2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::try_new(render_layer_alloc,components,label)\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 \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":"libs/elodin-editor/src/ui/plot/state.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16d3d149e4bcf00fb514fe83dbd096750fb496d6eef0e1e7cab8b0d18df3288"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060collected_graph_data.ensure_line_handle(*component_id,value_index,\u0026mut lines)\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 \u0060sync_graphs\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":"libs/elodin-editor/src/ui/plot/widget.rs"},"region":{"startLine":1754}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f2b5cd65f6694a7810e2887634b3299c49e6de574fc4c7bee3a63eac4e695b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060item.system.run(filter,world)\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 \u0060ctx_system\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":"libs/elodin-editor/src/ui/command_palette/mod.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe89b162862e1d86fb2d4e443d5322026a8d317bb344b56bd3807375b5ca38ac"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060command_palette_state.page_stack.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 \u0060ui_system\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":"libs/elodin-editor/src/ui/command_palette/mod.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8281b74f735b89ecd11482e5ecf054eb6bdf5a031d499640611713f25d67adc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060item.system.run(filter.clone(),world)\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_system\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":"libs/elodin-editor/src/ui/command_palette/mod.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f9ae52341eca28b3cc5463aafffd7a78d518365f75c8c4b862c028c18abdef"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060system.run(filter,world)\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\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":"libs/elodin-editor/src/ui/command_palette/palette_items.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5203b4ed29a11b0f632fdab27963518f8e3d25f017255ef477d9870c805255c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::read(path)\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\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":"libs/elodin-editor/src/plugins/cesium.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3a9d9760aed076636cdb01c83ebca15ff1ca7d34e48c16f71e257351e0d4f8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parse_capture_views(\u0026bytes)\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\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":"libs/elodin-editor/src/plugins/cesium.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b3a5ef7b730d5a1182392e985ed6da1017ba17bc3b46cdbbb827d12755e8e9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var(\u0022ELODIN_FPS_LOG\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 \u0060log_fps\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":"libs/elodin-editor/src/plugins/fps_log.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"069337f0dd148cb88e553fb8634898d69643a200a880817c22df8e2c52a7f80d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::File::create(\u0026path)\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 \u0060log_fps\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":"libs/elodin-editor/src/plugins/fps_log.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade0e38147b63dd8faa34a9d3e8041c32b807eeaf275f182c1bd1e5086c9932c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060atmosphere\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 \u0060sync_camera_environment\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":"libs/elodin-editor/src/plugins/scene_environment.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a8aac623725222f4e77e39b20b25505828bedd00047118e94e9f5c95c19884"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tokio::runtime::Builder::new_multi_thread().enable_all().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 \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":"libs/elodin-editor/src/plugins/web_asset/mod.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3f8e3800c42036ff6c1c9b0f631117887137900e04e2866b6955d365e60725c"}},{"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 \u0060spawn\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":"libs/elodin-editor/src/plugins/web_asset/mod.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1ab49ee60ea44c57a1a013fc322b25c1b93ce3b061d7aa5d60997710c3e76e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060AnimatableKeyframeCurve::new([(0.0,Vec3::splat(1.0)),(0.1,Vec3::splat(1.3))])\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 \u0060cube_color_highlight\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":"libs/elodin-editor/src/plugins/navigation_gizmo/mod.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c395d46a18c32f6f7286cced784cdde2ab866b6bc7e54b23b7f20df5749459"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060AnimatableKeyframeCurve::new([(0.0,Vec3::splat(1.3)),(0.1,Vec3::splat(1.0))])\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 \u0060cube_color_reset\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":"libs/elodin-editor/src/plugins/navigation_gizmo/mod.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"a447c059e226db43ebe509e9c4ab732138eb78b5760505dd185677bb7bd7977f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pressed.first()\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 \u0060touch_tracker\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":"libs/elodin-editor/src/plugins/editor_cam_touch/mod.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa669e65d6399e6ba0557199e12b1a37041fc04adb0860c1ed56b1cdb4231b3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pressed.first()\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 \u0060touch_tracker\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":"libs/elodin-editor/src/plugins/editor_cam_touch/mod.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7892e93a260d98e35024ecfb1f55c91ee8a6bea9a038555c0333334d0266aa2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pressed.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 \u0060touch_tracker\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":"libs/elodin-editor/src/plugins/editor_cam_touch/mod.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e54aca08dec28715266b069b7b70a88ef92cabb431ae3ee442733a0759f08a8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060directories::ProjectDirs::from(\u0022systems\u0022,\u0022elodin\u0022,\u0022cli\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 \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":"libs/elodin-editor/src/plugins/asset_cache/mod.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1404a46497ada4b1d10256a729d9a4ff21c264be4c9db03d6422bd746b2088ca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::create_dir_all(\u0026cache_dir)\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":"libs/elodin-editor/src/plugins/asset_cache/mod.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db9964c8c27ab8a005f32fa3db532937ae4270e50c606710821c1be81db3940"}},{"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.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":"libs/db/build.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ebb3e9d83fe28d3dc7d0f70ca1c92df6f2c721f1f3ae17b7ccd9bfa77f45a3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tonic_prost_build::configure().file_descriptor_set_path(descriptor).compile_protos(\u0026protos,\u0026[\u0022proto\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":"libs/db/build.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a60f04c39ca2d77599dab8320c89d53fe6254a71b6118e2def36003b3a48052"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(\u0026err)\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 \u0060msg_stream\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":"libs/db/src/axum.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"56f20060c44c5676aaf03488cd7837475233374014eaabbadddfe4d2c6e33bcc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(\u0026err)\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 \u0060buf_to_json\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":"libs/db/src/axum.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda464da3ae8ee6da49b8693e64ef1a9bf38224a2a9b8e49779557134191a08c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_value(\u0026val)\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 \u0060buf_to_json\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":"libs/db/src/axum.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d0aadd40abf921c82115aefb06fa8542826a6d6b70564d6b42499f9c3592aa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_name()\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 \u0060collect_all_components\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":"libs/db/src/drop.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e578f5422af12dffea9098e9818b05e01ff3188f5dbe6f9a3743ff94f5f280"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pattern.split_first()\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 \u0060glob_matches_impl\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":"libs/db/src/drop.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aabb142eb75bf494b2ef28b1eab5f7342edd934ab1de9a658f4eeb282ce3206"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060header[0..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.unwrap()\u0060 in \u0060get_entry_count\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":"libs/db/src/drop.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"2901c09c6f17d4938813b53ff446225b7858571d6bcb1bdbd33ee8fabdadf287"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060array.values().as_any().downcast_ref::\u003CPrimitiveArray\u003CT\u003E\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 \u0060build_list_strings_primitive\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":"libs/db/src/export.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a8a615ab09ca1d8d3e106a33304e132d364ccaf76425d88bd328d0ce4876d0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060array.values().as_any().downcast_ref::\u003CBooleanArray\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 \u0060build_list_strings_bool\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":"libs/db/src/export.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9d045a4dd6eedaa3a4c2f407531cf8a2c787d7050f941a8b0b0e4932794e17"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(buf,\u0022{v}\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 \u0060fixed_size_list_to_string\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":"libs/db/src/export.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6861825e78c8a56a1326b866dafb91724e491b07aa397d4e47e127bce0bafc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(buf,\u0022{v}\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 \u0060fixed_size_list_to_string\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":"libs/db/src/export.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34f56bf9eb88f168a807392be0b45a7459806375410decba1fba924f441c4e7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(buf,\u0022{v}\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 \u0060fixed_size_list_to_string\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":"libs/db/src/export.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e0a720578ea1cd243ef6475cb11e62690d78ebf7a60fd828b60c06d8d92679"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(buf,\u0022{v}\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 \u0060fixed_size_list_to_string\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":"libs/db/src/export.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"9be3cb72bf2f0fb1bd47eee1ec78756528ec71b3c1766b0757dc5b42625152e1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(buf,\u0022{v}\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 \u0060fixed_size_list_to_string\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":"libs/db/src/export.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5de764d2e04d498e6568d81f4b308e65fd83d5cf31eb3753522a80d935c834d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(buf,\u0022{v}\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 \u0060fixed_size_list_to_string\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":"libs/db/src/export.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d10118a4990dfbbd0a35cd0f413bdea9b4a0018d2d578ca1be1293938a804d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(buf,\u0022{v}\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 \u0060fixed_size_list_to_string\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":"libs/db/src/export.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"9681cfecfad47eda70f3569282493d51ddad4be3d6044f7f295da00341c330dc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(buf,\u0022{v}\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 \u0060fixed_size_list_to_string\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":"libs/db/src/export.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9f72b2cbe0df3df52c363a72ba9c77d3b0b38c99287525143d324dd95ee1f2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(buf,\u0022{v}\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 \u0060fixed_size_list_to_string\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":"libs/db/src/export.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd597f5707fdd25efc3d8af6efba2ddad94c3c6998d79cd9fa8347d33cc0f8c9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(buf,\u0022{v}\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 \u0060fixed_size_list_to_string\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":"libs/db/src/export.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"818a34637fdbb62dd0e49ca78fac8836844b4f0ef87ff64b4f49090eda2e0bad"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060column.as_any().downcast_ref::\u003CFixedSizeListArray\u003E()\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 \u0060convert_lists_to_strings\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":"libs/db/src/export.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"3107c6140773e3be6fe8e94a7c1bdd3226fd91e6e71cf9b7c14df228cdeedd11"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060RecordBatch::try_new(new_schema,new_columns)\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 \u0060convert_lists_to_strings\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":"libs/db/src/export.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a42070f64825c575836c573ae2a005984844c6a225a3d3f74a71b7a80e9925"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060RecordBatch::try_new(Arc::new(Schema::new(fields)),columns)\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 \u0060join_group_identical_ts\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":"libs/db/src/export.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ef1cd44b875f4ae21cc0eba9a2ab1263491c588fd4ea3886089970dacc4eed"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060arr.as_any().downcast_ref::\u003CTimestampMicrosecondArray\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 \u0060join_group_outer\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":"libs/db/src/export.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"841697a5eca0f63d645b06c2e4a69759464c07dfad2e8f4f1cc15ee228cd7bd4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060compute::take(\u0026a,\u0026indices,None)\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 \u0060join_group_outer\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":"libs/db/src/export.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61f75dd85968c83b01d8f110c7483055dc817d8de0210dec4422866aeb76fa2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060RecordBatch::try_new(Arc::new(Schema::new(fields)),columns)\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 \u0060join_group_outer\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":"libs/db/src/export.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a9370b8dafe15a32989bb7a71c38b35da76ea20fdfc62c862a1097a895b16c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060batch.column(0).as_any().downcast_ref::\u003CTimestampMicrosecondArray\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 \u0060rewrite_time_column\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":"libs/db/src/export.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bede560c6b7888683269c243fbfc6f79c7ac8704a4a873a4df05d468da5dc2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060RecordBatch::try_new(Arc::new(Schema::new(fields)),columns)\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 \u0060rewrite_time_column\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":"libs/db/src/export.rs"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb152e72adc34f1be9df1cb1ebd002e3957d9f5bc3ad88f6c402896648676d0c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bytes.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 \u0060element_value\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":"libs/db/src/export_mcap.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"85d54ab9fb7ff443b8386a652c6192307cdfa99c4ad3fb27f1edffcd545c645e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bytes.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 \u0060element_value\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":"libs/db/src/export_mcap.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"1100a90455bb26ee9b91d07a9aeb339ffe30f7d7c92cb666f55bb64775c6446f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bytes.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 \u0060element_value\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":"libs/db/src/export_mcap.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a3c6c3a2df115553cf59ef343f4788e9025b683857ec2cf2186f312c3011e1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bytes.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 \u0060element_value\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":"libs/db/src/export_mcap.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f423ba06c356fd73e9c1542bad90fd3835a63ac1178672c97e707023eeccd0e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bytes.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 \u0060element_value\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":"libs/db/src/export_mcap.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c99b8aa34b9bbedbdfb115022a8bd03591ee8c6217223ac0a39a42da7a94200"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bytes.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 \u0060element_value\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":"libs/db/src/export_mcap.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90038eb7f892d626cf39cb37fd68ae118351d54ddf8d2b3f314497cf8d34297"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bytes.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 \u0060element_value\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":"libs/db/src/export_mcap.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"580a00cfad47b417050dd1c6d86fb77b1bf659186d8081563b7e70b6c4948425"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bytes.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 \u0060element_value\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":"libs/db/src/export_mcap.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"1596d491b47ccc253d62f0393feaf6040fb3de668c7b488d507d03d9706bbc12"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(\u0026Value::Object(map))\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 \u0060component_row_json\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":"libs/db/src/export_mcap.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bd98a0b8d41297706b8534be001dcfa8b373c8887b82982ef0c06da34a15a1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(\u0026msg)\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 \u0060tf_message\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":"libs/db/src/export_mcap.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"c962e1e43ea9f1835e2c4d57aec77de1fc44fa8be4588e6bf388fca31135feb7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(\u0026msg)\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 \u0060geo_frame_tf_message\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":"libs/db/src/export_mcap.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"07401df83f8d745cc3e2e7b29b7821c3368fbee84d7d3abb30c49459384dc2fb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(\u0026value)\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 \u0060msg_log_json\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":"libs/db/src/export_mcap.rs"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"77011dad6f82be5c8dc36bc07a8faa78ca8e225431afbf066d25f0e7e3d1cfb7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(\u0026json!({\u0022deletions\u0022:[],\u0022entities\u0022:[entity]}))\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 \u0060scene_update_message\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":"libs/db/src/export_mcap.rs"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee9d201700846b9f8a6acc14d93166c4919307afa306cabf7d2f2be870df936"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060element_path_str(\u0026comp.element_paths,idx)\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 \u0060push_component_series\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":"libs/db/src/export_mcap.rs"},"region":{"startLine":1621}}}],"partialFingerprints":{"codehealthFindingId/v1":"21b4cc54ce03cf037cc029841e4ab1ddfef2d44cdd5843a5d3c5f92cc32e3122"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::export_videos::SensorEncoder::new(cfg.width,cfg.height,fps)\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_sensor_frame\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":"libs/db/src/export_mcap.rs"},"region":{"startLine":2232}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f1bbec5b6cac5eee3e0e7a9e340242c62a919051260277747f83d5a6f54558"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(\u0026value)\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_sensor_frame\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":"libs/db/src/export_mcap.rs"},"region":{"startLine":2253}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed5975f7d8abc7bb6e59221ee1d5d215664b7368942fdfd4cfbf945d2d721ae8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec(\u0026schema)\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 \u0060run\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":"libs/db/src/export_mcap.rs"},"region":{"startLine":2530}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca318b5dbb0269809899a21a46b5d37a5aea92d0546df85e22438cb0894a20ed"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060component_cursors[cursor_id].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 \u0060run\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":"libs/db/src/export_mcap.rs"},"region":{"startLine":2787}}}],"partialFingerprints":{"codehealthFindingId/v1":"68148e6568704321c7801e080bb931e15b1128a693c06b5e0ad317ab0d412df9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060component_cursors[cursor_id-n].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 \u0060run\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":"libs/db/src/export_mcap.rs"},"region":{"startLine":2796}}}],"partialFingerprints":{"codehealthFindingId/v1":"1588bb53a1af795cc38e19bfe1410eccfab235ec504688f10a5d4b574560f7e5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060comp.pose_entity.as_deref()\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 \u0060run\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":"libs/db/src/export_mcap.rs"},"region":{"startLine":2798}}}],"partialFingerprints":{"codehealthFindingId/v1":"bacfbabfd4c816dc855e4c333766941170a6def5f7131c2af8c646a778f6bc69"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tf_channel\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 \u0060run\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":"libs/db/src/export_mcap.rs"},"region":{"startLine":2800}}}],"partialFingerprints":{"codehealthFindingId/v1":"77fa0d719a8e7159a4552cd82164903b17f7177ff3032ab92de680d8d7ab8e0d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060serde_json::to_vec_pretty(\u0026layout)\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 \u0060run\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":"libs/db/src/export_mcap.rs"},"region":{"startLine":2971}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8bfb868b56c131bb6554a5978998bc76301f1cede803c7a3c3892186d32104"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060start_ts\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 \u0060export_one_h264\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":"libs/db/src/export_videos.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9588f9d3d9d40de17c424d60f3bf365b97196d362f1d28724334e5a7d2bc1c3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060start_ts\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 \u0060export_one_h264\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":"libs/db/src/export_videos.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e07c17c2c6aa9e168f7fbadfa86840bde29f299c97a9ef595a1c04da412b32"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_name()\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 \u0060run\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":"libs/db/src/fix_timestamps.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3840df03c56d5c16678de6edd0046d52fccf0a063d27e90e685807af97e726f0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060good_components.iter().map(|(_,info)|info.min_timestamp).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 \u0060run\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":"libs/db/src/fix_timestamps.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"16470b59e1c71c57d3c372052d90eb817242d3024800e920420373793688ffb5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bad_components.iter().map(|(_,info)|info.min_timestamp).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 \u0060run\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":"libs/db/src/fix_timestamps.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac79bd152238f4bbe43e2d88e9e1954363217926f0ae021a79ed31126cca853"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060header[0..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.unwrap()\u0060 in \u0060analyze_component\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":"libs/db/src/fix_timestamps.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"915b19596f2b764baa91032bfd177a4975adfed438e594b1adfe4e11ccb2af24"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060header[8..16].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 \u0060analyze_component\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":"libs/db/src/fix_timestamps.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff60cce88ea072d1212b664596ed90ee52e0402e464f142c649eb3fac0acbc77"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060header[16..24].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 \u0060analyze_component\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":"libs/db/src/fix_timestamps.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"b26577231f0e527d646dbc55c7b2c60b8b38594270448f889f2281033615919a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060header[16..24].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 \u0060apply_offset\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":"libs/db/src/fix_timestamps.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b8c31e761bdf84caff30c4fdc7ac38cd01b75f2a80154932316d4eb665a918"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060schema_resp\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 \u0060request_source_snapshot\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":"libs/db/src/follow.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd7920f3c11976f74e4d06151932d378528f8599c53a51b48d65cc553d4015fc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060session\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 \u0060run_follower_inner\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":"libs/db/src/follow.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"d928e718ec82a1106998bc17e137348b3059882cf2879d38f93ed8eb2f606144"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060m.timestamp\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 \u0060run_follower_inner\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":"libs/db/src/follow.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5c30cc4d2ddc2330149dbac5e89f93c44e3407733191931afb7abe25abcaec"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.components.get(component_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 \u0060apply_component_row\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":"libs/db/src/lib.rs"},"region":{"startLine":1114}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe30c109472793e1e35441c5196faac484e1f216124fffe33c5708ce6b52e2e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060component.time_series.get_all(timestamp)\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 \u0060apply_component_row\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":"libs/db/src/lib.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"d267e3395c72f6ace832d9a15fec7dda455f67056ddfea68bb8226cfd8f7a384"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.components.get(component_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 \u0060apply_component_row\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":"libs/db/src/lib.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"95eeeaacf66ac6ccdccd2391faac4001053b1fb2985a6afd6ab5198c1433fd8c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Schema::new(self.prim_type,self.shape())\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 \u0060to_schema\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":"libs/db/src/lib.rs"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"257424d00e1de525c3855d60106293fb431f4568db65582fca1e4d59418b0bde"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pkt_tx.pkt\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 \u0060handle_conn_inner\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":"libs/db/src/lib.rs"},"region":{"startLine":1965}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d79e7a7218f93f6a2be920c597ad49b32357df1eed38f148d62b7afd52e878e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pkt_tx.pkt\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 \u0060handle_conn_inner\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":"libs/db/src/lib.rs"},"region":{"startLine":1982}}}],"partialFingerprints":{"codehealthFindingId/v1":"e59faa053a30f587b9b1623eded19373382eacd74fa7e42183bbc51511ee2016"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pkt.take()\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 \u0060send_with_builder\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":"libs/db/src/lib.rs"},"region":{"startLine":2070}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ca631cd02ffdff223cc59a9092a86e70ce63bf8f2150165a49cb8947d58a35"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060last_advance\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 \u0060run_tick_driver\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":"libs/db/src/lib.rs"},"region":{"startLine":3086}}}],"partialFingerprints":{"codehealthFindingId/v1":"270ff424e19232489bdf331604db94bb670135d6e36096164fb193c7370d72b0"}},{"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 \u0060handle_unicast_stream\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":"libs/db/src/lib.rs"},"region":{"startLine":3103}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdad44e23d9548dac6fd9de14ec028333bc5f5fd8d1b2036ade3d2449d564ab4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.stream_id.to_le_bytes()[..2].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 \u0060handle_fixed_stream\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":"libs/db/src/lib.rs"},"region":{"startLine":3471}}}],"partialFingerprints":{"codehealthFindingId/v1":"363915a4787c238358138b633d2040ed059643228e1bdf77ba76b276850668bb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::current_exe()\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":"libs/db/src/main.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eb9b6ddb1c44cebc8c4a083d56b86e69bc3b35e509a20a4895cf24fdc7bab21"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060directories::ProjectDirs::from(\u0022systems\u0022,\u0022elodin\u0022,\u0022db\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":"libs/db/src/main.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f8126e00610188f9cfb73972a76e426720089ba3248aaaff43820498577cf9"}},{"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 \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":"libs/db/src/main.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c47c1d208fc2093816b115c46aedec3e8b266b90c2a1ec0c18ecab0544eb45"}},{"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 \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":"libs/db/src/main.rs"},"region":{"startLine":600}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc73956d8d2543054e2a414110c23e0ea8cf41ec0fa2d661ee3f5f4501d412a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060directories::ProjectDirs::from(\u0022systems\u0022,\u0022elodin\u0022,\u0022db\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 \u0060run_info\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":"libs/db/src/main.rs"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb94cf5601fd134057f362969567c3d68f5ce1c82509c871a05f5972a16b1e5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060header[0..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.unwrap()\u0060 in \u0060copy_index_with_offset\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":"libs/db/src/merge.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"4000a25b1b6e5aabf27efda7f388bc6a7fadf16fb61a207d1eadd9dd35580b89"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060header[16..24].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 \u0060copy_index_with_offset\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":"libs/db/src/merge.rs"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"f60124f70351d498161055f0d5b2d54284169558099f23bbb4ba56cb08c29d4b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buf[start..start\u002B8].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 \u0060copy_index_with_offset\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":"libs/db/src/merge.rs"},"region":{"startLine":1032}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cefa8ad065e95121963d1330d44778fed7b1b613b94ffcaf9a398af8b3e89b0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.timestamps.get(..)\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 \u0060timestamps\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":"libs/db/src/msg_log.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8ba9a604416427e8be292f09ae9aa916bfd6bd748909c7dceb9c9e6afbe613"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u003C[Timestamp]\u003E::ref_from_bytes(self.timestamps.get(..).expect(\u0022couldn\u0027t get full range\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 \u0060timestamps\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":"libs/db/src/msg_log.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"da916070c99fb5022d74b90b3f523faafc2d68006b2064946ccac126a4a944f6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u003C[UmbraBuf]\u003E::ref_from_bytes(self.offsets.data())\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 \u0060bufs\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":"libs/db/src/msg_log.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"c734df3c2fb2d3d14411e91dc328f7bb45e040ca68649e59a08e9f5ed81fa5e9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060msg[..4].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 \u0060insert_msg\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":"libs/db/src/msg_log.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08f058bb8c2ec2f56c25982123053a8f46565d078790a87dfc1ea417d0ae06b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_name()\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 \u0060run\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":"libs/db/src/prune.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8729b00d3767d2f5083d7f7d7fea1e235d8af818c574edb52151cc3c1a4b7f3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060header[0..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.unwrap()\u0060 in \u0060is_component_empty\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":"libs/db/src/prune.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac14997ef6b4d3d837ebdc75f9e89b1fbab030b180a6c9da7fc5b3af3d7855a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060off.to_microseconds()\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 \u0060resolve_slice\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":"libs/db/src/query.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffb2d2c3da77139f4a38241093b247718f56c73d61d27e379ab68e6f6a90245e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060times\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 \u0060resolve_slice\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":"libs/db/src/query.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ffc914ea0f012877b1d783842cf56b12e89a55cf2d1cec95d55532bb381de1c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lim.to_microseconds()\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 \u0060resolve_slice\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":"libs/db/src/query.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd75e6919d77e76decb26298aedf3eccce76437cec819ee94ad210a8577c268"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060times\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 \u0060resolve_slice\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":"libs/db/src/query.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a583be66e6c7e6151b2c1214f0e703a57c2898e64ea03c9882d730fc8311ae"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060col.as_any().downcast_ref::\u003CInt8Array\u003E()\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 \u0060format_cell\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":"libs/db/src/query.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed4e7257441c7fce3790722f566240434e0f77ea7cbf082fdda5c00d0b2967c5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060col.as_any().downcast_ref::\u003CInt16Array\u003E()\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 \u0060format_cell\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":"libs/db/src/query.rs"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ebff2ee77194df805c580692cfe907e3b50f2c597706dfd3e915a91a58e7ef0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060col.as_any().downcast_ref::\u003CInt32Array\u003E()\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 \u0060format_cell\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":"libs/db/src/query.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6daa088672746c1cedc746334a303ffe0c7ac917d913cf75982be59dee083c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060col.as_any().downcast_ref::\u003CInt64Array\u003E()\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 \u0060format_cell\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":"libs/db/src/query.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ef973d2e311069cf5872763a287ee7977e81ae4731f346da082447934aedb0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060col.as_any().downcast_ref::\u003CUInt8Array\u003E()\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 \u0060format_cell\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":"libs/db/src/query.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"1904a5290aefc3070988ed32e570716405faf3782fd3313e0992b896334f7b57"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060col.as_any().downcast_ref::\u003CUInt16Array\u003E()\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 \u0060format_cell\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":"libs/db/src/query.rs"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"87bd95ea9e46ce8f7c89a131d7f203408405e60f57ca90a748516d263cd773a2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060col.as_any().downcast_ref::\u003CUInt32Array\u003E()\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 \u0060format_cell\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":"libs/db/src/query.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac58d87aece9d9b4b667351c776cc4bc7ba5e8e187011d8a0976a918f8fd9221"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060col.as_any().downcast_ref::\u003CUInt64Array\u003E()\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 \u0060format_cell\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":"libs/db/src/query.rs"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"857c854484786bcf816dabcf7ef49b7072d14214e138e9f8ae52f9394f9ad367"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060col.as_any().downcast_ref::\u003CFloat32Array\u003E()\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 \u0060format_cell\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":"libs/db/src/query.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e95b68fc4c26e12af504c8b842e738593418e30d3e1cba5adfec6984f06fef0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060col.as_any().downcast_ref::\u003CFloat64Array\u003E()\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 \u0060format_cell\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":"libs/db/src/query.rs"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"d58415aa450e08c6c1dc42012d12ce66647555f2b09838b2c0563fd12f3c080f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060col.as_any().downcast_ref::\u003CBooleanArray\u003E()\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 \u0060format_cell\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":"libs/db/src/query.rs"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"173ed333e37f211510d0d0a0191825db7ff9ab638389cb988b6c4c4609818225"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060col.as_any().downcast_ref::\u003CStringArray\u003E()\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 \u0060format_cell\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":"libs/db/src/query.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e06c116fdc35cecc4bc190ba6450e63ce0fc8aaae2a7c448245d784af685536"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060col.as_any().downcast_ref::\u003CLargeStringArray\u003E()\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 \u0060format_cell\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":"libs/db/src/query.rs"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff97250286c0a92ad6daae0314f96b3c529ffab7a5bfd1e9ad8d6a022bcf1dc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_name()\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 \u0060collect_components\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":"libs/db/src/time_align.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"473ce90152f5b80451b23a46e953f277b1a1277407e06d3d14ff6b694565e4dc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060header[0..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.unwrap()\u0060 in \u0060analyze_component\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":"libs/db/src/time_align.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"78377fce7753beaf21f410014a1f195a318184bc3324fd58641951338be0cb45"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060header[0..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.unwrap()\u0060 in \u0060apply_time_shift\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":"libs/db/src/time_align.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e8ce0c2f66be3622dc338afcff43b942c91a9e60c19ffe2fead2dc7e27fcf9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060header[16..24].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 \u0060apply_time_shift\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":"libs/db/src/time_align.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab1b6436956291045633669a6bfaafba5cf9e7d64de0eeec1aacae47de5052e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.index.get(..)\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 \u0060timestamps\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":"libs/db/src/time_series.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e7f975976fb8566bceb6d76f6f4744a0bc7942c9f78109b6915b4c97c7ac84"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060\u003C[Timestamp]\u003E::ref_from_bytes(self.index.get(..).expect(\u0022couldn\u0027t get full range\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 \u0060timestamps\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":"libs/db/src/time_series.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2eea1963bc3d6fd7839c3cef625c88858644d328e1229c1077299b517a9d509"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.index.get(len-size_of::\u003Ci64\u003E()..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 \u0060push_buf\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":"libs/db/src/time_series.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e5bc259950ad17e0057c896f71b1da1ada77594d9092772b36c25240bfea57"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060last_timestamp.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 \u0060push_buf\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":"libs/db/src/time_series.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"32c99b2b811491596c29a49d7e4fb326cf4f453a0cf97da4c888e7c2b4b88d52"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060kept_timestamps.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 \u0060trim_component\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":"libs/db/src/trim.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"499e409228be6190da6a9e3ba7f6faf3f6139ab70f0f4ad4d6435cfe352b1b66"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060header[0..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.unwrap()\u0060 in \u0060read_index_timestamps\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":"libs/db/src/trim.rs"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"316df0f5d183586ae103927a91ef4f1591d407934cdbe98aa59dbd1f232de842"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060header[16..24].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 \u0060read_index_timestamps\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":"libs/db/src/trim.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"d348a6c7b6436a0b9ec23c4f41cfd0c0eb5fac01cc7fa5d59aa90a13e13f7983"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060header[16..24].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 \u0060read_data_element_size\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":"libs/db/src/trim.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"926f142c8974eb64b506e0b449996655ead1c2f80452147c279d2d5f31c0c7aa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060header[0..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.unwrap()\u0060 in \u0060read_timestamp_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":"libs/db/src/utils.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"28be4a5cdcf9b2a6454fcee970c533ad288eb101143b0d17ffbfe832ba57dafb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060header[0..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.unwrap()\u0060 in \u0060read_msg_timestamp_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":"libs/db/src/utils.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1cc4807a3fb24e817dec71d4d9d09dfe1da80cca573767c2b8a46aaa475ba8d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060table.take()\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 \u0060take\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":"libs/db/src/vtable_stream.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dffcec77cd8fd2c6aa701d0ee905e3cda54b10e4ed1c9d86cf43097ec1f0f28"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buf.as_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 \u0060with_buf\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":"libs/db/src/vtable_stream.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1744ea1f64eb5fafbc550892ba344f490825b7b281e0850be253a2f1e3432fd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ComponentView::try_from_bytes_shape(f,\u0026shape,ty)\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 \u0060next\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":"libs/db/src/vtable_stream.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"6193bb06d1fcc63872f050f09fe47a01b17e791d22b90dae0a955b08ba5e8f56"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.parent()\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 \u0060persist\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":"libs/db/src/grpc/common.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c1586e5bc3f51dfad46720f4a5ff4e35feb6a8f8151a1aa2c4027213463e82"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pending_ack.take()\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 \u0060run_session\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":"libs/db/src/grpc/ingest.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d81f7c8daa120328099975a6d62f62bf61e929895a0cbec9c1fe7828cea4a0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pending_ack.take()\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 \u0060run_session\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":"libs/db/src/grpc/ingest.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca3f2e4d29c24d36804881f5e93335dfbbb522277b5d740da16f289d3097dfb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060max_points\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_time_series\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":"libs/db/src/grpc/query.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"94fcbcc414ea30745fb9289810acd0ea2f8e25f419817214af95c15604019924"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060DB::create(db_path.clone())\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_component_db\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":"libs/db/src/bin/bench-csv-export.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26ed073261c468df2c8edcb50ee21289afa3ee12180aae7b075144768ebf746"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.set_component_metadata(ComponentMetadata{component_id:cid,name:name.to_string(),metadata:HashMap::new(),},\u0026db_path,)\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_component_db\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":"libs/db/src/bin/bench-csv-export.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9000de5e8929779d6a19686734760434d470506e78bfc0669255a0eaacc523b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.insert_component(cid,ComponentSchema::new(prim,dim_slice),\u0026db_path)\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_component_db\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":"libs/db/src/bin/bench-csv-export.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c761f0201ee23560216fc7b83a71faee4dac6c24d0044e1f513de27d67427f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060s.get_component(cid)\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_component_db\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":"libs/db/src/bin/bench-csv-export.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4f74ca66ee8d39ce1b521fb3ba8496b1cd47417f39510382230832291418176"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060c.time_series.push_buf(ts,\u0026buf)\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_component_db\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":"libs/db/src/bin/bench-csv-export.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"8726286a1d1012a0ff6a5a32c04821ce8cf3f925e4ad5ffcd69555b43ec6cdf2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060db.flush_all()\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_component_db\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":"libs/db/src/bin/bench-csv-export.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72bd27765e6a5bc223bac4e073371d6e4a20e426799cb0c096403f535c38663"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060export::run(db_path,out.clone(),ExportFormat::Csv,opts)\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 \u0060time_export\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":"libs/db/src/bin/bench-csv-export.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"8568be0e498ef8ddac1a83ccfa728d7b63d5c4ffd0eb59c54c54c9d78a6b3332"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chunk.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 \u0060run_bench\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":"libs/db/src/bin/bench-csv-export.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2d5eed36b10ab180cd380eeb2b68ac9ca21dbeb69e26faa9a1d3d6899e4d40"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sz.parse()\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 \u0060run_bench\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":"libs/db/src/bin/bench-csv-export.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a596612e0adc56682294a415fea8109930049351b63c1951e2981aca2745bde"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060r.parse()\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 \u0060run_bench\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":"libs/db/src/bin/bench-csv-export.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"7486be386121508ab8ae4196dc9b75345349e18f085ee1c2f1cb2e4e41e886ae"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::read_dir(\u0026db_path)\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 \u0060run_decode_schema\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":"libs/db/src/bin/bench-csv-export.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"71bbc374b03b49b6dcfe90b7e528d11a4dc413a055e35cff891728df7077c499"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060postcard::from_bytes(\u0026schema_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 \u0060run_decode_schema\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":"libs/db/src/bin/bench-csv-export.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"aff97f32c599c95c6d63be115c7ed7d723b782fc5238b01be703b0494f7afdfb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060postcard::from_bytes(\u0026metadata_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 \u0060run_decode_schema\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":"libs/db/src/bin/bench-csv-export.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"85174ab0e0a58033358c023d027ea0585e0b6b23b042c3c51a49d427396bc55d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.ack_latency_p95_us\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 \u0060print_human\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":"libs/db/src/bin/bench.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1d8f08cde8033b3861db781b11d9db3b38bc579705e0c7923480a57531769c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.ack_latency_p99_us\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 \u0060print_human\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":"libs/db/src/bin/bench.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"d079a6c4f9bcf0adab9e8b8ffd89a3673cfabd5f13fc7a3a13a1b275cfc2a266"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.ack_latency_max_us\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 \u0060print_human\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":"libs/db/src/bin/bench.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ac82c3b5ca3704e79adab838b2e37b1a2138b5067fe84f98c17840d08e0648"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060TcpListener::bind(\u0022127.0.0.1:0\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 \u0060run_benchmark\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":"libs/db/src/bin/bench.rs"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"84502324da6845153f53f50a9c7e64997d57c0174fd2d9fbf3c4d93703602359"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060listener.local_addr()\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 \u0060run_benchmark\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":"libs/db/src/bin/bench.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc83c62ab749e18347cf0cee47ae6734c6092568ce264922e23a55c09a9997ef"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Server::from_listener(listener,\u0026temp_dir)\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 \u0060run_benchmark\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":"libs/db/src/bin/bench.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3cd5cf56c941e364f56bef1c163473686b9315e12524c96e8e226676628323"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::net::TcpListener::bind(\u0022127.0.0.1:0\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 \u0060run_benchmark\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":"libs/db/src/bin/bench.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"15dc708699fb6b57a58bf44cf44f46d984331e27df11863ea4100e18969dae32"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060listener.local_addr()\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 \u0060run_benchmark\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":"libs/db/src/bin/bench.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"413015946bcc294149fee1b03e533260d80939c5dad8a4fdc78259b63c9504e1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060_embedded_db.clone()\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 \u0060run_benchmark\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":"libs/db/src/bin/bench.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"505d773dbcae63eac456166a33fda57c956e36f17f4f152835e0d18065f0f53f"}},{"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 \u0060run_benchmark\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":"libs/db/src/bin/bench.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"616ee58e17f627e048bbe8d543f20cacaec4362bba17a00eb5bb6d26c143855d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060grpc_addr\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 \u0060run_benchmark\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":"libs/db/src/bin/bench.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"e127e6efa69ba5b2f396870831322cf3a6cc14575d0cc38b7b1092a780a318e3"}},{"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 \u0060run_benchmark\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":"libs/db/src/bin/bench.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"593ed7e63bd591f5a5ca0d29dbac7f7f7157ff32fa0755eb548c3d73e4460ace"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060.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 \u0060run_benchmark\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":"libs/db/src/bin/bench.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"a462e86ba2b4b5c1d2a2c15a01e5d8bd44d403bfe580302111b5043d7819cd7c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pending.pop_front()\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 \u0060run_writer_grpc\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":"libs/db/src/bin/bench.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa682c4fe3fc8a4454db96e6b583c776fed9bddf1ff641c378ce6cc85f76e98f"}},{"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 \u0060run_writer_batch\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":"libs/db/src/bin/bench.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"130e418b0a9a7a1147872799a1c1f07b608a04f1ccf3f76ec6bd75c0c98d9441"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060.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 \u0060run_writer_batch\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":"libs/db/src/bin/bench.rs"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d186af7fbcf66d9edb0015ac85ed9b96efea7d412cd57832841916a25500659"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060.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 \u0060run_writer_batch\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":"libs/db/src/bin/bench.rs"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba358f563c93d1048551fec1864a499c8a485f0b819823acdc86347ec4a72fc7"}},{"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 \u0060run_writer_per_component\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":"libs/db/src/bin/bench.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"4437d07f131c60765421cc18b25c549561cb9e5f9805f1fc4751ee96690050f2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060.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 \u0060run_writer_per_component\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":"libs/db/src/bin/bench.rs"},"region":{"startLine":955}}}],"partialFingerprints":{"codehealthFindingId/v1":"906da69a801cc40e6d8a5b06c16c59c9de54a9c5d5287f237f99e15306953aff"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060.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 \u0060run_writer_per_component\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":"libs/db/src/bin/bench.rs"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce967f9ad1dfc2de6b1b56babccda3da556ddf8aa9ee695e133348c43b254b6"}},{"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 \u0060run_reader\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":"libs/db/src/bin/bench.rs"},"region":{"startLine":992}}}],"partialFingerprints":{"codehealthFindingId/v1":"560ec93b2b73582c118ed6468fa79232427b74d06f62e05019d12e87d83ba374"}},{"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 \u0060run_reader\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":"libs/db/src/bin/bench.rs"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d64bae84c0124d00a5cc556c4ce8681646a90582b67268485cf78eb8ed3bc65"}},{"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 \u0060count_total_samples\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":"libs/db/src/bin/bench.rs"},"region":{"startLine":1009}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d388aea1f4a780bccacc7f73893987ea2dbc634774b7f125c7afe2d21920d93"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NonNull::new(data.as_ptr().add(start)as*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 \u0060as_arrow_buffer_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":"libs/db/src/arrow/mod.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"44d2fc53886a3b80c9791b5e3926c46a8b63bd9ed0d1406c056819bbb26a21ff"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060array.as_any().downcast_ref::\u003CFixedSizeListArray\u003E()\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 \u0060as_flattened_columns\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":"libs/db/src/arrow/mod.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32aa32aa1a0a737cedf2f1d3e97ddad03ff4b0c534d4c25a23b70e16ae2e341"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060compute::take(values,\u0026indices_array,None)\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 \u0060as_flattened_columns\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":"libs/db/src/arrow/mod.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"e07eaaeaecadb097a130aa72482e203ebde8010d993cbfb01dc217219b63f83d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060RecordBatch::try_new(Arc::new(Schema::new(fields)),columns)\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 \u0060as_record_batch_range_with_element_names\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":"libs/db/src/arrow/mod.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ec4aab33522cf3e7ba225813568b67a6595dfe1f8b0b309627cdacec38a6e6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060RecordBatch::try_new(Arc::new(Schema::new(fields)),columns)\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 \u0060as_flat_record_batch\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":"libs/db/src/arrow/mod.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65de463514441e18af5fd2f081e52991fda6a1efa0bee16bdbb6e6cb2436fb3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060StreamingTable::try_new(stream.schema.clone(),vec![stream])\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 \u0060as_stream_table\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":"libs/db/src/arrow/mod.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bd8e5e4811f722c88da11d3dfebb0d0b0dbd1198a426bbc4c28ff2c9d7c9b7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060MemTable::try_new(schema,vec![record_batches])\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 \u0060as_mem_table_with_element_names\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":"libs/db/src/arrow/mod.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"75eba14e84f6a7d339505e96d9762ac4fa2bfca9f7b44cfdec98a099eecc9c5f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.component_metadata.get(\u0026component.component_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 \u0060as_session_context\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":"libs/db/src/arrow/mod.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2519c9bed19cee602b0730ba56724997e6d7d851ef7cf4aa6fbc750d832c136"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060values.as_any().downcast_ref::\u003CPrimitiveArray\u003CT\u003E\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 \u0060stride_split_primitive\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":"libs/db/src/arrow/mod.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"9346e66ecf4b6c2aaf373e27f747bc039800cdeb5e5421a4886b2a93274e8b7a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060values.as_any().downcast_ref::\u003CBooleanArray\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 \u0060stride_split_bool\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":"libs/db/src/arrow/mod.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7212914784ec3b8b5a1cbdad10b709e6dbdb6b5ba4013d57f406401f322cb9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060AsVTable::from_derive_input(\u0026input)\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 \u0060as_vtable\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":"libs/db/macros/src/as_vtable.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"056e59a3969bf9175f5b5fc3b71299d60536d78d09d40614c617b9601e7e5be5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data.take_struct()\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 \u0060as_vtable\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":"libs/db/macros/src/as_vtable.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0de39cccc180652ec4e799481d8d80e3452573c5c0254b945842938a4ab366a1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Componentize::from_derive_input(\u0026input)\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 \u0060componentize\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":"libs/db/macros/src/componentize.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"efe041b43f4b36ce1afd12da60d0906c1e82e68d94c371fca05b0c926e2a5409"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data.take_struct()\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 \u0060componentize\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":"libs/db/macros/src/componentize.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe96992476e81db399c9c8461a804bc99585059e53506a26bfb46d7e864e8bfe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060field.ident.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 \u0060componentize\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":"libs/db/macros/src/componentize.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99ff7255d6425ebc1faa8acf9c8bd615e6bd93a5f527c0c136b84bc6bae96c4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Decomponentize::from_derive_input(\u0026input)\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 \u0060decomponentize\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":"libs/db/macros/src/decomponentize.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e7e7510e8ad8be943b83003a808656d4476992ede41ab3c5f213947246aa84"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data.take_struct()\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 \u0060decomponentize\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":"libs/db/macros/src/decomponentize.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb975c3f681bcca11e1de120319d54a30238eb5262f45e65923a4e4f2fea55d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060field.ident.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 \u0060decomponentize\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":"libs/db/macros/src/decomponentize.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8099479576ff7daeb470d89a6e956ff63669f1604414759c99d83a0850c7d778"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.ident.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 \u0060component_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":"libs/db/macros/src/lib.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b99069806deed7e8b2a60a5ef74cd6d484724a6cf1cb3872d17b46a2cf6b2d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.ident.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 \u0060component_id_str\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":"libs/db/macros/src/lib.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd5e44be9c956d7636b7edc0f58e9839ac7ddf00d7b81c8b8a201eac79028ab"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate_name(\u0022impeller\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 \u0060impeller_crate_name\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":"libs/db/macros/src/lib.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce88e1b96bce098de0fbac3c2baa91468e194e5367cd29e0c17d3e49ef3f30b7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate_name(\u0022impeller-wkt\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 \u0060wkt_crate_name\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":"libs/db/macros/src/lib.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"119cd6541b71e45653b4fa5a9f8194de36d5d35af79bec70a9e19b454fd5ce4f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Metadatatize::from_derive_input(\u0026input)\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 \u0060metadatatize\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":"libs/db/macros/src/metadatatize.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef32322434c1d111d649f4fb65915fc9734b9f82f1ff3ff509c8081cc4eafcec"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data.take_struct()\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 \u0060metadatatize\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":"libs/db/macros/src/metadatatize.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b41232d6326fccb4ed2ef200eff13be23280dfe914a8e3ee10e88b62b6bccc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060field.ident.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 \u0060metadatatize\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":"libs/db/macros/src/metadatatize.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d3e5e100f2dd44750141d1a3e4913a525885589c6a98a0efd4ae3cb2315b03"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060table_names.first()\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 \u0060to_sql_with_options\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":"libs/db/eql/src/lib.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e042b087b36e579c91c94b88c1f10d1ac850ccec638bf5935766c59c81cddd9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060table_names.first()\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 \u0060to_sql_with_options\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":"libs/db/eql/src/lib.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c6367c636ea7dbc982c2f7ed312e31198fe5bbdf2095f30f862d7c02bcda32"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060table_names.first()\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 \u0060to_sql_with_options\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":"libs/db/eql/src/lib.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"1afc02a7c577d9b2c2970c75fed3e48bc6fcd9b84a192cf4ce92bbb76852fb96"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060nodes.next_back()\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_leaves\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":"libs/db/eql/src/lib.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c86a6e3304c966de3ba615d50691e29151e4969d22fa8ba117f654a252248d5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060input.rfind(\u0027,\u0027)\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_string_suggestions\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":"libs/db/eql/src/lib.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"620f69675933764a9e64c00f6828d4999a51a9501c595a6a019ee2c821e01fae"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060span.total(jiff::Unit::Nanosecond)\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_duration\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":"libs/db/eql/src/lib.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec040d7cb61ead513fe9c278499d4d9817dabbef6e5ae42bbf505afbc7abc87"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060time_series.timestamps()\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 \u0060print_time_series_as_table\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":"libs/db/cli/src/lib.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"62362da02b07e1d27859e7869b768177ba606eb9f347569fa0f5d3ff4e89c7a8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060syntastica::highlight(line,syntastica_parsers::Lang::Lua,\u0026syntastica_parsers::LanguageSetImpl::new(),\u0026mut syntastica::renderer::TerminalRenderer::new(None),syntastica_themes::catppuccin::mocha(),)\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 \u0060highlight\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":"libs/db/cli/src/lib.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"551d077dd2044e32955c65e2f3783399a07814b4aa6a81a8f18f7e09730928b1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060syntastica::highlight(format!(\u0022{:#?}\u0022,value),syntastica_parsers::Lang::Lua,\u0026syntastica_parsers::LanguageSetImpl::new(),\u0026mut syntastica::renderer::TerminalRenderer::new(None),syntastica_themes::catppuccin::mocha(),)\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 \u0060run\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":"libs/db/cli/src/lib.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fab9b0b54932a7d5a1cc392b02c18dd31cfdb601685df8857510933b3baee30"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bytes[off..off\u002B8].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 \u0060read_f64\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":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ad4c2092be252aa4c306da4e8bd0712c0374ca3bc62824cf071f128c3457ae"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bytes[off..off\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 \u0060read_f64\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":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":2407}}}],"partialFingerprints":{"codehealthFindingId/v1":"0984f4c604dd21730272833e105d0aa0bd3657883f69eb99ec8352999c35231b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bytes[off..off\u002B8].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 \u0060read_int\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":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":2427}}}],"partialFingerprints":{"codehealthFindingId/v1":"680a41734fc400db72a12d3cc48438e3a924d8a11b5e60cfbb2c66a7d6e490b9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bytes[off..off\u002B8].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 \u0060read_int\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":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":2431}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b31fd1b2e37425f419109af2f78f32ee931a201905979881ecd250ba363e92"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bytes[off..off\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 \u0060read_int\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":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":2435}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41e412c45e3c87bce671c77660f17adffb91e87412ae6f1d265f4fb9126ad80"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bytes[off..off\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 \u0060read_int\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":"libs/cranelift-mlir/src/interp.rs"},"region":{"startLine":2439}}}],"partialFingerprints":{"codehealthFindingId/v1":"2deb7b50b4b776cdb28330295439d484a7283b765d885925cc617f0f1fbc0f30"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060v.first().copied()\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 \u0060spill_to_slot_pooled\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b70f9d31a1a314912a6ac5ab27763c1968ca1e90d9fac124a0a982242bed600"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060v.first()\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_chunks\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"06756eb19971416b4320134976519cc31c5c1b8bab78bc62cb22c68783270753"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060flag_builder.set(\u0022opt_level\u0022,\u0022speed\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 \u0060compile_module_with_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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":1584}}}],"partialFingerprints":{"codehealthFindingId/v1":"29ba1b68623861f005c6e7c29cbeb35a3e7b9046b5d4b016c17267dbf6be8272"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060flag_builder.set(\u0022is_pic\u0022,\u0022false\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 \u0060compile_module_with_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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":1585}}}],"partialFingerprints":{"codehealthFindingId/v1":"0132cad301e5249bc77eb4e2950c49a2a282e7d49b2282b32fa1576a409d5b7a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060l_tail\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 \u0060lower_ptr_binop_elision_or_spill\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":2898}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eebfe451b604cc666a9d6c49012b067dcd3f12d6269ffb6ec8958e49613b308"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060r_tail\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 \u0060lower_ptr_binop_elision_or_spill\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":2899}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f49b01a9f5eb3217c39812e44cb358003c02b29fb96dde8808f49cafd46ada"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060value_map.get(lhs)\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 \u0060align_packed_f64\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":9116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c87fcdd563b840c6942d25c0389a4183a9118598ee12a65c0f7600dc06044743"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060value_map.get(rhs)\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 \u0060align_packed_f64\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":9129}}}],"partialFingerprints":{"codehealthFindingId/v1":"9627b1e95fc4b98faf78ef1221fc7065b590c5b7241b7e5ea7723c08509e32fe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060faer::linalg::cholesky::llt::compute::cholesky_in_place_req::\u003Cf64\u003E(n,faer::Parallelism::None,Default::default(),)\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 \u0060cranelift_cholesky\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":10512}}}],"partialFingerprints":{"codehealthFindingId/v1":"85c0012d2c4da683269ab188c2ebc5110b8c26c1ee734412d102cafb326340fd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060faer::linalg::qr::no_pivoting::compute::qr_in_place_req::\u003Cf64\u003E(m,n,blocksize,parallelism,params,)\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 \u0060cranelift_qr\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":10583}}}],"partialFingerprints":{"codehealthFindingId/v1":"42e804ef6165f83fa13a17b95772d1b82be3f72450341e47b9f8828fc5186e4c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060faer::linalg::householder::apply_block_householder_sequence_on_the_left_in_place_req::\u003Cf64\u003E(m,blocksize,m,)\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 \u0060cranelift_orgqr\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":"libs/cranelift-mlir/src/lower.rs"},"region":{"startLine":10634}}}],"partialFingerprints":{"codehealthFindingId/v1":"9235717c7844263652d18d6178776c0cc99b4299d473cd8dc70450e17044fa0f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bytes[j..j\u002B8].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 \u0060parse_dense_value\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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":702}}}],"partialFingerprints":{"codehealthFindingId/v1":"93c81c308b9171a7350f6a3aa133bd23681cca5c3070197df6541f74323416ab"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u64::from_str_radix(hex,16)\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_scalar_value\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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"004c99752656380f66fa5a51d7adba0688a03e0e81256fe85eac81f77260c483"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060full.parse()\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 \u0060parse_scalar_value\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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":772}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec6f39042ee15c0e72ae8f19242da3d655afb18a94d3a660b36dd398cb38d4e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060digits.parse()\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 \u0060parse_scalar_value\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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e5a7bc8baaaa95456966e1764aed88809c53fc097ed9f0bde5980dc8d28576e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060digits.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 \u0060integer\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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":3045}}}],"partialFingerprints":{"codehealthFindingId/v1":"599265bac5df65f2c8a4ac93752ca759a4ce87028526d6b6a6dc71279f62b263"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060u64::from_str_radix(hex,16)\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 \u0060float_literal\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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":3053}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e803fb2b44f8c5d6df18242d9436254774048eff507eeb5749c9824a557d2a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060consumed.parse::\u003Cf64\u003E()\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 \u0060float_literal\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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":3078}}}],"partialFingerprints":{"codehealthFindingId/v1":"918fc6803e0918e9877726f47363f8993601998412faf3be6ace168752fb4ac5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parts.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 \u0060parse_result_type_from_str\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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":3189}}}],"partialFingerprints":{"codehealthFindingId/v1":"234ffc30f7afa0261163d205358e0802fcf7b8b87c4793e6a1646a41218fce6c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parts.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 \u0060parse_tensor_type_inner\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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":3249}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6c2faf4a77da48d360b280be24cd76ae1d1353b7a19ea9e866b8e070fe09ed"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060types.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 \u0060make_values\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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":3471}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e8549b93a6ff4497c379bfb6925f79cbf9e7b3e2dbda17a6c75675a280d56b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out.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 \u0060tensor_scatter\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":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d6262d2e9427cf2c8a27cbabe97e9cb0691bb47f5c00facc41eb62c13e3130"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060upd.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 \u0060tensor_scatter\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":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"6163fae615021eeaefc3f3f68919a8065acc4afcb247bd9e2b96e8beb4e866f2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out.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 \u0060tensor_scatter\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":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":1072}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02fbc622b34d53545fdb19442422c8c767922fd52e1f7a507f20e561a7c0799"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060upd.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 \u0060tensor_scatter\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":"libs/cranelift-mlir/src/tensor_rt.rs"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"9da9cbd68fa8293dfc7d1bac3e8b2798273c94c9091ad0e09219583cc7c781e2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cache.get(\u0026key)\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_terrain_tile\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":"libs/bevy_world_mesh/src/fetch.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d39a7509570094c4ea6e404059d79010e875ba0bfcb32f63d308129b88c17d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cache.get(\u0026key)\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_imagery_tile\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":"libs/bevy_world_mesh/src/fetch.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69ddeb225a2c58a3bf80d359060a1056b9343e7b93cd2058e729ffc5aa4d2f1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.cache.get(\u0026key)\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 \u0060tile\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":"libs/bevy_world_mesh/src/fetch.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a42a133bea210495286ebe6fde61748aecc836ca61a96627c4a11e2e9d58486"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.cache.get(\u0026key)\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 \u0060tile\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":"libs/bevy_world_mesh/src/fetch.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d5e06cd2fb70a7e6c46d46304dc9805d1a5162610308ec15b1c2373c07d8c08"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ProgressStyle::with_template(\u0022    {prefix:12} [{elapsed_precise}] [{bar:40.cyan/blue}] \\\n         {pos}/{len} {msg} {per_sec} ETA {eta}\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 \u0060make_progress_bar\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":"libs/bevy_world_mesh/src/fetch_pipeline.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d8cec89e6a4d543d62b9288cd45ee3f5978a05268a45affefc502685ce2df81"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.collect_vec().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 \u0060collect_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":"libs/bevy_world_mesh/src/terrain/util.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"41be60ca14a4c7be6e9a44fb1b0daaa9c625c93491fb3fc881550e36313bbbad"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060scratch.write(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 \u0060write\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":"libs/bevy_world_mesh/src/terrain/util.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9b38b755918a090f0708cf6e1b6eab8183f9f7706e3763e9f9844b68cf5084"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060scratch.write(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 \u0060write\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":"libs/bevy_world_mesh/src/terrain/util.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6813614d258ecf23e16e66a88b1903f3f6cdc6776968050cfbfc60f441c7ab"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.value.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 \u0060value\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":"libs/bevy_world_mesh/src/terrain/util.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc22dc3f12ce489a194cea222c19ab1a480c1a88e8923b9eaaa49a9500e22aa9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tx.try_send(())\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_downloading_tiles\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":"libs/bevy_world_mesh/src/terrain/terrain_data/gpu_tile_atlas.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"d11219605081c3d15601898d4cfb83a763f39b835d66609206fdf9eadd96f515"}},{"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 \u0060start_downloading_tiles\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":"libs/bevy_world_mesh/src/terrain/terrain_data/gpu_tile_atlas.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"300a32b1b21c2c2e1aac3344f8013ef14a7bae85e91e976ae036eacd9e66c26c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060gpu_tile_tree.data.as_slice()\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 \u0060prepare\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":"libs/bevy_world_mesh/src/terrain/terrain_data/gpu_tile_tree.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c44749a521d5b7a32026ee76ee28d1c4dd421a778e7c13c0bc52cf6ab5a4f4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060gpu_tile_tree.origins.as_slice()\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 \u0060prepare\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":"libs/bevy_world_mesh/src/terrain/terrain_data/gpu_tile_tree.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"e267e93666ffd70772165790ced762e03c9901b8cc084faa340f39ff4a8d5c45"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Rgba8Image::from_raw(self.texture_size,self.texture_size,data)\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_saving\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":"libs/bevy_world_mesh/src/terrain/terrain_data/tile_atlas.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd61c67e5a0b2c2790376b9fed16ce1a4efb2691c1773b20f8827cb46cc5a9a2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060R16Image::from_raw(self.texture_size,self.texture_size,data)\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_saving\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":"libs/bevy_world_mesh/src/terrain/terrain_data/tile_atlas.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0e5c582175083f144c9c690725a4a38b5d18b6027461df17855f2013e124634"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Rg16Image::from_raw(self.texture_size,self.texture_size,data)\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_saving\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":"libs/bevy_world_mesh/src/terrain/terrain_data/tile_atlas.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea90b067ad85acf462c90cd4a1729e5a4abe11271e3fa9058188647024a2085"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060image.save(\u0026path)\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_saving\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":"libs/bevy_world_mesh/src/terrain/terrain_data/tile_atlas.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"d644ff330364d6258b9a11c933822b53efed16d4e2fe485b9f860273f44be00a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::write(path,self.data.bytes())\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_saving\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":"libs/bevy_world_mesh/src/terrain/terrain_data/tile_atlas.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1bdb91bf3bfdf1f9af547065cfceb8e92fbf8129a40a753b311278826bca4e1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060reader.decode()\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_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":"libs/bevy_world_mesh/src/terrain/terrain_data/tile_atlas.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"6863e6b8b9f707011f44fe0dc5e3d4ecc37d929ec36bc64c9a5461b9730f6b92"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tc.save_file(asset_path_string(format!(\u0022{}/config.tc\u0022,self.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 \u0060save_tile_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":"libs/bevy_world_mesh/src/terrain/terrain_data/tile_atlas.rs"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f032e9748b01a317a6338b99e1ddd256a1c4d4aee26e9b91504619b5707cf4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060TerrainPipelineFlags::from_bits(msaa_bits)\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_msaa_samples\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":"libs/bevy_world_mesh/src/terrain/render/terrain_material.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5066e54aff81b86617244e984aca1f62a19d685e287ad30e44d9daa45d39d8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060draw_functions.read().get_id::\u003CDrawTerrain\u003CM\u003E\u003E()\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 \u0060queue_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":"libs/bevy_world_mesh/src/terrain/render/terrain_material.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd378b567d97391aba035e47e958973f9cf772f687bdd56b41ec591c28035e0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060gpu_preprocessors.get_mut(\u0026terrain)\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 \u0060extract\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":"libs/bevy_world_mesh/src/terrain/preprocess/gpu_preprocessor.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"96362cc371120f99f5033e00c6e182595d46bf4326e3f8f9f7318ddc27b70ef3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060gpu_preprocessors.get_mut(\u0026terrain)\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 \u0060prepare\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":"libs/bevy_world_mesh/src/terrain/preprocess/gpu_preprocessor.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c82a5f737d846f4067c2bc74b0b24a12fdcc44ad52e79f39c1325ceac473678"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060gpu_tile_atlases.get_mut(\u0026terrain)\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 \u0060prepare\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":"libs/bevy_world_mesh/src/terrain/preprocess/gpu_preprocessor.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74d6cdfa5498e138fe9934323937521db817af304913c80183033959669eed5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060gpu_preprocessor.ready_tasks.back()\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 \u0060prepare\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":"libs/bevy_world_mesh/src/terrain/preprocess/gpu_preprocessor.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdb48e19430eddc519f95682a57a8a099ccee4e3be9f0284373fcddb588437f1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060gpu_preprocessor.ready_tasks.pop_back()\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 \u0060prepare\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":"libs/bevy_world_mesh/src/terrain/preprocess/gpu_preprocessor.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"784da8a29d5c52126137e0fcdf14a73032cb14b5fdd6debf352c3741a594e0c9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060images.get(tile_data)\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 \u0060prepare\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":"libs/bevy_world_mesh/src/terrain/preprocess/gpu_preprocessor.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6ce369986b6b6c3ddb170004e16ebe2e10a66ed1ac53ad0403220dacf2f4fa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060preprocess_data.get(\u0026terrain)\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 \u0060dispatch_terrain_preprocess\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":"libs/bevy_world_mesh/src/terrain/preprocess/mod.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d67f54e0138beeaeae87b217d88949e379209607c63d38b26057a07d29345f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060gpu_tile_atlases.get(\u0026terrain)\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 \u0060dispatch_terrain_preprocess\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":"libs/bevy_world_mesh/src/terrain/preprocess/mod.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8511073e61f3cbc621d5299e7c73b1656c8f7cb365a27eda7e890a95ed99049"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060task.bind_group.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 \u0060dispatch_terrain_preprocess\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":"libs/bevy_world_mesh/src/terrain/preprocess/mod.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2a41dc0a3c164574c2d4062f8f49c62f77383c1acaa26e48d75759abc5879b9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::create_dir_all(directory)\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 \u0060reset_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":"libs/bevy_world_mesh/src/terrain/preprocess/preprocessor.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"edc36ebf956f2205d0becb4aa40540a06d3ca23b6a8f3cf6086694af1a1e73f3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060lods.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 \u0060split_and_downsample\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":"libs/bevy_world_mesh/src/terrain/preprocess/preprocessor.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e17621f4fd23e69d38e5d4b2ac80e84ca0339bfc3b953472f96a11b139cede8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060task_queue.pop_front()\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 \u0060select_ready_tasks\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":"libs/bevy_world_mesh/src/terrain/preprocess/preprocessor.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"28cad12848a9260698081e32f7e758e1585e9a515bca992483edd586d1238d1d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tile_atlases.get(terrain)\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 \u0060generate_terrain_model_approximation\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":"libs/bevy_world_mesh/src/terrain/math/terrain_model.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"d881414c850577f54dc6ad66ed2a7c962e4a4f7715e729d5e3d2dd0c7fdc4c8e"}},{"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 \u0060load\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":"libs/bevy_world_mesh/src/terrain/formats/tiff.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"3180e122a91180e2c4585082c1c48373ea590395d5d51fc4b2b67ffe110d5322"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Decoder::new(Cursor::new(bytes))\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 \u0060load\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":"libs/bevy_world_mesh/src/terrain/formats/tiff.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f21e71c854b56e4084540c94f5cc42a267861e69eec034f22f2ae5833deefb3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060decoder.dimensions()\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 \u0060load\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":"libs/bevy_world_mesh/src/terrain/formats/tiff.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ccf32a59e315820b50a2ed8d3c0aa697a75c5e62bd1d52fb95bff2766e726c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060decoder.read_image()\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 \u0060load\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":"libs/bevy_world_mesh/src/terrain/formats/tiff.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f7481d831bbcf71b0e7a75f15369bde1581239c686ec5bbe584d7ced2e46c5a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060images.get_mut(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 \u0060finish_loading_images\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":"libs/bevy_world_mesh/src/terrain/debug/mod.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4c9bd2276a980314804bc0a34f1687cd56b0d38c8819d6ed958657843064ea3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::create_dir_all(parent)\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 \u0060ensure_parent\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":"libs/bevy_world_mesh/src/bin/synthesize_height.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8093e3c62466f4f6746a90048c245f308058c9977e590673a45b887f12ced5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060img.save(path)\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 \u0060write_planar_height\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":"libs/bevy_world_mesh/src/bin/synthesize_height.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"347a6aa49b3e718f412574b92d2af720d9832438ffbe64c9ceac611851aa6589"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060img.save(path)\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 \u0060write_planar_albedo\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":"libs/bevy_world_mesh/src/bin/synthesize_height.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7cde45240e8ae7cea8a14a421a154708abcbeac6411026256ff922186e9a33c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060img.save(path)\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 \u0060write_gradient\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":"libs/bevy_world_mesh/src/bin/synthesize_height.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e934e47fb560e09d37be8cc637302f4809da3f156b3259ca4bc2c60c3878249"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::create_dir_all(OUT_DIR)\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":"libs/bevy_world_mesh/src/bin/synthesize_spherical_faces.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff00c78e3c4d2da1cb5b998571e64b0f8cfabe5264e64410e9ec2aaa01eb6979"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060img.save(\u0026out_path)\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":"libs/bevy_world_mesh/src/bin/synthesize_spherical_faces.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2691066a0fc99fdece12a6c175f8c94f0f4eb5ae8c438829aec9d1c0243968"}},{"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 \u0060wait_for_not_empty\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":"libs/bbqueue/src/traits/notifier/maitake.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1540521fbddef2983617b51508aea8159d7224c51bdabf9825a5fa9cb79018"}},{"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 \u0060wait_for_not_full\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":"libs/bbqueue/src/traits/notifier/maitake.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afaee4e07fc00904599dd4e6e245ed6edbe4a89ed21b130d7365f31e9210e3d"}},{"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 \u0060connect\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":"fsw/serial-bridge/src/main.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"bea088cfdf3d43c8faa0632917f3ca948d6566bfea1333d5527e25ae8f1d3226"}},{"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 \u0060connect\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":"fsw/serial-bridge/src/main.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a7078da02c8e3ba4059189b3051b465ac066abd1ce33ceccd10228795c4231"}},{"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 \u0060connect\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":"fsw/serial-bridge/src/main.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79f8cd6066d5e1e15d79759ad94fe8676aa6fed47390d0a5a293368d9d03328"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060env::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":"fsw/sensor-fw/build.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1cf497e20ca85ff21db6ecbe2e57186b770a2b6a1b97be605bd3e943e34b224"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060File::create(out.join(\u0022memory.x\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":"fsw/sensor-fw/build.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9981f784b5c3419d3baa7647d1a458885ebdfa77b3007e6c0d333f85c7ff62e6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060File::create(out.join(\u0022memory.x\u0022)).unwrap().write_all(include_bytes!(\u0022memory.x\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":"fsw/sensor-fw/build.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaae161a7bbc482329e8853f2022ce459342591e3e01b74df1370174c34b89e1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060core::str::from_utf8(volume_label)\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 \u0060blackbox\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":"fsw/sensor-fw/src/blackbox.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"110c78922d2340281d03b2b6f5a2f10102e880d2d0d3c683735618cd1ae1edce"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060now.checked_duration_since(self.created_at)\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 \u0060needs_reset\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":"fsw/sensor-fw/src/blackbox.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06d2706237b58d48fdc1a8432271c6db27e9877097b28238afd25ead26118a8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(\u0026self.frame_buffer[3..25]).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 \u0060process_frame\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":"fsw/sensor-fw/src/crsf.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"989cc852724474e2586f111f3ba5e326343c2ec7dbb00a99a3437b63ef7c839b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.buf[..2].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 \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":"fsw/sensor-fw/src/dronecan.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf8a035af10e83ef98e9d8e82a3427d68b8df852ce5e0d47709cd1716c99b8c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Frame::new(throttle.0,false)\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_throttle\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":"fsw/sensor-fw/src/dshot.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0fd2103fc4d82f10f0291425ddc93865ed0ef63a60db91ca9cae67061600f4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bsp::Pins::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 \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":"fsw/sensor-fw/src/main.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e46a29fc4fc6c611481bc27de00171deaa9120f5eea96b9ab8ea49bda0c984"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cortex_m::Peripherals::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 \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":"fsw/sensor-fw/src/main.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"9862b95a9dec9ab2ab3d4ecffc1511b4b86476f124cca52a4166709875131b48"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pac::Peripherals::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 \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":"fsw/sensor-fw/src/main.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"f129accb488122f8b0165df8a2876d853baf7baeab38e3665e818a3d71ba8a5e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060clock_cfg.setup()\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":"fsw/sensor-fw/src/main.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"902f1ab6d1148fa71555dc0e63bbefd9429d83db9a17537acfe800874ff3da3b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060now.checked_duration_since(last_elrs_update)\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":"fsw/sensor-fw/src/main.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ca57bffdf34e560e01b77b0648f96e714f5cf98a0c9571d80797f9a414f538"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060now.checked_duration_since(last_dshot_update)\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":"fsw/sensor-fw/src/main.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"66da47ccb5fa139bde02169b56858dc1e77f0a0205ff65abac724b9448708976"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060now.checked_duration_since(last_can_update)\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":"fsw/sensor-fw/src/main.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"193b1c56fe34a6e4866962fbf36dfb5ce5b50a87e955bef24685142c72c1826e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060now.checked_duration_since(last_usb_log)\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":"fsw/sensor-fw/src/main.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc316010a862bfadd6091ba68fb99e3c3c702d0b7d9e76d8f7e833dca3eb8081"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bmi270.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 \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":"fsw/sensor-fw/src/main.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fb622db0057e69002d42a9f04295dc34d6d32dcdc267fa5152e24f3547990b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bmi270_spi.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 \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":"fsw/sensor-fw/src/main.rs"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e0c631f6a514a92ea078a45b3cf4c8688cd7dfb9053cba2c974e2a6d7d2d7b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060now.checked_duration_since(last_diag)\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":"fsw/sensor-fw/src/main.rs"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"53d136c7c72117c81912767303e2b7787886a7c766ed4a297b088b80c4a1ea00"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ext_compass.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 \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":"fsw/sensor-fw/src/main.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"45fbbd2eaa56a3af6e93c11614e5cffd6ad61671666870859e29a16bf5a06c57"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060debug_uart.write_fmt(format_args!(\u0022{}\\r\\n\u0022,ts))\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":"fsw/sensor-fw/src/main.rs"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"84217fa30bf6cc2f47d31a5831998a9d501cbdef0f8eab6b4a93fd5c550de2ec"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.writer.flush()\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\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":"fsw/roci/src/csv.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb99ff598b91900df500686be2a3302b5a725e2aa1389f1838872c92adaea302"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Runtime::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 \u0060tcp_listen\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":"fsw/roci/src/tokio.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"66862cc3b3edd20e34870d652147d8678f59c180cea24a7e2aa3c15f2b277b2b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ColumnPayload::try_from_value_iter(0,[ColumnValue{entity_id:*entity_id,value:value.clone(),}].into_iter(),)\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 \u0060run\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":"fsw/roci/src/tokio.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"492165cfc842167624d90016f4988b3e21379190f99ea91fe9ea3c6db6ea82fd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Runtime::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 \u0060tcp_connect\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":"fsw/roci/src/tokio.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90e45efdde4d075e26c85b6cf63ac8c978e0361ebdc148eeab794279dd5a8e7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ColumnPayload::try_from_value_iter(0,[ColumnValue{entity_id,value:value.into_dyn(),}].into_iter(),)\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 \u0060run\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":"fsw/roci/src/tokio.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d629a7279fbf4a4d60bb869f85412b7ca0b9f5194512acc7190727e71a966f8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060wmm::Epoch::now()\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 \u0060run\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":"fsw/mekf/src/main.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"5458b4c9e6afd6180049cf7fa7dafb7cb66c449db229c7df59401b2688a62150"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060gst::PadTemplate::new(\u0022sink\u0022,gst::PadDirection::Sink,gst::PadPresence::Always,\u0026caps,)\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 \u0060pad_templates\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":"fsw/gstreamer/src/lib.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"5192263e22e54e2160dc92b161fc6b6973026feb104d07166e7ff27647206da9"}},{"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 \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":"fsw/blackbox/src/main.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc68316bbcbba4eee8ab5a9faebb3e9612c73d86706f0b69644a7cae45393f0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::File::open(input_file)\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":"fsw/blackbox/src/main.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"d221bb29ba696ad6853702f5f202047e3796b4a081d81403f019020768c6cd67"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060input_file.read_to_end(\u0026mut 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 \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":"fsw/blackbox/src/main.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"26f5f3a74053151c64ad52180369b20966a0fc361fc6b7c8b7db3ff20e1fced3"}},{"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 \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":"fsw/aleph-status/src/main.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe32f66984b398169558c7719e5442b1b51bff001b57ef1fcd4680e7edf0a45"}},{"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 \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":"fsw/aleph-status/src/main.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cbc2083c402b6f8edc32a360b64d7f43001b7ceeebdc75412e862b180aa559a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060image::load_from_memory(LOGO_PNG)\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 \u0060print_logo\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":"fsw/aleph-status/src/main.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f3e5b6635f230729de5274a0055bb9be8197bb9bbce85affe603c5a96f8922"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060network_names.iter().position(|name|name==\u0026selected_network)\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 \u0060connect_to_wifi\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":"fsw/aleph-setup/src/main.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cacff9477ecbb70320a368819adc4c36a95a46331ffbe904e3ac68d47839bdd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.stream.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 \u0060accept\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":"docs/memserve/memserve.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae690d7e7861d9dde3bee732ac196dc3448e7e1d23325aca8ce57683cc32744"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060poll.registry().register(self.stream.as_mut().unwrap(),self.token,Interest::READABLE.add(Interest::WRITABLE),)\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 \u0060accept\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":"docs/memserve/memserve.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d676bf7ec32923c0b1214b0f2c64660bf86cb5e534b0af7d2969f2c1c4fb951"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060poll.registry().deregister(\u0026mut stream)\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 \u0060close\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":"docs/memserve/memserve.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"64021f23ab511c57c881ed1ecad56466443795a96321222d6a74d0246d13ebc0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::str::from_utf8(\u0026self.path_buf[..self.path_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 \u0060path\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":"docs/memserve/memserve.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"47c526ce99543cd4af333f803c5f1b2c45d6c3a0ccf4d287cbee9f4b6e7f98ec"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::read_dir(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":"docs/memserve/memserve.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb6fcc96c5e693520609e7948044e5709b1b489ec2146e5a2973e76286692ae"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.strip_prefix(\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 \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":"docs/memserve/memserve.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dca39afdccb1540785ed537d5fd25933ea3add4fb802dc61efaee9d4f21d832"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.to_str()\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":"docs/memserve/memserve.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74e16d73125fa0993cb9d1be2b6333f21f0220d7851be75d6cf6cda2b3fe12f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060addr.to_socket_addrs()?.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 \u0060serve\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":"docs/memserve/memserve.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"7187c1e33727a678d2c5a7c4098bb8999f8e7393f8253035c9ffa5ad211439ee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_name()\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 \u0060put\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":"docs/memserve/memserve.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffcada19d24fe75cbc2980e725a9cc02a5f9a34f9c51fbbba33737b86359617c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_name().unwrap().to_str()\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 \u0060put\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":"docs/memserve/memserve.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c72304c4dd536554bf9068fe4e17a880f9dd9ed0540c40e0784c5c64c3e567b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.parent()\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 \u0060put\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":"docs/memserve/memserve.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7886e489658836db9135160507c093a04b859f824d06389383be135ba446ec8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.parent().unwrap().to_str()\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 \u0060put\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":"docs/memserve/memserve.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ab66d08525ad92b11a58d1d774eaa91cb1cca6cc877ac3ad73318da0984614a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060encoder.write_all(response.body)\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 \u0060put\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":"docs/memserve/memserve.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"524735a0c9100d14a6c44162d4077d2df32c9fa7a6d8b37cf5edf65cdcfa894d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060encoder.finish()\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 \u0060put\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":"docs/memserve/memserve.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a4a31547254367915d167c78a10a98cfdf71df9469148ea412953eb4b7cf25"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(\u0026mut header,\u0022HTTP/1.1 200 OK\\r\\n\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 \u0060http_response\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":"docs/memserve/memserve.rs"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18a19e3df177479242aad166f4578b30f95090d7d6bd840775b773d60cb0293"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(\u0026mut header,\u0022Content-Encoding: gzip\\r\\n\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 \u0060http_response\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":"docs/memserve/memserve.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c79f6a9eeb36f7464e274954bc34c4a31b07ddecebdbe3297d7e2c273373e8b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(\u0026mut header,\u0022Content-Type: {}\\r\\n\u0022,content_type)\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 \u0060http_response\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":"docs/memserve/memserve.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfdf6743c24cfc28a8ab5e9d40bc1e9e2f1b2beb989be8b9a5d6502f0434fac"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(\u0026mut header,\u0022Content-Length: {}\\r\\n\u0022,body.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 \u0060http_response\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":"docs/memserve/memserve.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"04cfb8cd755d57b9744caed43244f1ada3e3270ed1f3b695434d60200f778f33"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(\u0026mut header,\u0022ETag: \\\u0022{:x}\\\u0022\\r\\n\u0022,etag)\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 \u0060http_response\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":"docs/memserve/memserve.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"2441e47544502ef2768780d25df545bb75b3cd2c14e7ba2aa25fccfbd5430b2b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(\u0026mut header,\u0022Cache-Control: {}\\r\\n\u0022,cache_control)\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 \u0060http_response\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":"docs/memserve/memserve.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"a62eab82bdfbd5e56d525c3738c5d781bd5869e7317387b0cc73543eae914231"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(\u0026mut header,\u0022Vary: Accept-Encoding\\r\\n\\r\\n\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 \u0060http_response\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":"docs/memserve/memserve.rs"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece8bc57141682efb144fcb28e20f9c596dcbc0e842c34578bc536a792bd6eeb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(\u0026mut header,\u0022HTTP/1.1 404 Not Found\\r\\n\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 \u0060custom_not_found\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":"docs/memserve/memserve.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"e066f10a3dd65d04064d90a03918f0a8aa9eae74d689e064dfd80e39eb78d242"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(\u0026mut header,\u0022Content-Type: text/html\\r\\n\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 \u0060custom_not_found\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":"docs/memserve/memserve.rs"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a824546b224c2d488e7c871462adf500d538aecd82ec520611b2b331ba96b0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(\u0026mut header,\u0022Content-Length: {}\\r\\n\\r\\n\u0022,body.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 \u0060custom_not_found\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":"docs/memserve/memserve.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"554239cba1ee79af2a4672405c30c34c133c17892920713d88a73ecd0a1b8de2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060content_type.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 \u0060gzippable\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":"docs/memserve/memserve.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"3737391ac41f38d9dcc9805fd4b7f9a3aa0531bee6f37241b2a75d115a44b132"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060content_type.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 \u0060gzippable\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":"docs/memserve/memserve.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9fb4d4c910b99e56aa0f53d326ba623f3d751e66fa8c8b3a826b9fa5613e1d0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060env::args().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 \u0060print_usage_and_exit\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":"docs/memserve/memserve.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"be62caf1ea2a31ade7016c4b30b523de5928441b8072f8a44e190cfb1fa443d0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ContentStore::new(\u0026content_root)\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":"docs/memserve/memserve.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf86190cf04ee3209598e8491a4909ce2ae75c70696c976f254c72950468e4f6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cs.serve(\u0026bind_address)\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":"docs/memserve/memserve.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da2d2e530b0c97b0a66895a7116a16359bcc49a6b71bc9aad7f5554a0a5b5d5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060disks.into_iter().find(|f|f.to_string()==disk)\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":"apps/inscriber/src/main.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee56d1784b838abd2f459dbc07bbdfc51aa1e95d1bce568678dbe79327e5ebc0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060temp_buf.try_slice(..result.bytes_written)\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":"apps/inscriber/src/main.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a008dae34dcca2b3f6e853c231d9a0689bc67aab88781e7cbcbc95c41f4458f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buf.try_slice(..read)\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":"apps/inscriber/src/main.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4dda341850d659f9936a18259e1819483ded2a9ab7976ad80253e8fa65674c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060res\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 \u0060run_sim\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":"apps/elodin/src/cli/editor.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5378ae747e07bc30b4ac03ea83822369eaac0302561ceda1428573754e8c927"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::current_exe()\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 \u0060run\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":"apps/elodin/src/cli/mod.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"1efb831b93842210643eae86d354d3c99be71240d12400fc0cad4f30b83ced8b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tokio::runtime::Builder::new_current_thread().enable_all().build()\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 \u0060run\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":"apps/elodin/src/cli/mod.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a4fe413dbda47db56455e6d41da18ca653d5e7fe43d1ae6262e70c3ca336d2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060count\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 \u0060point_count\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":"apps/elodin/src/cli/terrain.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e70a1cac6bfa33a92e430cdadb7eabfe2f31a3badc0c8f32382d49d6b7f7521"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SystemRandom::new().fill(\u0026mut 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 \u0060pkce\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":"apps/elodin/src/cli/cloud/auth/mod.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db845dd5e3bf53d7827030e29782b2463dff5e21a3ac8b456a1bbed4cf09c6e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060SystemRandom::new().fill(\u0026mut 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 \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":"apps/elodin/src/cli/cloud/auth/mod.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d352deb33eda69ee1e57c1d65560763b989a44cf9351d4d7ceafb0f285b35dc2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060read_json\u0060 returns \u0060{}\u0060 when \u0060(OSError, json.JSONDecodeError)\u0060 is raised, with no log or raise \u2014 a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/falcon9/hooks/mc_metrics.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"389f47a697f8132da891ca0729833b8137115c69503bade452178b9e04656e98"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060redact\u0060 turns every \u0060Err\u0060 into \u0060\u0022\u003Cinvalid url\u003E\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"fsw/rtsp-streamer/src/main.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdcc85136f9899df089769f221240cbbb54b5230af708b121209d55f373542dd"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060parse_scatter_op\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":"libs/cranelift-mlir/src/parser.rs"},"region":{"startLine":1547}}}],"partialFingerprints":{"codehealthFindingId/v1":"1608a5cf859d4912f5645296395fec508ff2326f1f18c38ec19d7cf8d950c36c"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060get_string_suggestions\u0060 turns every \u0060Err\u0060 into \u0060vec![]\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":"libs/db/eql/src/lib.rs"},"region":{"startLine":792}}}],"partialFingerprints":{"codehealthFindingId/v1":"f609b5fe168b0c367e9894cc22441c784fd3db81ffe97ec1fde6cebfd56831b2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060from_env\u0060 turns every \u0060Err\u0060 into \u0060Self::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":"libs/db/src/assets_http.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd25cf1e34e7d755713735ea91e5eb6612387e6bd991f7b26cceea88de17ee82"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060ui_system\u0060 turns every \u0060Err\u0060 into \u0060Default::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":"libs/elodin-editor/src/ui/inspector/mod.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a333f2efe9eb0ce50f653141e21b4b519f3dd97a9795c7bfd2aebf5301b98d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060compute_hover_targets\u0060 turns every \u0060Err\u0060 into \u0060vec![]\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":"libs/elodin-editor/src/plugins/view_cube/interactions.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bb6b5d5917f74df601a72042b1e1f2228fd019715201e8651015a6d63aec106"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060attitude_readout\u0060 turns every \u0060Err\u0060 into \u0060\u0022PITCH \u2014  ROLL \u2014\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/elodin-editor/src/ui/gauges/horizon.rs"},"region":{"startLine":639}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3f5c71382132504a454398ab238e88620e2c98692a283a23b5332b277720c0"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060recent_files\u0060 turns every \u0060Err\u0060 into \u0060RecentItems::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":"libs/elodin-editor/src/ui/startup_window.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"349dadb664d39eb0e15a829fdb972a7810da1a840a68448d1110e7314e385923"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_resource_samples\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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":1880}}}],"partialFingerprints":{"codehealthFindingId/v1":"251a911cf935331d65069511f649fe1b3ce45e64c039fb80e6449a83d45acbb7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_post_run_outcome\u0060 turns every \u0060Err\u0060 into \u0060HookOutcome::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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":2450}}}],"partialFingerprints":{"codehealthFindingId/v1":"dce21b1b749faaad0e8a03713301d3b31f96b3093547f7d8127a8515ab4a7e99"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060sample_cache_mappings\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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":3713}}}],"partialFingerprints":{"codehealthFindingId/v1":"74eae5e294384a9b8d99bddd3dafc150159f74fb4df557a123a2eb37ad0411b1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_per_core_cpu_samples\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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":4033}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a43a3ed0a4a1c3d01a8d2d764eed8176f5347e9a64648409d96ccbcd33ba2a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060sample_run_processes\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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":4115}}}],"partialFingerprints":{"codehealthFindingId/v1":"f35e0d35c5970376cd012a083486bf9cee6b8c0614503024dd96d1e3f658fbcb"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060read_proc_rss_kib\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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":4199}}}],"partialFingerprints":{"codehealthFindingId/v1":"f239321f06d182057be20131b56f5cd66d57b3952ce6606ce8a4ac0e0775a028"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060dir_size\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":"libs/monte-carlo/src/lib.rs"},"region":{"startLine":4232}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba4e400f19d239d4f376976b85991eec0d6d3795555d24e83417ff95aa022f71"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060pop\u0060 turns every \u0060Err\u0060 into \u0060true\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":"libs/nox-py/src/db/client.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"2752b88fc224fed70fa1f1503866f621408585d540cd26dcd76648742671c528"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060state\u0060 turns every \u0060Err\u0060 into \u0060\u0022Unknown\u0022.to_string()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/db/client.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"4101444dba5e89d2173065f619a2a52ea3a63049fef0245b3a552683a8ea5b38"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060push_nowait\u0060 turns every \u0060Err\u0060 into \u00601\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":"libs/nox-py/src/db/writer.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"eead7c4571955b77c54e86543694b4a1b3683e0e412086eca935d5bdabb4831b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060pop\u0060 turns every \u0060Err\u0060 into \u0060true\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":"libs/nox-py/src/db/writer.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"d678ecfc8d9a52baa854e6273494c7f3c897d88cda2c6064d34c3ad3c184106a"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060__eq__\u0060 turns every \u0060Err\u0060 into \u0060Ok(false)\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":"libs/nox-py/src/ui/mod.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d89eba73869163bdbe67b28cb9d2055b3604531cc1199f70d99247efa2347cf"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060op_name.contains(\u0022rsqrt\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060op_name.contains(\u0022rsqrt\u0022)\u0060 also satisfies \u0060op_name.contains(\u0022sqrt\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/nox-py/src/world_builder.rs"},"region":{"startLine":1479}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e09e5a95b0e02c2b5a0498a3273104ac986e717d49cbb6b8b7f6af4a8460bd"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060msg.contains(\u0022at most one timeline\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060msg.contains(\u0022at most one timeline\u0022)\u0060 also satisfies \u0060msg.contains(\u0022timeline\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"libs/impeller/kdl/src/de.rs"},"region":{"startLine":2934}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e09444f27940cf7ca30d4a4d8da6d8c5ce42431b4e695ff72b3ced2ef7d431"}}],"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-191","guid":"31b5d115-a84b-875f-a016-48689827db3c","name":"CWE-191","shortDescription":{"text":"CWE-191"},"helpUri":"https://cwe.mitre.org/data/definitions/191.html"},{"id":"CWE-200","guid":"b0ce3b1d-7a29-fe50-8aab-9aba899d2988","name":"Exposure of Sensitive Information to an Unauthorized Actor","shortDescription":{"text":"Exposure of Sensitive Information to an Unauthorized Actor"},"helpUri":"https://cwe.mitre.org/data/definitions/200.html"},{"id":"CWE-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.html"},{"id":"CWE-248","guid":"64b58946-d244-a556-a48a-f82fcd4f4186","name":"Uncaught Exception","shortDescription":{"text":"Uncaught Exception"},"helpUri":"https://cwe.mitre.org/data/definitions/248.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-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-502","guid":"f7d3b296-aac0-5c5a-b706-e07faba26c36","name":"Deserialization of Untrusted Data","shortDescription":{"text":"Deserialization of Untrusted Data"},"helpUri":"https://cwe.mitre.org/data/definitions/502.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-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"Insertion of Sensitive Information into Log File","shortDescription":{"text":"Insertion of Sensitive Information into Log File"},"helpUri":"https://cwe.mitre.org/data/definitions/532.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-939","guid":"12397742-f2c4-8254-8012-482c3356c551","name":"CWE-939","shortDescription":{"text":"CWE-939"},"helpUri":"https://cwe.mitre.org/data/definitions/939.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"},{"id":"CWE-95","guid":"400bba4e-483c-5c50-a695-114fa9168003","name":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Directives in Dynamically Evaluated Code (\u0027Eval Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/95.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":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"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/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_Failures/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"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-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"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":171,"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."]}]}