{"$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":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX8","name":"Test isolation","shortDescription":{"text":"Test isolation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX8"},{"id":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"ED1","name":"Handler temporal coupling","shortDescription":{"text":"Handler temporal coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/ED1"},{"id":"ED4","name":"Outbox / dual-write","shortDescription":{"text":"Outbox / dual-write"},"helpUri":"https://codehealth.canine.dev/dimensions/ED4"},{"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":"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":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"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":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"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":"App::run_system_command (cyclomatic 94): App::run_system_command has cyclomatic complexity 94 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/command_handling.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d2b85e315587052dfc3080b731a758e3862872c7b46944459819fe0e75b7bb"}},{"ruleId":"D1","level":"warning","message":{"text":"TimeControl::handle_time_command (cyclomatic 59): TimeControl::handle_time_command has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/time_control/command.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67bf753ba3aa05b3cbc9f180fa7a96dd6e3afabfe93eefae1c02b5fbcaaf92d"}},{"ruleId":"D1","level":"warning","message":{"text":"App::run_ui_command (cyclomatic 55): App::run_ui_command has cyclomatic complexity 55 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/command_handling.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8b94574b50f1048351cb50c433709d718afcee19fcb0133ddbe8895b24c2ca"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_types_core::reflection::generic_placeholder_for_datatype (cyclomatic 49): dl_types_core::reflection::generic_placeholder_for_datatype 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":"crates/store/dl_types_core/src/reflection.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"3664e35912b8aec661acc0932c5cb8995c1e1c5beef7c6c77f062e22ed058410"}},{"ruleId":"D1","level":"warning","message":{"text":"App::ui (cyclomatic 45): App::ui has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/mod.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"229b3c0d387f0df5e85cc484150431bcf55dbd0935ed566dab82e050360d9ab0"}},{"ruleId":"D1","level":"warning","message":{"text":"ChunkStore::insert_chunk_impl (cyclomatic 43): ChunkStore::insert_chunk_impl has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/writes.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60adbeaa783b978929166d05d8761bafb0bb2fed57227fa44274bef6640f6c9"}},{"ruleId":"D1","level":"warning","message":{"text":"compare_snippet_output.main (cyclomatic 41): compare_snippet_output.main 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":"docs/snippets/compare_snippet_output.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"511f72447e15ea9854395e0a6f4669d45c56eee8edb95528116864cc6aeea3b5"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_types_builder::codegen::python::code_for_struct (cyclomatic 40): dl_types_builder::codegen::python::code_for_struct has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"53190ba76b81e935f78478795d193d0779318a5653ddedc6c178f21c930bc91d"}},{"ruleId":"D1","level":"warning","message":{"text":"TimeSeriesView::ui (cyclomatic 40): TimeSeriesView::ui has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/view_class.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad8a5526c5a847452de9076f5f61dc4f12c55fb6b3a87fd78c4e77ea5b80efe"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_types_builder::codegen::rust::serializer::quote_arrow_field_serializer (cyclomatic 39): dl_types_builder::codegen::rust::serializer::quote_arrow_field_serializer has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/serializer.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c47a8398a3e47a28a5c9eeb1f1f65295d5d2564da768ef15ec95428c15c13db"}},{"ruleId":"D1","level":"warning","message":{"text":"QueryHandle::try_bulk_emit_run (cyclomatic 38): QueryHandle::try_bulk_emit_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":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":2132}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcace613839347f84a52fd8125f9a5aa78222b916a297e846ebe81e206bb9876"}},{"ruleId":"D1","level":"warning","message":{"text":"AppState::show (cyclomatic 38): AppState::show has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app_state.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb44e45fdc8441abeca52f0b107f32e94212b0f56e3c4d898d20e3f4d10458f"}},{"ruleId":"D1","level":"warning","message":{"text":"QueryCache::on_events (cyclomatic 37): QueryCache::on_events has cyclomatic complexity 37 (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":"crates/store/dl_query/src/cache.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c563890244320fa9ed39e6f79d8b153ad4977302b618e45a5e3c3e370eabe3"}},{"ruleId":"D1","level":"warning","message":{"text":"App::run_recording_command (cyclomatic 37): App::run_recording_command has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/command_handling.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a4258627be2503dc03dfd5fb5c23bc60cc54c9bba0390d6c04c4170b98fd6bc"}},{"ruleId":"D1","level":"warning","message":{"text":"QueryHandle::_next_n_rows (cyclomatic 34): QueryHandle::_next_n_rows has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"1745341b7ce6623a691b2f02f2bfce3dd4f0b2e3f8f742edf50a94fbf93239ad"}},{"ruleId":"D1","level":"warning","message":{"text":"BarChartView::ui (cyclomatic 34): BarChartView::ui has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_bar_chart/src/view_class.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"923a36f4ac94831571334a9f4b69bdb56d4e04d0ef5784f37f0315e96d20ce3f"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_datafusion::dataframe_query_provider::cpu_worker::chunk_store_cpu_worker_thread (cyclomatic 32): dl_datafusion::dataframe_query_provider::cpu_worker::chunk_store_cpu_worker_thread has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa8a9d0dc99c56f923863f299bb994820e58c317ea4051a0f8b628724120e1c"}},{"ruleId":"D1","level":"warning","message":{"text":"StateTimelineView::ui (cyclomatic 32): StateTimelineView::ui has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_state_timeline/src/view_class.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"bebe904c03d0f4951f65464e755bb77f62140d910f81932478fc405f80b47b90"}},{"ruleId":"D1","level":"warning","message":{"text":"DalaranCloudHandler::query_dataset (cyclomatic 31): DalaranCloudHandler::query_dataset has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df7af811b2cb1af784cda831ee27e8083a94802db0a05b2a1dff33d7f5d7338"}},{"ruleId":"D1","level":"warning","message":{"text":"DurationFormatOptions::format_nanos (cyclomatic 31): DurationFormatOptions::format_nanos has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_format/src/duration.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"17af7db5962e60b01924fd3e5fe45bd270f8afa505f7173c14fcfeb53d1a6f34"}},{"ruleId":"D1","level":"warning","message":{"text":"ServerModal::ui (cyclomatic 31): ServerModal::ui has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_redap_browser/src/server_modal.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40484af7105d65c0bf6366a59c26da2b678038ec3a3707c420480549ca6fe6e"}},{"ruleId":"D1","level":"warning","message":{"text":"ViewportUi::viewport_ui (cyclomatic 31): ViewportUi::viewport_ui has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport/src/viewport_ui.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"276a55459c64828e2715ff922047d7f24117cfbdb939a612d44a7b1bb112a5c6"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_types_builder::codegen::python::quote_arrow_serialization (cyclomatic 29): dl_types_builder::codegen::python::quote_arrow_serialization has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":2446}}}],"partialFingerprints":{"codehealthFindingId/v1":"2659f121b6ba729391fe85d0e91ea605c61079db8cbbd3fb5b4483175b0af60d"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_view_text_log::view_class::table_ui (cyclomatic 29): dl_view_text_log::view_class::table_ui has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_text_log/src/view_class.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f84fa8bf708a6d3aada04d131c753a655b0791076ead4825ee9effdc70db526"}},{"ruleId":"D1","level":"warning","message":{"text":"CommandPaletteProviderImpl::all_matching (cyclomatic 29): CommandPaletteProviderImpl::all_matching has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/command_palette.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"3075fdfaf2f4bc07776995446830a3ca8c992d8201c736794cd46b2c9afb8c41"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageExt.__init__ (cyclomatic 29): ImageExt.__init__ 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":"dalaran_py/dalaran_sdk/dalaran/archetypes/image_ext.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9bc3e097d64edaec52b24020efb9795d5f0d42bf21c7a8869409e2a5350f45f"}},{"ruleId":"D1","level":"warning","message":{"text":"Objects::resolve_and_validate (cyclomatic 28): Objects::resolve_and_validate has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/objects/mod.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b79a667631601bfad0f477e9ddfc001748e6bd1b8d8dcfe5c66ec9bf50a744"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_types_builder::docs::doclink_translation::try_translate_doclink (cyclomatic 28): dl_types_builder::docs::doclink_translation::try_translate_doclink has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/docs.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5c45185c94b188c82722ae66db773dc12a7c465a59ee37eab9d57382b6a761b"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_types_builder::objects::from_fbs::type_from_raw_type (cyclomatic 28): dl_types_builder::objects::from_fbs::type_from_raw_type has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/objects/from_fbs.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d3c8cf057496daec37d84f33bf9c588a57d0d3754337a83915bc0c9e0fcc53"}},{"ruleId":"D1","level":"warning","message":{"text":"LogDataSource::from_uri (cyclomatic 28): LogDataSource::from_uri has cyclomatic complexity 28 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 10 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_data_source/src/data_source.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c99099c74fec986f64128f96660c89fe68c38d4b2241a9bb074e3341eddf3cf"}},{"ruleId":"D1","level":"warning","message":{"text":"Telemetry::init (cyclomatic 28): Telemetry::init has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_perf_telemetry/src/telemetry.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef951164ad9c09b179b518eee245a1e8170b7096d6539f9de0ba75c0cbd5905"}},{"ruleId":"D1","level":"warning","message":{"text":"SpatialView3D::view_3d (cyclomatic 28): SpatialView3D::view_3d has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/ui_3d.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a9cf89b7f6976a1141b36cd40b4d910e77aad09f714e7dffc84a1b5bd088f91"}},{"ruleId":"D1","level":"warning","message":{"text":"ItemCollection::copy_to_clipboard (cyclomatic 28): ItemCollection::copy_to_clipboard has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/item_collection.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"c46d3c82781d5f0bb08ebfff77a1203e4d655f6935e2b457eabf8cce55d36fa5"}},{"ruleId":"D1","level":"warning","message":{"text":"QueryHandle::_resolve_one_row (cyclomatic 27): QueryHandle::_resolve_one_row has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0ba18b515cf94ad6d2bdffd7eee44abf8908b13b409307fdd6b586fe87fd2a"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_time_panel::time_selection_ui::loop_selection_ui (cyclomatic 27): dl_time_panel::time_selection_ui::loop_selection_ui has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_panel/src/time_selection_ui.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3ce2e4bf50a379f4fcb031b802ffe6a3c95e0af8f13ec9c74e720283426e5f"}},{"ruleId":"D1","level":"warning","message":{"text":"ListItem::ui (cyclomatic 27): ListItem::ui has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/list_item/list_item.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb46964185674af0bc8f9c46f96dacf3dab6fd5bc50c3c96e5842a55e7d4ffe"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_types_builder::codegen::cpp::quote_fill_arrow_array_builder (cyclomatic 26): dl_types_builder::codegen::cpp::quote_fill_arrow_array_builder has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/cpp/mod.rs"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"e941356d3cb33bb365f05bee6cca47804fe618a914bacd6991cda3276e6b7bd4"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_video::decode::ffmpeg_cli::ffmpeg::read_ffmpeg_output (cyclomatic 26): dl_video::decode::ffmpeg_cli::ffmpeg::read_ffmpeg_output has cyclomatic complexity 26 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/decode/ffmpeg_cli/ffmpeg.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ab061cb41e512edecdb9d3417f2cfa1a3d428f449ebd1e5eb9d5e2011cf1f5a"}},{"ruleId":"D1","level":"warning","message":{"text":"CommandPalette::alternatives_ui (cyclomatic 26): CommandPalette::alternatives_ui has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/command_palette.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ba9133714e8114bee2ba78cce48e641a53c3c47eb43ccc78cb5a6c9c6a5b0b"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_viewport_blueprint::viewport_blueprint::apply_viewport_command (cyclomatic 26): dl_viewport_blueprint::viewport_blueprint::apply_viewport_command has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/viewport_blueprint.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ff774e8d94b3b5c79bc8a3e5f141047beec24587691e0a8b766c2178dd3b40"}},{"ruleId":"D1","level":"warning","message":{"text":"CrateVersion::try_parse (cyclomatic 25): CrateVersion::try_parse has cyclomatic complexity 25 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 4 belong to 2 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_build_info/src/crate_version.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"11f5bd068b99992f05da4a522bbce0746ca17edefd422a62662b4dd2dd26dbb0"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::eval (cyclomatic 25): Expr::eval has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/selector/eval.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0115ddccfbbfc990be4a7e84e9d2c9c0e2802eabe74bb819bacd644c09cfd22"}},{"ruleId":"D1","level":"warning","message":{"text":"MessageDecoderRunner::process (cyclomatic 25): MessageDecoderRunner::process has cyclomatic complexity 25 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/decoders/mod.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37b61561483cfcbf669555b8213e009ed38475f1a5b80e49b2d088a1292e5dd"}},{"ruleId":"D1","level":"warning","message":{"text":"SelectionPanel::item_ui (cyclomatic 25): SelectionPanel::item_ui has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/selection_panel.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"6691b0e0397f6b802899319a634b4b1365ae52241e2bb5114db440b0c5c225e8"}},{"ruleId":"D1","level":"warning","message":{"text":"TimeControl::update (cyclomatic 25): TimeControl::update has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/time_control/mod.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"e44160e77856486ca472176d179fdd40d360b683d7c2fc13b03b2da1239f0f39"}},{"ruleId":"D1","level":"warning","message":{"text":"SplitCommand::run (cyclomatic 24): SplitCommand::run has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/split.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2efe476d243a296a64b589b9635d94f9ea1601143a8962d9013fd93b42b923"}},{"ruleId":"D1","level":"warning","message":{"text":"StatsCommand::run (cyclomatic 24): StatsCommand::run has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/stats.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bc34f75d3c08c804dff9db37d8dfdbfc4c5c000a0f5146d9534e55b6218ec9d"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_view_spatial::shared_fallbacks::register_fallbacks (cyclomatic 24): dl_view_spatial::shared_fallbacks::register_fallbacks has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/shared_fallbacks.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca474ca9afbc7d5db722ced5b8be67766f9b29b29c231575c0aebbb534cd53a"}},{"ruleId":"D1","level":"warning","message":{"text":"DataQueryPropertyResolver::update_overrides_recursive (cyclomatic 24): DataQueryPropertyResolver::update_overrides_recursive has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/view_contents.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"4477f270c825c86e943787184d1be696576c30ced8a43f6a3e37e36236a07696"}},{"ruleId":"D1","level":"warning","message":{"text":"PythonCodeGenerator::generate_folder (cyclomatic 23): PythonCodeGenerator::generate_folder has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4e00e2d91195e03dbc734606b0ffc8c49b5578ef93d7a0a770b37aa9540d0d"}},{"ruleId":"D1","level":"warning","message":{"text":"VideoDataDescription::load_mp4_from_reader (cyclomatic 23): VideoDataDescription::load_mp4_from_reader has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/demux/mp4.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed4642fc201e6980acd88ced924a137dca61d9929bcb4bdb97efb4bc3769d48"}},{"ruleId":"D1","level":"warning","message":{"text":"MeshRenderer::draw (cyclomatic 23): MeshRenderer::draw has cyclomatic complexity 23 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"d462f41cae6cc11aad3ba1ec16cf4075d14f7fce22359b3132e21d1baf2a4524"}},{"ruleId":"D1","level":"warning","message":{"text":"MaxImageDimensionsStoreSubscriber::on_events (cyclomatic 23): MaxImageDimensionsStoreSubscriber::on_events has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/max_image_dimension_subscriber.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"10538451dfd1f3231f8e4559862a68b5f3446670892f88f7d9dd68c89fde24f1"}},{"ruleId":"D1","level":"warning","message":{"text":"App::load_data_source (cyclomatic 23): App::load_data_source has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/add_data_source.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a972fe82b022beb458d144e86e56af42bc9c8aab6c541d0f6fe226b101aae314"}},{"ruleId":"D1","level":"warning","message":{"text":"App::with_commands (cyclomatic 23): App::with_commands has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/mod.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4f9a4304fe667576e57e21b54f52456b1c169758cdf1527cc72a7d36c55540"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_viewer::viewer_analytics::event::open_recording (cyclomatic 23): dl_viewer::viewer_analytics::event::open_recording has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/viewer_analytics/event.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4e3a9b1a3d10ca5f0c4dd89349da284864b579d0f13623ef0f5f806c54a252"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageStats::from_image (cyclomatic 23): ImageStats::from_image has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/tensor/image_stats.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1f5eb71e31c813270b21b4ea616933d0778fbaf214097b79522f225cf122b52"}},{"ruleId":"D1","level":"warning","message":{"text":"PinholeExt.__init__ (cyclomatic 23): PinholeExt.__init__ 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":"dalaran_py/dalaran_sdk/dalaran/archetypes/pinhole_ext.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ef15b43595135ef1db3dc0c7096d6102fa7567f4d67085de35856b9d9a9ba9"}},{"ruleId":"D1","level":"warning","message":{"text":"ChunkFetcher::next_chunk (cyclomatic 22): ChunkFetcher::next_chunk has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/dlr_manifest_index/chunk_prioritizer.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fc28f8b5a0a2bc14d00c6d4c8aa369145745842711c8e2bde8e9ca569c83131"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_component_ui::variant_uis::redap_uri_button::redap_uri_button (cyclomatic 22): dl_component_ui::variant_uis::redap_uri_button::redap_uri_button has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/variant_uis/redap_uri_button.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"292a62f3b1f946c290485f517486733a522ce0e69e10e1c4bce10ccc990b6b35"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_data_ui::entity_db_ui::grid_content_ui (cyclomatic 22): dl_data_ui::entity_db_ui::grid_content_ui has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/entity_db_ui.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffaca3a3e9fa6b3c4b3980dcdc11416883bea50056afcf9dbe7462559ec06e2"}},{"ruleId":"D1","level":"warning","message":{"text":"Query::column_visibility_ui_impl (cyclomatic 22): Query::column_visibility_ui_impl has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_dataframe/src/view_query/ui.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"288dc5f2e7aeb3b3ee8996141038bd9a511bba73d583552ee9b14e0b038e3ed1"}},{"ruleId":"D1","level":"warning","message":{"text":"AppContext::handle_select_hover_drag_interactions (cyclomatic 22): AppContext::handle_select_hover_drag_interactions has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/app_context.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"540bf610dc75bcad894adf764c119c089f8c68e8706dde3b76dc6dc29d86bc52"}},{"ruleId":"D1","level":"warning","message":{"text":"TensorStats::from_tensor (cyclomatic 22): TensorStats::from_tensor has cyclomatic complexity 22 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/tensor/tensor_stats.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"8880d22c7590690d1f526bac03dc840848fe175467dba16d0f4504f3b21074cc"}},{"ruleId":"D1","level":"warning","message":{"text":"msg_map.convert_marker (cyclomatic 22): msg_map.convert_marker has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/ros2/msg_map.py"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf18535e2f30a5f69950ccb91dca91b1188121e1a29490d4268a69ea6df0ac22"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_types_builder::codegen::python::check_ext_consistency (cyclomatic 21): dl_types_builder::codegen::python::check_ext_consistency has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"a547442653a3bcdabbdb02c43091ef30a18fb5006de53c6ebe416b043ad6ef82"}},{"ruleId":"D1","level":"warning","message":{"text":"DataframeQueryTableProvider::scan (cyclomatic 21): DataframeQueryTableProvider::scan has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_common.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54441de40017265e754a3501a58e81394c5180a332463a5398383bfe0235ef0"}},{"ruleId":"D1","level":"warning","message":{"text":"Decoder::try_read_impl (cyclomatic 21): Decoder::try_read_impl has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/decoder/state_machine.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ef9945a35a6dfaf594cba2d37d3e38940e1bb0cd3cf2ee96c11c9d8a3f9549"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_video::decode::av1::create_frame (cyclomatic 21): dl_video::decode::av1::create_frame 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":"crates/utils/dl_video/src/decode/av1.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff667e5127f65bb32d8d2fc5f4b5a56d1eeaa602ea92a1c3e43dbb2144030bf"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_data_ui::video_ui::video_data_ui (cyclomatic 21): dl_data_ui::video_ui::video_data_ui has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/video_ui.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"616d39e5001bd1d8d38a9f51ce346f00c4ecead6f85a41f15e7840d02131fd60"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_redap_browser::servers::error_ui (cyclomatic 21): dl_redap_browser::servers::error_ui has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_redap_browser/src/servers.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"4930b9cbbae64f29b180a9ec819f4dac0bd599c79330e42a3617059c11795029"}},{"ruleId":"D1","level":"warning","message":{"text":"Boxes2DExt.__init__ (cyclomatic 21): Boxes2DExt.__init__ 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":"dalaran_py/dalaran_sdk/dalaran/archetypes/boxes2d_ext.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"760ea9ff9758a74cc6b4a1670d8f343d9ece03843f055941af75c22da7080033"}},{"ruleId":"D1","level":"warning","message":{"text":"_manifest_build._resolve_rows (cyclomatic 21): _manifest_build._resolve_rows has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/manifest/_manifest_build.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fca56d92fe30f2c7608cebc08901655af388480d65f013190518b3c7560f09a"}},{"ruleId":"D1","level":"warning","message":{"text":"Parser::parse_named_type (cyclomatic 20): Parser::parse_named_type has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/objects/from_rust.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"6222a4543799a0d3996f719725e3af95f7c30d831eac56b4d8d5c3fc321cf269"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_types_builder::codegen::python::quote_field_converter_from_field (cyclomatic 20): dl_types_builder::codegen::python::quote_field_converter_from_field has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: dl_types_builder::codegen::python::quote_arrow_datatype (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":1979}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8819b338260b7243863b0a69d8c84febcd50ce27971ca0be804928cf7c6acfa"}},{"ruleId":"D1","level":"warning","message":{"text":"ChunkStore::find_and_elect_compaction_candidate (cyclomatic 20): ChunkStore::find_and_elect_compaction_candidate has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/writes.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"31cd7b0809222b72e58fed08060f4a3b527b337725cee1ada5d1b92b9ac9051f"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_lenses_core::execute::execute (cyclomatic 20): dl_lenses_core::execute::execute has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/execute.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"703c66d7300b7bf257977f2a0e8cb338ba66fb3264cc6a11d49eec9b897b4869"}},{"ruleId":"D1","level":"warning","message":{"text":"QueryCache::latest_at (cyclomatic 20): QueryCache::latest_at has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/latest_at.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f974d5cd902cb1bdb99b9d0951005233b6dbb6863e8cc22e2f8fe73f8f00917"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_redap_client::grpc::stream_segment_from_server (cyclomatic 20): dl_redap_client::grpc::stream_segment_from_server has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/grpc.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"8095e6ce263dd73b0c5430dc60bd25d1be0f83f36ecfddb754900fcda96d58bd"}},{"ruleId":"D1","level":"warning","message":{"text":"dalaran::commands::dlr::route::process_messages (cyclomatic 20): dalaran::commands::dlr::route::process_messages has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/route.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f5e12df3a12bd9372582f90b03cb749ccc2ef987ef7d07c6dadfac41151d62"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_sdk::spawn::spawn (cyclomatic 20): dl_sdk::spawn::spawn has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/spawn.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c19728e437eba914ae56580db8137168130a2b8bd69cb6a7c2a78ee9424a145"}},{"ruleId":"D1","level":"warning","message":{"text":"TimestampFilter::popup_ui (cyclomatic 20): TimestampFilter::popup_ui has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/filters/timestamp.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"96dba2caf11fa91ab28d630c519b3c919e2b71687c6c394c7eac4f16cf1de534"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_selection_panel::view_entity_picker::add_entities_line_ui (cyclomatic 20): dl_selection_panel::view_entity_picker::add_entities_line_ui has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/view_entity_picker.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2f322e86615a15980cf836c0655276576dd725bd2d47412c14396ea09a3f523"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_ui::drag_and_drop::find_drop_target (cyclomatic 20): dl_ui::drag_and_drop::find_drop_target has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/drag_and_drop.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"aee724ea563c85e99d77cad1be7f9a9e5b2d7a1a25da1bbd94650d19f9e5b1f3"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_view_spatial::visualizers::video::show_video_frame (cyclomatic 20): dl_view_spatial::visualizers::video::show_video_frame has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/video/mod.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"897c9b721a12c17f46371719bae254d7f1686505ee5a3bc33c19d1fb13b99327"}},{"ruleId":"D1","level":"warning","message":{"text":"App::receive_messages (cyclomatic 20): App::receive_messages has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/logic.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"270e63af7aed1153f277e13aad2046dfcdd370f78e62b6d52571562bb13a2977"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_viewer::ui::dev_panel::transform_cache_ui::paint::draw_transform_cache_contents (cyclomatic 20): dl_viewer::ui::dev_panel::transform_cache_ui::paint::draw_transform_cache_contents has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/dev_panel/transform_cache_ui/paint.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff2d124b67957de768645ea30117e7b13cd5a784784cc15abc81d327217dc85"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_viewer_context::cache::video_stream_cache::handle_out_of_order_chunk (cyclomatic 20): dl_viewer_context::cache::video_stream_cache::handle_out_of_order_chunk has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs"},"region":{"startLine":1974}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3bead01c47e1a417891cc1a428ae1c8156f72f8e20e87e821030b2b2c1ff904"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_viewer_context::view::visualizer_entity_subscriber::process_entity_components (cyclomatic 20): dl_viewer_context::view::visualizer_entity_subscriber::process_entity_components has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/view/visualizer_entity_subscriber.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb25b332ebb873fc9fd103a9b935c71f7526d98cdf340e101212c6e27c5c5ab"}},{"ruleId":"D1","level":"warning","message":{"text":"VideoFrameDecoder._decode_to_target (cyclomatic 20): VideoFrameDecoder._decode_to_target 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":"dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/_decoders.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"35fff4756791d60dfe37b2dda465f31429c4acd1a44b8abfa49331539f498fe0"}},{"ruleId":"D1","level":"warning","message":{"text":"SnippetsRefCodeGenerator::generate_fallible (cyclomatic 19): SnippetsRefCodeGenerator::generate_fallible has cyclomatic complexity 19 (threshold 15). Of this number, 11 points are the body\u0027s own statements and 8 belong to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/docs/snippets_ref.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"c62082c4d35fd1536bf34f239f26c8f818eaa3e109c82bc7c03001c4baa6fb38"}},{"ruleId":"D1","level":"warning","message":{"text":"ChunkFetcher::fetch_inner (cyclomatic 19): ChunkFetcher::fetch_inner has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/dlr_manifest_index/chunk_prioritizer.rs"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2fabda9a3e28999f96208d69b574a47c00e0655153a68a9e00b4da2acf036a9"}},{"ruleId":"D1","level":"warning","message":{"text":"RawRrdManifest::check_index_columns_are_correct (cyclomatic 19): RawRrdManifest::check_index_columns_are_correct has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a78ca094370e59624d918209da80f45c631088907dd7b2d281e69fb4cb6bef"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_mcap::decoders::ros2_reflection::append_value (cyclomatic 19): dl_mcap::decoders::ros2_reflection::append_value has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/decoders/ros2_reflection.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"b93a133f0ee7a0af6fb349067ca289a8261a9c67eb4aed9cd4ffeff89eac17aa"}},{"ruleId":"D1","level":"warning","message":{"text":"Args::generate_markdown_manual (cyclomatic 19): Args::generate_markdown_manual has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 2 function items inside it that branch (generate_markdown_manual, generate_arg_doc). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest. This is NOT this file\u0027s highest cyclomatic complexity: dalaran::commands::entrypoint::record_cli_command_analytics (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/entrypoint.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7ea3ee1bd50593c7469fc9ad4cb1af55f7e335b238082740f93289e04c552ca"}},{"ruleId":"D1","level":"warning","message":{"text":"dalaran::commands::entrypoint::run (cyclomatic 19): dalaran::commands::entrypoint::run has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: dalaran::commands::entrypoint::record_cli_command_analytics (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/entrypoint.rs"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36b5a581a1fe2eaf83fa14a9fbd99b42db8171818d2686d96e4fb58a0207c5a"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_ui::text_edit::autocomplete_text_edit (cyclomatic 19): dl_ui::text_edit::autocomplete_text_edit has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/text_edit.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3faefbed1175585f893b89ca4fcedb8a38c326fe925d23eb4005c6084c711e6b"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_view_spatial::visualizers::video::execute_video_stream_like (cyclomatic 19): dl_view_spatial::visualizers::video::execute_video_stream_like has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/video/mod.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"be321cd08dfcad0e4fd1e22995c6fa096c44ea226b64d29464e209d9c65bd4a5"}},{"ruleId":"D1","level":"warning","message":{"text":"SeriesPointsSystem::load_series (cyclomatic 19): SeriesPointsSystem::load_series has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/point_visualizer_system.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"096d138d87fcf5f7aa768fb6f727f38a07c51e578417a1c00207173bdb0b529d"}},{"ruleId":"D1","level":"warning","message":{"text":"VideoStreamCache::handle_store_event (cyclomatic 19): VideoStreamCache::handle_store_event has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2169f83f16fca0abc60a351f58e7b821b1aaadb7c156b4fa617d4a936c9ed15"}},{"ruleId":"D1","level":"warning","message":{"text":"SegmentUrlUdf::return_type (cyclomatic 19): SegmentUrlUdf::return_type 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":"dalaran_py/src/catalog/segment_url_udf.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"d66b6c2401499500dd9184f2d1eb0043941af030cc8fd1da9385216f29538f22"}},{"ruleId":"D1","level":"warning","message":{"text":"url_generation.segment_url (cyclomatic 19): url_generation.segment_url 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":"dalaran_py/dalaran_sdk/dalaran/utilities/datafusion/functions/url_generation.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"090ebcd75107d42adc4905b516bb659d5aa1e6f4ec727f49c9c5f62ee88f526a"}},{"ruleId":"D1","level":"warning","message":{"text":"Chunk::latest_at (cyclomatic 18): Chunk::latest_at has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/latest_at.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"8717727c6d056132b14833341e15a081b0278bc4f6447f2da010ae5e0a5c4a6f"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_chunk_store::rebatch_videos::rebatch_video_chunks_to_gops (cyclomatic 18): dl_chunk_store::rebatch_videos::rebatch_video_chunks_to_gops has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/rebatch_videos.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"055415797bb3e768224881b114332d2f0a1cfc23bf0c2442787aee7d8ac6313d"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_server::dalaran_cloud::get_chunks_for_query_results (cyclomatic 18): dl_server::dalaran_cloud::get_chunks_for_query_results has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"f33b1f273558720df3b7018eebf68654de8824886cd381a11c0c223d2ff56a5c"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_sorbet::migrations::v0_0_2__to__v0_1_0::rewire_tagged_components (cyclomatic 18): dl_sorbet::migrations::v0_0_2__to__v0_1_0::rewire_tagged_components has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/migrations/v0_0_2__to__v0_1_0.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc9009a99f1bc7d785ca0438c0c8975c52cfde271de0937c9d47a7c45fe2d4f8"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_selection_panel::view_space_origin_ui::view_space_origin_widget_editing_ui (cyclomatic 18): dl_selection_panel::view_space_origin_ui::view_space_origin_widget_editing_ui has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/view_space_origin_ui.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"6194bcb33bb0c11eb679f2eaad52e88ad4d3265f555b17d186f9d10b5e0cac54"}},{"ruleId":"D1","level":"warning","message":{"text":"ListItemNavigation::end_if_root (cyclomatic 18): ListItemNavigation::end_if_root has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/list_item/navigation.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d44a926b4a94cb7fe45efcb70c011b9daf3b30f7e0496f740d208c34db469343"}},{"ruleId":"D1","level":"warning","message":{"text":"UiExt::native_window_buttons_ui (cyclomatic 18): UiExt::native_window_buttons_ui has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to one function item inside it that branches (window_button). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/ui_ext.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"a407675854caa64799becdaecdd2a964d17b30642d726d4f28364f27b16d8f3b"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_viewer::prefetch_chunks::prefetch_chunks_for_recordings (cyclomatic 18): dl_viewer::prefetch_chunks::prefetch_chunks_for_recordings has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/prefetch_chunks.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe704456d31a4063e7edca761924e67a4d026c4acc0b0e0992c585f62b34779"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageInfo::get_xyc (cyclomatic 18): ImageInfo::get_xyc has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/image_info.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"678c709947c2c99c28ce9d77762e3e1f31fb1d402ef28bd7e7ef3037d07546f1"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageInfo::to_dynamic_image (cyclomatic 18): ImageInfo::to_dynamic_image has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/image_info.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"f366e55e420f008560928b2be1ac861035a9583d6fe3433d3301d8fdb892a397"}},{"ruleId":"D1","level":"warning","message":{"text":"ViewerOpenUrl::open (cyclomatic 18): ViewerOpenUrl::open has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/open_url.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"da99331abef7f8a337a4a1ca940838f55a60a4030e45099b9aeff565a62b614b"}},{"ruleId":"D1","level":"warning","message":{"text":"Transform3DExt.__init__ (cyclomatic 18): Transform3DExt.__init__ 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":"dalaran_py/dalaran_sdk/dalaran/archetypes/transform3d_ext.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2d9e813ec15e503f004018d701a2c8d54c7e7fb2951310d688974ce7a2cd6e5"}},{"ruleId":"D1","level":"warning","message":{"text":"TensorDataExt.__init__ (cyclomatic 18): TensorDataExt.__init__ 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":"dalaran_py/dalaran_sdk/dalaran/datatypes/tensor_data_ext.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1b396c39af1a2694aff5fb5fb04d7b51c821625f4e1e2f4c116fbeab0174a4"}},{"ruleId":"D1","level":"warning","message":{"text":"ChunkStore::remove_chunk_from_virtual_indices (cyclomatic 17): ChunkStore::remove_chunk_from_virtual_indices has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/gc.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"814c015a8e0aa2215e8e084845998adbc6f39e97fb01993963053590427dee26"}},{"ruleId":"D1","level":"warning","message":{"text":"PipelineBudget::reserve_with_priority (cyclomatic 17): PipelineBudget::reserve_with_priority has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/pipeline_budget.rs"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1b340c1ccae4e58f50c2b83571a649000b7723c839f99c3bebe2c6d08f290b"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_datafusion::pushdown_expressions::apply_filter_expr_to_queries (cyclomatic 17): dl_datafusion::pushdown_expressions::apply_filter_expr_to_queries has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/pushdown_expressions.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"4006f412515477c26ee5577dbb48e265649cdd6d6bbd94ffd8273e41c0f551db"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_datafusion::pushdown_expressions::known_filter_column (cyclomatic 17): dl_datafusion::pushdown_expressions::known_filter_column has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/pushdown_expressions.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c5711501ccfd9e7fedac96d4ea689f08f52836494d322f664de493b9b44e827"}},{"ruleId":"D1","level":"warning","message":{"text":"Flatten::transform (cyclomatic 17): Flatten::transform has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/combinators/reshape.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b0bb66a97a6b8db3e53d18f6ce56aeb2164905e36d1d539f5e1200a4805e12"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_sdk_types::archetypes::gaussian_splats3d_ext::read_ply (cyclomatic 17): dl_sdk_types::archetypes::gaussian_splats3d_ext::read_ply has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sdk_types/src/archetypes/gaussian_splats3d_ext.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f466db42e9b95fa5b54379035873d7d5b4585dd11fe41b6da63b797237f28ff"}},{"ruleId":"D1","level":"warning","message":{"text":"VideoPlayer::enqueue_samples (cyclomatic 17): VideoPlayer::enqueue_samples has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/player/mod.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c15d413937ebb60b24ea9533fa105950eefe074e1d064e8d8ce20e2c9ff8d1b"}},{"ruleId":"D1","level":"warning","message":{"text":"GaussianSplatBatchBuilder::add_gaussians (cyclomatic 17): GaussianSplatBatchBuilder::add_gaussians has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/gaussian_splat_builder.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6420ab3c8200323aa3ad1332bdf6523d960797dda05fe05643ddd23043ce454"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_view_spatial::picking_ui::picking (cyclomatic 17): dl_view_spatial::picking_ui::picking has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/picking_ui.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"040056f1cde153aefa0a2f5639af3fcf4f3a34d2d5674790f03c537da3f99d0b"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_view_time_series::fallbacks::register_fallbacks (cyclomatic 17): dl_view_time_series::fallbacks::register_fallbacks has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/fallbacks.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb8e44e586ea48c450ad98b2ef16c3c10ce5a23c92066b3a3e876e22d5e02f52"}},{"ruleId":"D1","level":"warning","message":{"text":"ViewerOpenUrl::sharable_url (cyclomatic 17): ViewerOpenUrl::sharable_url has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/open_url.rs"},"region":{"startLine":424}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e68dd8a0e09206931924e85fa25838830662c76cd35f9c3c4ff15d44b8e3db"}},{"ruleId":"D1","level":"warning","message":{"text":"TimeControl::update_from_blueprint (cyclomatic 17): TimeControl::update_from_blueprint has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/time_control/mod.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0cab837577ba3c133d0c7b1db855879a7c3cd7e9ae47acc72250d482d97eab9"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_types_builder::codegen::python::code_for_union (cyclomatic 16): dl_types_builder::codegen::python::code_for_union has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file\u0027s highest cyclomatic complexity: dl_types_builder::codegen::python::quote_arrow_datatype (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecb56b0eff6749035c4c9a9220fec2c9c7acf63655ff65c37b243f895dd1cb5"}},{"ruleId":"D1","level":"warning","message":{"text":"QueryHandle::init_ (cyclomatic 16): QueryHandle::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":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e85b44b7ad8e9cfe4622701ad20d06045227b9727898120ee920969d423f108"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_datafusion::pushdown_expressions::merge_queries_and (cyclomatic 16): dl_datafusion::pushdown_expressions::merge_queries_and has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/pushdown_expressions.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1afad506df4804b879eadec71c88d6d212015f72ba0bcf4c760ce103147e014"}},{"ruleId":"D1","level":"warning","message":{"text":"ExternalImporter::import_from_path (cyclomatic 16): ExternalImporter::import_from_path has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_external.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"433838bdef7d290ec4af495c604ae6f7739eef53acf25cb50348947e088ebd82"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::fmt (cyclomatic 16): Expr::fmt has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/selector/parser.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"e648b8c181672e7c355c98cb904615c4b273e8bd0d38cc8df31b09a0043a29bc"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_lenses_core::plan::plan (cyclomatic 16): dl_lenses_core::plan::plan has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/plan.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e91a74d2de29103f2832a0d0c20a3fe0d8703368fb2280ff65b6e2363d9c2e"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_sorbet::dataframe_to_chunks::stamp_dataframe_metadata (cyclomatic 16): dl_sorbet::dataframe_to_chunks::stamp_dataframe_metadata has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/dataframe_to_chunks.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c5a874779c27b689ad3e8c1e18d13b2f4e1e6d4008085471c0947e27672922"}},{"ruleId":"D1","level":"warning","message":{"text":"dalaran::commands::doctor::recording::check_recording (cyclomatic 16): dalaran::commands::doctor::recording::check_recording has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/doctor/recording.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b1aa1452bd374d75760299c67cfa0e26a80b12c0db1a6d5064eaafc5b24401b"}},{"ruleId":"D1","level":"warning","message":{"text":"dalaran::commands::entrypoint::assert_receive_into_entity_db (cyclomatic 16): dalaran::commands::entrypoint::assert_receive_into_entity_db has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: dalaran::commands::entrypoint::record_cli_command_analytics (cyclomatic 21) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/entrypoint.rs"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"b368783226d5a8039b23a092b21d9da934581ee66a65562b269cbd8c20c23250"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_sdk::recording_stream::forwarding_thread (cyclomatic 16): dl_sdk::recording_stream::forwarding_thread has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 4 of the 16 points are its own statements and the rest belongs to one function item inside it that branches (handle_cmd). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/recording_stream.rs"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"091145ad7db1887dab289f2db87b8480a08076ab30e114d463235ba0ac26036c"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_video::demux::mp4::subsampling_mode (cyclomatic 16): dl_video::demux::mp4::subsampling_mode has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/demux/mp4.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"296e39513a28579a801749a5ce951097bfbe1c380b2d4afde2e6c3551cb48076"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_data_ui::item_ui::entity_db_button_ui (cyclomatic 16): dl_data_ui::item_ui::entity_db_button_ui has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/item_ui.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"a976d4238cbc66c15a98a464fe6b67441823fff7d7c9aea8bb58995f41141a32"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_data_ui::video_ui::decoded_frame_ui (cyclomatic 16): dl_data_ui::video_ui::decoded_frame_ui has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/video_ui.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"107fa312a1b42bf9836758477b5ff83d39db9a703270682359e1ddd5dfa10a64"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_dataframe_ui::preview_renderer::preview_timeline (cyclomatic 16): dl_dataframe_ui::preview_renderer::preview_timeline has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/preview_renderer.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0d39b2e75634a075e18a572872a287ef4761ad13d123ebc88899f406b5d582"}},{"ruleId":"D1","level":"warning","message":{"text":"UniformBuffer::from_textured_rect_with_outline_mask (cyclomatic 16): UniformBuffer::from_textured_rect_with_outline_mask has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/rectangles.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"0942f380c5230c04ab3f09d6c9b5caaa201172cbada7567569879c23940d23c8"}},{"ruleId":"D1","level":"warning","message":{"text":"DataframeTableDelegate::header_cell_ui (cyclomatic 16): DataframeTableDelegate::header_cell_ui has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_dataframe/src/dataframe_ui.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a91dd09a39a218c975b2a498a54d2742cfe3e4272885c02105c012e6c7fc996"}},{"ruleId":"D1","level":"warning","message":{"text":"SpatialView3D::on_register (cyclomatic 16): SpatialView3D::on_register has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/view_3d.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"f481b1668b2555ca9029a43a52762259a7766673edfb557bf7018ad9e678a63a"}},{"ruleId":"D1","level":"warning","message":{"text":"SeriesLinesSystem::build_draw_data (cyclomatic 16): SeriesLinesSystem::build_draw_data has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/line_visualizer_system.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"f293c8be2ac6f05cd6db9540c7591c1cde4cb28eda0aa978a22f6d6acd54e1cb"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_viewer::ui::top_panel::panel_buttons_r2l (cyclomatic 16): dl_viewer::ui::top_panel::panel_buttons_r2l has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/top_panel.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"7665766ccbbd250832e5e50646cbcd7bcabf74853abddec02c4351573ea280a5"}},{"ruleId":"D1","level":"warning","message":{"text":"ViewerOpenUrl::parse_with_options (cyclomatic 16): ViewerOpenUrl::parse_with_options has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/open_url.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f945f8ef74614edb2934c88e93dc9bfa2b3c61f58215b260b911c0d885e50e"}},{"ruleId":"D1","level":"warning","message":{"text":"dl_viewer_context::gpu_bridge::image_to_gpu::texture_creation_desc_from_color_image (cyclomatic 16): dl_viewer_context::gpu_bridge::image_to_gpu::texture_creation_desc_from_color_image has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file\u0027s highest cyclomatic complexity: dl_viewer_context::gpu_bridge::image_to_gpu::general_texture_creation_desc_from_image (cyclomatic 33) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/gpu_bridge/image_to_gpu.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"be289d43ccbc86e143f1bdc9217affe266effc0dde1aa33823158623164a364d"}},{"ruleId":"D1","level":"warning","message":{"text":"SegmentUrlUdf::invoke_with_args (cyclomatic 16): SegmentUrlUdf::invoke_with_args has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/catalog/segment_url_udf.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d102a1dd3d02bd30076265d707a29077de39f2aa0a51c0611770916c88a1f75"}},{"ruleId":"D1","level":"warning","message":{"text":"urdf_model._joint_from_xml (cyclomatic 16): urdf_model._joint_from_xml 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":"dalaran_py/dalaran_sdk/dalaran/robot/urdf_model.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"22af76235a973dfda8bb4a1d04f53f9accd5c333aa74965e5b6932a694a6c580"}},{"ruleId":"D2","level":"warning","message":{"text":"App::run_system_command (cognitive 134): App::run_system_command has cognitive complexity 134 (threshold 15). Drivers by points: if/else 43 (97 pts), match/switch 14 (29 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 71). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/command_handling.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"9758e8d8d0c188af8495daef2c01fadc5ac3ff285bff46dbd1025dcaf160e6b3"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkStore::insert_chunk_impl (cognitive 106): ChunkStore::insert_chunk_impl has cognitive complexity 106 (threshold 15). Drivers by points: if/else 33 (73 pts), loops 11 (30 pts), boolean chains 3 (nesting depth added 59). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/writes.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"74029e2f56aa36ceec6472b9487899ba97c115017188cf3b8f40cbc96d956b91"}},{"ruleId":"D2","level":"warning","message":{"text":"TimeControl::handle_time_command (cognitive 105): TimeControl::handle_time_command has cognitive complexity 105 (threshold 15). Drivers by points: if/else 51 (99 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 51). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/time_control/command.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"1459f2a04ac72e65e32c00d4c94013d8a659a906b1231be1c6028fafcef0b146"}},{"ruleId":"D2","level":"warning","message":{"text":"QueryHandle::_next_n_rows (cognitive 101): QueryHandle::_next_n_rows has cognitive complexity 101 (threshold 15). Drivers by points: if/else 27 (73 pts), match/switch 6 (19 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 63). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"c539a735581367cf6ba3406de51dd90c8ba4421c60bbf3a1b565788c80e57296"}},{"ruleId":"D2","level":"warning","message":{"text":"QueryCache::on_events (cognitive 99): QueryCache::on_events has cognitive complexity 99 (threshold 15). Drivers by points: loops 20 (62 pts), if/else 10 (30 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 65). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/cache.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"97cdc55b2b125c22e9a58e571545250cc2d80b389e3965d38f19133ffcbccef8"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::rust::serializer::quote_arrow_field_serializer (cognitive 98): dl_types_builder::codegen::rust::serializer::quote_arrow_field_serializer has cognitive complexity 98 (threshold 15). Drivers by points: if/else 49 (86 pts), match/switch 5 (10 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":"crates/build/dl_types_builder/src/codegen/rust/serializer.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b527e9d75f1b104196b19005058bc3f86d3a89932a18dd714690a04d81baac3"}},{"ruleId":"D2","level":"warning","message":{"text":"QueryHandle::try_bulk_emit_run (cognitive 78): QueryHandle::try_bulk_emit_run has cognitive complexity 78 (threshold 15). Drivers by points: if/else 31 (65 pts), match/switch 3 (7 pts), loops 4 (5 pts), boolean chains 1 (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":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":2132}}}],"partialFingerprints":{"codehealthFindingId/v1":"501d54c88448fbaa95e209d0064296dddc3a6bd1e64729380b96ac8429631a76"}},{"ruleId":"D2","level":"warning","message":{"text":"compare_snippet_output.main (cognitive 77): compare_snippet_output.main has cognitive complexity 77 (threshold 15). Drivers by points: if/else 28 (46 pts), loops 9 (15 pts), error handling 3 (11 pts), boolean chains 5 (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":"docs/snippets/compare_snippet_output.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"192195eecc5a65736cc30131a9fb7a307fd16ea064ad4149a9281033142ffda6"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_datafusion::dataframe_query_provider::cpu_worker::chunk_store_cpu_worker_thread (cognitive 76): dl_datafusion::dataframe_query_provider::cpu_worker::chunk_store_cpu_worker_thread has cognitive complexity 76 (threshold 15). Drivers by points: if/else 23 (61 pts), match/switch 4 (7 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"0074a182416fec8e5c712a84e7a5fb0ca9292e8d0c4974061078321fd4aa6e70"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::python::code_for_struct (cognitive 75): dl_types_builder::codegen::python::code_for_struct has cognitive complexity 75 (threshold 15). Drivers by points: if/else 40 (61 pts), loops 3 (9 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"e152b761b6b3297a65b4c33b09a196b08d5625e874f2136a66fdfdaca73440a6"}},{"ruleId":"D2","level":"warning","message":{"text":"CommandPaletteProviderImpl::all_matching (cognitive 75): CommandPaletteProviderImpl::all_matching has cognitive complexity 75 (threshold 15). Drivers by points: if/else 23 (52 pts), loops 7 (20 pts), boolean chains 3 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/command_palette.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bc634796ed304f3a79b532518eade0bf626104a2858c9c1c733e4a84b06399c"}},{"ruleId":"D2","level":"warning","message":{"text":"Objects::resolve_and_validate (cognitive 74): Objects::resolve_and_validate has cognitive complexity 74 (threshold 15). Drivers by points: if/else 14 (49 pts), loops 5 (9 pts), match/switch 2 (9 pts), boolean chains 7 (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":"crates/build/dl_types_builder/src/objects/mod.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe98219485b8e11945bb73e31bdd9d8395d9040c647a502755467b878c3aca0"}},{"ruleId":"D2","level":"warning","message":{"text":"QueryHandle::_resolve_one_row (cognitive 70): QueryHandle::_resolve_one_row has cognitive complexity 70 (threshold 15). Drivers by points: if/else 17 (49 pts), loops 6 (14 pts), match/switch 4 (6 pts), boolean chains 1 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d43004b8456cd006c975ecf2d9ae0208e3efa5aa4db2f3f4ef03a22e06810d0"}},{"ruleId":"D2","level":"warning","message":{"text":"DalaranCloudHandler::query_dataset (cognitive 69): DalaranCloudHandler::query_dataset has cognitive complexity 69 (threshold 15). Drivers by points: if/else 20 (40 pts), loops 7 (21 pts), boolean chains 5, match/switch 2 (3 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":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc057b2e3873834e4bae4a8423a716e3235c047f04d1a0ebd9e440d0dd23f8d2"}},{"ruleId":"D2","level":"warning","message":{"text":"MaxImageDimensionsStoreSubscriber::on_events (cognitive 67): MaxImageDimensionsStoreSubscriber::on_events has cognitive complexity 67 (threshold 15). Drivers by points: if/else 14 (47 pts), loops 6 (18 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":"crates/viewer/dl_view_spatial/src/max_image_dimension_subscriber.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5295d0e842c8ca34c79c3229dbcd53e2edb1db8dd807de04dd3f5d39e1de9b5"}},{"ruleId":"D2","level":"warning","message":{"text":"TimeSeriesView::ui (cognitive 65): TimeSeriesView::ui has cognitive complexity 65 (threshold 15). Drivers by points: if/else 24 (43 pts), boolean chains 9, match/switch 6 (8 pts), loops 4 (5 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/view_class.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"181d5036ad167b657ac41b89ed0e5b9375d23465ab7b90c2bb6cc44d6f5f8cf2"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::python::check_ext_consistency (cognitive 61): dl_types_builder::codegen::python::check_ext_consistency has cognitive complexity 61 (threshold 15). Drivers by points: if/else 18 (43 pts), loops 5 (15 pts), boolean chains 3 (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d08c38f444d6817cc4ff0bc9451119d05441cfb1c4bd2e63b562922ad752fa"}},{"ruleId":"D2","level":"warning","message":{"text":"AppState::show (cognitive 61): AppState::show has cognitive complexity 61 (threshold 15). Drivers by points: if/else 33 (54 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app_state.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c5b3c78147dd52db10c32062faaeb99b0cc43e7a990c60032ee910a30f4908"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::python::quote_arrow_serialization (cognitive 60): dl_types_builder::codegen::python::quote_arrow_serialization has cognitive complexity 60 (threshold 15). Drivers by points: if/else 23 (43 pts), loops 3 (8 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 29). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":2446}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc66375e183e40430a471f7544f77dd43f54cd48b69909bf8292fd938af0f4e"}},{"ruleId":"D2","level":"warning","message":{"text":"App::ui (cognitive 60): App::ui has cognitive complexity 60 (threshold 15). Drivers by points: if/else 32 (46 pts), match/switch 4 (8 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/mod.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"8baec5330e90ebb58bfe2920dd28f428e00979828d998c23a695d3e7500c11f0"}},{"ruleId":"D2","level":"warning","message":{"text":"StatsCommand::run (cognitive 56): StatsCommand::run has cognitive complexity 56 (threshold 15). Drivers by points: loops 8 (26 pts), if/else 10 (21 pts), match/switch 4 (8 pts), boolean chains 1 (nesting depth added 33). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/stats.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"c941d655a52520e6c4bce770573e3219bc92eba87669cd268b18ec59787677d4"}},{"ruleId":"D2","level":"warning","message":{"text":"TimeControl::update (cognitive 56): TimeControl::update has cognitive complexity 56 (threshold 15). Drivers by points: if/else 16 (36 pts), match/switch 3 (12 pts), boolean chains 8 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/time_control/mod.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa0dc66b57c614917717de48f76d042187901f35ed668d6d0981d3f6709e175"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_redap_browser::servers::error_ui (cognitive 54): dl_redap_browser::servers::error_ui has cognitive complexity 54 (threshold 15). Drivers by points: if/else 16 (41 pts), match/switch 4 (13 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_redap_browser/src/servers.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d46f1483daefb387a4f14339101b6938090a2f53b5366605a87aa4c463336b7"}},{"ruleId":"D2","level":"warning","message":{"text":"App::run_recording_command (cognitive 53): App::run_recording_command has cognitive complexity 53 (threshold 15). Drivers by points: if/else 19 (41 pts), loops 2 (6 pts), match/switch 3 (6 pts) (nesting depth added 29). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/command_handling.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c32b6851dda846d95c1602b31cce5c58024fb790efb342c0f14033b4be1c2c0"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewportUi::viewport_ui (cognitive 53): ViewportUi::viewport_ui has cognitive complexity 53 (threshold 15). Drivers by points: if/else 20 (39 pts), boolean chains 5, loops 5, match/switch 1 (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":"crates/viewer/dl_viewport/src/viewport_ui.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"82de6e92f7d0a76dcd5e89643dd9207262f47f453a68b11915a5cb80b03b76aa"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_time_panel::time_selection_ui::loop_selection_ui (cognitive 52): dl_time_panel::time_selection_ui::loop_selection_ui has cognitive complexity 52 (threshold 15). Drivers by points: if/else 22 (46 pts), boolean chains 6 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_panel/src/time_selection_ui.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"916d70424d74ef0eeb78a6d3cabd40a8d9d8a1c4e61f36516f4334a366729224"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkStore::remove_chunk_from_virtual_indices (cognitive 51): ChunkStore::remove_chunk_from_virtual_indices has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (44 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":"crates/store/dl_chunk_store/src/gc.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a0e75b70d255818c9af21ad542486b3cb1493ba0e64d3ae015043176e7c3f3"}},{"ruleId":"D2","level":"warning","message":{"text":"DataQueryPropertyResolver::update_overrides_recursive (cognitive 51): DataQueryPropertyResolver::update_overrides_recursive has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (38 pts), loops 5 (9 pts), boolean chains 4 (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/view_contents.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfef760faa6a8b7db2cccfebb6da45a6362d63834d6e5e6c2c70e5d3c81d4737"}},{"ruleId":"D2","level":"warning","message":{"text":"Decoder::try_read_impl (cognitive 50): Decoder::try_read_impl has cognitive complexity 50 (threshold 15). Drivers by points: if/else 12 (28 pts), match/switch 7 (18 pts), loops 1 (4 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/decoder/state_machine.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"37266090700213cf3e4dc40ad37ab221088957f721ecb4d61c8be47bcf7608df"}},{"ruleId":"D2","level":"warning","message":{"text":"CommandPalette::alternatives_ui (cognitive 50): CommandPalette::alternatives_ui has cognitive complexity 50 (threshold 15). Drivers by points: if/else 20 (39 pts), boolean chains 7, loops 3 (4 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/command_palette.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe8ed6b9a26c1c73ed2567ab85d5e80ccabf5bb3853e93424dc0f50e8e76b754"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_text_log::view_class::table_ui (cognitive 49): dl_view_text_log::view_class::table_ui has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (38 pts), loops 6, match/switch 2 (4 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_text_log/src/view_class.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"98832cdf65b4f7357b022c413a292af268d338fd3334271dde204174e39d1a88"}},{"ruleId":"D2","level":"warning","message":{"text":"AppContext::handle_select_hover_drag_interactions (cognitive 49): AppContext::handle_select_hover_drag_interactions has cognitive complexity 49 (threshold 15). Drivers by points: if/else 21 (40 pts), boolean chains 5, loops 1 (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":"crates/viewer/dl_viewer_context/src/app_context.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eabfe7c72e323fc4678474f203bc9997f6f9a3719a9911eb46afd7441c46759"}},{"ruleId":"D2","level":"warning","message":{"text":"PythonCodeGenerator::generate_folder (cognitive 48): PythonCodeGenerator::generate_folder has cognitive complexity 48 (threshold 15). Drivers by points: if/else 24 (40 pts), loops 3 (4 pts), match/switch 2 (4 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39f0b8403e6927b9f7134d6053c6dd65f3c212fbcb64c68100a9b3590de9628"}},{"ruleId":"D2","level":"warning","message":{"text":"Chunk::latest_at (cognitive 48): Chunk::latest_at has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 4 (12 pts), boolean chains 3 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/latest_at.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ddf7d1fc65e8fe022fff67cbf26e26809690593b51f5440124087019a9b4fe"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitCommand::run (cognitive 48): SplitCommand::run has cognitive complexity 48 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 9 (15 pts), match/switch 3 (9 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":"crates/top/dalaran/src/commands/dlr/split.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc74f01c3ad01a7e8bdff7565542b72d0643aa231dea12f7db6e2c6f4512efd"}},{"ruleId":"D2","level":"warning","message":{"text":"DurationFormatOptions::format_nanos (cognitive 48): DurationFormatOptions::format_nanos has cognitive complexity 48 (threshold 15). Drivers by points: if/else 21 (32 pts), boolean chains 11, match/switch 4 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_format/src/duration.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8538afd61300de6e0d5be929b126f4cf5a2b009d8a834feba9bca53505a04d8b"}},{"ruleId":"D2","level":"warning","message":{"text":"TimePanel::show_entity_contents (cognitive 47): TimePanel::show_entity_contents has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (42 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_panel/src/time_panel.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"308d71371a307fa2d1c284aaa226985c1af92c7d532332141052021cb8542f05"}},{"ruleId":"D2","level":"warning","message":{"text":"MessageDecoderRunner::process (cognitive 45): MessageDecoderRunner::process has cognitive complexity 45 (threshold 15). Drivers by points: loops 10 (20 pts), if/else 8 (15 pts), match/switch 4 (7 pts), boolean chains 3 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/decoders/mod.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"332be3832029bc478e267430f9b22ab59e9ffb5258d204c0eb550b2e7b20c157"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageExt.__init__ (cognitive 45): ImageExt.__init__ has cognitive complexity 45 (threshold 15). Drivers by points: if/else 21 (34 pts), boolean chains 6, error handling 2 (3 pts), loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/archetypes/image_ext.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad133526e14ec080abf217a831e83e5c08c7a63b2d140b7dcea8fed3af4bcfb"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkFetcher::fetch_inner (cognitive 44): ChunkFetcher::fetch_inner has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (37 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/dlr_manifest_index/chunk_prioritizer.rs"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be7c85f1ac1237a70637faf9aa10cd5f64ec967b7901cdf1bb7f67ee3218db3"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_viewport_blueprint::viewport_blueprint::apply_viewport_command (cognitive 44): dl_viewport_blueprint::viewport_blueprint::apply_viewport_command has cognitive complexity 44 (threshold 15). Drivers by points: if/else 13 (29 pts), match/switch 4 (9 pts), loops 3 (6 pts) (nesting depth added 24). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/viewport_blueprint.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"b12c33df048115408f5290d59511d872e3fd54deddff98c37b59fe5749834216"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::docs::doclink_translation::try_translate_doclink (cognitive 43): dl_types_builder::docs::doclink_translation::try_translate_doclink has cognitive complexity 43 (threshold 15). Drivers by points: if/else 28 (38 pts), boolean chains 3, loops 1, match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/docs.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5fe6710cdaabb08c94cbc978e41f8d29f8ebf42e6061e18d6a1da779a1fe28a"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_lenses_core::execute::execute (cognitive 43): dl_lenses_core::execute::execute has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 5 (15 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/execute.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c3bf64c68ac180290fd42e20edc5d92872b1e3cef43a9b4c098c987fb0bc01f"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_server::dalaran_cloud::get_chunks_for_query_results (cognitive 43): dl_server::dalaran_cloud::get_chunks_for_query_results has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 5 (11 pts), match/switch 3 (11 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":2231}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b6a97be4e3cd0c9c878747e833b0902789f06b01338edb19805207c3ef9ed1"}},{"ruleId":"D2","level":"warning","message":{"text":"dalaran::commands::dlr::route::process_messages (cognitive 43): dalaran::commands::dlr::route::process_messages has cognitive complexity 43 (threshold 15). Drivers by points: if/else 5 (19 pts), match/switch 4 (12 pts), loops 6 (11 pts), boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/route.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db0627b9887d0a3c17b6c941aceac0fab39c3366eee06efcb98d99308dfb901"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerModal::ui (cognitive 43): ServerModal::ui has cognitive complexity 43 (threshold 15). Drivers by points: if/else 24 (33 pts), boolean chains 5, match/switch 4 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_redap_browser/src/server_modal.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ded1c81c0c42be67aece61c0a4c68e53695d354c19d7d8b9e99c6acb968c45"}},{"ruleId":"D2","level":"warning","message":{"text":"SeriesPointsSystem::load_series (cognitive 43): SeriesPointsSystem::load_series has cognitive complexity 43 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 6 (19 pts), boolean chains 2, match/switch 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/point_visualizer_system.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"69270b1ca4f2c488e3ab52c21ce09b7ff5432c7954506bdb07ac395da07ce74f"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::cpp::quote_fill_arrow_array_builder (cognitive 42): dl_types_builder::codegen::cpp::quote_fill_arrow_array_builder has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (34 pts), match/switch 2 (8 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/cpp/mod.rs"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"8287301ce7a4663119f7d38a375297c345fccb1545f39c75cedd0e7500bd01c0"}},{"ruleId":"D2","level":"warning","message":{"text":"Query::column_visibility_ui_impl (cognitive 42): Query::column_visibility_ui_impl has cognitive complexity 42 (threshold 15). Drivers by points: if/else 21 (37 pts), loops 3, boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_dataframe/src/view_query/ui.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"e53b6be6c7ffd1a2b2aec0be2feb56c814a78883f811c78b19e07de5c1a53241"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkFetcher::next_chunk (cognitive 41): ChunkFetcher::next_chunk has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (31 pts), loops 3 (8 pts), match/switch 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/dlr_manifest_index/chunk_prioritizer.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"3591bcab9e92807acb3e25dc460eba9fe65d733418061d1acddbd52d08042e97"}},{"ruleId":"D2","level":"warning","message":{"text":"Telemetry::init (cognitive 41): Telemetry::init has cognitive complexity 41 (threshold 15). Drivers by points: if/else 31 (36 pts), boolean chains 3, match/switch 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_perf_telemetry/src/telemetry.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9ef052c4a76a966c21edb8dc50d19a9fc5d3355751d7033dcff15a36dc2e73"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_spatial::visualizers::video::execute_video_stream_like (cognitive 41): dl_view_spatial::visualizers::video::execute_video_stream_like has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (32 pts), match/switch 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/video/mod.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca8b5e51402f5d480eeed11baa191730b4246da0658323d845b392939f3d7e2"}},{"ruleId":"D2","level":"warning","message":{"text":"PinholeExt.__init__ (cognitive 41): PinholeExt.__init__ has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (29 pts), boolean chains 7, error handling 2 (5 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/archetypes/pinhole_ext.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"0112f35b53b98541e37daf8a01f8de11103e5b234e2a503f60cfdecf2b2732a6"}},{"ruleId":"D2","level":"warning","message":{"text":"_manifest_build._resolve_rows (cognitive 41): _manifest_build._resolve_rows has cognitive complexity 41 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 6 (14 pts), boolean chains 5, ternaries 4 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/manifest/_manifest_build.py"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"535daea03dda25e978dd160ade431c2bf56c77b8a1f244540a0fc7735fcaf741"}},{"ruleId":"D2","level":"warning","message":{"text":"Flatten::transform (cognitive 40): Flatten::transform has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (34 pts), loops 4 (6 pts) (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/combinators/reshape.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda42146b10f842910423c23f44fa82c586a1a3d954a32ab50afd9ea0295f1fc"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_selection_panel::view_entity_picker::add_entities_line_ui (cognitive 40): dl_selection_panel::view_entity_picker::add_entities_line_ui has cognitive complexity 40 (threshold 15). Drivers by points: if/else 23 (40 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/view_entity_picker.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"5940f5d8fce8d507245f8312540b7cfdd9e32818edc0135b8bab7c3b9db2a993"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_ui::drag_and_drop::find_drop_target (cognitive 40): dl_ui::drag_and_drop::find_drop_target has cognitive complexity 40 (threshold 15). Drivers by points: if/else 26 (38 pts), boolean chains 1, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/drag_and_drop.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2db5bb9f6f56dd3d96ee6b8b32c9b569b3657ea50e790885cbc2845f5aea5a"}},{"ruleId":"D2","level":"warning","message":{"text":"ForceLayoutProvider::layout (cognitive 40): ForceLayoutProvider::layout has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (25 pts), loops 4 (10 pts), match/switch 1 (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":"crates/viewer/dl_view_graph/src/layout/provider.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"96bd840825be54d1cf6065f4f979c127b1cbd28f8ce857db84aff176b27d563f"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_component_ui::variant_uis::redap_uri_button::redap_uri_button (cognitive 39): dl_component_ui::variant_uis::redap_uri_button::redap_uri_button has cognitive complexity 39 (threshold 15). Drivers by points: if/else 27 (36 pts), boolean chains 2, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/variant_uis/redap_uri_button.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b684b704d2119fe746c668eae8b41ea782b3fb3becb741acfb209dc364e9f909"}},{"ruleId":"D2","level":"warning","message":{"text":"StateTimelineView::ui (cognitive 39): StateTimelineView::ui has cognitive complexity 39 (threshold 15). Drivers by points: if/else 24 (29 pts), boolean chains 8, loops 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_state_timeline/src/view_class.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"00f6001dd9b7f82065a2893e39074a751c61b048d99ea7b2e22e395a7d4a5267"}},{"ruleId":"D2","level":"warning","message":{"text":"LogDataSource::from_uri (cognitive 38): LogDataSource::from_uri has cognitive complexity 38 (threshold 15). Drivers by points: if/else 25 (31 pts), boolean chains 7 (nesting depth added 6). Of this number, 25 points are the body\u0027s own statements and 13 belong to 2 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_data_source/src/data_source.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"001b758e76c68cd650df7d3b0bd380e2e913cc6a66e30b204d266df98c66c577"}},{"ruleId":"D2","level":"warning","message":{"text":"QueryCache::latest_at (cognitive 38): QueryCache::latest_at has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (29 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/latest_at.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"92259e7c1d41cc55a8d61570c7e534ff30557f7096e9ff4785cc8a824adacb2c"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_redap_client::grpc::stream_segment_from_server (cognitive 38): dl_redap_client::grpc::stream_segment_from_server has cognitive complexity 38 (threshold 15). Drivers by points: if/else 19 (31 pts), match/switch 2 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/grpc.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3247c8468204eeb8b541cb55caf06c988b90b2dfd580960a2b8fd948094a2d3"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_arrow_util::format::format_dataframe_without_metadata (cognitive 38): dl_arrow_util::format::format_dataframe_without_metadata has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 3 (7 pts), match/switch 2 (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":"crates/utils/dl_arrow_util/src/format.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd794ccc92582fc3e4975825b35035c663a8eae49d12185c6992143bed0a4db"}},{"ruleId":"D2","level":"warning","message":{"text":"SelectionPanel::item_ui (cognitive 38): SelectionPanel::item_ui has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (34 pts), boolean chains 2, match/switch 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/selection_panel.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"66fa14c62db8c497fb00d9c8dbcab892fb99bd83bd5c9fd49916ed7fd3ea195f"}},{"ruleId":"D2","level":"warning","message":{"text":"ListItem::ui (cognitive 38): ListItem::ui has cognitive complexity 38 (threshold 15). Drivers by points: if/else 23 (31 pts), boolean chains 6, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/list_item/list_item.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5d7b860c394f06e3c796a0b5e4d98ed6b388e053b003dd829041c8c3d71bd7"}},{"ruleId":"D2","level":"warning","message":{"text":"SpatialView3D::view_3d (cognitive 38): SpatialView3D::view_3d has cognitive complexity 38 (threshold 15). Drivers by points: if/else 19 (29 pts), boolean chains 5, loops 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/ui_3d.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"48988db8f225a354ad8ab97ec16edefffa5b79ad8cb63ab33946527075cd6713"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkStore::find_and_elect_compaction_candidate (cognitive 37): ChunkStore::find_and_elect_compaction_candidate has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 5 (14 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/writes.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a70a68985e1beea5f5caa207ed0b1239d0f3134d16958880d4f546f2033fa2"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_video::decode::av1::create_frame (cognitive 37): dl_video::decode::av1::create_frame has cognitive complexity 37 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 3 (12 pts), match/switch 5 (7 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/decode/av1.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f106731220887a8d2c38b7957f9e8290ef8dbc7539757fe7b5b8ece61f0f3ab"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_dataframe_ui::preview_renderer::preview_timeline (cognitive 37): dl_dataframe_ui::preview_renderer::preview_timeline has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (25 pts), boolean chains 7, loops 1 (5 pts) (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/preview_renderer.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf76308136ad5a4fe5ed35e27817ed0646a2ff6fbae76297b611b082f4dda55"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_viewer_context::view::visualizer_entity_subscriber::process_entity_components (cognitive 37): dl_viewer_context::view::visualizer_entity_subscriber::process_entity_components has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 2 (4 pts), boolean chains 3, 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":"crates/viewer/dl_viewer_context/src/view/visualizer_entity_subscriber.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"09fe78f256d4d65e7a4dde5cef7e7009df77fbefc41926c5f3aa4d143df3d1fb"}},{"ruleId":"D2","level":"warning","message":{"text":"CrateVersion::try_parse (cognitive 36): CrateVersion::try_parse has cognitive complexity 36 (threshold 15). Drivers by points: if/else 21 (29 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 9). Of this number, 30 points are the body\u0027s own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_build_info/src/crate_version.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfbe66bb03149beaeecec35dcbfa2134ea6dda2376b7de243b5a363825e73bea"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::common::remove_orphaned_files (cognitive 36): dl_types_builder::codegen::common::remove_orphaned_files has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (33 pts), loops 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":"crates/build/dl_types_builder/src/codegen/common.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71e4c61c8b732aafac655e1dcb999e110775144ef0de565a8ef351a10de45e4"}},{"ruleId":"D2","level":"warning","message":{"text":"RawRrdManifest::check_index_columns_are_correct (cognitive 36): RawRrdManifest::check_index_columns_are_correct has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 5 (15 pts), loops 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f8769ea9b8e5df1fcd08a730ad60d233ea8a8badcc50827d9263ac402c24672"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_sdk_types::archetypes::gaussian_splats3d_ext::read_ply (cognitive 36): dl_sdk_types::archetypes::gaussian_splats3d_ext::read_ply has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sdk_types/src/archetypes/gaussian_splats3d_ext.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f79b767134a2e1af489ad2de083d94158b11be09e1869e0c0acf656fddcdd5"}},{"ruleId":"D2","level":"warning","message":{"text":"MeshRenderer::draw (cognitive 36): MeshRenderer::draw has cognitive complexity 36 (threshold 15). Drivers by points: if/else 6 (18 pts), match/switch 3 (10 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs"},"region":{"startLine":649}}}],"partialFingerprints":{"codehealthFindingId/v1":"3662b8e5878b688eca9fa1f2582e37b6be7971dd56857a5088eb979d49ff1c0f"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_time_series::series_query::collect_colors (cognitive 36): dl_view_time_series::series_query::collect_colors has cognitive complexity 36 (threshold 15). Drivers by points: loops 5 (18 pts), if/else 10 (17 pts), boolean chains 1 (nesting depth added 20). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/series_query.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"679a0cea72b5990e40aad122c9fcef747b710ca267583ebb67aa0319c1bbf76e"}},{"ruleId":"D2","level":"warning","message":{"text":"Boxes2DExt.__init__ (cognitive 36): Boxes2DExt.__init__ has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (36 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":"dalaran_py/dalaran_sdk/dalaran/archetypes/boxes2d_ext.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"592936f03152effafe8f7ffb71ec6bca18a32ccf9eac8dcf3c9169fa287be51a"}},{"ruleId":"D2","level":"warning","message":{"text":"FilterCommand::run (cognitive 35): FilterCommand::run has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (23 pts), match/switch 3 (9 pts), loops 2, boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/filter.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb358d7f37cad79f0c066c25d7ad00534e1a99b60740cdf5c0b156abf7772782"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_sdk::spawn::spawn (cognitive 35): dl_sdk::spawn::spawn has cognitive complexity 35 (threshold 15). Drivers by points: if/else 21 (30 pts), boolean chains 3, 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":"crates/top/dl_sdk/src/spawn.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"5858637af55ff2c62c0cc42232bacb297922d3259f28a3a2421d555d83be02c6"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_data_ui::entity_db_ui::grid_content_ui (cognitive 35): dl_data_ui::entity_db_ui::grid_content_ui has cognitive complexity 35 (threshold 15). Drivers by points: if/else 20 (29 pts), boolean chains 4, 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":"crates/viewer/dl_data_ui/src/entity_db_ui.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e085151ca7a9f89fbb4073ac78cb81c80f419d07dffa07cc5703af34c9950a4"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_data_ui::video_ui::video_data_ui (cognitive 35): dl_data_ui::video_ui::video_data_ui has cognitive complexity 35 (threshold 15). Drivers by points: if/else 16 (28 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/video_ui.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"22dd3d995d64c7cb63b3efdf3ee1cf8fe9b7efe665f29892a0a2f1f7a89f8dd1"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_spatial::picking_ui_pixel::format_pixel_value (cognitive 35): dl_view_spatial::picking_ui_pixel::format_pixel_value has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 6 (19 pts), if/else 8 (16 pts) (nesting depth added 21). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/picking_ui_pixel.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c1cecba6e16f7a2c9edb8ebae8b6f8fcb0165000369723c2e3b4afd893ecf1f"}},{"ruleId":"D2","level":"warning","message":{"text":"App::run_ui_command (cognitive 35): App::run_ui_command has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 3 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/command_handling.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef62c9d110763854f9eda3c01513ffb627d137433f0b925d7deda9381b046360"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::cpp::quote_append_field_to_builder (cognitive 34): dl_types_builder::codegen::cpp::quote_append_field_to_builder has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (29 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/cpp/mod.rs"},"region":{"startLine":2091}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae812912620ed3360d656f56cd71953ce9be0761acf8054879b708b2c2b84ed"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::rust::util::string_from_quoted (cognitive 34): dl_types_builder::codegen::rust::util::string_from_quoted has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (28 pts), boolean chains 4, loops 1, match/switch 1 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/util.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a99a657f368fe2ce3b1dfa64e822c5b75f25b5261d2e0d49716c254ceb6f5dc"}},{"ruleId":"D2","level":"warning","message":{"text":"DataframeQueryTableProvider::scan (cognitive 34): DataframeQueryTableProvider::scan has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 6 (8 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_common.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"538591fcbba97306f982b69f2a5f5b0a13076349433a4104b83192e55e889e00"}},{"ruleId":"D2","level":"warning","message":{"text":"RawRrdManifest::check_manifest_schema_matches_sorbet_schema (cognitive 34): RawRrdManifest::check_manifest_schema_matches_sorbet_schema has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (23 pts), loops 5 (10 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"47017ae8955166926040cecdada7d781dd4600479d7f4c95675299b6695dc0f4"}},{"ruleId":"D2","level":"warning","message":{"text":"FloatFormatOptions::format_f64 (cognitive 34): FloatFormatOptions::format_f64 has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (29 pts), loops 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":"crates/utils/dl_format/src/lib.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8869e51eec6b31b3a61123ba7442c90a0d2d6f6f5cb4aba601b3a2b1cb73b2"}},{"ruleId":"D2","level":"warning","message":{"text":"Sender::send_impl (cognitive 34): Sender::send_impl has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_quota_channel/src/sync/mod.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5601752309fcd13810bf28cc5a00d13f7cae03ec65329a99744c152f375445c"}},{"ruleId":"D2","level":"warning","message":{"text":"EyeState::handle_tracking_entity (cognitive 34): EyeState::handle_tracking_entity has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (28 pts), boolean chains 3, match/switch 2 (3 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/eye.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"0643478367b85f9a8450c429b68142b4bdba8a0c10e580bf89f8774b64a53e6e"}},{"ruleId":"D2","level":"warning","message":{"text":"App::receive_messages (cognitive 34): App::receive_messages has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (26 pts), match/switch 3 (6 pts), boolean chains 1, 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":"crates/viewer/dl_viewer/src/app/logic.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a450f30027028967cf44c1f729a7b93209a3bb245fa30b42914cc650ccf1e1"}},{"ruleId":"D2","level":"warning","message":{"text":"App::receive_log_msg (cognitive 34): App::receive_log_msg has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (28 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/logic.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b24eb54a02905dbda8423468ef5c19349ee278fcbabb9cccbe87e25bcda458"}},{"ruleId":"D2","level":"warning","message":{"text":"SegmentUrlUdf::invoke_with_args (cognitive 34): SegmentUrlUdf::invoke_with_args has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (31 pts), loops 2, 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":"dalaran_py/src/catalog/segment_url_udf.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f52addf9c2f1faeb4bed177f021b09bbe08c35543edd386377cb4d948cc0e51"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::rust::api::quote_from_impl_from_obj (cognitive 33): dl_types_builder::codegen::rust::api::quote_from_impl_from_obj has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20 (33 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/api.rs"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fcda231251a243c82761ac1742c1976bd032da1f311248a27df63267ba4618a"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkStore::drop_time_range (cognitive 33): ChunkStore::drop_time_range has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (30 pts), loops 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/drop_time_range.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"c90c3d0339239c06371a7438f1139e3a442dbeaa7f7fec8fe5240cf4a20c956f"}},{"ruleId":"D2","level":"warning","message":{"text":"PipelineBudget::reserve_with_priority (cognitive 33): PipelineBudget::reserve_with_priority has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 3 (5 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/pipeline_budget.rs"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d378d3259c487505028705cffe620ca19171a0a2107075d76c6652247d1303d"}},{"ruleId":"D2","level":"warning","message":{"text":"dalaran::commands::entrypoint::assert_receive_into_entity_db (cognitive 33): dalaran::commands::entrypoint::assert_receive_into_entity_db has cognitive complexity 33 (threshold 15). Drivers by points: match/switch 5 (18 pts), if/else 7 (14 pts), loops 1 (nesting depth added 20). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/entrypoint.rs"},"region":{"startLine":1544}}}],"partialFingerprints":{"codehealthFindingId/v1":"f995ccb99e38621591a41da7b844c62d8a5962594d47f41fbac5de20f64da2a0"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_data_ui::video_ui::decoded_frame_ui (cognitive 33): dl_data_ui::video_ui::decoded_frame_ui has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (25 pts), match/switch 2 (6 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/video_ui.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"948b564fa82a42881e97e05acf26cbd64ac5c9dc436e5b32abf79b7d562c6ba3"}},{"ruleId":"D2","level":"warning","message":{"text":"ServerEntriesData::new (cognitive 33): ServerEntriesData::new has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (21 pts), match/switch 3 (8 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_recording_panel/src/data.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9756f62d286e42bf2886467f1a634c07b363551e10e7eb9cd35e3c40f7b0e70"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformAxes3DVisualizer::execute (cognitive 33): TransformAxes3DVisualizer::execute has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/transform_axes_3d.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"382eba04b252c01110ed12fd8dec16d797f05227fb9bce42848e7369c4c333bb"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_spatial::picking_ui::picking (cognitive 33): dl_view_spatial::picking_ui::picking has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (27 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/picking_ui.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ce0f78c248eeb483805375b1ecfeea0eccb2fa5d8f41616e6d771ea2aafa96"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_datafusion::dataframe_query_provider::io_loop::chunk_stream_io_loop (cognitive 32): dl_datafusion::dataframe_query_provider::io_loop::chunk_stream_io_loop has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 4 (10 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider/io_loop.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db08efe972874f0a5aaf4dff93577e53f16c5b9ad49cc41d713934374636592"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_importer::importer_dlr::decode_and_stream (cognitive 32): dl_importer::importer_dlr::decode_and_stream has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (25 pts), match/switch 2 (5 pts), boolean chains 1, 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":"crates/store/dl_importer/src/importer_dlr.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f50d7173dc0ade8a9d48dd6f9b6217d9346f124c3315bffca4b98f006165c61"}},{"ruleId":"D2","level":"warning","message":{"text":"RrdManifest::concat (cognitive 32): RrdManifest::concat has cognitive complexity 32 (threshold 15). Drivers by points: loops 8 (21 pts), if/else 8 (10 pts), boolean chains 1 (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":"crates/store/dl_log_encoding/src/dlr/footer/dlr_manifest.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b52249f243b2ea71b76b213f66f369bc0795ee89b4b3eee644374f253d43e4f"}},{"ruleId":"D2","level":"warning","message":{"text":"CompareCommand::run (cognitive 32): CompareCommand::run has cognitive complexity 32 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 8 (15 pts), boolean chains 1 (nesting depth added 17). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/compare.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"58481008e22ac5dd20a9255ef3fc3ef5ec9e6dabd356e85822ad6f53c615b1b6"}},{"ruleId":"D2","level":"warning","message":{"text":"VerifyCommand::run (cognitive 32): VerifyCommand::run has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 5 (10 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/verify.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"801efb525b3e11355f2dd4ae637e93e9362e3b9b76d287322222239bb8972432"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_renderer::importer::gltf::import_mesh (cognitive 32): dl_renderer::importer::gltf::import_mesh has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/importer/gltf.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"697ef686866983f37d0554f7c7b99952cf7dbbfb2f27ae30b3e6d281c4726e7d"}},{"ruleId":"D2","level":"warning","message":{"text":"ProcMeshDrawableBuilder::add_batch (cognitive 32): ProcMeshDrawableBuilder::add_batch has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/utilities/proc_mesh_vis.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"21e233f8d47f688c77c7e8dde6fc9cd723803b93d983acce5a99a1307c8758b7"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_time_series::fallbacks::register_fallbacks (cognitive 32): dl_view_time_series::fallbacks::register_fallbacks has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 2 (4 pts), boolean chains 2, loops 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/fallbacks.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e319dd346840fe416b2aa3f6a05159ec493eeb5d83d54763eec91bb778c4b3d"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_viewer::ui::dev_panel::transform_cache_ui::paint::draw_transform_cache_contents (cognitive 32): dl_viewer::ui::dev_panel::transform_cache_ui::paint::draw_transform_cache_contents has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 4, boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/dev_panel/transform_cache_ui/paint.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cf70d5f8fe13d282a2bcd81c590c8de818230c769c0f8cee43e1f3e98019fff"}},{"ruleId":"D2","level":"warning","message":{"text":"Rgba32Ext.native_to_pa_array_override (cognitive 32): Rgba32Ext.native_to_pa_array_override has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (25 pts), error handling 2 (5 pts), boolean chains 2 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/datatypes/rgba32_ext.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f647171629e93f268bd9be00426d2fe56c598fe1a78c105dc62c0eaf091daa2"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::docs::website::write_fields (cognitive 31): dl_types_builder::codegen::docs::website::write_fields has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 3 (5 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 13). Of this number, 30 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/docs/website.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4ef3c5f10575f0e3577c4b5d34f07600ae83a5c56c25fc704f7aefa5c6c8539"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::python::quote_field_converter_from_field (cognitive 31): dl_types_builder::codegen::python::quote_field_converter_from_field has cognitive complexity 31 (threshold 15). Drivers by points: if/else 18 (28 pts), boolean chains 2, 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":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":1979}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee3aef16fc8f18f5adb99a86497f70b2b37dc58a3b56829b3bdf756913268064"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_grpc_client::write::message_proxy_client (cognitive 31): dl_grpc_client::write::message_proxy_client has cognitive complexity 31 (threshold 15). Drivers by points: match/switch 6 (15 pts), if/else 6 (14 pts), loops 2 (nesting depth added 17). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_grpc_client/src/write.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6344f9762e079b21fcd51b99e2dc4e4a185bcf05e0787297b5b5609db7988bc"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_parquet::grouping::compute_column_groups (cognitive 31): dl_parquet::grouping::compute_column_groups has cognitive complexity 31 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 4 (9 pts), match/switch 2 (4 pts) (nesting depth added 20). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_parquet/src/grouping.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d6898cd75fbb4724772335304db84f92367d316e45640106ab6c2ab1e9716a"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_sorbet::dataframe_to_chunks::stamp_dataframe_metadata (cognitive 31): dl_sorbet::dataframe_to_chunks::stamp_dataframe_metadata has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/dataframe_to_chunks.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6f49d2fbefafcbfad9b292bd31d92f5e27eed25a101bb8380c1fe83d32ae61"}},{"ruleId":"D2","level":"warning","message":{"text":"VideoDataDescription::load_mp4_from_reader (cognitive 31): VideoDataDescription::load_mp4_from_reader has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 4 (11 pts), loops 4 (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":"crates/utils/dl_video/src/demux/mp4.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"350e02d45145cbbfebac62627de5ecd1cac772776eff1222c6ff53d3ab993e07"}},{"ruleId":"D2","level":"warning","message":{"text":"App::load_data_source (cognitive 31): App::load_data_source has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (20 pts), match/switch 4 (8 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":"crates/viewer/dl_viewer/src/app/add_data_source.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a405f0ac0b1c4c83f23c7fc72e85cbad29cb61d4caff47a8aa8175ed2dfaea4"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_viewer_context::cache::video_stream_cache::handle_out_of_order_chunk (cognitive 31): dl_viewer_context::cache::video_stream_cache::handle_out_of_order_chunk has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 5 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs"},"region":{"startLine":1974}}}],"partialFingerprints":{"codehealthFindingId/v1":"4950bc74079ab585930e0ab8d124572b15ad75b18ac86ae60aeeb1325ed13b08"}},{"ruleId":"D2","level":"warning","message":{"text":"QuotedObject::from_union (cognitive 30): QuotedObject::from_union has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (24 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":"crates/build/dl_types_builder/src/codegen/cpp/mod.rs"},"region":{"startLine":987}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d6c749ac6d56df460bebec70b5debb205a659ba9f5f336d5517df0f366966ed"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_datafusion::pushdown_expressions::merge_queries_and (cognitive 30): dl_datafusion::pushdown_expressions::merge_queries_and has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (25 pts), match/switch 1 (3 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/pushdown_expressions.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"28426b555900d9ee7f645bcb0bbda17d5e6d6ee7e32e9deb05821135de2515ef"}},{"ruleId":"D2","level":"warning","message":{"text":"ExternalImporter::import_from_path (cognitive 30): ExternalImporter::import_from_path has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 4 (9 pts), loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_external.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"df410a1d2aff2090d7aa7eb1bca99028c31dbd6b75f64728be3b7f283b88feaf"}},{"ruleId":"D2","level":"warning","message":{"text":"GaussianSplatBatchBuilder::add_gaussians (cognitive 30): GaussianSplatBatchBuilder::add_gaussians has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (17 pts), loops 3 (10 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/gaussian_splat_builder.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f89127e48528a38edc98ca2c2e37bb8520562d1076c0ac51ccbb8cbde6960e"}},{"ruleId":"D2","level":"warning","message":{"text":"App::with_commands (cognitive 30): App::with_commands has cognitive complexity 30 (threshold 15). Drivers by points: if/else 19 (23 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/mod.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b8b9df73727769949e8e0e4876b56040be5f3f7a1f5f18ec843c2d102fc0f4"}},{"ruleId":"D2","level":"warning","message":{"text":"RrdManifestIndex::mark_roots_as (cognitive 29): RrdManifestIndex::mark_roots_as has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/dlr_manifest_index.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bde3d298f0be1820a73a2e40f6ca8244f42e52acb21e6e80978138fff4c5681"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_video::decode::ffmpeg_cli::ffmpeg::read_ffmpeg_output (cognitive 29): dl_video::decode::ffmpeg_cli::ffmpeg::read_ffmpeg_output has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 3 (9 pts), loops 1 (nesting depth added 17). Of this number, 25 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/decode/ffmpeg_cli/ffmpeg.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f5f69abecded7887f092e13524e1949c55522af8d6fb4824b15f580179f311"}},{"ruleId":"D2","level":"warning","message":{"text":"DataResultData::from_data_result_and_filter (cognitive 29): DataResultData::from_data_result_and_filter has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 2, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_blueprint_tree/src/data.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"582735611bbcce66083f37ed9f4155da8e47c387df1dee2f3d98fbc733844cb5"}},{"ruleId":"D2","level":"warning","message":{"text":"BarChartView::ui (cognitive 29): BarChartView::ui has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 3 (4 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_bar_chart/src/view_class.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"122765a58034c09e45d5d6690532443ed61cbcd4afd752e12ded5f9f9c4b6698"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_spatial::shared_fallbacks::register_fallbacks (cognitive 29): dl_view_spatial::shared_fallbacks::register_fallbacks has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19 (21 pts), boolean chains 6, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/shared_fallbacks.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3301dd205060277ffcb7116f084b22682aadc445a8baaa7864e7842da9b09c"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_spatial::visualizers::utilities::transform_retrieval::is_valid_space_for_content (cognitive 29): dl_view_spatial::visualizers::utilities::transform_retrieval::is_valid_space_for_content has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 4 (8 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/utilities/transform_retrieval.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d84518039f824d12b14d8e61eb73bac9554b030c7815d80f60cd95a6e45b207"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_viewer_context::cache::video_stream_cache::handle_deletion (cognitive 29): dl_viewer_context::cache::video_stream_cache::handle_deletion has cognitive complexity 29 (threshold 15). Drivers by points: if/else 19 (26 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c13c2be093576d0dca441c51b1076d19807f203a1b071128bae181f1e9e053"}},{"ruleId":"D2","level":"warning","message":{"text":"PendingRow::many_into_chunks (cognitive 28): PendingRow::many_into_chunks has cognitive complexity 28 (threshold 15). Drivers by points: loops 10 (17 pts), if/else 3 (10 pts), boolean chains 1 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/batcher.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b973c4ff1c348133a202fe76bd9ec30d085bac1cf764053fe18700da2cee68"}},{"ruleId":"D2","level":"warning","message":{"text":"QueryHandle::init_ (cognitive 28): QueryHandle::init_ has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (21 pts), match/switch 2 (4 pts), loops 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f7db91f65fbc5e63070616f254843430d26faa87cce978bab26ed61292f368c"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_datafusion::dataframe_query_provider::io_loop::create_request_batches_with_segment_limit (cognitive 28): dl_datafusion::dataframe_query_provider::io_loop::create_request_batches_with_segment_limit has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider/io_loop.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"269c18e31d72e751d79fbf21fc23300ad933500fe6e32d9d61a336a18699c7a9"}},{"ruleId":"D2","level":"warning","message":{"text":"EntityDb::app_ui (cognitive 28): EntityDb::app_ui has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (22 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/entity_db_ui.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b01e466608265f5b7183b1394cad9aa2d770b3767850ea603d081fbc25a660dc"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_grpc_server::spawn_from_rx_set (cognitive 28): dl_grpc_server::spawn_from_rx_set has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (19 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_grpc_server/src/lib.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d4a2908277d272ec1078cc5ce6a2b277ff19000cacc2c29c5af03c95f1d411"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr::eval (cognitive 28): Expr::eval has cognitive complexity 28 (threshold 15). Drivers by points: match/switch 10 (22 pts), if/else 3 (6 pts) (nesting depth added 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/selector/eval.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"eae794cc65fb6b7dc86d71ff81fe8d3e7a5f2eac32e67a04b7863897d75c0d4b"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_log_encoding::dlr::stream_from_http::stream_from_http (cognitive 28): dl_log_encoding::dlr::stream_from_http::stream_from_http has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 4 (12 pts), loops 1 (3 pts) (nesting depth added 19). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/stream_from_http.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"93e0c42318af692f1da314c1951a6d4d76f3226250be2dfef4aa22c379d1ab38"}},{"ruleId":"D2","level":"warning","message":{"text":"SplitCommand::split_store (cognitive 28): SplitCommand::split_store has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/split.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db74bc6a6f56498b7a40ab5944a888188e8f2fdc1d168a5912701c6e4bf21ff"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_ui::text_edit::autocomplete_text_edit (cognitive 28): dl_ui::text_edit::autocomplete_text_edit has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (22 pts), boolean chains 5, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/text_edit.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee9e3940ad883ac04f3e85ff0c6742b59eaf6763c8ac6378c3e9ae2c5dfce3e"}},{"ruleId":"D2","level":"warning","message":{"text":"App::receive_fetched_chunks (cognitive 28): App::receive_fetched_chunks has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (7 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/logic.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eab7d931f73e6b88e7712ace01801db12d64888ca19c0da3eb17a028bbb3ca1"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_viewer::ui::top_panel::top_bar_ui (cognitive 28): dl_viewer::ui::top_panel::top_bar_ui has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 4 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/top_panel.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc2f999d78d9fd991dd9cb633a5df6e3d4b43a7cdd02bd257318c304f1ff734"}},{"ruleId":"D2","level":"warning","message":{"text":"TilesDelegate::reports_button (cognitive 28): TilesDelegate::reports_button has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 5 (11 pts), match/switch 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport/src/viewport_ui.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b938e6778dd4b6c24144d26ce34b4127fbf2e8c259fa157cdbb41c4755d5f2"}},{"ruleId":"D2","level":"warning","message":{"text":"Transform3DExt.__init__ (cognitive 28): Transform3DExt.__init__ has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (20 pts), error handling 2 (5 pts), boolean chains 3 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/archetypes/transform3d_ext.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f87670fe3941ac11ee14da8ad6f7721577b73e4dc3a4b91e706b239c93092e"}},{"ruleId":"D2","level":"warning","message":{"text":"DataMetaPerTimeline::handle_event_for_row_count (cognitive 27): DataMetaPerTimeline::handle_event_for_row_count has cognitive complexity 27 (threshold 15). Drivers by points: loops 7 (21 pts), if/else 2 (5 pts), match/switch 1 (nesting depth added 17). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/data_meta_per_timeline.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e3f56468450df27da2bff95d9212186a3e5c0e9ac43b9c94a692215d7454c1"}},{"ruleId":"D2","level":"warning","message":{"text":"Client::flush_blocking (cognitive 27): Client::flush_blocking has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 2 (5 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_grpc_client/src/write.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e318e287655b2cc37c861bf582bc0496a548cf0431df3f1d3a94a9b16b8edf"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolvedEntityPathFilter::is_superset_of (cognitive 27): ResolvedEntityPathFilter::is_superset_of has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 4 (12 pts), loops 2, boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/path/entity_path_filter.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"064c0b582b87f29c7db4d71c5cb6c8e08e922ca82f9ee14165e1ac162b40515f"}},{"ruleId":"D2","level":"warning","message":{"text":"EntityPathPart::parse_forgiving_with_warning (cognitive 27): EntityPathPart::parse_forgiving_with_warning has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (9 pts), boolean chains 2, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/path/entity_path_part.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d43f4e07f75f0415965af851be80f6a6d08d3c000b054059243c74e2628180e"}},{"ruleId":"D2","level":"warning","message":{"text":"DecoderRegistry::plan (cognitive 27): DecoderRegistry::plan has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/decoders/mod.rs"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba8263931a768bbd79f16d027a009ce6de7ad420c5ed8baaba6fb51272408c42"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_log::add_builtin_log_filter (cognitive 27): dl_log::add_builtin_log_filter has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 3 (9 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":"crates/utils/dl_log/src/lib.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf885c475ed7b0401eee453135e5e5141a29866603c0248d3dd779f8b3ff674"}},{"ruleId":"D2","level":"warning","message":{"text":"VideoPlayer::enqueue_samples (cognitive 27): VideoPlayer::enqueue_samples has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 6, match/switch 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/player/mod.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2f51450b713503177c0c6952ec968b5cbe145e2cd6d96978a86ae37f4b94314"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view::query::latest_at_with_blueprint_resolved_data_polymorphic (cognitive 27): dl_view::query::latest_at_with_blueprint_resolved_data_polymorphic has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 2 (8 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/src/query.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"2559442f9215164b439f044dda26e6b7c7a1a4ba5b2161f4a1bb8ee5b5a1180b"}},{"ruleId":"D2","level":"warning","message":{"text":"Boxes3DExt.__init__ (cognitive 27): Boxes3DExt.__init__ has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (18 pts), error handling 2 (7 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/archetypes/boxes3d_ext.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae5011a5141dbaa31104590159139505d4fc2f3cf845aaa0870a3ba258e6f6c"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_time_panel::data_density_graph::paint_loaded_indicator_bar (cognitive 26): dl_time_panel::data_density_graph::paint_loaded_indicator_bar has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_panel/src/data_density_graph.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f6657de5eb905ae0ae8c9049d2226fcdc729cd66e008f5877e180c4c67e6331"}},{"ruleId":"D2","level":"warning","message":{"text":"DataframeTableDelegate::header_cell_ui (cognitive 26): DataframeTableDelegate::header_cell_ui has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_dataframe/src/dataframe_ui.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2f64a22d5678fb64fde12b0c18e4aff58c899028110e38fc317534cb3fee69f"}},{"ruleId":"D2","level":"warning","message":{"text":"IntroItem::show (cognitive 26): IntroItem::show has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (19 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/welcome_screen/intro_section.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"495bdc9156ba8225ba18004366ce3162071f56bbd7daa99e9c8c60756d456373"}},{"ruleId":"D2","level":"warning","message":{"text":"TimeControl::update_from_blueprint (cognitive 26): TimeControl::update_from_blueprint has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/time_control/mod.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"03cbc09ecc9e88241ed923b445947ad8d435dabf1ded23bc6a553177dadfc3bd"}},{"ruleId":"D2","level":"warning","message":{"text":"TabWidget::new (cognitive 26): TabWidget::new has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17 (24 pts), boolean chains 1, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport/src/viewport_ui.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3e7c227526c33f88d30ed1883d076740bbf9befa3a65a9b091e1fd0437479b"}},{"ruleId":"D2","level":"warning","message":{"text":"VideoFrameDecoder._decode_to_target (cognitive 26): VideoFrameDecoder._decode_to_target has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 6 (8 pts), boolean chains 5 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/_decoders.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"17c9699a0124edcf959dd4eb1be73da046e29e651b271b1c8289e65f561fd4ba"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::docs::snippets_ref::collect_snippets_recursively (cognitive 25): dl_types_builder::codegen::docs::snippets_ref::collect_snippets_recursively has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 6 (12 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/docs/snippets_ref.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ace1214164be57b8c55f6eb001b074543d1be199f8be464227c67ce5b9e08b"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::python::quote_arrow_support_from_obj (cognitive 25): dl_types_builder::codegen::python::quote_arrow_support_from_obj has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (21 pts), match/switch 3 (4 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":2259}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c444d541844567b6da860a36bff7d85a7bbe27ea1092c7a305cc6d660eba48d"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_datafusion::pushdown_expressions::apply_filter_expr_to_queries (cognitive 25): dl_datafusion::pushdown_expressions::apply_filter_expr_to_queries has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 4 (9 pts) (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/pushdown_expressions.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"19730ac0ad84bdd5ca33d57be73770a72d2dd4f938edda418f9065546eccf52c"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_sdk_types::archetypes::points3d_ext::read_ply (cognitive 25): dl_sdk_types::archetypes::points3d_ext::read_ply has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (11 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sdk_types/src/archetypes/points3d_ext.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"809bf1eda3c3682ab299529769453b3f80037109b542aded22b024bb9cc38000"}},{"ruleId":"D2","level":"warning","message":{"text":"Args::generate_markdown_manual (cognitive 25): Args::generate_markdown_manual has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17 (19 pts), boolean chains 5, loops 1 (nesting depth added 2). None of this is in the body itself: all 25 points belong to 2 function items inside it that branch (generate_arg_doc, generate_markdown_manual). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/entrypoint.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"a92c2692e3bda6ed8af79a6c64b833346b59129e35b78c3cc8543faf7a9fafa5"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_analytics::native::pipeline::flush_pending_events (cognitive 25): dl_analytics::native::pipeline::flush_pending_events has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), match/switch 2 (7 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_analytics/src/native/pipeline.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"b573fcdc2245df06b00bde9d8ba74855cab2b47545e56b150bf6cacbd2dede4f"}},{"ruleId":"D2","level":"warning","message":{"text":"LatestAllInstanceResult::data_ui (cognitive 25): LatestAllInstanceResult::data_ui has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (22 pts), loops 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/latest_all_instance_ui.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef61a5f5412e6cd44e393a28a3b089f7dae1464f817426cab51e664de881c45a"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFusionQuery::execute_streaming (cognitive 25): DataFusionQuery::execute_streaming has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 2 (6 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/datafusion_adapter.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"149d91a00d81ea4a66271f018fc397ce0973e6b96660e09cb2e9225e965317bd"}},{"ruleId":"D2","level":"warning","message":{"text":"MeshDrawData::new (cognitive 25): MeshDrawData::new has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 6 (11 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a72283e9dfb97d5a9c05181e3b299a7a898489d22fdd46947bb01caac790948"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_ui::notifications::show_notification (cognitive 25): dl_ui::notifications::show_notification has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (22 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":"crates/viewer/dl_ui/src/notifications.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb3b73a60e3d77bfceddc9869a5480543b05954fb584831ea5d6ced120f8be24"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_spatial::proc_mesh::capsule_wireframe_lines (cognitive 25): dl_view_spatial::proc_mesh::capsule_wireframe_lines has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 4 (5 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/proc_mesh.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"42fb2ba4305d9b5c683abe5b3a5d5b2b9497f3a04bcfb5ac9c7ebd19d674735c"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_spatial::visualizers::video::show_video_frame (cognitive 25): dl_view_spatial::visualizers::video::show_video_frame has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 2, match/switch 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/video/mod.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ceffff67e516cf6a56efbd948b64bd396cd0902b605d7af2087a1ce26ebb32"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_state_timeline::view_class::show_group (cognitive 25): dl_view_state_timeline::view_class::show_group has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_state_timeline/src/view_class.rs"},"region":{"startLine":898}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5d7e17c272ec6f9fa0767a0b0a9a6476ab2c5aa7b4b85d8b05809187bf8a8e"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_time_series::series_query::collect_radius_ui (cognitive 25): dl_view_time_series::series_query::collect_radius_ui has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (11 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/series_query.rs"},"region":{"startLine":358}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb596002f28e29647643c4263dafe52db6b76c331f07380f985ea4bebcf51db"}},{"ruleId":"D2","level":"warning","message":{"text":"App::validate_loaded_events (cognitive 25): App::validate_loaded_events has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (8 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/logic.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a31346d00215288291a0948b864d2772af684c7f0bd7757c601f90efd85d9ef"}},{"ruleId":"D2","level":"warning","message":{"text":"TensorDataExt.__init__ (cognitive 25): TensorDataExt.__init__ has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17 (22 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/datatypes/tensor_data_ext.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"39482254b4d1eec6a43f6a145ce545e7b75eb5643a466afe3a66dd93284f5a1b"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.__init__ (cognitive 25): Server.__init__ has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/server.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0bda2dedd7b5961f171b63d28533d07a2a3fb74e16363d01b8992a2a6354f57"}},{"ruleId":"D2","level":"warning","message":{"text":"url_generation.segment_url (cognitive 25): url_generation.segment_url has cognitive complexity 25 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 4, ternaries 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/utilities/datafusion/functions/url_generation.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0901f9ca968836746d2ecf539783d46f6e542251aae23151a6c06950bf8f19c3"}},{"ruleId":"D2","level":"warning","message":{"text":"SnippetsRefCodeGenerator::generate_fallible (cognitive 24): SnippetsRefCodeGenerator::generate_fallible has cognitive complexity 24 (threshold 15). Drivers by points: if/else 20, boolean chains 3, match/switch 1. Of this number, 14 points are the body\u0027s own statements and 10 belong to one function item inside it that branches. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/docs/snippets_ref.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c144b6fb7110b6341e9aef1da86064532a905f9964f362065581a78fd74f828"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::rust::util::doc_as_lines (cognitive 24): dl_types_builder::codegen::rust::util::doc_as_lines has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/util.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"8988118feda4cb9e6e773aaf470da2f9c6ce29614738d2ee4bf934c15f36e4e5"}},{"ruleId":"D2","level":"warning","message":{"text":"Chunk::row_id_range_per_component (cognitive 24): Chunk::row_id_range_per_component has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 4 (8 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/chunk.rs"},"region":{"startLine":842}}}],"partialFingerprints":{"codehealthFindingId/v1":"02824827b5781f68f79fe654c23df88f89bf9fd21cfc5eb768ad2a33f8479ed2"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_lenses_core::plan::plan (cognitive 24): dl_lenses_core::plan::plan has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 3, boolean chains 2, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/plan.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2358869fbc924d2d91a568789428d29ef44da4f1e0cc0dde0d09f90380607b"}},{"ruleId":"D2","level":"warning","message":{"text":"FrameIdRegistry::register_all_frames_in_chunk (cognitive 24): FrameIdRegistry::register_all_frames_in_chunk has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (17 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/frame_id_registry.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"061cdc118bea1b3cb8d7878a1e8254af99f4d0a7194374b521319b3994ccd9ce"}},{"ruleId":"D2","level":"warning","message":{"text":"CachedTransformsForTimeline::remove_chunk (cognitive 24): CachedTransformsForTimeline::remove_chunk has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 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":"crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd2a26347f4d9f00a07ca4804b0039b2dbc192ab9f358bf726bf46424b952aeb"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_dataframe_ui::grid_view::flag_button (cognitive 24): dl_dataframe_ui::grid_view::flag_button has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/grid_view.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecac3609a842ce7370a3e4a5a809ccdd55181b4b1993646afc048b2418266c5"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view::query::range_with_blueprint_resolved_data_polymorphic (cognitive 24): dl_view::query::range_with_blueprint_resolved_data_polymorphic has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (10 pts), match/switch 2 (8 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/src/query.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2ef2dbc9d7cc6a05c7388be35318edaaf880b8643118ab86f888bb108cabc0"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_tensor::dimension_mapping::find_width_height_dim_indices (cognitive 24): dl_view_tensor::dimension_mapping::find_width_height_dim_indices has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_tensor/src/dimension_mapping.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"305de90949eaa4a8cc5f947bfbcd2067261c223796ae86df490212b3eda5e918"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_tensor::view_class::paint_axis_names (cognitive 24): dl_view_tensor::view_class::paint_axis_names has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (24 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_tensor/src/view_class.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85817819ef9109a86db696922d504ded6929ec0058f2cb7a8de264582611fb3"}},{"ruleId":"D2","level":"warning","message":{"text":"SeriesLinesSystem::build_draw_data (cognitive 24): SeriesLinesSystem::build_draw_data has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 3 (8 pts), loops 2, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/line_visualizer_system.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c219d9b9f85fc82b040f0c19f0ba4851ce2ccc48613e23202f742e74082887d"}},{"ruleId":"D2","level":"warning","message":{"text":"ExampleSection::ui (cognitive 24): ExampleSection::ui has cognitive complexity 24 (threshold 15). Drivers by points: loops 6 (11 pts), if/else 4 (8 pts), match/switch 2 (5 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":"crates/viewer/dl_viewer/src/ui/welcome_screen/example_section.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ffaaeb386fe5a8436adc6235f711af999208f0a5b7c038a0215f597835839c7"}},{"ruleId":"D2","level":"warning","message":{"text":"VideoStreamCache::handle_store_event (cognitive 24): VideoStreamCache::handle_store_event has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 5 (10 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b47f7f4566089a33d7d3398fed628267118417d04f2fcfc3ffb0f7fade0305"}},{"ruleId":"D2","level":"warning","message":{"text":"CompileContext::take_split_receiver (cognitive 24): CompileContext::take_split_receiver has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 2 (4 pts), boolean chains 3, 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":"dalaran_py/src/chunk_stream/engine.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"a84d894f97a6cb31633989d5d1747cdd21b3c6109bbff713728b75c3a332bf2b"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::cpp::lines_from_docs (cognitive 23): dl_types_builder::codegen::cpp::lines_from_docs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (5 pts), match/switch 1 (4 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/cpp/mod.rs"},"region":{"startLine":2711}}}],"partialFingerprints":{"codehealthFindingId/v1":"d926409df56b96679f4700213da1ab2edb163862e6f79419bcf3408c8aab9bc8"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_chunk_store::rebatch_videos::rebatch_video_chunks_to_gops (cognitive 23): dl_chunk_store::rebatch_videos::rebatch_video_chunks_to_gops has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 5, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/rebatch_videos.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"105b8c86d065efbcb2839d83d32e1f3d9e577660cb7fd9f01dd33c6565b11dbe"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_grpc_server::spawn_with_recv_and_services (cognitive 23): dl_grpc_server::spawn_with_recv_and_services has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 5 (15 pts), if/else 3 (7 pts), loops 1 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_grpc_server/src/lib.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f476dcd6261e9e0a80ec049a64bbe842f83f3e699170eb1096b70afe321ea0"}},{"ruleId":"D2","level":"warning","message":{"text":"LeRobotEpisodeData::parse_feature_metadata (cognitive 23): LeRobotEpisodeData::parse_feature_metadata has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (18 pts), match/switch 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/lerobot/datasetv3.rs"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"2425349c80a029325be7cc9541b0032da57bc65a9a37a5638e4b6fc38afdb463"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_log_types::path::entity_path_filter::split_whitespace_smart (cognitive 23): dl_log_types::path::entity_path_filter::split_whitespace_smart has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 6, loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/path/entity_path_filter.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"b614ca6c7909fc3fe38f31fc3d245ddb7f6a4273ca207fa2216f646482bfc1b3"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_tf::transform_forest::transforms_at (cognitive 23): dl_tf::transform_forest::transforms_at has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 1 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_forest.rs"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99b493d68e493700837f4b3af333279d1d9b7a57d7f8e2401329a336d1823c4"}},{"ruleId":"D2","level":"warning","message":{"text":"Fragment::from_str (cognitive 23): Fragment::from_str has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 4 (16 pts), if/else 2 (6 pts), loops 1 (nesting depth added 16). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_uri/src/fragment.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"8970b1cd6ae0a5927c0460cddc2c2b8d332d7890621319ab2891e404735cdf53"}},{"ruleId":"D2","level":"warning","message":{"text":"VideoPlayer::frame_at (cognitive 23): VideoPlayer::frame_at has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 2, match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/player/mod.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"49ad0e950f3664d3830ef8dfc13b488ad6a18fcc955f33ef82a568a93a493bc1"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_ui::relative_time_range::edit_boundary_ui (cognitive 23): dl_ui::relative_time_range::edit_boundary_ui has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 4 (6 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/relative_time_range.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e8a7bde78a84aff902ec62a0abacb26be365b4cdc63e8ca7b6730344c5bcd1"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_viewer::prefetch_chunks::prefetch_chunks_for_recordings (cognitive 23): dl_viewer::prefetch_chunks::prefetch_chunks_for_recordings has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 2 (5 pts), loops 4, boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/prefetch_chunks.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0cf0ca520a9572aaac366f1a1eb506107cd5fdfb9e405576427c8c54d790f3"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_viewer::ui::top_panel::panel_buttons_r2l (cognitive 23): dl_viewer::ui::top_panel::panel_buttons_r2l has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/top_panel.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0df3ad0efc45fd6e0d67acac437a6ad3c214354d7ef5a71fc186fb9e90c8803"}},{"ruleId":"D2","level":"warning","message":{"text":"StoreHub::purge_fraction_of_ram (cognitive 23): StoreHub::purge_fraction_of_ram has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 6 (7 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/store_hub.rs"},"region":{"startLine":1039}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f191a790b760b6d80c97da538b4c85f1c94f9e794f078a9ce798b7a14b5e9c6"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_viewer_context::cache::video_stream_cache::update_sample_durations (cognitive 23): dl_viewer_context::cache::video_stream_cache::update_sample_durations has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 3, loops 3, 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":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs"},"region":{"startLine":1238}}}],"partialFingerprints":{"codehealthFindingId/v1":"c438e6b3f655c8508ea1e1a529f65c4228d44c979b8e70d75a0e9006037dd6e1"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_viewer_context::cache::video_stream_cache::find_affected_sample_range (cognitive 23): dl_viewer_context::cache::video_stream_cache::find_affected_sample_range has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 4, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs"},"region":{"startLine":1865}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c87186ea9b1e300e321cafea7654b29911208daa9d65476fab7aac9e2d2716"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_component_fallbacks::component_fallbacks::archetype_field_fallbacks (cognitive 23): dl_component_fallbacks::component_fallbacks::archetype_field_fallbacks has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_fallbacks/src/component_fallbacks.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e0b0e1bbcc3cd8a61bf9fcbc48d1f81b706fb458d0960fa7d3628017938917"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::rust::deserializer::quote_arrow_deserializer (cognitive 22): dl_types_builder::codegen::rust::deserializer::quote_arrow_deserializer has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (20 pts), match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/deserializer.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e765411bda65b0424a3f1727870c979af970c6f3b0ada89648672124d952f8"}},{"ruleId":"D2","level":"warning","message":{"text":"Chunk::sanity_check (cognitive 22): Chunk::sanity_check has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 2, loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/chunk.rs"},"region":{"startLine":1801}}}],"partialFingerprints":{"codehealthFindingId/v1":"300bef7dda2f3335d34ff41f1ee7847c6f3f41d16ad6f8f2d129f44328b08a6c"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_datafusion::chunk_fetcher::fetch_batch_via_direct_urls (cognitive 22): dl_datafusion::chunk_fetcher::fetch_batch_via_direct_urls has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 2 (4 pts), loops 3, boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/chunk_fetcher.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"a110d5beba4a8e00de03d3dbe793cedc40bc269134bb3c8d6b53040dd8271756"}},{"ruleId":"D2","level":"warning","message":{"text":"ReceiversFromUrlParams::new (cognitive 22): ReceiversFromUrlParams::new has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 1 (3 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/entrypoint.rs"},"region":{"startLine":1850}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90fcdb49966a67989f2a8e32b213d8212f644a45a6f02ae9a0b6ebfb963edec"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_data_ui::item_ui::entity_tree_stats_ui (cognitive 22): dl_data_ui::item_ui::entity_tree_stats_ui has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (17 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/item_ui.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c5bfa689d859a8801faf5a0e63bcb5dcb8e667c73e2bc8fe1bcf3e6035cdaf7"}},{"ruleId":"D2","level":"warning","message":{"text":"TimestampFilter::popup_ui (cognitive 22): TimestampFilter::popup_ui has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 2, loops 1, match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/filters/timestamp.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"882baa5009c0b9b8798498cce234a462a3c8ceaa60880cd1ea188854304ecc40"}},{"ruleId":"D2","level":"warning","message":{"text":"TableSelectionState::handle_row_click (cognitive 22): TableSelectionState::handle_row_click has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/table_selection.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"5791058d2dbd74ad02810867fe24783b588587f2780d466daa939c6971b3d8e0"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_memory_view::flamegraph::render_flamegraph_node (cognitive 22): dl_memory_view::flamegraph::render_flamegraph_node has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_memory_view/src/flamegraph.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2e438fd11e23a0929bbc0f539602a8e28f26030d3d1a7d88e37fafebf20026"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_selection_panel::visualizer_ui::visualizer_components (cognitive 22): dl_selection_panel::visualizer_ui::visualizer_components has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (17 pts), 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":"crates/viewer/dl_selection_panel/src/visualizer_ui.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06d29142a5bc9e1a01a5b37839e191aac94c9a07c50c11435c0506ecc0c69fe"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_bar_chart::view_class::find_nearest_bar (cognitive 22): dl_view_bar_chart::view_class::find_nearest_bar has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_bar_chart/src/view_class.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6551a87346da4ca57c9b5d932c368d491f8d3ae85a3b721390980a37415991d"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_spatial::picking::picking_gpu (cognitive 22): dl_view_spatial::picking::picking_gpu has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/picking.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa216f60e934e3d1f6e36fabaf9e2e65e305c32497fd6014b8771ee8c4b3f13"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_time_series::view_class::update_series_visibility_from_legend (cognitive 22): dl_view_time_series::view_class::update_series_visibility_from_legend has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/view_class.rs"},"region":{"startLine":1547}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a182756cd7becc2fdf5f8a9dd338dee680d2b0e78de2536e658b23fd9a21b7"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_viewer_context::cache::video_stream_cache::handle_compacted_chunk_addition (cognitive 22): dl_viewer_context::cache::video_stream_cache::handle_compacted_chunk_addition has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (14 pts), loops 5 (7 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs"},"region":{"startLine":671}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f7f9097ffde6a661157804bc226548235c36459379e3fe64e03b8936ebae16"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewportBlueprint::save_tree_as_containers (cognitive 22): ViewportBlueprint::save_tree_as_containers has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 3, boolean chains 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/viewport_blueprint.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1c95c1f52d3de432179d8e89c6a2e8b8b0a8a42eaad36616ebef35c5d12ef4a"}},{"ruleId":"D2","level":"warning","message":{"text":"Blueprint.__init__ (cognitive 22): Blueprint.__init__ has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (21 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":"dalaran_py/dalaran_sdk/dalaran/blueprint/api.py"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"502d195fd3b3204d55a93a99689eae4022904ce19cc3d08d2e7b501d7b5019d3"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::rust::deserializer::quote_iterator_transparency (cognitive 21): dl_types_builder::codegen::rust::deserializer::quote_iterator_transparency has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/deserializer.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"a719ed5af11ec1df7e437e1920dfdd3041172e7bb41efcadcccec83854d94ce3"}},{"ruleId":"D2","level":"warning","message":{"text":"QueryResults::from_chunk_ids (cognitive 21): QueryResults::from_chunk_ids has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/query.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"3161d3309156338677f5b9536ea125d9319695d3a6dbb9b495f926cbccb6e25c"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkStore::finalize_compaction (cognitive 21): ChunkStore::finalize_compaction has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 4 (9 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/compact.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c0b5be9e386eea3ee785dc015d5db310bf535cf21f6c1c9637dc955a7a58db6"}},{"ruleId":"D2","level":"warning","message":{"text":"LocalChunkStoreExec::execute (cognitive 21): LocalChunkStoreExec::execute has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/local_chunk_store_provider.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b0cdbdd508a09e9f7f41b1883c183014464b1d083d6d90164cbb83ad5eeab6"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkFetcher::high_prio_chunk_stage (cognitive 21): ChunkFetcher::high_prio_chunk_stage has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/dlr_manifest_index/chunk_prioritizer.rs"},"region":{"startLine":1004}}}],"partialFingerprints":{"codehealthFindingId/v1":"7197af84c45c00d6664400941b514e2cf16c4a2971c43cc368191170c841b46b"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_grpc_server::serve_from_channel (cognitive 21): dl_grpc_server::serve_from_channel has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_grpc_server/src/lib.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5997cb0846b7ae59030a1b1cc73a3acb53172a57130049ea73eeed7fb238bca"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_lenses::semantic::foxglove::packed_element_field::extract_voxel_indices (cognitive 21): dl_lenses::semantic::foxglove::packed_element_field::extract_voxel_indices has cognitive complexity 21 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (9 pts), boolean chains 2 (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":"crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbaad6f647e9dfd40ef8148f8805427bafd58d8f76d61d3e61aef8a2a22167f6"}},{"ruleId":"D2","level":"warning","message":{"text":"RawRrdManifest::calc_temporal_map (cognitive 21): RawRrdManifest::calc_temporal_map has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"3933f0ef1e5ad4ea1e275439750d35616112b36dd1bf9e76d3a9790b4f9dc4b1"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_mcap::decoders::protobuf::append_message_fields (cognitive 21): dl_mcap::decoders::protobuf::append_message_fields has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/decoders/protobuf.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb36dffc7927201c61eda6f8631f2f04942cdc75be61572b5c2f1b07045ca8e"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_sorbet::migrations::v0_0_2__to__v0_1_0::rewire_tagged_components (cognitive 21): dl_sorbet::migrations::v0_0_2__to__v0_1_0::rewire_tagged_components has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 6). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/migrations/v0_0_2__to__v0_1_0.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"94464c2a239508325bf257736f10dcb81436a57e88a50889d6a23cd2236326dc"}},{"ruleId":"D2","level":"warning","message":{"text":"dalaran::commands::doctor::recording::check_recording (cognitive 21): dalaran::commands::doctor::recording::check_recording has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 5 (8 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/doctor/recording.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e07b6e4f92af6308bb2aec2c19b0ccd3bc961ffb7ea4c054e82f09160674cea"}},{"ruleId":"D2","level":"warning","message":{"text":"LensesSink::send (cognitive 21): LensesSink::send has cognitive complexity 21 (threshold 15). Drivers by points: loops 2 (8 pts), match/switch 3 (7 pts), if/else 1 (5 pts), boolean chains 1 (nesting depth added 14). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/lenses/sink.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eeb04ea5a810bda9a14dd5ddd249c40ac6ce71a87c831656772b02cc878dcb7"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_perf_telemetry::prometheus::convert_to_prometheus (cognitive 21): dl_perf_telemetry::prometheus::convert_to_prometheus has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_perf_telemetry/src/prometheus.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fd7de491cb42d4a55e104cf890dd8edf12f28594f074b504ecdd21a468fbde"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_video::player::request_keyframe_before (cognitive 21): dl_video::player::request_keyframe_before has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 2 (3 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":"crates/utils/dl_video/src/player/mod.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"87605b894cceac59eb8286c167af313e340461b90abfab29a31c08d5bebd2790"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_data_ui::instance_path_ui::component_list_ui (cognitive 21): dl_data_ui::instance_path_ui::component_list_ui has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/instance_path_ui.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57d155d4a2879da84ff766b5d44fbbed836825d84b09e3aaee5fa143d744a73"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_data_ui::item_ui::entity_db_button_ui (cognitive 21): dl_data_ui::item_ui::entity_db_button_ui has cognitive complexity 21 (threshold 15). Drivers by points: if/else 15 (17 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/item_ui.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"46842994b32616963a9522b34d02edada7fb221250c6ef624ad5da47c9f077aa"}},{"ruleId":"D2","level":"warning","message":{"text":"GaussianSplatDrawData::new (cognitive 21): GaussianSplatDrawData::new has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b0c56efe97c012e278ab3db6f3b843727920f3cf3bb0ed2904de4a16b8550c"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_selection_panel::item_heading_with_breadcrumbs::item_bread_crumbs_ui (cognitive 21): dl_selection_panel::item_heading_with_breadcrumbs::item_bread_crumbs_ui has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/item_heading_with_breadcrumbs.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"93a05a4b931eee90bed222a95db44f553d2f3629457f34180f897c0fc3d88401"}},{"ruleId":"D2","level":"warning","message":{"text":"ListItemNavigation::end_if_root (cognitive 21): ListItemNavigation::end_if_root has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/list_item/navigation.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad4140642d01a49b2682822010433d7b1ee48974b843c1c8aa534b77a02a9c3"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_spatial::ui::create_labels (cognitive 21): dl_view_spatial::ui::create_labels has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/ui.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d756c83b391690b57e605a9b9ce384b1324b5e1f5aaeff934db80166ea2327"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_state_timeline::view_class::compute_render_items (cognitive 21): dl_view_state_timeline::view_class::compute_render_items 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":"crates/viewer/dl_view_state_timeline/src/view_class.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea35e0275d409b812454e53f475f2150384161593eb36d287b05b6751b9d955"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_time_series::line_visualizer_system::build_nan_island_marker_draw_data (cognitive 21): dl_view_time_series::line_visualizer_system::build_nan_island_marker_draw_data has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, loops 2 (3 pts), match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/line_visualizer_system.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"639509ee76acdbc73fa426d88abd9d6ad5c035acb32e9c11e32452f931c67e6e"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_time_series::view_class::find_nearest_data_point_and_show_tooltip (cognitive 21): dl_view_time_series::view_class::find_nearest_data_point_and_show_tooltip has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/view_class.rs"},"region":{"startLine":1307}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9cc651cd2f43dbcb883beff34a4f8ec3d27a8dcabd29d43993e43b8f538fc2"}},{"ruleId":"D2","level":"warning","message":{"text":"TimeControl::step_time_back_no_pause (cognitive 21): TimeControl::step_time_back_no_pause has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (TimeControl::step_time_fwd_no_pause) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/time_control/command.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"81cff8b9194b47498d009f3575fa1565822e012af0e1aff16edcefffb3ed8b85"}},{"ruleId":"D2","level":"warning","message":{"text":"TimeControl::step_time_fwd_no_pause (cognitive 21): TimeControl::step_time_fwd_no_pause has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (20 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (TimeControl::step_time_back_no_pause) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/time_control/command.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"c79cc48b1f3ace41a509a3841e1cea20f3502b83afe2d3dd426a070b997a4df7"}},{"ruleId":"D2","level":"warning","message":{"text":"TilesDelegate::top_bar_right_ui (cognitive 21): TilesDelegate::top_bar_right_ui has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport/src/viewport_ui.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"943ff4894f33211343a0402c8a8c72ef1eb8a145f5fe08e65566cccfd7d9feec"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewportBlueprint::set_content_visibility (cognitive 21): ViewportBlueprint::set_content_visibility has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (20 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":"crates/viewer/dl_viewport_blueprint/src/viewport_blueprint.rs"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"54e6e5917a7a36d0c9f71d52504ff514596fc17a59f856659657849938aaaf8e"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::python::code_for_union (cognitive 20): dl_types_builder::codegen::python::code_for_union has cognitive complexity 20 (threshold 15). Drivers by points: if/else 19, match/switch 1. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":1248}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7bbb29b319807e881e8cadad3add7fc4cb81d0da32fc00a6757000878b0586b"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkStore::gc_find_candidates (cognitive 20): ChunkStore::gc_find_candidates has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 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":"crates/store/dl_chunk_store/src/gc.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1915d36bca2edbe506ee45787bd28b79ac88ecbfcddbcc1f164d296a34afee"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkStore::drop_lineage_reference (cognitive 20): ChunkStore::drop_lineage_reference has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (16 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/writes.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf824695749208dc9ae8e5038b65efbdad2556b3aad87250b1abf1b5958e5b7"}},{"ruleId":"D2","level":"warning","message":{"text":"EntityPathPart::parse_strict (cognitive 20): EntityPathPart::parse_strict has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 2 (9 pts), if/else 5 (8 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/path/entity_path_part.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d52740640f6fbcf67637fc25c826b1e67037eb2d4afe3388ff598a006a362e7"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_mcap::parsers::ros2msg::sensor_msgs::point_cloud_2::add_field_value (cognitive 20): dl_mcap::parsers::ros2msg::sensor_msgs::point_cloud_2::add_field_value has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (19 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/point_cloud_2.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"7318ce4c6b6b6ae0fb37da46cffbded6dafd35d6c9ccd8a8242777c10cf9e818"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_mcap::recover::reconstruct_summary (cognitive 20): dl_mcap::recover::reconstruct_summary has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (7 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/recover.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de23c14c18bd0260482c8144a0017073b49f83cd170376e8c1f0909421caaba"}},{"ruleId":"D2","level":"warning","message":{"text":"ConnectionRegistryHandle::connect_and_validate_client_stack (cognitive 20): ConnectionRegistryHandle::connect_and_validate_client_stack has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 5 (7 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/connection_registry.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d796927e43006d35112ec9a713916e126c6133900ec8f63d45f39f6a3767dd"}},{"ruleId":"D2","level":"warning","message":{"text":"Source::index_ranges (cognitive 20): Source::index_ranges has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (19 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":"crates/store/dl_server/src/store/source.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e602e561535882d715244a13f4ae8dbd87a0f8a42467c50da992a084a46d1a9"}},{"ruleId":"D2","level":"warning","message":{"text":"TransformResolutionCache::add_static_chunk (cognitive 20): TransformResolutionCache::add_static_chunk has cognitive complexity 20 (threshold 15). Drivers by points: loops 7 (17 pts), if/else 3 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_resolution_cache/cache.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3e50896ecef2ccf0c0a0d3745482dd84458f9bd1d263cbb7ba74b8227370a37"}},{"ruleId":"D2","level":"warning","message":{"text":"PrintCommand::run (cognitive 20): PrintCommand::run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (6 pts), boolean chains 4, match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/print.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"18f74629e256ae9215302a5a7323d82692d8ff4edad82c74fc58e06a42256237"}},{"ruleId":"D2","level":"warning","message":{"text":"dalaran::commands::dlr::merge_optimize::optimize_dir_mirror (cognitive 20): dalaran::commands::dlr::merge_optimize::optimize_dir_mirror has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/merge_optimize.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf76a7f3b3b4ae1406668a253b04197d8fa21ffa23b70ea8f69c6a38ff3819fa"}},{"ruleId":"D2","level":"warning","message":{"text":"BlueprintTree::data_result_ui (cognitive 20): BlueprintTree::data_result_ui has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), match/switch 2 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_blueprint_tree/src/blueprint_tree.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bee0dbd04f340021aa697393174d2d942acc3454354deaa8f829def6b36014"}},{"ruleId":"D2","level":"warning","message":{"text":"DatastoreUi::ui (cognitive 20): DatastoreUi::ui has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), match/switch 2 (5 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_chunk_store_ui/src/chunk_store_ui.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf0049611415d6a364c693af9f20abd5e113fac795c8aa5837d9a8a8522e009"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_data_ui::video_ui::frame_info_ui (cognitive 20): dl_data_ui::video_ui::frame_info_ui has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/video_ui.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c4e0be7916dd79467f2239f770f6548329d552da8e2a13c0bfce89b5f8fe9b2"}},{"ruleId":"D2","level":"warning","message":{"text":"ReTable::header_cell_ui (cognitive 20): ReTable::header_cell_ui has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/dl_table.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b2ffc8674a5b6bdb70393a1f3a0d7fef2439e548773c657d689d2c0c147912"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_selection_panel::visible_time_range_ui::resolved_visible_history_boundary_ui (cognitive 20): dl_selection_panel::visible_time_range_ui::resolved_visible_history_boundary_ui has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 5 (8 pts) (nesting depth added 8). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/visible_time_range_ui.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cd5590569ef80115e226348863728eeaf360023538457d6d5c52b0ab899243b"}},{"ruleId":"D2","level":"warning","message":{"text":"TimePanel::data_density_graph_ui (cognitive 20): TimePanel::data_density_graph_ui has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_panel/src/time_panel.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"b019ddb27fdcdaf886d445882369dbace166f745abc8cc5493eb115a2cf4e304"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_spatial::visualizers::utilities::transform_retrieval::format_transform_info_result (cognitive 20): dl_view_spatial::visualizers::utilities::transform_retrieval::format_transform_info_result has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (19 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/utilities/transform_retrieval.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0c96b943c8d24407ac8e3c58e3b0c27d169b8b5254cd6ad4ff59bcb98361e1"}},{"ruleId":"D2","level":"warning","message":{"text":"MinMaxAggregator::aggregate (cognitive 20): MinMaxAggregator::aggregate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (6 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/aggregation.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d37ebe6be9720ab4b59970406b4e50a02c1623b82c1d7e610b11a16d550355b"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_time_series::visualizer_ui::visualizer_ui_element (cognitive 20): dl_view_time_series::visualizer_ui::visualizer_ui_element has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/visualizer_ui.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a7e9c28dd31928318d33a31ee6b5a63a28934a41cef4af1e4fc0cbb5786da3"}},{"ruleId":"D2","level":"warning","message":{"text":"TimeControl::set_play_state (cognitive 20): TimeControl::set_play_state has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 5, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/time_control/mod.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"649873f019b55e4140007801381eda12d392c47462ac3fa34ed14bf2d1d5b330"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_viewer_context::gpu_bridge::image_to_gpu::color_image_to_gpu (cognitive 20): dl_viewer_context::gpu_bridge::image_to_gpu::color_image_to_gpu has cognitive complexity 20 (threshold 15). Drivers by points: if/else 15 (16 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/gpu_bridge/image_to_gpu.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdbabafa61fa78db13cb3f0dda15a830fa11bf72671eb79d2e3e758930a25d52"}},{"ruleId":"D2","level":"warning","message":{"text":"UrdfModel.resolve_positions (cognitive 20): UrdfModel.resolve_positions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), ternaries 2 (5 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/robot/urdf_model.py"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b7ccf83ed3e14e0370a5dcd3b516831ad180c51c58f994610206b8ab80b3d3"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::common::collect_snippets_for_api_docs (cognitive 19): dl_types_builder::codegen::common::collect_snippets_for_api_docs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/common.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"086649ada3b240dec3f80db1507c5969c650553bbea38c71eceafa7178b8e2c0"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::docs::website::write_used_by (cognitive 19): dl_types_builder::codegen::docs::website::write_used_by has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/docs/website.rs"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e44ca04e8be2110989441cfbcea88a629c9ef5a251c2d7a7d3f1921b01ce211"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::rust::serializer::quote_arrow_serializer (cognitive 19): dl_types_builder::codegen::rust::serializer::quote_arrow_serializer has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/serializer.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d892c901e5ae9e5a8a57ea47c58d15c767704cd237a187ae201881ae3be1a3b8"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::rust::util::replace_doc_attrb_with_doc_comment (cognitive 19): dl_types_builder::codegen::rust::util::replace_doc_attrb_with_doc_comment has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/util.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49edb4999b76ffa93f14ff3fb95894d803eba3e37cf041f4158843cf0d4b2eb"}},{"ruleId":"D2","level":"warning","message":{"text":"Chunk::range (cognitive 19): Chunk::range has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (19 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/range.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3e3ae7e82cb1e33a50d89f174d20000b8c528dbcafb61682a422a8f5678a44c"}},{"ruleId":"D2","level":"warning","message":{"text":"QueryHandle::fill_bulk_metadata (cognitive 19): QueryHandle::fill_bulk_metadata has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"22002e4d485a46ebcc1e8e0705ad6b8f7cf39314b41493c3d05b19f64b25cd42"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_mcap::recover::build_chunk_index (cognitive 19): dl_mcap::recover::build_chunk_index has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/recover.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77c2b86f46a196e55c2c8160245378b261ce1c0100e4dd227f5fdb977211967"}},{"ruleId":"D2","level":"warning","message":{"text":"ParquetChunkIterator::next (cognitive 19): ParquetChunkIterator::next has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_parquet/src/streaming.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"984b36e24c1f0b999ffc8fe66f0210ce45ddb940ada388c0f525dafe416872cb"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_core::reflection::generic_placeholder_for_datatype (cognitive 19): dl_types_core::reflection::generic_placeholder_for_datatype has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 4 (6 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_types_core/src/reflection.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a20486e3e4b2cbc63a3d98d447aef42bc624261610a6bd43cba70e53ac2de04"}},{"ruleId":"D2","level":"warning","message":{"text":"Origin::replace_and_parse (cognitive 19): Origin::replace_and_parse has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_uri/src/origin.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcea0c852f197b72bb7623b64cdb2b29686231034f6b29a77523597b2dfdfb0b"}},{"ruleId":"D2","level":"warning","message":{"text":"Verifier::verify_component_column (cognitive 19): Verifier::verify_component_column has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/verify.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"129a8287d7cb4f2cfc6d3d9f220f29713beb938e5adb1ee4d522113289db8393"}},{"ruleId":"D2","level":"warning","message":{"text":"dalaran::commands::dlr::split::extract_chunks_for_single_split (cognitive 19): dalaran::commands::dlr::split::extract_chunks_for_single_split has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/split.rs"},"region":{"startLine":866}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f81d2fddc81877ec5e43cbce8776b61f0509eb71f52cd06299ca0a52d270025"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_arrow_util::compare::ensure_buffers_equal (cognitive 19): dl_arrow_util::compare::ensure_buffers_equal has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_arrow_util/src/compare.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"016dc97ce18cd29672edc4d7ce8d836b34f1550ba4230d328651aa0260b1da76"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_byte_size_derive::enum_body (cognitive 19): dl_byte_size_derive::enum_body has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_byte_size_derive/src/lib.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"5294197f381d9fca4a7eee2400cab691e41077a2f5cb35523173539d68ac5ad3"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_ros_msg::deserialize::decode_value (cognitive 19): dl_ros_msg::deserialize::decode_value has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (5 pts), loops 1 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_ros_msg/src/deserialize/mod.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c2c148dc8fbbcbaa61a0fe94794dbd69cb4a070fd0421909ca5c7f24913867d"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_video::av1::detect_av1_keyframe_start (cognitive 19): dl_video::av1::detect_av1_keyframe_start has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/av1.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cfd21acb16b9b1d2e7adaf22cc3d3e16efa577b167ded1f1981d86fb0d7de2e"}},{"ruleId":"D2","level":"warning","message":{"text":"DataFusionTableWidget::table_ui (cognitive 19): DataFusionTableWidget::table_ui has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 3, 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":"crates/viewer/dl_dataframe_ui/src/datafusion_table_widget.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28910ebccb3c22f49faac626f478257299fb3ad576644a91adfdd359b5b7b51"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_redap_browser::server_modal::auth_ui (cognitive 19): dl_redap_browser::server_modal::auth_ui has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 2 (5 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_redap_browser/src/server_modal.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b601b55b41678d7ef495dd3594cb7a5328d2ac709a3a5a3d603ebaef42c1aff"}},{"ruleId":"D2","level":"warning","message":{"text":"PointCloudDrawData::new (cognitive 19): PointCloudDrawData::new has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/point_cloud.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d636bd4df187661f0827cf237b04b627a8046ce3cbda13497c434c0faae6777f"}},{"ruleId":"D2","level":"warning","message":{"text":"RectangleDrawData::new (cognitive 19): RectangleDrawData::new has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/rectangles.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aeae02a9da66b714f28065bf6497ff87bf6308c78162a1aee364f452d781b84"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_selection_panel::view_space_origin_ui::view_space_origin_widget_editing_ui (cognitive 19): dl_selection_panel::view_space_origin_ui::view_space_origin_widget_editing_ui has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 5, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/view_space_origin_ui.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce37323775b5cbb03f5537d2811b3f404f53df37b2c53500582072badbcd3c91"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_selection_panel::visible_time_range_ui::query_range_ui (cognitive 19): dl_selection_panel::visible_time_range_ui::query_range_ui has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, match/switch 3 (7 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/visible_time_range_ui.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24cee835260bd4b584483278434d959db21ad943883c6f838e62c1d30b55a7c"}},{"ruleId":"D2","level":"warning","message":{"text":"TimePanel::collapsed_ui (cognitive 19): TimePanel::collapsed_ui has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_panel/src/time_panel.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"9acda2f194cf61658728cd90f0f1aad148d2bc901427619b0fbe4d5fde2bed2b"}},{"ruleId":"D2","level":"warning","message":{"text":"TimePanel::expanded_ui (cognitive 19): TimePanel::expanded_ui has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_panel/src/time_panel.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"8977c50d272c88a1d10ad97adefb807c0287cfe970744304c52e19a13971cd2c"}},{"ruleId":"D2","level":"warning","message":{"text":"SceneBoundingBoxes::update (cognitive 19): SceneBoundingBoxes::update has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/scene_bounding_boxes.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee256bcac78ba7f8365bb2d626d7735269e28df21631b7b997f00e8def0723e8"}},{"ruleId":"D2","level":"warning","message":{"text":"SpatialView3D::on_register (cognitive 19): SpatialView3D::on_register has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (16 pts), match/switch 2, boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/view_3d.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"49e3abbf46ae8bfe1e158c5fa64aff954e74da40ebf682c7e06cfe17606874aa"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_spatial::ui::resolve_label_positions (cognitive 19): dl_view_spatial::ui::resolve_label_positions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/ui.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02efefce01069ac82a41664ef19c8e07053d20196a516e4d8f4e866893043d7"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_text_log::view_class::view_property_ui_rows (cognitive 19): dl_view_text_log::view_class::view_property_ui_rows has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_text_log/src/view_class.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"b272e683646cf7ac3a74415268e2841a1d6905ce63f6d0a41909849f7491c4a0"}},{"ruleId":"D2","level":"warning","message":{"text":"App::purge_memory_if_needed (cognitive 19): App::purge_memory_if_needed has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/logic.rs"},"region":{"startLine":944}}}],"partialFingerprints":{"codehealthFindingId/v1":"5091e1ddf29b639549b6333c7edbfb074b107acf8a1735fb985cb17276527aad"}},{"ruleId":"D2","level":"warning","message":{"text":"VisualizerEntityMapping::add_visualizability_reason (cognitive 19): VisualizerEntityMapping::add_visualizability_reason has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/view/visualizer_entity_subscriber.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea0501138122a79da1b71c335e3437662091ddc1fccd4754b72b7439f58aea2"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_viewer_context::gpu_bridge::image_to_gpu::texture_creation_desc_from_color_image (cognitive 19): dl_viewer_context::gpu_bridge::image_to_gpu::texture_creation_desc_from_color_image has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 3 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/gpu_bridge/image_to_gpu.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"daf9d269127a4b14ee6ebdef0233164bbb48f87bc91c7b72e214becf63e53605"}},{"ruleId":"D2","level":"warning","message":{"text":"AnyBatchValue.__init__ (cognitive 19): AnyBatchValue.__init__ has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 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":"dalaran_py/dalaran_sdk/dalaran/any_batch_value.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc718cee07a082f00508d54f9f48dc27b335cd5b94b1ff2c6e3af8793a87f27"}},{"ruleId":"D2","level":"warning","message":{"text":"_entry._python_objects_to_record_batch (cognitive 19): _entry._python_objects_to_record_batch has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, error handling 1 (2 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/catalog/_entry.py"},"region":{"startLine":1535}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7cd0f8c174c89f69641287fe05ac61e5ba6bd11e422359144376e9414bff5bb"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::docs::website::index_page (cognitive 18): dl_types_builder::codegen::docs::website::index_page has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/docs/website.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dea95a6ed6582349ab56d94bc4a962dd502d2f51b35dab39447ccbcf5f1e460"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::docs::website::write_archetype_fields (cognitive 18): dl_types_builder::codegen::docs::website::write_archetype_fields has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/docs/website.rs"},"region":{"startLine":574}}}],"partialFingerprints":{"codehealthFindingId/v1":"c239f2d8555d86e5355e6dcc76da8bbe23e653035552bf1b401a13fc3d994e4a"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::rust::reflection::generate_archetype_reflection (cognitive 18): dl_types_builder::codegen::rust::reflection::generate_archetype_reflection 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":"crates/build/dl_types_builder/src/codegen/rust/reflection.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92a316f9c95cb39e4d4c1176215734f7c5902d8bbcd09725deef11cbb07df06"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::objects::from_fbs::type_from_raw_type (cognitive 18): dl_types_builder::objects::from_fbs::type_from_raw_type has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/objects/from_fbs.rs"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba624ee4fcd0f844fe8f4f592c466a1e9791c072de2b12c9b4d80fc43ae3866b"}},{"ruleId":"D2","level":"warning","message":{"text":"Chunk::concatenated_unsorted (cognitive 18): Chunk::concatenated_unsorted has cognitive complexity 18 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/merge.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3a1f24671c2227c217a4640ba645c15f9245399b7227c3658d39e247d9c919"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_importer::import_file::import (cognitive 18): dl_importer::import_file::import 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":"crates/store/dl_importer/src/import_file.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d165a6da72dd54aea9cc1ffc9c920f07cda4546c53e049a593ba8fadf309ee7"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr::fmt (cognitive 18): Expr::fmt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (5 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":"crates/store/dl_lenses_core/src/selector/parser.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"4046d6154857bfbbc7821e589263a6db2267bf99d09b8085976b726ab7ab15d9"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_lenses_core::execute::apply_one_to_many (cognitive 18): dl_lenses_core::execute::apply_one_to_many has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 2 (5 pts), loops 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/execute.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b3716b29b923efcf5210411cbb95296177592d061ef49a188ac3ee926ab0cb7"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_lenses_core::selector::eval::eval_pack (cognitive 18): dl_lenses_core::selector::eval::eval_pack has cognitive complexity 18 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 4 (6 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":"crates/store/dl_lenses_core/src/selector/eval.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"e948e585bb4ad24986efb8bbb91e03b257e94d383150da72a04552ffd3c5758b"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_log_types::path::parse_path::entity_path_parts_from_tokens_strict (cognitive 18): dl_log_types::path::parse_path::entity_path_parts_from_tokens_strict 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":"crates/store/dl_log_types/src/path/parse_path.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"5650d3ae8b311ff9af377cbcfed4f6e01db4fda4bce28fc359086843cb139fc6"}},{"ruleId":"D2","level":"warning","message":{"text":"dalaran::commands::dlr::merge_optimize::merge_and_compact (cognitive 18): dalaran::commands::dlr::merge_optimize::merge_and_compact has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/merge_optimize.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"f86db454b9c01e00fbdfd8015b7f25540c3439809dd01b8d914ec6f25e226862"}},{"ruleId":"D2","level":"warning","message":{"text":"dalaran::commands::dlr::print::print_msg (cognitive 18): dalaran::commands::dlr::print::print_msg has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (7 pts), boolean chains 2 (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/print.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"3816709f7b5dab5553a80b3672cfdbf62b9eb5ada1912eddfaef261449814951"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_sdk::recording_stream::forwarding_thread (cognitive 18): dl_sdk::recording_stream::forwarding_thread has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 2 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to one function item inside it that branches (handle_cmd). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/recording_stream.rs"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e772e74f08aaa882a8445599871f2aa0ecf6562a9ebafeb41c177cd1795832b"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_video::demux::mp4::codec_details_from_stds (cognitive 18): dl_video::demux::mp4::codec_details_from_stds has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 2 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/demux/mp4.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ccde6214cedec2995c8c4b324637fa544fe3bc33cd5c047430be6e91242a68"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_component_ui::datatype_uis::enum_ui::edit_view_enum_impl (cognitive 18): dl_component_ui::datatype_uis::enum_ui::edit_view_enum_impl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/datatype_uis/enum_ui.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"41a020be0b8f4936915e250ba48f6270a482b2e9e79ab0d1be98ff9c20b2bcb2"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_memory_view::flamegraph::flamegraph_ui (cognitive 18): dl_memory_view::flamegraph::flamegraph_ui has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_memory_view/src/flamegraph.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"05b2670cff4fd2554d4d6fdf85c2fceeb372e8cc5e455dc051d6df897b8e70cf"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_recording_panel::recording_panel_ui::dataset_entry_ui (cognitive 18): dl_recording_panel::recording_panel_ui::dataset_entry_ui has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 2 (5 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_recording_panel/src/recording_panel_ui.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"d353ee9e5adc3b45445aab9ea8454c53ebc2c9f94ecb0c7f4f8908eda8964a24"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_selection_panel::visualizer_ui::visualizer_ui_impl (cognitive 18): dl_selection_panel::visualizer_ui::visualizer_ui_impl 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":"crates/viewer/dl_selection_panel/src/visualizer_ui.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"583fbcb04bc6802d40872eb553b2ef7f337a827ca52536862ad2e44f78b0d982"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view::query::component_not_found_error (cognitive 18): dl_view::query::component_not_found_error has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/src/query.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7736e9974370a299cb321c441126c513d363f6d26491676ee07b3b09055ca6"}},{"ruleId":"D2","level":"warning","message":{"text":"App::on_new_store (cognitive 18): App::on_new_store has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/logic.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"a02ce3a0fadbb2b00a695ae471dadfa63c65e9b62bed164b1cc17689357eabcc"}},{"ruleId":"D2","level":"warning","message":{"text":"App::receive_data_source_ui_command (cognitive 18): App::receive_data_source_ui_command has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), match/switch 3 (5 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/logic.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d69ee21859158fa39e1ad2804b149deae2168e273744a7f89de879165e6cd3e"}},{"ruleId":"D2","level":"warning","message":{"text":"App::move_time (cognitive 18): App::move_time has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/mod.rs"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3d02b9a37b9d2c92c0b2f3f0ae1e7a606b95a7c76e2230ec5dae18cb635e5a"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageStats::from_image (cognitive 18): ImageStats::from_image has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (12 pts), match/switch 3 (4 pts), boolean chains 2 (nesting depth added 2). Of this number, 12 points are the body\u0027s own statements and 6 belong to 3 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/tensor/image_stats.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"eac981d5b037acda6bb2941896b8693eaded45cb41383564b86e00a8489e74eb"}},{"ruleId":"D2","level":"warning","message":{"text":"SegmentUrlUdf::return_type (cognitive 18): SegmentUrlUdf::return_type has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, boolean chains 7. To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/catalog/segment_url_udf.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf500719a903227bc425261369a12da5648c1c66bd20e46a7cfa04b073bffe6"}},{"ruleId":"D2","level":"warning","message":{"text":"View._log_to_stream (cognitive 18): View._log_to_stream has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 4 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/blueprint/api.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6e5357a223e32ab4456a293db5eef3fc63cf4d0caac1fb8037371e9e6c671c1"}},{"ruleId":"D2","level":"warning","message":{"text":"Robot.log_joint_states (cognitive 18): Robot.log_joint_states has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (4 pts), boolean chains 3, ternaries 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":"dalaran_py/dalaran_sdk/dalaran/robot/robot.py"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"8adf7736241c9976a815271767305b0aa377a53df15ad14c0a2218e6b6060f41"}},{"ruleId":"D2","level":"warning","message":{"text":"msg_map.convert_marker (cognitive 18): msg_map.convert_marker has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 3 (6 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/ros2/msg_map.py"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"850977ecfaeb451cf6c2ac508219e89824971aa24fa997e67a613fb3bcabbac0"}},{"ruleId":"D2","level":"warning","message":{"text":"ExampleInfo::parse (cognitive 17): ExampleInfo::parse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 1 (nesting depth added 7). Of this number, 10 points are the body\u0027s own statements and 7 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/common.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f8d206ec51d1261116d25f7e8f9de541f1c3e15c48fbf759124dd761c4e7ff"}},{"ruleId":"D2","level":"warning","message":{"text":"ExtensionClass::new (cognitive 17): ExtensionClass::new has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"fde6652c1ea7a9adbd76f7260145f5032a795627c5b2ce6893d67ea45c435bda"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::docs::datatype_docs::datatype_docs_impl (cognitive 17): dl_types_builder::codegen::docs::datatype_docs::datatype_docs_impl has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 9). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/docs/datatype_docs.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"acc2269d8d742ac6de2f6a8858a125227508c04cfd6965e9f114e8b75f7eec9e"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::rust::deserializer::quote_arrow_field_deserializer (cognitive 17): dl_types_builder::codegen::rust::deserializer::quote_arrow_field_deserializer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 4 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/deserializer.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"58abb734c691caea34f5528c88a3f9b144b71e8e3e56b356ec90f36f34bcb261"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::rust::reflection::generate_component_reflection (cognitive 17): dl_types_builder::codegen::rust::reflection::generate_component_reflection has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/reflection.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f1a0588dbf8ccccddf5a30f3d4ef4614deeec72e87f49185e968dddcc0dfa6"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::docs::doclink_translation::translate_doc_line (cognitive 17): dl_types_builder::docs::doclink_translation::translate_doc_line has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 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":"crates/build/dl_types_builder/src/docs.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9f77b6ac04097aa662052a8b0e734789b68acd6cde53d043548f6dac8b4b05"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkStore::format_lineage (cognitive 17): ChunkStore::format_lineage has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 2, loops 1 (nesting depth added 4). None of this is in the body itself: all 17 points belong to 2 function items inside it that branch (compute_staticness, recurse). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/lineage.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b1a017efb7f89ba15e49637124ec9dfd40d672fa9e01e1f7a4dd5dd0608d09f"}},{"ruleId":"D2","level":"warning","message":{"text":"QueryHandle::seek_to_index_value_impl (cognitive 17): QueryHandle::seek_to_index_value_impl has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (8 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":1144}}}],"partialFingerprints":{"codehealthFindingId/v1":"203170608b1105e1419589bf323f574edf33d5aaaf9d31dfcd9387af02c99bcd"}},{"ruleId":"D2","level":"warning","message":{"text":"RecordBatchGrpcOutputStream::poll_next (cognitive 17): RecordBatchGrpcOutputStream::poll_next has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/table_entry_provider.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd787ae47c72655f1fdfe65efcc0474db13ee9beb71df1d81fb96d76ffd7d05d"}},{"ruleId":"D2","level":"warning","message":{"text":"DirectoryImporter::import_from_path (cognitive 17): DirectoryImporter::import_from_path has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), match/switch 2 (5 pts), loops 2 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_directory.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6d37af5b473087fa5c75722aeff9e3069c027545ff11e0ff3806913bff91344"}},{"ruleId":"D2","level":"warning","message":{"text":"McapImporter::emit_chunks (cognitive 17): McapImporter::emit_chunks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), loops 2 (6 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_mcap/importer.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"313f75335fe77560ea501b5d41ca84b171f2e8af6ea07ad2352b40c0307e733e"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_importer::importer_mcap::robot_description::extract_urdf_from_robot_descriptions (cognitive 17): dl_importer::importer_mcap::robot_description::extract_urdf_from_robot_descriptions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (5 pts), loops 3 (5 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_mcap/robot_description.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"f518c7f1ec5ef2bc8d032242f07eea71557f69ae913d8604b3d50be7af7e0009"}},{"ruleId":"D2","level":"warning","message":{"text":"EntityPath::short_names_with_disambiguation (cognitive 17): EntityPath::short_names_with_disambiguation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/path/entity_path.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"74c4aabae9e3d6c2200f648ade780c0c8b6c7288a7dbedade341c8a34b53ce74"}},{"ruleId":"D2","level":"warning","message":{"text":"DalaranCloudHandler::find_entries (cognitive 17): DalaranCloudHandler::find_entries has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), match/switch 2, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"4792c19be1c98822d9f72c3e3d9487de4ea5971030a523b5efe7aed83f0d0fd0"}},{"ruleId":"D2","level":"warning","message":{"text":"InMemoryStore::load_directory_as_dataset (cognitive 17): InMemoryStore::load_directory_as_dataset has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 3 (10 pts), if/else 3 (6 pts), loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/in_memory_store.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"d33f4a81f449b1d7a93289551158a154f951a833a98c77bb99c044bdd35bccb7"}},{"ruleId":"D2","level":"warning","message":{"text":"CachedTransformsForTimeline::add_temporal_chunk (cognitive 17): CachedTransformsForTimeline::add_temporal_chunk has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 4 (8 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0057b2bbee776e8ac5274bee189bf4efcc9a8a25950e1c751ab263206936bde"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_tf::transform_queries::query_and_resolve_instance_poses_at_entity (cognitive 17): dl_tf::transform_queries::query_and_resolve_instance_poses_at_entity has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 1 (nesting depth added 2). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_queries.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aba79699d2f1b90aeb811ba6f1a19c70a72a74b4ccbab653a6a28a1a65d8683"}},{"ruleId":"D2","level":"warning","message":{"text":"dalaran_c::dl_recording_stream_flush_blocking (cognitive 17): dalaran_c::dl_recording_stream_flush_blocking has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran_c/src/lib.rs"},"region":{"startLine":725}}}],"partialFingerprints":{"codehealthFindingId/v1":"7935ae6e7e1dfc1dff90269b7f1fc656515317184d8b36e9234c86eb04b8dec1"}},{"ruleId":"D2","level":"warning","message":{"text":"DisplayComponentColumn::data_ui (cognitive 17): DisplayComponentColumn::data_ui has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/display_record_batch.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"14cff4a94c684ef2da135a5c4b60b3cde2b2d9c2a73df16b2748c213d1b9f483"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_redap_browser::folder_card_ui::collect_cards (cognitive 17): dl_redap_browser::folder_card_ui::collect_cards has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_redap_browser/src/folder_card_ui.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3c0f29048df389e85f9778d3ff634d53db16b577a7053886bcf1d222268711"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_renderer::importer::gltf::load_gltf_from_buffer (cognitive 17): dl_renderer::importer::gltf::load_gltf_from_buffer has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/importer/gltf.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"318a0fbb3c15645fab8e81ff1adbd7919b3e444e98de804e159729d70af5ec86"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_time_panel::data_density_graph::build_density_graph (cognitive 17): dl_time_panel::data_density_graph::build_density_graph has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_panel/src/data_density_graph.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3f53c9899250019acf35a8da01c8fcb7a80846bda871f6e2ae1c6b1a742c51"}},{"ruleId":"D2","level":"warning","message":{"text":"CardLayout::show (cognitive 17): CardLayout::show has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/egui_ext/card_layout.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78084ea061ad37c59172e2b2ac0293c00a21ee737ec0e64229a47efec96a948"}},{"ruleId":"D2","level":"warning","message":{"text":"VoxelGridMapVisualizer::process_voxel_grid_map (cognitive 17): VoxelGridMapVisualizer::process_voxel_grid_map has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/voxel_grid_map.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"75a4b2957d725e75d32a268d6c33da0c2c81f378d9fbdb2613902ce4eca8dee7"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_tensor::tensor_dimension_mapper::dimension_mapping_ui (cognitive 17): dl_view_tensor::tensor_dimension_mapper::dimension_mapping_ui has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_tensor/src/tensor_dimension_mapper.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"738e74a35fa75e2246580f92c77c988f3c2d74ae48dd26c0ea1993b80047e132"}},{"ruleId":"D2","level":"warning","message":{"text":"SeriesPointsSystem::build_draw_data (cognitive 17): SeriesPointsSystem::build_draw_data has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/point_visualizer_system.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"08bcf6532dac807bbf42785de52d83586f2a7d2092ab816d9d976a0d1a06ab9f"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_time_series::series_query::collect_scalars (cognitive 17): dl_view_time_series::series_query::collect_scalars has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (7 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/series_query.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"1797bd8621f96cc74982a583571a56d3336eef227585308a6f91e249baeb10be"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_time_series::view_class::all_scalar_mappings (cognitive 17): dl_view_time_series::view_class::all_scalar_mappings has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 3, match/switch 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/view_class.rs"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"2939f10a39796e0303171dc497fc024465411ffa6d0859e559ac5485d18168f1"}},{"ruleId":"D2","level":"warning","message":{"text":"App::prefetch_chunks (cognitive 17): App::prefetch_chunks has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 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":"crates/viewer/dl_viewer/src/app/logic.rs"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"d958dd5c61e44cf141b5859ca5accb77642f057dcc8bcbb7b29870c89ed954ad"}},{"ruleId":"D2","level":"warning","message":{"text":"StoreHub::gc_blueprints (cognitive 17): StoreHub::gc_blueprints has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/store_hub.rs"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa8db9ea65334725aa86904134c2ba14f6a132e7d1b0e55a92204ea8f1f59e30"}},{"ruleId":"D2","level":"warning","message":{"text":"bundle.format_manifest (cognitive 17): bundle.format_manifest has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 1 (4 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/tools/bundle.py"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e265d950666c47ece6fc727092df11978efbb71d7f84cbea89b7e7a6631f98"}},{"ruleId":"D2","level":"warning","message":{"text":"bundle.main_unpack (cognitive 17): bundle.main_unpack has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (7 pts), loops 2 (5 pts), ternaries 2 (4 pts), error handling 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/tools/bundle.py"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b621a89efc817c7746311abc9928c22ffefdd7bc727b9fef966304a5115bcd"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_build_tools::export_build_info_vars_for_crate (cognitive 16): dl_build_tools::export_build_info_vars_for_crate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, match/switch 3 (4 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":"crates/build/dl_build_tools/src/lib.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"969500e441debc740f1e87b5c5b5196c63fe0271ebf126d210b6e8ad508c4d92"}},{"ruleId":"D2","level":"warning","message":{"text":"Visitor::visit_children (cognitive 16): Visitor::visit_children has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 2 (4 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":"crates/build/dl_dev_tools/src/build_search_index/ingest/cpp.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffc1343250f2b1ee646133068446e433fa1866c9ddc7a42fd736e28a66181d66"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::codegen::python::quote_local_batch_type_imports (cognitive 16): dl_types_builder::codegen::python::quote_local_batch_type_imports has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":2819}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c947acbea034fab0a2cbf14c0a9df3d7491fde88db9e5e0204707e8677a7823"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_types_builder::objects::from_rust::collect_definition_files (cognitive 16): dl_types_builder::objects::from_rust::collect_definition_files has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), match/switch 3 (6 pts), loops 3, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/objects/from_rust.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb5dad7b7ad2857bd3eaafd6d91989029514553229b3bb483d9f8aa42b394e6"}},{"ruleId":"D2","level":"warning","message":{"text":"TimeColumn::sanity_check (cognitive 16): TimeColumn::sanity_check has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/chunk.rs"},"region":{"startLine":1934}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea152859296308d889a97be71910a54bee0cfd8fe66dabda085bc9c6fe5cb112"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkStore::next_time_on_timeline (cognitive 16): ChunkStore::next_time_on_timeline has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 2 (5 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. This shape REPEATS in the file: one other method here (ChunkStore::prev_time_on_timeline) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/query.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"82f6e609150982ff62cd8f329bff5bf450daffd121bc83fe45aac5f498bfd376"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkStore::prev_time_on_timeline (cognitive 16): ChunkStore::prev_time_on_timeline has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 2 (5 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. This shape REPEATS in the file: one other method here (ChunkStore::next_time_on_timeline) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/query.rs"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67acf2ff79f5c916e2ee511aa6e70e8e27b9ce1176f1507084fc219fd3b7971"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_datafusion::dataframe_query_provider::queried_uncompressed_segment_size (cognitive 16): dl_datafusion::dataframe_query_provider::queried_uncompressed_segment_size has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a32c581d35ed02ee52676e732f6cb87673aa87a84bf3a28dada2c03a61e8197"}},{"ruleId":"D2","level":"warning","message":{"text":"ChunkPrioritizer::find_chunks_with_component_prefix (cognitive 16): ChunkPrioritizer::find_chunks_with_component_prefix has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 1 (4 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":"crates/store/dl_entity_db/src/dlr_manifest_index/chunk_prioritizer.rs"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"c547378cf11803e5e09d9c1647eb6b3e15d38f408a9ec2a128d827885a3095da"}},{"ruleId":"D2","level":"warning","message":{"text":"UrdfTree::compute_joint_transform_batches (cognitive 16): UrdfTree::compute_joint_transform_batches has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_urdf/urdf_tree.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3f0d27fa527f6f6a04e03d7b35d896d1efc934e246b976d57e30dedc8c2394"}},{"ruleId":"D2","level":"warning","message":{"text":"LeRobotDatasetV3::log_episode_language (cognitive 16): LeRobotDatasetV3::log_episode_language has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/lerobot/datasetv3.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"e67d89725fc074dfdcb8aa3973f01848275c4891a2877e9eb9bcf7ee8b5a18a9"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_lenses::semantic::ros2msg::ros_map_helpers::ros_map_buffer_to_image_buffer (cognitive 16): dl_lenses::semantic::ros2msg::ros_map_helpers::ros_map_buffer_to_image_buffer 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":"crates/store/dl_lenses/src/semantic/ros2msg/ros_map_helpers.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ae583d7e1079fdb993073dd7973fe62b483dd098eebdc700b6400f6c2aa5aee"}},{"ruleId":"D2","level":"warning","message":{"text":"RrdManifestBuilder::append (cognitive 16): RrdManifestBuilder::append has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 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":"crates/store/dl_log_encoding/src/dlr/footer/builders.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7714e9e8cee79940788b780beeb83d9deceea67dafddf8cd9f230493edf5476"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_log_encoding::dlr::stream_from_http::web_decode::decode_dlr_async (cognitive 16): dl_log_encoding::dlr::stream_from_http::web_decode::decode_dlr_async has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), match/switch 2 (4 pts), loops 1 (2 pts) (nesting depth added 10). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/stream_from_http.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6ac78833af7647803484294e4c5059b77368d1c744f643307fd89b5de3256d"}},{"ruleId":"D2","level":"warning","message":{"text":"Timestamp::format_opt (cognitive 16): Timestamp::format_opt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/index/timestamp.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b521fd41d1ea3b14ae223740f3c90f6d65676481e0d52ffcf837139f8fd207"}},{"ruleId":"D2","level":"warning","message":{"text":"ResolvedEntityPathFilter::evaluate (cognitive 16): ResolvedEntityPathFilter::evaluate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/path/entity_path_filter.rs"},"region":{"startLine":779}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bc07dfcf2efccf6c0580e6e782ccfeb8e10d4744599f0949ada98045b7cc97f"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_tf::transform_queries::query_and_resolve_tree_transform_at_entity (cognitive 16): dl_tf::transform_queries::query_and_resolve_tree_transform_at_entity has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_queries.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"b561a5e34b2041e0040d5c71d40d3d0125e25ee5fabc951a11c97194bd3b832e"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_tf::transform_resolution_cache::transform_cache_snapshot::latest_at (cognitive 16): dl_tf::transform_resolution_cache::transform_cache_snapshot::latest_at has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 2, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_resolution_cache/transform_cache_snapshot.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e81de3ecc8ed01fffd98b576585ff1c3b0f495ae422809fcd102c6bee9c1862"}},{"ruleId":"D2","level":"warning","message":{"text":"DownloadCommand::run (cognitive 16): DownloadCommand::run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/download.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"70425cc3c7a726cccea787653aa5934a8be6004ca8e470d7413dd25a6d87ed74"}},{"ruleId":"D2","level":"warning","message":{"text":"dalaran::commands::dlr::stats::compute_stats (cognitive 16): dalaran::commands::dlr::stats::compute_stats has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 3, 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":"crates/top/dalaran/src/commands/dlr/stats.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"54335647198852b4240cb2a9ea00a3260d7d45770ac01328b976628e5626d428"}},{"ruleId":"D2","level":"warning","message":{"text":"dalaran::commands::entrypoint::connect_to_existing_server (cognitive 16): dalaran::commands::entrypoint::connect_to_existing_server has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (6 pts), if/else 2 (5 pts), match/switch 1 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/entrypoint.rs"},"region":{"startLine":1352}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c88ff5b2c76bdeffa635d8ac220d82d15e4dd2df17061bb8bfcd255617070a8"}},{"ruleId":"D2","level":"warning","message":{"text":"Vp9KeyframeHeader::parse (cognitive 16): Vp9KeyframeHeader::parse has cognitive complexity 16 (threshold 15). Drivers by points: if/else 14 (16 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/vp9.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"96047c253f22f39ac1798cdfaa5d907aae3e341c86536f462ced77f290a08685"}},{"ruleId":"D2","level":"warning","message":{"text":"LatestAtInstanceResult::data_ui (cognitive 16): LatestAtInstanceResult::data_ui has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, match/switch 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/latest_at_instance_ui.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b86712b7c31837e427c42657f279085bbad03974d6a50fac201a3f1c80cbf51"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_dataframe_ui::grid_view::card_content_ui (cognitive 16): dl_dataframe_ui::grid_view::card_content_ui has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/grid_view.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a33da8e03e7f2aeca35706e7549061ceca1bc06b5281a5a55707c0dc932475"}},{"ruleId":"D2","level":"warning","message":{"text":"LegendWidget::show_entries (cognitive 16): LegendWidget::show_entries has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 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":"crates/viewer/dl_plot/src/legend.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e1f72f10b9d0f9db0652fdae4f7f4b0a5bda73b637d4ac71efe6ff7ea0f314d"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewBuilder::new (cognitive 16): ViewBuilder::new has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 4 (5 pts), loops 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/view_builder.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"802000a4dff0d22f399b32190eebbb4039eaf6b815b86bd18fe3363014f259dc"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_renderer::renderer::plane_clustering::overlapping_clusters (cognitive 16): dl_renderer::renderer::plane_clustering::overlapping_clusters has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/plane_clustering.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5f310a6ab887229653a2b7eb49d6dafb7e186f6624280eca3641dab295b527a"}},{"ruleId":"D2","level":"warning","message":{"text":"TimePanel::current_time_ui (cognitive 16): TimePanel::current_time_ui has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1 (nesting depth added 5). Of this number, 10 points are the body\u0027s own statements and 6 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_panel/src/time_panel.rs"},"region":{"startLine":1583}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ec8cb21aeb3a95968d7d11428b8d9abf7069165f5e994796af4443d0cb69b7"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_time_ruler::paint_ticks::paint_ticks (cognitive 16): dl_time_ruler::paint_ticks::paint_ticks has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_ruler/src/paint_ticks.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf8fe76976b4744ff85df83b03c90a623d93b182dd8e6e0b607c2289540891a"}},{"ruleId":"D2","level":"warning","message":{"text":"ComboItem::ui (cognitive 16): ComboItem::ui has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/combo_item.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaa4489e06bb9fbeb4253039a8e5197f5dcbc85271897f0454c9e69c90edaa65"}},{"ruleId":"D2","level":"warning","message":{"text":"UiExt::native_window_buttons_ui::window_button (cognitive 16): UiExt::native_window_buttons_ui::window_button has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/ui_ext.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d127c1fb27fd294aaa97e30596ee01392748cad76a07c48e0b875e7fc35dbd3"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view::view_property_ui::view_property_ui_impl (cognitive 16): dl_view::view_property_ui::view_property_ui_impl has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/src/view_property_ui.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"7457554df6970ee367775fed2649fa20a36df4a90fd281319fa6ea19c1d7beab"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_dataframe::dataframe_ui::line_ui (cognitive 16): dl_view_dataframe::dataframe_ui::line_ui has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), match/switch 2, boolean chains 1 (nesting depth added 6). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_dataframe/src/dataframe_ui.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"324cf361a0ceccdf8702e866cdba6437212b592a9d378922cb256272a18bfcaa"}},{"ruleId":"D2","level":"warning","message":{"text":"Points3DVisualizer::process_data (cognitive 16): Points3DVisualizer::process_data has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/points3d.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"158ff2ed2b1099aad4e881bfd3244219282eab7a702b537e963b23b8f1377937"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_view_spatial::proc_mesh::generate_wireframe (cognitive 16): dl_view_spatial::proc_mesh::generate_wireframe has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (6 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/proc_mesh.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"715c8285f522db5000a01a69f8d7f5c4000df9c05bf6544deee3d45bb74b2292"}},{"ruleId":"D2","level":"warning","message":{"text":"StateVisualizer::execute (cognitive 16): StateVisualizer::execute 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":"crates/viewer/dl_view_state_timeline/src/visualizer.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"37465141c8169de343c821096743c55e8140d9e18f2d18b4d5b195f75c45033c"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_viewer::web::create_app (cognitive 16): dl_viewer::web::create_app has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 4 (8 pts), if/else 6, loops 1 (2 pts) (nesting depth added 5). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/web.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"b512042da7263f1fa46a7f549c313146427cfa24fef562a210dfed553dae7e61"}},{"ruleId":"D2","level":"warning","message":{"text":"VideoStreamCache::on_store_events (cognitive 16): VideoStreamCache::on_store_events has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs"},"region":{"startLine":1498}}}],"partialFingerprints":{"codehealthFindingId/v1":"4061e859278ee90595d1ff67f8f7c27e34883c8ef6f45cb45c98da356a93cf04"}},{"ruleId":"D2","level":"warning","message":{"text":"dl_viewer_context::cache::video_stream_cache::load_known_chunk_ranges (cognitive 16): dl_viewer_context::cache::video_stream_cache::load_known_chunk_ranges has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs"},"region":{"startLine":1756}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a61904faa7ae1bb66b1f55984993ebc4242b5514ad6e478516061199f4443a7"}},{"ruleId":"D2","level":"warning","message":{"text":"ViewportBlueprint::from_db (cognitive 16): ViewportBlueprint::from_db has cognitive complexity 16 (threshold 15). Drivers by points: loops 2 (6 pts), if/else 3 (5 pts), match/switch 1 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/viewport_blueprint.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"358bc681730764122ecfaa5b842850fa87e7b6cc6aeaeb707c1b86cd25eb82dc"}},{"ruleId":"D2","level":"warning","message":{"text":"TimeColumn.__init__ (cognitive 16): TimeColumn.__init__ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (16 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/_send_columns.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"17ab3e46063532d2dff45f49328f9337fc8d9a68bfe0731e50875db8765d9c45"}},{"ruleId":"D2","level":"warning","message":{"text":"Mesh3DExt.__init__ (cognitive 16): Mesh3DExt.__init__ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), error handling 1 (4 pts), ternaries 1 (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":"dalaran_py/dalaran_sdk/dalaran/archetypes/mesh3d_ext.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"67898b83a19d6ee384d38fb0eb8ad33aa0a3d1610082f68275b7fd06acf2a3d2"}},{"ruleId":"D2","level":"warning","message":{"text":"_utils._build_query_indices (cognitive 16): _utils._build_query_indices has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (7 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/_utils.py"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a909eef180b2ae4bad20398f59afaf256e93b620943a73e5435e27a03e3f78"}},{"ruleId":"D2","level":"warning","message":{"text":"urdf_model._joint_from_xml (cognitive 16): urdf_model._joint_from_xml has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 7, if/else 5 (6 pts), boolean chains 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/robot/urdf_model.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"24904f52cca91c1cbd3916e84c4814e6eab35d8e084dc16c8f42325f92afbd29"}},{"ruleId":"D2","level":"warning","message":{"text":"bundle.extract_bundle (cognitive 16): bundle.extract_bundle has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/tools/bundle.py"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"87402a7503ca97a01b7c834e6efd2e079fba9f43e7c7975279b9fc02432a97bd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: DesignTokens: TooManyFields \u2014 141 stored fields beside 41 methods. The bar is 30 stored fields; this is 111 over it, 4.70\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/design_tokens.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee70531464f7d59b6df3f5b6d0ae6f8ae032c0bb80aed9b2e963f0f9da4f6c4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.run_system_command: MethodTooLong \u2014 run_system_command runs 444 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 344 over it, 4.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/command_handling.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5db2ee331efd8ea44f4cf213a0918587941f19ebf9aef2052b5b36db72fd264"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AppState.show: MethodTooLong \u2014 show runs 443 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 343 over it, 4.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":"crates/viewer/dl_viewer/src/app_state.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"d371f5bccbb6e4d301e4ac97c70560b31b7dba9ae6dc3c05d31cac748816ed03"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Chunk: TooManyMethods \u2014 117 methods, declared across 11 files: src/chunk.rs (51), src/slice.rs (17), src/iter.rs (10), src/shuffle.rs (10), \u002B7 more file(s). The bar is 30 methods; this is 87 over it, 3.90\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/chunk.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9d8bc96f45604ec120b45b84b25c7a2b2c27835cde8e22b12702eaa07f573d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ChunkStore: TooManyMethods \u2014 117 methods, declared across 11 files: src/query.rs (32), src/store.rs (31), src/lineage.rs (11), src/subscribers.rs (11), \u002B7 more file(s). The bar is 30 methods; this is 87 over it, 3.90\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/store.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3db795f4361665ae70b98e84ad75cbef0c54d9a16bc0094eb815b4d4094f4b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TimeSeriesView.ui: MethodTooLong \u2014 ui runs 378 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 278 over it, 3.78\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/view_class.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"788c5d26f311e96f29ff158985a1c52fa97b37cbc5531c67bd50959aacaec492"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_component_fallbacks::component_fallbacks::archetype_field_fallbacks: FunctionTooLong \u2014 dl_component_fallbacks::component_fallbacks::archetype_field_fallbacks runs 341 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 241 over it, 3.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_fallbacks/src/component_fallbacks.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"b241db15da4441ea0c78f1ceabcc018f75f4539ccae41d3ff0c80505cd910ea6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/python_bridge.rs: FileTooLong \u2014 1701 significant 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 1201 over it, 3.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":"dalaran_py/src/python_bridge.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1d324e20f23b6f8dd8ce522d2d84a93cac582207dc74e27d09c77faec2e83eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: v1alpha1/dalaran.cloud.v1alpha1.ext.rs: FileTooLong \u2014 1552 significant 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 1052 over it, 3.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_protos/src/v1alpha1/dalaran.cloud.v1alpha1.ext.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5674ac39e195ede789085ce3685c7923eb529d5cdcc6ccc11eb79d41b5ad1e53"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dalaran_cloud/mod.rs: FileTooLong \u2014 1534 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 79% of them inside a single declaration: DalaranCloudHandler (5 blocks, 209-2159). The bar is 500 significant lines; this is 1034 over it, 3.07\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14bcbc6b5a048f02d458a01dae87d4e1d3453de4c230cd8da1dd60abcf8046c4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DalaranCloudHandler: ClassTooLong \u2014 1212 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 6 methods, 5 blocks, lines 209-2159. The bar is 400 significant lines; this is 812 over it, 3.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"e48538a65dffb6b57f99f23046b54e9ef0077ea10a9544c01a607dd703dd52b4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ChunkStore.insert_chunk_impl: MethodTooLong \u2014 insert_chunk_impl runs 293 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 193 over it, 2.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/writes.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"0274f854d99f4c38e9c7417b4b348b8bdb828fc96e235caee0c405152e8ef73e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Telemetry.init: MethodTooLong \u2014 init runs 285 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 185 over it, 2.85\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_perf_telemetry/src/telemetry.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7c5cef3e439f7251c621396a8981ba60f0c06ec2238dd9480dc01d759c5305"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: QueryHandle: ClassTooLong \u2014 1122 significant 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, 4 blocks, lines 242-2522. The bar is 400 significant lines; this is 722 over it, 2.81\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"6812aab96d88452e2c594f0eb18935081a275fefe43a96dcf60fd522e881b822"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: App: TooManyMethods \u2014 84 methods, declared across 6 files: app/mod.rs (31), app/command_handling.rs (18), app/logic.rs (16), app/ui.rs (8), \u002B2 more file(s). The bar is 30 methods; this is 54 over it, 2.80\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. Most of these members implement app.App (84 of 84 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/mod.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"857fec9367321d41637fd9a9050182b4bbf2b2e182d0537925186bb006921fc2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.ui: MethodTooLong \u2014 ui runs 279 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 179 over it, 2.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/mod.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"14950cf910a454098b6f34261e46e4eaa77e1453b85ebeff253a9cc358f11983"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/query.rs: FileTooLong \u2014 1338 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 84% of them inside a single declaration: QueryHandle (4 blocks, 242-2522). The bar is 500 significant lines; this is 838 over it, 2.68\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d9c2d23a19ed5cb535c14be73807e7b25d2334aa51e068ce5c7e9ac672f947"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TimePanel: ClassTooLong \u2014 1056 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 19 methods, 4 blocks, lines 97-2053. The bar is 400 significant lines; this is 656 over it, 2.64\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_panel/src/time_panel.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1dea1747a3e5fff1488f016879d71d2b8e1da5e516cdf9a58275b4b9ef3476"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cache/video_stream_cache.rs: FileTooLong \u2014 1313 significant 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 813 over it, 2.63\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cacf9ad5849d9b5dd3b8a06fb5058f6bd84c2d5ddd63f1d026efb9c34e8af6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/time_panel.rs: FileTooLong \u2014 1299 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 81% of them inside a single declaration: TimePanel (4 blocks, 97-2053). The bar is 500 significant lines; this is 799 over it, 2.60\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_panel/src/time_panel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8135e798278a423a3598e9966750fa1c85bcd4e9d39714e3ab774b87d4cde4bf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StatsCommand.run: MethodTooLong \u2014 run 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":"crates/top/dalaran/src/commands/dlr/stats.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6993c07ae4aaf5bf900f59f470ccad21849a48d6cf906dbe94690a95fefc3ae"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/recording_stream.rs: FileTooLong \u2014 1240 significant 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 740 over it, 2.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/recording_stream.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c960eede227204eb22c9c95df02914c7c0f4ef937e0e69755d3dd65378afbb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: App: ClassTooLong \u2014 975 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 84 methods, 4 blocks, lines 75-1730. The bar is 400 significant lines; this is 575 over it, 2.44\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/mod.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"194451161df332c2c7584912122f136ee1461af8c3a0c12122a623c01b4011a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/entrypoint.rs: FileTooLong \u2014 1218 significant 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 718 over it, 2.44\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/entrypoint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead661f7c5c70f44d7eabff0d99998aef4ccba28e36beddb58fe8e66861a1037"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RecordingStream: TooManyMethods \u2014 73 methods, declared across 2 files: src/recording_stream.rs (62), src/global.rs (11). The bar is 30 methods; this is 43 over it, 2.43\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/recording_stream.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ecb842d899ac0c7b2f30f39d2f01e643fef0bc19c2fd889be0a5b41f2ebd167"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/command_handling.rs: FileTooLong \u2014 1186 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 85% of them inside a single declaration: App (40-1689). The bar is 500 significant lines; this is 686 over it, 2.37\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/command_handling.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aacc80871f7a4ba71dae4208bc183df4c57bae074fe7160341141d9fe8b3e530"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/view_class.rs: FileTooLong \u2014 1183 significant 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 683 over it, 2.37\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/view_class.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b5b82e9658edc6c719005983f1d2b9e81440c99abb25258b590618d0c13d65b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EntityDb: TooManyMethods \u2014 70 methods. The bar is 30 methods; this is 40 over it, 2.33\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/entity_db.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"345eb44eff2b47ec9cd7f5cf4cbf7ea68f41da086a63297a5d5fc96680423eca"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RawRrdManifest: ClassTooLong \u2014 920 significant 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, 8 blocks, lines 137-1728. The bar is 400 significant lines; this is 520 over it, 2.30\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"01b3911eb38c40c2cabfa5b0dd1bf0c817bb5a9aa3fbb825ede8c30a0d0b854d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/chunk.rs: FileTooLong \u2014 1141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 62% of them inside a single declaration: Chunk (13 blocks, 225-1927). The bar is 500 significant lines; this is 641 over it, 2.28\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/chunk.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c39659d3ded8806851dc8d00ac37b9dd7c6504ba033f5101600b87441fb263"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/connection_client.rs: FileTooLong \u2014 1141 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 80% of them inside a single declaration: RedapClient (4 blocks, 308-1708). The bar is 500 significant lines; this is 641 over it, 2.28\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/connection_client.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"631445bfae859a0e3facf4dea525535cd26aa065d060e78c65abb67720278fca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_view_spatial::visualizers::video::execute_video_stream_like: FunctionTooLong \u2014 dl_view_spatial::visualizers::video::execute_video_stream_like runs 228 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 128 over it, 2.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/video/mod.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"83c3a258212d20e260ac48fb25166c6edd380133a0e95d8a726359f8bb9c9aea"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RedapClient: ClassTooLong \u2014 909 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 43 methods, 4 blocks, lines 308-1708. The bar is 400 significant lines; this is 509 over it, 2.27\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/connection_client.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f096d9971c1b37747ddfd8f3cfe6de396c4bfb07597cdd687fe60905b89143"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SpatialView3D.view_3d: MethodTooLong \u2014 view_3d runs 225 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 125 over it, 2.25\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/ui_3d.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f711e2e379b5688888c9d6c5fba9abac30a03f103904234d4651c3de6733fa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: QueryHandle._next_n_rows: MethodTooLong \u2014 _next_n_rows 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":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":1788}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd5ec73432804bcc1c3d39e90ad680118ec139538d6791669089e1407222d5c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StateTimelineView.ui: MethodTooLong \u2014 ui runs 220 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 120 over it, 2.20\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_state_timeline/src/view_class.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc282d19c1b697a5bb1a1430e6bafa2fa4cfd9d7ccfbe3c78a81791a21deef12"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/mod.rs: FileTooLong \u2014 1089 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 90% of them inside a single declaration: App (4 blocks, 75-1730). The bar is 500 significant lines; this is 589 over it, 2.18\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca47f91a1b77d14954a492fd1eff4356eab874dae6b6bbe3355edf52ba1704c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.run_ui_command: MethodTooLong \u2014 run_ui_command runs 214 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 114 over it, 2.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/command_handling.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"afcdea4bda92c0fcb92115e53781beb0e1a62645e16193d0e7b4807d2c168f5c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TimeControl.handle_time_command: MethodTooLong \u2014 handle_time_command runs 210 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 110 over it, 2.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/time_control/command.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf6d29c70a3c488ba20dadf589a8f332e478503aec6a6d2cb028bc97a8a7683"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_datafusion::dataframe_query_provider::io_loop::chunk_stream_io_loop: FunctionTooLong \u2014 dl_datafusion::dataframe_query_provider::io_loop::chunk_stream_io_loop runs 208 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 108 over it, 2.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider/io_loop.rs"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"242bd46b143b85f3542b9913cf69241c74da3fed0eddecf2d7a8aecc6e083060"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DalaranCloudHandler.query_dataset: MethodTooLong \u2014 query_dataset runs 205 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 105 over it, 2.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":1441}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9273529107998a588fc873382800a62f29858d135d60c504ed386bf5be69d41"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SplitCommand.run: MethodTooLong \u2014 run runs 204 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 104 over it, 2.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/split.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfd3041b26197f0c63b845d997383d17b2ab2116b8aeb8c82d836305b1b9b5d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: UiExt: ClassTooLong \u2014 804 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 65 methods. The bar is 400 significant lines; this is 404 over it, 2.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/ui_ext.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"05754a2c6a9839ae7e30570058aebf7cab3780e56edabf65dfd8113e3a0428d9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.with_commands: MethodTooLong \u2014 with_commands runs 201 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 101 over it, 2.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/mod.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d0883b69101bc46d3c6049b0fdc87d3029a12b58d813caf7605370e2276e65"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/visualizer_ui.rs: FileTooLong \u2014 991 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 491 over it, 1.98\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/visualizer_ui.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94d7dfde61a974acd26cef392a569f945b3c57b9dbf1193f051962598608c84a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_datafusion::dataframe_query_provider::cpu_worker::chunk_store_cpu_worker_thread: FunctionTooLong \u2014 dl_datafusion::dataframe_query_provider::cpu_worker::chunk_store_cpu_worker_thread runs 198 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 98 over it, 1.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec9466498023eead8fcddcf4507b2fb0df96c70c23149a824a30b8459aec437"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_redap_client::grpc::stream_segment_from_server: FunctionTooLong \u2014 dl_redap_client::grpc::stream_segment_from_server runs 198 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 98 over it, 1.98\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/grpc.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb7b28d4246e19a87479535d702e440d961baf6d00298f50c55e103b4f39a21"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: footer/raw_dlr_manifest.rs: FileTooLong \u2014 987 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 93% of them inside a single declaration: RawRrdManifest (8 blocks, 137-1728). The bar is 500 significant lines; this is 487 over it, 1.97\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"573f9a0ead8c3a23622c32f56fdac5c612f2d9907f30a22db9ce09785e0edd12"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: StoreHub: TooManyMethods \u2014 59 methods. The bar is 30 methods; this is 29 over it, 1.97\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/store_hub.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c21001e0db332d258122a76640b87ce329450a304ae3efd53889b60a4872b0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GaussianSplatDrawData.new: MethodTooLong \u2014 new runs 196 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 96 over it, 1.96\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7253a9f51e8cccfcd418aef748115404bde70e7aeaf56f99eaa84a007a763a2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataframeQueryTableProvider.scan: MethodTooLong \u2014 scan runs 195 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 95 over it, 1.95\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_common.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f13ee5160b95f13a4bf98b737bc05f96678d58b1531933566a353432170f647"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PointCloudDrawData.new: MethodTooLong \u2014 new runs 195 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 95 over it, 1.95\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/point_cloud.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"74b2671e13f0f8244b1fc17453ffb590955d17977095701514dc5c9d96fcc403"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BarChartView.ui: MethodTooLong \u2014 ui runs 194 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 94 over it, 1.94\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_bar_chart/src/view_class.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3c6f4cad8e6fb14d322071b561b4e3c641972d03d47e1bf9df0118bda78943"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: BlueprintTree: ClassTooLong \u2014 767 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 21 methods, 2 blocks, lines 25-1235. The bar is 400 significant lines; this is 367 over it, 1.92\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_blueprint_tree/src/blueprint_tree.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"87638a5cfe5a86c8a180636b80d8f9e5f982b39a2f327643e6341ae5b73f0d6e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_datafusion::analytics::build_query_span: FunctionTooLong \u2014 dl_datafusion::analytics::build_query_span 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":"crates/store/dl_datafusion/src/analytics.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ed66ce63dbb8ebfe566b160a605fad5383f1b0091778e923fb209a13800a5f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RawRrdManifest: 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":"crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"81fbf9febc9d278defabea805c7911750dd61e6408886a9aaba8834a6245a452"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/selection_panel.rs: FileTooLong \u2014 933 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 433 over it, 1.87\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/selection_panel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5678df6d73fa8f539d9b1a19fa0e8217e3a09f71a9b4a2df89eeb86970a0308b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RecordingPreviewRenderer.show_preview: MethodTooLong \u2014 show_preview runs 184 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/preview_renderer.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5f79133c2c97d056c64ea93e68062963e7eaab6fc049d3763ca117d288b25b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ViewBuilder.new: MethodTooLong \u2014 new runs 184 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/view_builder.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a5f020c5190745773299f80ba7032d9f4442bbcd57e0396239095cdb4503e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 915 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 43 free functions. The bar is 500 significant lines; this is 415 over it, 1.83\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran_c/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8964c479db3939e1ee1bba8cf331d039263541f40ebab51bccd036458f1abdba"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_data_ui::entity_db_ui::grid_content_ui: FunctionTooLong \u2014 dl_data_ui::entity_db_ui::grid_content_ui runs 182 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/entity_db_ui.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9bd5ae9ee384a67db210e5052a885b4105b8d030d29590b2efce1f2cb42bca0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: QueryHandle.try_bulk_emit_run: MethodTooLong \u2014 try_bulk_emit_run runs 181 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 81 over it, 1.81\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":2132}}}],"partialFingerprints":{"codehealthFindingId/v1":"7480b75397ee7f82db97fb3bf35d1868f353efe239e682b9df6b3fc556a3a56e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: StoreHub: ClassTooLong \u2014 717 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 59 methods, 3 blocks, lines 118-1506. The bar is 400 significant lines; this is 317 over it, 1.79\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/store_hub.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3afa437bfe5841bd0dbc1ca3f202eb1bd90daa1c95a2691651adf2d3fd2386b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataFusionTableWidget.table_ui: MethodTooLong \u2014 table_ui runs 179 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 79 over it, 1.79\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/datafusion_table_widget.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d55ecdfebf711a339ac749d39a284b860e9483359ed666d451e1bfb1e91cd4"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Chunk: ClassTooLong \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), 117 methods, 13 blocks, lines 225-1927. The bar is 400 significant lines; this is 311 over it, 1.78\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/chunk.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"65778477496fcd7db98102dd8112d56ee9aef43c95e8d7bf2a30d2334c55663e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: EntityDb: ClassTooLong \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), 70 methods, 6 blocks, lines 113-1378. The bar is 400 significant lines; this is 311 over it, 1.78\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/entity_db.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cd063bc933d64c855bbab881ad1bed63bf9f13679fcb4be79af99b924c4450"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SplitCommand.split_store: MethodTooLong \u2014 split_store 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":"crates/top/dalaran/src/commands/dlr/split.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7030937629031c5a04759f4bd547bd1a0d7d1ec35170874c6e7d6fed57f0eaf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SeriesPointsSystem.load_series: MethodTooLong \u2014 load_series 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":"crates/viewer/dl_view_time_series/src/point_visualizer_system.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7485cb869d76b0f787e66b37ebfbfa84cc17933a5514b3000443ca26f733654"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TimePanel.expanded_ui: MethodTooLong \u2014 expanded_ui runs 173 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_panel/src/time_panel.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3f2fcceb6f5bdf3946b74f885608e564eea7558d68524860542de804f303921"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/datafusion_table_widget.rs: FileTooLong \u2014 856 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 356 over it, 1.71\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/datafusion_table_widget.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9548b978089da32bd723d1faf31e9fc3b3d632dacdb1b6404637bf6a809ec207"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: AppState: ClassTooLong \u2014 684 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 14 methods, 4 blocks, lines 46-1202. The bar is 400 significant lines; this is 284 over it, 1.71\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app_state.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f344c48ef0d9d14f29742c743f29a8d6906656e03a313a7fd7f906b72f9b33d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ui_ext.rs: FileTooLong \u2014 855 significant 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: UiExt (19-1373). The bar is 500 significant lines; this is 355 over it, 1.71\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/ui_ext.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b20b2fa9a26b6a9f15d49f7760227279b91369dc134e441ffe16d289a6594cfe"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataQueryPropertyResolver.update_overrides_recursive: MethodTooLong \u2014 update_overrides_recursive runs 171 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 71 over it, 1.71\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/view_contents.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cb016c2190bbeeda24ef171e43df47c03a32ed86b2e479738c2f1ea8953b40"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/analytics.rs: FileTooLong \u2014 841 significant 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 341 over it, 1.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/analytics.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b4eddec550913533225613761d2a7fc28e8fed1988b48a5763cd3d1ce724de"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/blueprint_tree.rs: FileTooLong \u2014 840 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 91% of them inside a single declaration: BlueprintTree (2 blocks, 25-1235). The bar is 500 significant lines; this is 340 over it, 1.68\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_blueprint_tree/src/blueprint_tree.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24e876e3b1f8ffaa22d591e58ea2905e3c9c375651efed53a9ec472438cb0d7e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: lerobot/datasetv3.rs: FileTooLong \u2014 832 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 60% of them inside a single declaration: LeRobotDatasetV3 (3 blocks, 84-937). The bar is 500 significant lines; this is 332 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":"crates/store/dl_importer/src/lerobot/datasetv3.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d900aa0b94950e4b58f93bbf9cb6c02bb98859cf26bdfceb010410c7c1f759"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DesignTokens.load_with_color_table: MethodTooLong \u2014 load_with_color_table runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/design_tokens.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"254e98b02de45f29e3c28116c1eaf69b4a83fb56622b4c5ad3213112839415df"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_datafusion::chunk_fetcher::fetch_batch_via_direct_urls: FunctionTooLong \u2014 dl_datafusion::chunk_fetcher::fetch_batch_via_direct_urls runs 165 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 65 over it, 1.65\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/chunk_fetcher.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d81f4e69ea2faba8b4f6a31d4b27b3d864b8fc7b31f642d3a265dff57053c5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/grpc.rs: FileTooLong \u2014 820 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 320 over it, 1.64\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/grpc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eb2f57b885e3eee4f7032aab67ca93cec1e24707493d17594089700e018eb46"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ProcMeshDrawableBuilder.add_batch: MethodTooLong \u2014 add_batch runs 164 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/utilities/proc_mesh_vis.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"21bd658daec567255a9114cdea135d315d5008093eab196cb172cba79730be58"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_view_spatial::visualizers::video::show_video_frame: FunctionTooLong \u2014 dl_view_spatial::visualizers::video::show_video_frame runs 163 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 63 over it, 1.63\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/video/mod.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc22a0824d2e552dfdcb0614d840de94cbaffc19b171f0702cd869c55dfce01"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dalaran::commands::dlr::route::process_messages: FunctionTooLong \u2014 dalaran::commands::dlr::route::process_messages 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":"crates/top/dalaran/src/commands/dlr/route.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd8fe97e51b457ed1025115dfe8d6d5adfba07076aabaa9fa4f6d3ab37d98de2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ServerModal.ui: MethodTooLong \u2014 ui 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":"crates/viewer/dl_redap_browser/src/server_modal.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"befb6d679245606af25013917566416f5c5fb1159ce50a17a55c0da90e1961dc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SeriesLinesSystem.load_series: MethodTooLong \u2014 load_series 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":"crates/viewer/dl_view_time_series/src/line_visualizer_system.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"831bb3d51cff54bf53efca726cc4aa5ab48367143cf8b86245c3c65c6eb3951b"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: RecordingStream: ClassTooLong \u2014 640 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 73 methods, 10 blocks, lines 778-2900. The bar is 400 significant lines; this is 240 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/recording_stream.rs"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba40b9b7e76dd1bcc2f36dc87522cfbcdbe317209ef5813e6b74ce8137eead6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/viewport_ui.rs: FileTooLong \u2014 800 significant 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 300 over it, 1.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport/src/viewport_ui.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f386a585261ca3e668af0d5af754620237650909003e84e4f19ef4ebb47ed97"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dataframe_query_common.rs: FileTooLong \u2014 799 significant 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 299 over it, 1.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_common.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffd8addcbf4366b0a395b92b4ab13016de1f58a887b08ee26b74457745fab84"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dlr_manifest_index/chunk_prioritizer.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":"crates/store/dl_entity_db/src/dlr_manifest_index/chunk_prioritizer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a455be4cb3f0cc818399ab33278b3f4a9f04328afbdfe0f2828f29db389c88b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/store_hub.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), about 90% of them inside a single declaration: StoreHub (3 blocks, 118-1506). The bar is 500 significant lines; this is 296 over it, 1.59\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/store_hub.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d8209c434c1707c69401c7bc0bebd0476dda7c5865676b5d234eeb0623665b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_selection_panel::visualizer_ui::visualizer_components: FunctionTooLong \u2014 dl_selection_panel::visualizer_ui::visualizer_components runs 159 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/visualizer_ui.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ae94c95e787df685b5bcb0df03f489d518d990d5e14db0860d32cefa5287580"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SpatialView2D.view_2d: MethodTooLong \u2014 view_2d runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/ui_2d.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"b39466c7edf40022150f5b105463b619746828fa6c58d110cf439923b4516bf5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/app_state.rs: FileTooLong \u2014 779 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 88% of them inside a single declaration: AppState (4 blocks, 46-1202). The bar is 500 significant lines; this is 279 over it, 1.56\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app_state.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"88680c92281ecb86f0478956e18f536b56dc1106bd1ffa9376dce3221fb2019b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MeshRenderer.create_renderer: MethodTooLong \u2014 create_renderer runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"e00a834dd332707cb835d1ae38ba84630597ba13b3e06191e834ad1b8198fd21"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/servers.rs: FileTooLong \u2014 769 significant 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 269 over it, 1.54\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_redap_browser/src/servers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8130626cb1d36ad9312812d98fed60ec4ba939e869a8eb5c4c4c35cbcd3668a3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/iter.rs: FileTooLong \u2014 767 significant 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 267 over it, 1.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/iter.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31718788fa21cf9972158dc66bd2dd4f2c6269adb0e1f782e0dddd609baa6623"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/eye.rs: FileTooLong \u2014 766 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 266 over it, 1.53\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/eye.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca99e2f8c16c2e16d4ba5474cda37def2694dfc17cf5c28b3c7859b9f70c5dbb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/entity_db.rs: FileTooLong \u2014 764 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 93% of them inside a single declaration: EntityDb (6 blocks, 113-1378). The bar is 500 significant lines; this is 264 over it, 1.53\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/entity_db.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"626acbdc4c4aa7d96de1e510b22ef0566c9971975b5a5250f6d6f6a68dee6a62"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/view_class.rs: FileTooLong \u2014 762 significant 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 262 over it, 1.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_state_timeline/src/view_class.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b66068fdc868cb419b92fd4559dbcdef79618a7a182a0270300d455d3fd21b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: QueryHandle._resolve_one_row: MethodTooLong \u2014 _resolve_one_row runs 152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":1427}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b29e0a5b43ef16eb3383d06ba313452f528ee462f5cb47203827f34330667cf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GaussianSplatBatchBuilder.add_gaussians: MethodTooLong \u2014 add_gaussians runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/gaussian_splat_builder.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa8f641f3cb5c8d728db0cb812ad86c5f1c81b5a6ea59ef9bafa33609e93f31"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_view_spatial::picking_ui::picking: FunctionTooLong \u2014 dl_view_spatial::picking_ui::picking runs 151 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/picking_ui.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a117142fd0b40ce87f0011d87770ad8d10709ef8c2dc2f939b66eb993e3d467a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/pipeline_budget.rs: FileTooLong \u2014 746 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 246 over it, 1.49\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/pipeline_budget.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"884947ea26d4812c36ebd2e5d861e444d29adc2911e1e2781466a60030242767"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ListItem.ui: MethodTooLong \u2014 ui runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 49 over it, 1.49\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/list_item/list_item.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cbd8fbb364ba2c31870185044f333a6bc9738295b41187522e72289c7d4c4bc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TimeSeriesView: ClassTooLong \u2014 590 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 0 methods. The bar is 400 significant lines; this is 190 over it, 1.48\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/view_class.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dc2b23096c2136c78c9e321c47d053c085263d39da0aa3d03c9d50c5372721f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Chunk.concatenated_unsorted: MethodTooLong \u2014 concatenated_unsorted runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/merge.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"86117461e8b854b1a05b48adbfac357f10a9f490df2f45a04eb6de6b03538583"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_sdk::spawn::spawn: FunctionTooLong \u2014 dl_sdk::spawn::spawn runs 147 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 47 over it, 1.47\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/spawn.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"169b05ccb0faea6eb455963753e0750e27c9828618133e98a1a5ffaa0a1e6bcf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TimeControl: TooManyMethods \u2014 44 methods, declared across 2 files: time_control/mod.rs (34), time_control/command.rs (10). The bar is 30 methods; this is 14 over it, 1.47\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/time_control/mod.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d5660f9e112d4d1b599878c809fd1eaa20a41a67b33ad2d5634b8d47bb73d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dataframe_query_provider/io_loop.rs: FileTooLong \u2014 733 significant 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 233 over it, 1.47\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider/io_loop.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0405de4a4040a98e8a8ea344aa46147e0d8161c18ef5ea1eb649f51f35ffb9a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 732 significant 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 232 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":"crates/store/dl_grpc_server/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db7e7da8e49f2da5449ddfdfd76bc51dc4ac4b98609a153b35c05de36e2be62e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LineDrawData.new: MethodTooLong \u2014 new runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/lines.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34546586d6b9c4244f514521ada0e10d4aece50127c9b0bdcfff93667d07608"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: PointCloudRenderer.create_renderer: MethodTooLong \u2014 create_renderer runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/point_cloud.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"f56b4eeedbf549a1c335b54e0bcfd3885383c19243ab490f63777d2f5516b072"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: v1alpha1/dalaran.common.v1alpha1.ext.rs: FileTooLong \u2014 727 significant 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 227 over it, 1.45\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_protos/src/v1alpha1/dalaran.common.v1alpha1.ext.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb43c2fcabaae946b60b848ce39baf4b79254cd02bc8a333521f97c27a8d2899"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/design_tokens.rs: FileTooLong \u2014 725 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 74% of them inside a single declaration: DesignTokens (2 blocks, 103-965). The bar is 500 significant lines; this is 225 over it, 1.45\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/design_tokens.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56ac6dbcaf7f3fc050a5bfb4602f17202f0ef4bc4b94f72e43d3c2bd868fa02"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/query.rs: FileTooLong \u2014 722 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 84% of them inside a single declaration: ChunkStore (3 blocks, 29-1302). The bar is 500 significant lines; this is 222 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":"crates/store/dl_chunk_store/src/query.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73d218489a8acace8964f6f80d6c8a06bd19ebcd0545556999f9b487d04adcf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: QueryCache.on_events: MethodTooLong \u2014 on_events runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/cache.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd536678283657dda2a1384d37bf3c6bc1f7ab916dc66274a8ca470a044ea6e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SelectionPanel.item_ui: MethodTooLong \u2014 item_ui runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/selection_panel.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e106920561e2938884745ca8768864175bf9ca288fddf2076af0a35153d90d0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_time_panel::time_selection_ui::loop_selection_ui: FunctionTooLong \u2014 dl_time_panel::time_selection_ui::loop_selection_ui runs 144 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 44 over it, 1.44\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_panel/src/time_selection_ui.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"97765f6e1bd6434c11f820072dbaf7347be64b2513d9d55756f991abbf36e502"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RedapClient: TooManyMethods \u2014 43 methods. The bar is 30 methods; this is 13 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":"crates/store/dl_redap_client/src/connection_client.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e4e2c615d4449c729ef8e119eb2c98373f89441ac5ae0357e51b360ef28acf9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_view_spatial::shared_fallbacks::register_fallbacks: FunctionTooLong \u2014 dl_view_spatial::shared_fallbacks::register_fallbacks runs 142 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/shared_fallbacks.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"68751e59ad6ac19ff56afd0f582d89b5e583a5628a7a1fe4ddac18ea0cf7c000"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: App: TooManyFields \u2014 42 stored fields beside 84 methods. The bar is 30 stored fields; this is 12 over it, 1.40\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/mod.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"40357f25c32856e030868523430dd6f6cd7a3d0461c76a7983f5e61c2db61c6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/viewport_blueprint.rs: FileTooLong \u2014 698 significant 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: ViewportBlueprint (2 blocks, 37-970). The bar is 500 significant lines; this is 198 over it, 1.40\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/viewport_blueprint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"515bb94a6c0687848dabc0e83966d62aefc097a0b06bc9d63f07f0fd6717d35c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: app/logic.rs: FileTooLong \u2014 695 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 95% of them inside a single declaration: App (25-1158). The bar is 500 significant lines; this is 195 over it, 1.39\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/logic.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c10a95806b5ccac531f080ca03c48b3944be8659da9409887b681a259970e43"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_viewport_blueprint::viewport_blueprint::apply_viewport_command: FunctionTooLong \u2014 dl_viewport_blueprint::viewport_blueprint::apply_viewport_command runs 139 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/viewport_blueprint.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef6ad41a426310ce9815fe99bcf1029f0aa434c5db1b72dd9587a9baa4d54ee"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TransformTreeContext.execute: MethodTooLong \u2014 execute runs 138 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 38 over it, 1.38\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/contexts/transform_tree_context.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b407d6804fb9a466d627fb5088394666057911974adc776719104c421245485"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dalaran_py\u0022 # name of the rust crate::python_bridge::dalaran_bindings: FunctionTooLong \u2014 dalaran_py\u0022 # name of the rust crate::python_bridge::dalaran_bindings 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":"dalaran_py/src/python_bridge.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb6f43841343dc61c9482d98d9f9f99875be88cfedde4ec8f200ba2a950b352"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: StateVisualizer.execute: MethodTooLong \u2014 execute runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_state_timeline/src/visualizer.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"b957e21b5501558cd24e76b59e9e59cbc56a1c09dbd9c13547617d749889acb9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TabWidget.new: MethodTooLong \u2014 new runs 137 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 37 over it, 1.37\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport/src/viewport_ui.rs"},"region":{"startLine":938}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fd22afe68bb999668cb4b4ff61a1ae5823d6ec8392a5a471fdf125928e717ce"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DesignTokens: TooManyMethods \u2014 41 methods. The bar is 30 methods; this is 11 over it, 1.37\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/design_tokens.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea00d15a1848ee05e039204a426cd5080d824dd66742c3ecaaf81231943f58c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ffmpeg_cli/ffmpeg.rs: FileTooLong \u2014 677 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 177 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":"crates/utils/dl_video/src/decode/ffmpeg_cli/ffmpeg.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"552f8560c533a394ea75d14e42bfc01988d3891968e69babef9fb3a3b19bfb1a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RrdManifest.concat: MethodTooLong \u2014 concat runs 135 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 35 over it, 1.35\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/dlr_manifest.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9f1d94fe87d75beba27379578a8c2c9df2c3a10c5f27cbe5427cd79f84ef01"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DesignTokens: ClassTooLong \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), 41 methods, 2 blocks, lines 103-965. The bar is 400 significant lines; this is 139 over it, 1.35\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/design_tokens.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"4412d3370fc787715c2c152de6980014ee20f6ccf025d15d7353518dd678adb3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/writes.rs: FileTooLong \u2014 671 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 96% of them inside a single declaration: ChunkStore (52-1185). The bar is 500 significant lines; this is 171 over it, 1.34\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/writes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3ccb218b4513968efd084957f28336a5a4f4ae0173dfc94c407599206852a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dalaran::commands::doctor::recording::check_recording: FunctionTooLong \u2014 dalaran::commands::doctor::recording::check_recording runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/doctor/recording.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"827f1b707f807cfc00893a76789b90f6dc29a04bd6eb6a3da631d44f54f963fc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ViewportUi.viewport_ui: MethodTooLong \u2014 viewport_ui runs 134 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 34 over it, 1.34\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport/src/viewport_ui.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c722cecb4f5f20fc3a57ec0d4330bab2897a9715561ef144fb336df83cc675"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ViewportBlueprint: 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":"crates/viewer/dl_viewport_blueprint/src/viewport_blueprint.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9bca6026afe24ee0b162557d001eda0fdcde666a83b830c5091c1d1bddf33c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_redap_client::connection_client::fetch_dlr_manifest_via_key: FunctionTooLong \u2014 dl_redap_client::connection_client::fetch_dlr_manifest_via_key runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/connection_client.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2a76d0a1476f1ae979970a682382e2ca75941ec368dd46934762b725fbbbe3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TimePanel.show_entity_contents: MethodTooLong \u2014 show_entity_contents runs 133 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_panel/src/time_panel.rs"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"25701610f0ecc5c3e66bb2275e0f217a5c0e647502d3f1abc63d80c9c554138a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Decoder.try_read_impl: MethodTooLong \u2014 try_read_impl runs 131 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 31 over it, 1.31\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/decoder/state_machine.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1aec0cd6b1cbcb0ca1aa0487ead88677c307444c60e9a878154745c488857a5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dlr/split.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), about 71% of them inside a single declaration: SplitCommand (2 blocks, 32-789). The bar is 500 significant lines; this is 152 over it, 1.30\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/split.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f921c9f54f341f1398dba7feca1caf0e9533e416044a466964c47b253ae825ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_types_core::reflection::generic_placeholder_for_datatype: FunctionTooLong \u2014 dl_types_core::reflection::generic_placeholder_for_datatype runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_types_core/src/reflection.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"4911acf586bb606cff4ae12e89471ce4984f4b67cefba97336189017772d54ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_view_time_series::fallbacks::register_fallbacks: FunctionTooLong \u2014 dl_view_time_series::fallbacks::register_fallbacks runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/fallbacks.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0fccb4326c0dba92cd266ea847ab4474d223c609aafcded041d88736c5662d4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.run_recording_command: MethodTooLong \u2014 run_recording_command runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/command_handling.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48b7f7d04eed14ae117172f154ed9a8d1d676a60422391c5bb672e2d237851a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_viewer::ui::dev_panel::transform_cache_ui::paint::draw_transform_cache_contents: FunctionTooLong \u2014 dl_viewer::ui::dev_panel::transform_cache_ui::paint::draw_transform_cache_contents runs 130 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/dev_panel/transform_cache_ui/paint.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"03c450f927eba153a00532e5011743f8611d6aeb0a3713a4907f42a6e5b62f18"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/chunk_fetcher.rs: FileTooLong \u2014 645 significant 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 145 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/chunk_fetcher.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd7f6c6e8a32db8dd2da6b0f5c72d3694a273e6f50a2a2849463d8a2bdb896cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/video_ui.rs: FileTooLong \u2014 645 significant 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 145 over it, 1.29\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/video_ui.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e3704f76314ec80692a8e0daabd75909214ee929d60af1334a9f815815aef8"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: LineRenderer.create_renderer: MethodTooLong \u2014 create_renderer runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/lines.rs"},"region":{"startLine":624}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddd8a4c1de7b63408ac3250b94f89aeae49f3803d10df7ad89f15b32f122974d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MeshDrawData.new: MethodTooLong \u2014 new runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd18ca67e3a3592fe6b842926bcfabe7a5b74bc3feb92cb23bb29cbe8b955a74"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_viewer_context::cache::video_stream_cache::handle_out_of_order_chunk: FunctionTooLong \u2014 dl_viewer_context::cache::video_stream_cache::handle_out_of_order_chunk runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.29\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs"},"region":{"startLine":1974}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb08b7cde44c220f1e369d798b7459addc934ef704ec08cdb0bb691ad0bcd1e5"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ViewportBlueprint: ClassTooLong \u2014 512 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 40 methods, 2 blocks, lines 37-970. The bar is 400 significant lines; this is 112 over it, 1.28\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/viewport_blueprint.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d07c8f9278de6b8da103b1beef86794f5fcee1c83a61d940383ce3f459e1dad"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ComponentUiRegistry: ClassTooLong \u2014 512 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 21 methods, 3 blocks, lines 125-960. The bar is 400 significant lines; this is 112 over it, 1.28\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/component_ui_registry.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ffc5baa3c4c9145c3e1e77d1056ebe56fc7b253069e7135fa40066ff1d715e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Args.generate_markdown_manual: MethodTooLong \u2014 generate_markdown_manual runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/entrypoint.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1918e7943be180fa13f265f97d2b13b81e77d116411e7463f84b14eb8addbfc"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TransformAxes3DVisualizer.execute: MethodTooLong \u2014 execute runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.28\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/transform_axes_3d.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"083214e97ea1386d06e31a97a771e39676fa8cf13c5882f260080e7d5da0078b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: web-viewer/index.ts: FileTooLong \u2014 637 significant lines (blank, comment-only and punctuation-only lines excluded), about 62% of them inside a single declaration: WebViewer (467-1232). The bar is 500 significant lines; this is 137 over it, 1.27\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_js/web-viewer/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a697bbd688e9eae2328ea5eb1fc9799dd5c8066af91797b59cca2be89d4302fd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RectangleRenderer.create_renderer: MethodTooLong \u2014 create_renderer runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/rectangles.rs"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8d360bb71bc01eb45bf6ac1783f0c0bfa0518215dc3e8cd174f47969c8abf0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ViewerContext: TooManyMethods \u2014 38 methods, declared across 2 files: src/viewer_context.rs (37), src/query_context.rs (1). The bar is 30 methods; this is 8 over it, 1.27\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/viewer_context.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"657b7b93e39788d150df3e10de4e748e43414e41538119b62ea097919b58ec4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_video::decode::ffmpeg_cli::ffmpeg::read_ffmpeg_output: FunctionTooLong \u2014 dl_video::decode::ffmpeg_cli::ffmpeg::read_ffmpeg_output runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/decode/ffmpeg_cli/ffmpeg.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8b790b25ae0e838455e309c5fc6ea10ce19b3864607dbbd6fa4db48be76745e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BlueprintTree.data_result_ui: MethodTooLong \u2014 data_result_ui runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_blueprint_tree/src/blueprint_tree.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f8140f1137aa95bfad65358df409b323dc0366fa86de2e22ad299201d0fdaa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.load_data_source: MethodTooLong \u2014 load_data_source runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/add_data_source.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b70da70c1e4de7967e1a523fabd108b336b61ee75146982c0be384c4584da47"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CommandPaletteProviderImpl.all_matching: MethodTooLong \u2014 all_matching runs 126 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/command_palette.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4bc5ff3b213312a6577c1b8370e7148276d33a96bb77892d2d5b67e7b8f33b"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataResultData.from_data_result_and_filter: MethodTooLong \u2014 from_data_result_and_filter 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":"crates/viewer/dl_blueprint_tree/src/data.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8778f6b69627d9ff206eaa213da93c14d6768df3bd81eb99509a9f1bc57d720"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LeRobotDatasetV3: ClassTooLong \u2014 499 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 18 methods, 3 blocks, lines 84-937. The bar is 400 significant lines; this is 99 over it, 1.25\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/lerobot/datasetv3.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13a3e5d57c7d0224b4e99b126d627a9005a3028916fd12510aae53d8d982458"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SpatialView3D.on_register: MethodTooLong \u2014 on_register runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/view_3d.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"1689edf28286ca5129008044f7984f1ef3af4739abd86365cf1ebc84d97b1492"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VideoStreamCache.handle_store_event: MethodTooLong \u2014 handle_store_event runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"7160f01637a0a6dadf130e26313a604c384c171ecff8e36bcce133f7dc320b44"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RecordingStream: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/recording_stream.py"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e81e1e8b776f6b060496062f56f40a21a6f81ac0b8a08ef04cfb3f62acede92"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: demux/mod.rs: FileTooLong \u2014 612 significant 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 112 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":"crates/utils/dl_video/src/demux/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cdcc6751c9ded5ba7b2c6a4cca5d17d174eac62dd56e1d8d6bbaad1c7af8cbf"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RawRrdManifest.check_manifest_schema_matches_sorbet_schema: MethodTooLong \u2014 check_manifest_schema_matches_sorbet_schema runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"54575a5819351639bde4dc99824cf01711f1aff768adf09c9c5c69f2577026eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dalaran::commands::dlr::merge_optimize::merge_and_compact: FunctionTooLong \u2014 dalaran::commands::dlr::merge_optimize::merge_and_compact runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/merge_optimize.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a220481a920e33d6253d3c1fd2b4b7404a77d251082eaa1b1caed82127c6242"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VideoDataDescription.load_mp4_from_reader: MethodTooLong \u2014 load_mp4_from_reader runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/demux/mp4.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"6313add1886823915e63818b9bae5fbb9533b3dfc79453419758e87cf5a8949d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GaussianSplatRenderer.create_renderer: MethodTooLong \u2014 create_renderer runs 122 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"de89107216a91ab2013e14b99e32a0544afdbdba726317467cf5773b4e960468"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/chunk_store_ui.rs: FileTooLong \u2014 609 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 79% of them inside a single declaration: DatastoreUi (3 blocks, 115-861). The bar is 500 significant lines; this is 109 over it, 1.22\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_chunk_store_ui/src/chunk_store_ui.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5b13be49d49bbf18c52aa1344933eac1b0ba40250edb673f7d8553d6f89926e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/component_ui_registry.rs: FileTooLong \u2014 609 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 84% of them inside a single declaration: ComponentUiRegistry (3 blocks, 125-960). The bar is 500 significant lines; this is 109 over it, 1.22\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/component_ui_registry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ae0839ff45298dcd31b4dd21d6ce4c02a0d8711d7aa97ce8223e0a000f977f"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: RawRrdManifest.calc_temporal_map: MethodTooLong \u2014 calc_temporal_map runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"15bd6ec82ae62a7549ae41c2edc674007ad124ee1dc694d9bfe21dd2f043498d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dalaran::commands::entrypoint::run_impl: FunctionTooLong \u2014 dalaran::commands::entrypoint::run_impl runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/entrypoint.rs"},"region":{"startLine":983}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f4efd561954176a1ca14c3cef942480156236534dca44a31626d3798acb5f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_ui::drag_and_drop::find_drop_target: FunctionTooLong \u2014 dl_ui::drag_and_drop::find_drop_target runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/drag_and_drop.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"3963e367a0342a96346b75098d29120c685a24456e6c1a017b54285d9fb613b8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_viewer::ui::settings_screen::settings_screen_ui_impl: FunctionTooLong \u2014 dl_viewer::ui::settings_screen::settings_screen_ui_impl runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/settings_screen.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"384643ab58343032352eb96715b4fadbf9bb9a819f0273da637ea2ac1b50e8bc"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DatastoreUi: ClassTooLong \u2014 483 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 10 methods, 3 blocks, lines 115-861. The bar is 400 significant lines; this is 83 over it, 1.21\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_chunk_store_ui/src/chunk_store_ui.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6eaf50fabddbbb65815b99e5ee0991304e85f27d3abf9a1b57fa6c0798c07c"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: InMemoryStore: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/in_memory_store.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"38043b2522f64007adbd99695ee951595f365d86f858cc7feca6776dca5fd276"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_chunk::batcher::batching_thread: FunctionTooLong \u2014 dl_chunk::batcher::batching_thread runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/batcher.rs"},"region":{"startLine":573}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2c532e6b75331c390969f66231e99cc1692d957946e83b710a80dd117efb0d5"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/show_index.rs: FileTooLong \u2014 587 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 87 over it, 1.17\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_arrow_ui/src/show_index.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a2fb3f1487fb8c052c67a63dceba09af5438de53d432cba38cda37459bc01a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ChunkStore.insert_dlr_manifest: MethodTooLong \u2014 insert_dlr_manifest runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/writes.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9661e1beede82b3f5fcc7f94aebc07fc2615e0dfcac84ef12f41225acf3eff37"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: QueryHandle.init_: MethodTooLong \u2014 init_ runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"6faf2de610bb9ba38db5780b84bbd0f590b8377cd03e99eaf70610fcac4e51c1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: MessageDecoderRunner.process: MethodTooLong \u2014 process runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/decoders/mod.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"a49955a35c965aa9480229b23d52be9cc5588a6b87c9776f785ee2ce573265b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_view_spatial::proc_mesh::generate_wireframe: FunctionTooLong \u2014 dl_view_spatial::proc_mesh::generate_wireframe runs 117 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/proc_mesh.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f8524308ff764e22cdef5a1b8560d061b34bb1b35eb66b7392deebe8a7c4d2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: QuerySnapshot: TooManyFields \u2014 35 stored fields. The bar is 30 stored fields; this is 5 over it, 1.17\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/metrics_capture.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50e0c2e796628114d226ded4230c8fc2d210ff9bfc60c30f59b3ca934222f13"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: InMemoryStore: ClassTooLong \u2014 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), 36 methods, 4 blocks, lines 39-816. The bar is 400 significant lines; this is 66 over it, 1.17\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/in_memory_store.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"05fe7b91f8a03aa060889124679c8783354dc15f923d63b016d57f72fe884455"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: SplitCommand: ClassTooLong \u2014 465 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 3 methods, 2 blocks, lines 32-789. The bar is 400 significant lines; this is 65 over it, 1.16\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/split.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"7598241270efb2cc64c2d15280f85ba2df0737a6e494893fdd7eb4f8c14b7f5b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: player/mod.rs: FileTooLong \u2014 581 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 65% of them inside a single declaration: VideoPlayer (4 blocks, 305-1073). The bar is 500 significant lines; this is 81 over it, 1.16\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/player/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a0ec52dcafdb870ad8dcb84447b347824e26a0e19fe0b60a1ee81c1f0babfeb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/point_cloud.rs: FileTooLong \u2014 581 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 81 over it, 1.16\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/point_cloud.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7803ba6d88e5a2ea1940860270c2e5c834c1b341e8d758a7d4fca8279d05d579"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_view_text_log::view_class::table_ui: FunctionTooLong \u2014 dl_view_text_log::view_class::table_ui runs 116 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 16 over it, 1.16\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_text_log/src/view_class.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d9feb03186a1dc5a2a11864290409b8c5a4530dcf1c75182c00d6f5c47d44f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: transform_cache_ui/paint.rs: FileTooLong \u2014 576 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 76 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/dev_panel/transform_cache_ui/paint.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47c795f321b7584f842e5900b47a4f551bf1185acadefcee74ed5dac2cb78f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_component_ui::variant_uis::redap_uri_button::redap_uri_button: FunctionTooLong \u2014 dl_component_ui::variant_uis::redap_uri_button::redap_uri_button runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/variant_uis/redap_uri_button.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c516db55646fb89db41d26b4a7f72ff55d234f7108a376a1a09657682d1ee1"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Query.column_visibility_ui_impl: MethodTooLong \u2014 column_visibility_ui_impl runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_dataframe/src/view_query/ui.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb54094a871b167d362686a7f7562e359b7431a03d25bc62db94f238b5d6e279"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/recording_panel_ui.rs: FileTooLong \u2014 573 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 73 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_recording_panel/src/recording_panel_ui.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5082789c199dd4117f98f9a3b8fb4104ff273a530bcab31bf0cc8839c673499"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dalaran::commands::entrypoint::start_native_viewer: FunctionTooLong \u2014 dalaran::commands::entrypoint::start_native_viewer runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/entrypoint.rs"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9332e176207391cdbb4b825d7b45adf7a3cee82747801bb90585fe285997bd4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DatastoreUi.chunk_store_ui: MethodTooLong \u2014 chunk_store_ui runs 114 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_chunk_store_ui/src/chunk_store_ui.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"078057721e334a2fb68e129b967b3cebad7d1da6a7f557aa01ee929f533feb8b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: WebViewer: TooManyMethods \u2014 34 methods. The bar is 30 methods; this is 4 over it, 1.13\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_js/web-viewer/index.ts"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0a555aa436ce2716743ed8bdf13bc0c2ff1830d8b9f7615006701c5f601cee3"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SegmentUrlUdf.invoke_with_args: MethodTooLong \u2014 invoke_with_args 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":"dalaran_py/src/catalog/segment_url_udf.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f44fe0d48ec8befe409f02c2598347c816c1959351a027e6d0250ac1176a378"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_datafusion::pushdown_expressions::apply_filter_expr_to_queries: FunctionTooLong \u2014 dl_datafusion::pushdown_expressions::apply_filter_expr_to_queries runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/pushdown_expressions.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"4efbd818d47e6fab159a1dc4b0ff1b046a4e274005f60aba481b2a9d1c3d91d3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_component_ui::create_component_ui_registry: FunctionTooLong \u2014 dl_component_ui::create_component_ui_registry runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/lib.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"840d45e3b35bb329b10f8b0f547ca0c7427e544161a5052e4fa1817d5f3f980a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CamerasVisualizer.visit_instance: MethodTooLong \u2014 visit_instance runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/cameras.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db16bb85c71f4da61dedbc4ffe5c166fdf33aec21b5481e8f9337632d48bf19"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/batcher.rs: FileTooLong \u2014 554 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 54 over it, 1.11\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/batcher.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"037a2952ac9b1c4008c0fcbb7b5377f520ebca753c53b1ef6b0c07a94422096d"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DataFusionTableWidget: ClassTooLong \u2014 443 significant 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, 2 blocks, lines 151-836. The bar is 400 significant lines; this is 43 over it, 1.11\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/datafusion_table_widget.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa159149fe5df2707564df354e66cb238890bb3e3ce707c89cef045534774d33"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/store.rs: FileTooLong \u2014 550 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 65% of them inside a single declaration: ChunkStore (6 blocks, 519-1291). The bar is 500 significant lines; this is 50 over it, 1.10\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"17cbdd8efb80d72a23e23e4b7359bc6e26cc48601f2c37e105e0236388ffc8bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: video/mod.rs: FileTooLong \u2014 550 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 50 over it, 1.10\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/video/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"23b03e4c912640b51c29fcf33b6118043f1fd6fd717065d50fe5d57c9aa9a095"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VoxelGridMapVisualizer.process_voxel_grid_map: MethodTooLong \u2014 process_voxel_grid_map runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/voxel_grid_map.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a4598c26ce4d276101036cc617ccfbc1690023f4c31a06032fb683246aa626"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/web.rs: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 64% of them inside a single declaration: WebHandle (2 blocks, 29-610). The bar is 500 significant lines; this is 49 over it, 1.10\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/web.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b737201a80edace6336f32ffac5002783f759f6b1233c571bc2ee0fd64aa32"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: store/in_memory_store.rs: FileTooLong \u2014 546 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 85% of them inside a single declaration: InMemoryStore (4 blocks, 39-816). The bar is 500 significant lines; this is 46 over it, 1.09\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/in_memory_store.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b198e998ad3ef1e94408a1210a03630b24c96bab8c82f91b84d319dd3ce204"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/gaussian_splat.rs: FileTooLong \u2014 546 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 46 over it, 1.09\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3505e8af5c9bdd16ffef39c98f9e10db3dda79700611079477691996e2bdbe3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dataframe_query_provider.rs: FileTooLong \u2014 545 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 45 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":"crates/store/dl_datafusion/src/dataframe_query_provider.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddae33cf3a117b3100cdf9c85d42e12159beae870577bfd2dc2f237b1e3b326c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FilterCommand.run: MethodTooLong \u2014 run runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/filter.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"780dd2cf7f76ab4e08b166032ce65e64085cbf2a6ecdbc8365e1de0b1b0a793b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_data_ui::video_ui::video_data_ui: FunctionTooLong \u2014 dl_data_ui::video_ui::video_data_ui runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/video_ui.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a5b958be77d423971fb724c2701073c31d0a68d53f7b20b7e4d4fe171b511e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_viewport::view_highlights::highlights_for_view: FunctionTooLong \u2014 dl_viewport::view_highlights::highlights_for_view runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport/src/view_highlights.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"8931476950ab64b5a6e805f69d6b6718da15ebb35b3e9bf40d418e63af9e9034"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/grpc.rs: FileTooLong \u2014 543 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 43 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":"crates/utils/dl_perf_telemetry/src/grpc.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7340d8d7cebf9697e2ed21ace6ff24a3c18d03176c9ef655b92c6203bee64ed"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: SegmentStreamExec.try_new: MethodTooLong \u2014 try_new runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"94127f66706aad410f6085ce696a6989bc520edcfecf64a753a28edef76dd81e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: ConnectionHandle: ClassTooLong \u2014 429 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 29 methods, 3 blocks, lines 34-636. The bar is 400 significant lines; this is 29 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/catalog/connection_handle.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f335de9867fbceb260ec18813679ff9a9a27c107911cfb62343033d6b410d278"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: ImageStats.from_image: MethodTooLong \u2014 from_image runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/tensor/image_stats.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"765e822331eff643869add2d5c1fadc930782d6d0e6b5b85b45702649fd0075a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TensorStats.from_tensor: MethodTooLong \u2014 from_tensor runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/tensor/tensor_stats.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73a4ad15743447be31ef1c8fc283ee1cc34d9152e2d06b5306f611394a87cee"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: catalog/_entry.py: FileTooLong \u2014 534 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 34 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/catalog/_entry.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b02e3e5b058ab6bc40ae8e88739f258c66dc5233e15f8fa68bfd1dde6d74819e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: RrdManifestIndex: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/dlr_manifest_index.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b313f27d2bafa3c2d1d61965bc55d8be6b9034dbc291836d73058d6566f04e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dataframe_query_provider/cpu_worker.rs: FileTooLong \u2014 533 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 33 over it, 1.07\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9684df6b25d347471416f982fcad2604321bd63890c13f55254b04e27371d4b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_arrow_util::format::format_dataframe_without_metadata: FunctionTooLong \u2014 dl_arrow_util::format::format_dataframe_without_metadata runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_arrow_util/src/format.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ff0668bf1f87f565787409c1f4fc9550ccceabc292308866e2995e630b31bf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_data_ui::video_ui::decoded_frame_ui: FunctionTooLong \u2014 dl_data_ui::video_ui::decoded_frame_ui runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/video_ui.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5cfd901cad829f2f6dc75e439250632add767d321aeb1a54e45736447fd141"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TimestampFilter.popup_ui: MethodTooLong \u2014 popup_ui runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/filters/timestamp.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82f151620e06ca3bb151468119d140ed21e5c15ac39f6e5d0a5b5bf50392069"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: CommandPalette.alternatives_ui: MethodTooLong \u2014 alternatives_ui runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/command_palette.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d0efaf999661502daf1255976e34a09f97a87050380578084792713954ef03"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/mesh_renderer.rs: FileTooLong \u2014 524 significant 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 24 over it, 1.05\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc902b36550ceeda9ff5d3652e7970c16e9a5b88f80b5f5caf2b350bb4fb2a95"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: renderer/rectangles.rs: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 21 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/rectangles.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a80158655fec62d8e6fa7d972d981c255d6ba81540089fe6236a79342f130da"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/data_density_graph.rs: FileTooLong \u2014 521 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 21 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_panel/src/data_density_graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ef97ec7a7994f0e5dadca64677385021ec14da5d12e261197edbd5de612696"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_mcap::parsers::ros2msg::sensor_msgs::point_cloud_2::add_field_value: FunctionTooLong \u2014 dl_mcap::parsers::ros2msg::sensor_msgs::point_cloud_2::add_field_value runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/point_cloud_2.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d3ed7a9a3407cf6134ecff4c9f08ad2eea2ca563394933bf717de72a0de051"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: FFmpegProcessAndListener.new: MethodTooLong \u2014 new runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/decode/ffmpeg_cli/ffmpeg.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc0ffb6e4a553acdaa2bdb17d78c476c027e5ab4e12cfe1c1c4b1169712279c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_view_spatial::ui::create_labels: FunctionTooLong \u2014 dl_view_spatial::ui::create_labels runs 104 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/ui.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"f295b4283e66c66b2ded35af5975243bf1a61c0f69fb6efbebc047561fd09d91"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: decoders/mod.rs: FileTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 19 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/decoders/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4667b1bdc2ca2a5d8c2beaf5789d26cc679bed10542a9283ad6f52a8197ade4f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/telemetry.rs: FileTooLong \u2014 517 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 68% of them inside a single declaration: Telemetry (4 blocks, 317-1079). The bar is 500 significant lines; this is 17 over it, 1.03\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_perf_telemetry/src/telemetry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9a90b1cf5c5b0be3db5f61fc1c44c8188a8de8b9d072ced4f6b499ce19edb90"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TimeColumn: TooManyMethods \u2014 31 methods, declared across 5 files: src/chunk.rs (23), src/slice.rs (4), src/shuffle.rs (2), src/builder.rs (1), \u002B1 more file(s). The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/chunk.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"627fc17af2c8aebc95955e2ce7c6ef6f7e49f5edc47a2c062d80ddacb0c28978"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: EntityPath: TooManyMethods \u2014 31 methods, declared across 3 files: path/entity_path.rs (28), path/parse_path.rs (2), datatypes/entity_path_ext.rs (1). The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/path/entity_path.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed6f6d66cae47abfe5915951aabbe09d68fe32a149a26bb7b852ced93c6a28b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: PyDatasetEntryInternal: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/catalog/dataset_entry.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9b4008a3de2b94a1abd93ad0bca2aa2e436a04799d012dfe357eb469974134"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: QueryMetrics: TooManyFields \u2014 31 stored fields beside 1 method. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/metrics_capture.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0fae89c627eccc65cc096f11936c759429f5093874b74e60b727d3ceb12dc0"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Dataset: ClassTooLong \u2014 412 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 26 methods, 2 blocks, lines 40-705. The bar is 400 significant lines; this is 12 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/dataset.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"375b778e7f6c5eda6767241b131293b54f803ebf9b0275fc58445360920aa738"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: GpuMesh.new: MethodTooLong \u2014 new runs 103 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/mesh.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c34852176be48d8701a00ae4aed6a74725d1ae6b1b960d83422e9ca79bc04d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/picking_ui_pixel.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":"crates/viewer/dl_view_spatial/src/picking_ui_pixel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"382975ea18a27a759af1c65c1bedf0cca3f3aba048b2131ea5b221b885363f6c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dalaran/recording_stream.py: FileTooLong \u2014 510 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 10 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/recording_stream.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d095d79c67c08e58767db4ef2f84774137c86b90bc3238521586f65f886b1f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_tf::transform_queries::query_and_resolve_instance_poses_at_entity: FunctionTooLong \u2014 dl_tf::transform_queries::query_and_resolve_instance_poses_at_entity runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_queries.rs"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"59426be61b78879045b27be8e5eec2ebf816cf7411615238062932e6407ea0dd"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TimePanel.show_entity: MethodTooLong \u2014 show_entity runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_panel/src/time_panel.rs"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf28cb5b8a79fb6c60b0cca1075ae4a0965346e3d27bfe304e01008c63d95b5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: UICommand.text_and_tooltip: MethodTooLong \u2014 text_and_tooltip runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/command/ui_command.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1a9b6edf76086f9c9d8e5c6d96865ec5a1e21449918b3124554ed32bac8fb34"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Mesh3DVisualizer.execute: MethodTooLong \u2014 execute runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/meshes.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cd4bc21dff06fba48ae802470ef304a943ffe73b21a810e7dfc0572c92ae96"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Points3DVisualizer.execute: MethodTooLong \u2014 execute runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/points3d.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3957cc199ac863d31b0dd57b17d5b2a095d9cdbedfafb84d20041afac5d371"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VoxelGridMapVisualizer.execute: MethodTooLong \u2014 execute runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/voxel_grid_map.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd790c22ec99315e5ee3e39622c3156c8dc0c1ab5d6a596b0f8321436f8db81"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: App.ui_impl: MethodTooLong \u2014 ui_impl runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/ui.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"52648f99a0e5d54fcb7ac130a1f68523e9d4046e97a46b664c89edfc335bd444"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_viewer::ui::dev_panel::server_streaming_tab::streaming_plots: FunctionTooLong \u2014 dl_viewer::ui::dev_panel::server_streaming_tab::streaming_plots runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/dev_panel/server_streaming_tab.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb750d5d570ca9e2e0b1fe60be1989fa8d89553db23ccdeb3bb415b109c2cba3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dl_viewer_context::cache::video_stream_cache::handle_deletion: FunctionTooLong \u2014 dl_viewer_context::cache::video_stream_cache::handle_deletion runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b1d0fa1dc2775f595b2cb9769cedb6d527727080590dee4857174af8b62c56f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/dataframe_ui.rs: FileTooLong \u2014 508 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 8 over it, 1.02\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_dataframe/src/dataframe_ui.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1cdc27f0c15a5e16e6aece6c1273649760186cd3811e77bd0aa8be04220970f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DataframeQueryTableProvider: ClassTooLong \u2014 406 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 6 methods, 4 blocks, lines 111-825. The bar is 400 significant lines; this is 6 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_common.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce16671e3b966c54c2930274507140f9455d867aa2ef74d6b5fbfb8cb1a62ce3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/open_url.rs: FileTooLong \u2014 505 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), about 76% of them inside a single declaration: ViewerOpenUrl (6 blocks, 42-763). The bar is 500 significant lines; this is 5 over it, 1.01\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/open_url.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1c42c69ce19bfbc7b3054b5d23ee173ccae9cde446cc8fe570f8af1f63fd3b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: dalaran::commands::dlr::stats::compute_stats: FunctionTooLong \u2014 dalaran::commands::dlr::stats::compute_stats runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/stats.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"e630bb0f10db60829bd0c7c2b33f9f91e6f95b0e2c57f0ac0f910be7a6876c85"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: VideoPlayer.enqueue_samples: MethodTooLong \u2014 enqueue_samples runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/player/mod.rs"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c268a20eb45ba5541a6ea122fe5b2656e422db310df93a2915f9266a5be77d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DataframeTableDelegate.header_cell_ui: MethodTooLong \u2014 header_cell_ui runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_dataframe/src/dataframe_ui.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d381f9606d269bca3c6e2c4ae3af59071abcca43b05ddfb634de4bf9ef9174"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/prometheus.rs: FileTooLong \u2014 504 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 4 over it, 1.01\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_perf_telemetry/src/prometheus.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b7d20ee3194b56b91b85a4a13fff186f4c9b04ce2a60e65b96df959ddacc69"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 10 shared lines): crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:360-481 | crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:653-817 | crates/viewer/dl_renderer/src/renderer/lines.rs:624-795 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:651-847 | crates/viewer/dl_renderer/src/renderer/voxel_grid.rs:306-407 \u2014 These 5 members are variants of one another: a block of 10 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/depth_cloud.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"084b3b34b3dcb07ac7b833087fe20f90720d75cda3c00057b3a4615a65e52c8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (85 shared lines): crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:340-578 | crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:195-459 \u2014 These two members are variants of one another: 85 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/line_visualizer_system.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c7fac76d75e754769241f5b8f7647c516d24b48a544bd1378e1ed5cbcf8240d"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (64 shared lines): crates/viewer/dl_selection_panel/src/view_entity_picker.rs:337-441 | crates/viewer/dl_time_panel/src/streams_tree_data.rs:109-212 \u2014 These two members are variants of one another: 64 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/view_entity_picker.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c61f43e8102dbaee4f37dd7c89d6a1bebaf633b02bb83005f27925ff1ca16bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (58 shared lines): crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs:174-263 | crates/viewer/dl_view_spatial/src/visualizers/lines3d.rs:185-274 \u2014 These two members are variants of one another: 58 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"cade578bde49e4e9e6eaaf2cfb8f1e0a426264d7dfbd3e7141f2fbc2eeec873a"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (57 shared lines): crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:33-142 | crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:42-149 \u2014 These two members are variants of one another: 57 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"f914bbcfd3662de500d37622cb7e28dc096dfc4dee9cb5ac526b36845ca25545"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (24 shared lines): crates/viewer/dl_view_time_series/src/series_query.rs:200-289 | crates/viewer/dl_view_time_series/src/series_query.rs:365-424 \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":"crates/viewer/dl_view_time_series/src/series_query.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd4baadb6dd974473636cdefdc2513d57af6ab96e2cfe41af3730bc820eb81d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): crates/viewer/dl_blueprint_tree/src/blueprint_tree.rs:741-790 | crates/viewer/dl_time_panel/src/time_panel.rs:1285-1335 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_blueprint_tree/src/blueprint_tree.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"1574cd056e4cb6c393a1655e574b5ff582cc9f6408a72adc423c8fdffe4024e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:187-275 | crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs:189-277 | crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:191-288 | crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs:120-234 | crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:195-293 | crates/viewer/dl_view_spatial/src/visualizers/ellipsoids.rs:122-235 | crates/viewer/dl_view_spatial/src/visualizers/points2d.rs:213-319 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6a22e25089689df8a2e7da455850865f2af33545c29a634d517f2c30f29a89"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/store/dl_lenses/src/op/semantic.rs:261-275 | crates/store/dl_lenses/src/op/string.rs:11-26 | crates/store/dl_lenses/src/op/string.rs:31-46 | crates/store/dl_lenses/src/op/string.rs:51-66 | crates/store/dl_lenses/src/op/string.rs:71-86 | crates/store/dl_lenses/src/semantic/foxglove/log.rs:30-55 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/src/op/semantic.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"c625b0fba9cc91885dc54a9b70845128683e0bf217b9f2133a71e90ccbb0300d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (6 members, 50\u002B identical tokens): crates/utils/dl_perf_telemetry/src/prometheus.rs:212-234 | crates/utils/dl_perf_telemetry/src/prometheus.rs:242-261 | crates/utils/dl_perf_telemetry/src/prometheus.rs:269-290 | crates/utils/dl_perf_telemetry/src/prometheus.rs:387-409 | crates/utils/dl_perf_telemetry/src/prometheus.rs:417-436 | crates/utils/dl_perf_telemetry/src/prometheus.rs:444-465 \u2014 These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_perf_telemetry/src/prometheus.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"6214d6c7226490ab811d68ed0766e5308b50cde0e7dc437d6af19ab204c3bcc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/store/dl_log_encoding/src/dlr/footer/hub_dlr_manifest.rs:183-197 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1596-1612 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1622-1638 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1650-1666 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1680-1696 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/hub_dlr_manifest.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ffce8922ffb65e4e7c4ccde921a441437f084ea2662776ca520d84c0f8cfd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/viewer/dl_viewer/data/quick_start_guides/quick_start_connect.rs:5-24 | crates/viewer/dl_viewer/data/quick_start_guides/quick_start_spawn.rs:5-25 | docs/snippets/all/howto/set_sinks.rs:5-34 | docs/snippets/all/quick_start/quick_start_connect.rs:5-25 | docs/snippets/all/quick_start/quick_start_spawn.rs:5-27 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/data/quick_start_guides/quick_start_connect.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"152b587b41789122eb498ec4acd3315b0733726e686fa5f433db46eda76c415d"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/store/dl_chunk/src/iter.rs:476-501 | crates/store/dl_chunk/src/iter.rs:553-590 | crates/store/dl_chunk/src/iter.rs:637-668 | crates/store/dl_chunk/src/iter.rs:778-825 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/iter.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"b36a01d61704dd12388859a602b6fd61ee54d10ff84e7e4751978933f864a2ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/store/dl_chunk/src/unit_chunk.rs:98-110 | crates/store/dl_chunk/src/unit_chunk.rs:151-163 | crates/store/dl_chunk/src/unit_chunk.rs:388-400 | crates/store/dl_chunk/src/unit_chunk.rs:431-443 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/unit_chunk.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"24fce4aa447d565f17a4987bf802e90243eb8c3269d79b180d259942c64f924c"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): crates/viewer/dl_renderer/src/renderer/debug_overlay.rs:244-254 | crates/viewer/dl_renderer/src/renderer/generic_skybox.rs:171-183 | crates/viewer/dl_renderer/src/renderer/world_grid.rs:197-207 | crates/viewer/dl_renderer/src/resource_managers/yuv_converter.rs:554-565 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/debug_overlay.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe8ac83431a31096db6e89cc78fc6c075ba0d28e645b4988e2885e478a332e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): docs/snippets/all/descriptors/descr_builtin_archetype.rs:30-78 | docs/snippets/all/descriptors/descr_builtin_component.rs:40-83 | docs/snippets/all/descriptors/descr_custom_archetype.rs:75-121 | docs/snippets/all/descriptors/descr_custom_component.rs:35-76 \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":"docs/snippets/all/descriptors/descr_builtin_archetype.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9fc7e05c5474efe271ec7571f931ed2eef7d80886061dfac934e0b3bdc0bad0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (156 corresponding lines): crates/viewer/dl_viewer_context/src/tensor/image_stats.rs:22-189 | crates/viewer/dl_viewer_context/src/tensor/tensor_stats.rs:21-176 \u2014 These two members are one piece of code written twice and then edited apart: 156 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/tensor/image_stats.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1854a29d118b88f84c5132c3dcca4e06614d038a471d7f65e46ec56989f1419"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (100 corresponding lines): crates/viewer/dl_view_spatial/src/visualizers/capsules3d.rs:160-259 | crates/viewer/dl_view_spatial/src/visualizers/cylinders3d.rs:155-255 \u2014 These two members are one piece of code written twice and then edited apart: 100 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/capsules3d.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18a3f591f79152d0935e8138a5cfe5f34c10e140de7108d52dbfa1089ffa70d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (95 corresponding lines): docs/snippets/all/archetypes/transform3d_hierarchy.rs:3-97 | docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:3-121 \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":"docs/snippets/all/archetypes/transform3d_hierarchy.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"600062e8d62b9a7c2db1be87fc158166e28df8f3af2d05ea5fe6772764664dde"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (103 corresponding lines): crates/viewer/dl_view_spatial/src/visualizers/gaussian_splats3d.rs:384-486 | crates/viewer/dl_view_spatial/src/visualizers/points3d.rs:413-535 \u2014 These two members are one piece of code written twice and then edited apart: 103 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/gaussian_splats3d.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0dc1fefdaef239c3b623fb0a7688eeb9a8959c28026acc212138d91c7c5b68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (133 corresponding lines): crates/viewer/dl_view/src/query.rs:247-380 | crates/viewer/dl_view/src/query.rs:423-555 \u2014 These two members are one piece of code written twice and then edited apart: 133 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/src/query.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"9896fdc90e884e26d0fec40410ea6c44ec2b59a84a39aee64c8be44a4c6c705a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (89 corresponding lines): crates/store/dl_importer/src/lerobot/datasetv2.rs:366-454 | crates/store/dl_importer/src/lerobot/datasetv3.rs:410-507 \u2014 These two members are one piece of code written twice and then edited apart: 89 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/lerobot/datasetv2.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe663ab5d4081314b5850a19ce3bb6b90202279510f57db2c66ed7139a63f46a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 95\u002B corresponding lines): crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:33-138 | crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs:32-126 | crates/viewer/dl_view_spatial/src/visualizers/lines3d.rs:33-137 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 95 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5126289a2e723574a67e99ec405ea089730b0fca5fd264d749f71f6a16c7f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (72 corresponding lines): crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:166-241 | crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:342-413 \u2014 These two members are one piece of code written twice and then edited apart: 72 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a2bf8826718e591c52c5f231c86e63a7127e310538b6662fc7514f77cacce4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (75 corresponding lines): crates/viewer/dl_view_map/src/visualizers/geo_line_strings.rs:57-131 | crates/viewer/dl_view_map/src/visualizers/geo_points.rs:60-143 \u2014 These two members are one piece of code written twice and then edited apart: 75 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_map/src/visualizers/geo_line_strings.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8015261798eae5998da0e8cf2ed0dfbbac5b4dcb4e323c26e3791825357130"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (89 corresponding lines): crates/viewer/dl_view_spatial/src/visualizers/images.rs:89-177 | crates/viewer/dl_view_spatial/src/visualizers/segmentation_images.rs:53-152 \u2014 These two members are one piece of code written twice and then edited apart: 89 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/images.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b1aa3ee8097caa20be62eb13b883d75f6071b604e188cd8688109fe3802180"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (65 corresponding lines): crates/viewer/dl_renderer/src/renderer/generic_skybox.rs:99-163 | crates/viewer/dl_renderer/src/renderer/world_grid.rs:118-189 \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":"crates/viewer/dl_renderer/src/renderer/generic_skybox.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9295f64218d704d8fa3f03783d45fae14d29ee6e203be9d23d33bfd1a36925"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (67 corresponding lines): crates/viewer/dl_view_spatial/src/visualizers/capsules3d.rs:33-103 | crates/viewer/dl_view_spatial/src/visualizers/cylinders3d.rs:32-98 \u2014 These two members are one piece of code written twice and then edited apart: 67 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/capsules3d.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"0409a791a85377a998143060f0c422ce82b7088b34d01dd3a19da86e5c224e1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): docs/snippets/all/tutorials/dna.py:16-96 | examples/python/dna/dna.py:26-60 \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":"docs/snippets/all/tutorials/dna.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec1646c7f95c5b19650a4ffbcd72338bfd186d726e99f6975c253dab65c20649"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/viewer/dl_view_spatial/src/visualizers/mod.rs:73-98 | crates/viewer/dl_view_spatial/src/visualizers/mod.rs:102-130 \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":"crates/viewer/dl_view_spatial/src/visualizers/mod.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4e85a157fd0b64cb3ccc77bb027c319d17f0d786e69471a3794b1f6743430b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 43\u002B corresponding lines): crates/viewer/dl_component_ui/src/geo_line_string.rs:21-70 | crates/viewer/dl_component_ui/src/line_strip.rs:23-71 | crates/viewer/dl_component_ui/src/line_strip.rs:88-130 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 43 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/geo_line_string.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8433ce68e39e2cc0a693a437321f94555c28c2173fc4316fe33e400a89b1b91"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (77 corresponding lines): crates/store/dl_query/src/bin/clamped_zip.rs:119-195 | crates/store/dl_query/src/bin/clamped_zip.rs:236-313 \u2014 These two members are one piece of code written twice and then edited apart: 77 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/bin/clamped_zip.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d48b7f82f9aa47a7e920d751cf8e2743c11e6e10ab6bceb9d0246fab4da5674"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (59 corresponding lines): crates/viewer/dl_view_spatial/src/visualizers/assets3d.rs:40-99 | crates/viewer/dl_view_spatial/src/visualizers/meshes.rs:42-100 \u2014 These two members are one piece of code written twice and then edited apart: 59 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/assets3d.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6d529173232e77868d98cbf60b48ee1e222f1367b4c1a7a254f25f1fbbdd51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (69 corresponding lines): crates/store/dl_grpc_server/src/lib.rs:377-445 | crates/store/dl_grpc_server/src/lib.rs:460-540 \u2014 These two members are one piece of code written twice and then edited apart: 69 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_grpc_server/src/lib.rs"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eff98a31f467fa8b71d6e9fb35af83a876c4c96429b627530975375f5bc4305"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): docs/snippets/all/archetypes/points3d_column_updates.rs:5-43 | docs/snippets/all/archetypes/points3d_row_updates.rs:5-38 \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":"docs/snippets/all/archetypes/points3d_column_updates.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"99283e763212005466911e2c881a00f3301aca2a281f916862867424e9513175"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/store/dl_importer/src/lerobot/datasetv3.rs:1354-1388 | crates/store/dl_importer/src/lerobot/datasetv3.rs:1396-1430 \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":"crates/store/dl_importer/src/lerobot/datasetv3.rs"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4929caea9b0f8a31aa1487bd8ebddd3d28218e3fde876d8558659e0ce7566a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/store/dl_sorbet/src/migrations/make_list_arrays.rs:18-61 | crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:84-124 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/migrations/make_list_arrays.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3d5ddbb8e6b7b8b971888bb2add12cd72fbfe6a71a7691c1df8c87f318eea4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:68-85 | crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:88-113 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"6237ec279ee172ef21ed06867bf458efe56b18fdc1f9db1cb9ea16efab51e7c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/store/dl_chunk_store/src/rebatch_videos.rs:751-781 | crates/store/dl_chunk_store/src/rebatch_videos.rs:788-822 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/rebatch_videos.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb7ab8af9f8dc0194d547990ca34050723374fd08a74cb2f7d7d6ece1579826"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/utils/dl_format/src/lib.rs:592-615 | crates/utils/dl_format/src/lib.rs:643-666 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_format/src/lib.rs"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc91cf22bb2eca643357719e9a40769fb8c84775a2613cd197fa8fa862ca31e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/store/dl_datafusion/src/dataframe_query_provider.rs:826-874 | crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs:448-481 \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":"crates/store/dl_datafusion/src/dataframe_query_provider.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d9f08a48383c48591715fc171603a64cd691d213e2f10cd16a8af76d07d6ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (55 corresponding lines): crates/viewer/dl_view_map/src/map_view.rs:616-670 | crates/viewer/dl_view_spatial/src/picking.rs:194-263 \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":"crates/viewer/dl_view_map/src/map_view.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f4a9adbae6de868c8bdb149e14ba652cccb43ca8ce1ce3d7ef15c284f51726"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/store/dl_importer/src/importer_urdf/mod.rs:65-102 | crates/store/dl_importer/src/importer_urdf/mod.rs:110-147 \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":"crates/store/dl_importer/src/importer_urdf/mod.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"81fc8d54894d11cc4dc5c851bb8f77a8aa2c8461e4ec52898224357d6846486b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/top/dalaran/src/demo_util.rs:105-128 | crates/viewer/dl_renderer/src/colormap.rs:239-259 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/demo_util.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae0a0f38ec9933b881c05f41048b076f696f2234f591ee14a393a903db6a362"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (53 corresponding lines): crates/viewer/dl_renderer/src/allocator/cpu_write_gpu_read_belt.rs:525-587 | crates/viewer/dl_renderer/src/allocator/gpu_readback_belt.rs:264-316 \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":"crates/viewer/dl_renderer/src/allocator/cpu_write_gpu_read_belt.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"f235b5eaa035db205e6de66bfac0b084f9d8bc8e95d0494d72768df30dc3ac9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (54 corresponding lines): crates/viewer/dl_selection_panel/src/selection_panel.rs:690-743 | crates/viewer/dl_view/src/component_drop.rs:234-292 \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":"crates/viewer/dl_selection_panel/src/selection_panel.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"be34f8abd7244aa73e46a10993022a0302315a170c66181d6d1be284ba293ff1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (46 corresponding lines): crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:825-870 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:855-906 \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":"crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"994901799a2d276d4c112bd8d93aea15e5ab53978969d6c4b36d4d36450846f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 41\u002B corresponding lines): dalaran_py/src/chunk_stream/hdf5_reader.rs:207-247 | dalaran_py/src/chunk_stream/mp4_reader.rs:196-237 | dalaran_py/src/chunk_stream/parquet_reader.rs:180-225 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 41 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":"dalaran_py/src/chunk_stream/hdf5_reader.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"7176d08a56c3a310d643c0ad610c77884219d9f404985f7d662b9e1963b5da3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): docs/snippets/all/howto/any_batch_value_column_updates.rs:9-45 | docs/snippets/all/howto/any_values_column_updates.rs:11-45 \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":"docs/snippets/all/howto/any_batch_value_column_updates.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"553c015e0fc5dde68ef93ffd3118399484f864b9aa338c3f9d926ae5f5605a33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/store/dl_importer/src/lerobot/common.rs:129-155 | crates/store/dl_importer/src/lerobot/common.rs:161-189 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/lerobot/common.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"1759584e4c858bfbdc9ea703d6905f6f179aed4500a5f24afc046f0e822c8c3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 43\u002B corresponding lines): crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:105-154 | crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:157-199 | crates/store/dl_sorbet/src/migrations/v0_1_2__to__v0_1_3.rs:24-72 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 43 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c394f872a8c0a7a8246cd6e52aa11dac835248ad9f1a8eb989091ee962b8b17"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/utils/dl_ros_msg/src/deserialize/mod.rs:197-220 | crates/utils/dl_ros_msg/src/deserialize/mod.rs:226-256 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_ros_msg/src/deserialize/mod.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"171f55c15282553c0e6ce3579c48658c39f9ff00766c9d02a0794720d8c7a6b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (50 corresponding lines): crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:200-249 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:190-244 \u2014 These two members are one piece of code written twice and then edited apart: 50 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1b38d5583fac87f1afb57b3442b93203e3d0c25937298fb7b0d3e346e2ccd14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/store/dl_chunk_store/src/query.rs:172-209 | crates/store/dl_chunk_store/src/query.rs:221-258 \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":"crates/store/dl_chunk_store/src/query.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab0cb46d4317ccdd4a6511a8236ad67468cf1f14100f861b33fc44cab8297dd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): crates/store/dl_tf/src/transform_resolution_cache/tree_transforms_for_child_frame.rs:211-259 | crates/store/dl_tf/src/transform_resolution_cache/tree_transforms_for_child_frame.rs:279-340 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_resolution_cache/tree_transforms_for_child_frame.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c65b658e0a33354e19a403dec1ed6b01a7a5a2e3d628fe12a8c51d2708e567d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/store/dl_log_types/src/example_components.rs:195-219 | crates/store/dl_log_types/src/example_components.rs:300-324 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/example_components.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff275a3f520fd6d45b379ee4c788e8ff8e296ea96aeb9147abd28d2921adbd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/store/dl_lenses_core/src/selector/parser.rs:482-518 | crates/store/dl_lenses_core/src/selector/parser.rs:587-623 \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":"crates/store/dl_lenses_core/src/selector/parser.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf21b5f522feefbe2c7ee331a2503381b2048a842c62d3f352a7a3fcfa4f844"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 16\u002B corresponding lines): crates/viewer/dl_renderer/src/colormap.rs:276-291 | crates/viewer/dl_renderer/src/colormap.rs:294-309 | crates/viewer/dl_renderer/src/colormap.rs:312-327 | crates/viewer/dl_renderer/src/colormap.rs:330-345 | crates/viewer/dl_renderer/src/colormap.rs:370-389 | crates/viewer/dl_renderer/src/colormap.rs:399-416 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/colormap.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"5504ceab52d322079bdf19aed82b1774ddf5f1cdbe79990c6fd9e29e4868838f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/store/dl_server/src/dalaran_cloud/mod.rs:1239-1270 | crates/store/dl_server/src/dalaran_cloud/mod.rs:1302-1331 \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":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8649c10cd91c35b9070b1849fe2c074a5268ba5e20f4864b3275ce14115ee8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 35\u002B corresponding lines): docs/snippets/all/archetypes/scalars_multiple_plots.rs:3-60 | docs/snippets/all/archetypes/series_lines_style.rs:3-41 | docs/snippets/all/archetypes/series_points_style.rs:3-37 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 35 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":"docs/snippets/all/archetypes/scalars_multiple_plots.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"36cf1fbb4351ebdb0e55503a07fcc1f4156b8b22f73f6e37768aa48f8b4aee36"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): crates/utils/dl_arrow_util/src/arrays.rs:177-210 | crates/utils/dl_arrow_util/src/arrays.rs:215-248 \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":"crates/utils/dl_arrow_util/src/arrays.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b76b354a81a190b2cf37c9f71904bcf75036279cf3536beda538bbebed058a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): docs/snippets/all/archetypes/arrows3d_column_updates.rs:7-41 | docs/snippets/all/archetypes/arrows3d_row_updates.rs:7-42 \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":"docs/snippets/all/archetypes/arrows3d_column_updates.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d82bd9f0a83ea788100c6e73372de6a0c3e866befd6aed52be0d2d43af22d78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/store/dl_log_types/src/path/entity_path_part.rs:59-118 | crates/store/dl_log_types/src/path/entity_path_part.rs:121-158 \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":"crates/store/dl_log_types/src/path/entity_path_part.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"989fb3570ec38ac0f8a1e57397068936caf115d6e7da9feafa976d37c1dd6736"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): crates/viewer/dl_viewer_context/src/time_control/command.rs:546-581 | crates/viewer/dl_viewer_context/src/time_control/command.rs:583-618 \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":"crates/viewer/dl_viewer_context/src/time_control/command.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"c56bd5d406a6a4e07ef9f8bc6b688162c24ec0343aa4e4a4d1a8f462742be851"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/store/dl_lenses/src/semantic/ros2msg/ros_map_helpers.rs:22-52 | crates/store/dl_lenses/src/semantic/ros2msg/voxel_grid.rs:279-312 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/src/semantic/ros2msg/ros_map_helpers.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4262617e8c6b4f43b074d2583cc07efa93f68a7f4d22dd33519a3b44ffee1ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:264-303 | crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:309-347 \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":"crates/viewer/dl_viewer_context/src/blueprint_helpers.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea5df53da3cac85ed158f580373945de6dd6c480f893c6ed47846b2d4892043"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 30\u002B corresponding lines): crates/utils/dl_perf_telemetry/src/prometheus.rs:612-641 | crates/utils/dl_perf_telemetry/src/prometheus.rs:649-678 | crates/utils/dl_perf_telemetry/src/prometheus.rs:686-715 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 30 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_perf_telemetry/src/prometheus.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ecd00de6b6ef796bf663d7b37e22f87a55b035d51df14c284ee9eff539d6dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joint_state.rs:67-130 | crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joy.rs:58-90 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joint_state.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6a3238a5ff6872c29c82cd85b85f20468825ce902347de5162d0c962533cee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:68-107 | crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:66-105 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/line_visualizer_system.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"38627d85d7c38c3425ef73d8450c45798fcebcaed8842de161329aea16a492f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/store/dl_log_channel/src/receiver_set.rs:136-166 | crates/store/dl_log_channel/src/receiver_set.rs:172-202 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_channel/src/receiver_set.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"085d64bd5e3a020f7f8996deeaadd69fc7fbc825b8cb9f25c5bcd5e8964a9a69"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): docs/snippets/all/archetypes/line_strips2d_ui_radius.rs:3-34 | docs/snippets/all/archetypes/line_strips3d_ui_radius.rs:3-32 \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":"docs/snippets/all/archetypes/line_strips2d_ui_radius.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"6089f26ea268c53370ebec9cfb70049d5fc4f9a2a95972ab24dbc10b297c122b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/store/dl_lenses_core/src/selector/parser.rs:287-335 | crates/store/dl_lenses_core/src/selector/parser.rs:424-460 \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":"crates/store/dl_lenses_core/src/selector/parser.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67b841da7c338e6fdc32c49c6cb8284b02541df9791426bbc48e9268d90a89c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): docs/snippets/all/archetypes/clear_recursive.rs:5-35 | docs/snippets/all/archetypes/clear_simple.rs:5-36 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/clear_recursive.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"08296c5d90e4aeebe3c52f5f7f030af661a2942b554c42eaf396f77da7aa9032"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/store/dl_dataframe/src/query.rs:1281-1320 | crates/store/dl_dataframe/src/query.rs:1745-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":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":1281}}}],"partialFingerprints":{"codehealthFindingId/v1":"008d1e7348c1a2fc14cf7720f7c692f282dec8d2d5d2fe679254b427c1332b3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 30\u002B corresponding lines): crates/store/dl_importer/src/lerobot/datasetv2.rs:470-499 | crates/store/dl_importer/src/lerobot/datasetv3.rs:513-542 | crates/store/dl_importer/src/lerobot/datasetv3.rs:548-577 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 30 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/lerobot/datasetv2.rs"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fefee2bbb032c5fe2f9dff7845824d251be3d27202caae24ca6b50bbff07f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): docs/snippets/all/archetypes/points2d_random.rs:5-27 | docs/snippets/all/archetypes/points3d_random.rs:5-27 \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":"docs/snippets/all/archetypes/points2d_random.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ac8292c7cf71c2cbe466164b788de11be96edd21af787247674aebed971d24d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): crates/store/dl_chunk_store/src/query.rs:558-600 | crates/store/dl_chunk_store/src/query.rs:611-650 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/query.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"699f99c33722871798fcdf77029ca9ab9440cc2dccd357f6a421cfda62f28a5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1425-1451 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1460-1489 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a7ab69a58988a0d6a03def0ddde28193951007ed9a31f14d10fb6a04d3a72d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/viewer/dl_redap_browser/src/entries.rs:371-408 | crates/viewer/dl_redap_browser/src/entries.rs:416-452 \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":"crates/viewer/dl_redap_browser/src/entries.rs"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2365abc678abef9144329bc87487c54afe75b1ecd72c7fe2641e18871af31f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): dalaran_py/src/chunk_stream/mcap_reader.rs:493-525 | dalaran_py/src/chunk_stream/urdf_tree_stream.rs:26-58 \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":"dalaran_py/src/chunk_stream/mcap_reader.rs"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae58683b6f6c15568117d1ba263548f234e1c552f26f35c277ddad8f897a896f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (45 corresponding lines): crates/store/dl_lenses/src/semantic/foxglove/point_cloud.rs:12-57 | crates/store/dl_lenses/src/semantic/foxglove/voxel_grid.rs:12-56 \u2014 These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/src/semantic/foxglove/point_cloud.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"456ed2ec750a57e794c49bc487e2e60ca4b7a5077028655dd77e37e0f8479bdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/store/dl_importer/src/importer_parquet.rs:29-54 | crates/store/dl_importer/src/importer_parquet.rs:62-88 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_parquet.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d521a5331337b4bcbbe29768032fb9f88e48d81e54c7613306a81cfb7e3cee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): crates/store/dl_log_encoding/src/transport_to_app.rs:426-464 | crates/store/dl_protos/src/v1alpha1/dalaran.common.v1alpha1.ext.rs:1182-1216 \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":"crates/store/dl_log_encoding/src/transport_to_app.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c5264bfa206120b2ed1166053a295f6c50d2e6c9a575f6d983ef43cc2b2937"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): crates/viewer/dl_view_bar_chart/src/view_class.rs:45-85 | crates/viewer/dl_view_time_series/src/view_class.rs:135-185 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_bar_chart/src/view_class.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27569be696bf9b7733676380dcbe0505b3ed85c63689bb161e5dc34e6992a9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/viewer/dl_component_ui/src/datatype_uis/vec.rs:57-86 | crates/viewer/dl_component_ui/src/datatype_uis/vec.rs:93-127 \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":"crates/viewer/dl_component_ui/src/datatype_uis/vec.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8fbbc2261a2dc7811c65fe304e086c9e692cc71482f90d9462a0a514912bd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): crates/store/dl_importer/src/importer_lerobot.rs:59-91 | crates/store/dl_importer/src/importer_lerobot.rs:97-129 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_lerobot.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"676795d8c992f0c53d0c1702781e3862ebe05bd609376d0c3ee51b6c00e013c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): docs/snippets/all/archetypes/line_strips2d_batch.rs:3-22 | docs/snippets/all/archetypes/line_strips3d_batch.rs:3-28 \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":"docs/snippets/all/archetypes/line_strips2d_batch.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"372b5735cc7e06dfd02b1af6229935f8b7928cf898ac1228d376a8e16a800cfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): crates/utils/dl_memory/src/accounting_allocator.rs:346-378 | crates/utils/dl_memory/src/accounting_allocator.rs:381-412 \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":"crates/utils/dl_memory/src/accounting_allocator.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7cf28fe5a299566c61df7130206044798db103a37190d0212f731b6eac0bf75"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/utils/dl_case/src/lib.rs:105-132 | crates/utils/dl_case/src/lib.rs:193-226 \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":"crates/utils/dl_case/src/lib.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d43d507e42f73e05ec477c54f4f310c9e6c72f0c2107f59ad7686102d04ac6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 33\u002B corresponding lines): crates/viewer/dl_viewer_context/src/component_ui_registry.rs:223-263 | crates/viewer/dl_viewer_context/src/component_ui_registry.rs:360-392 | crates/viewer/dl_viewer_context/src/component_ui_registry.rs:405-437 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 33 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/component_ui_registry.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b2572fd472d20349c3e2f2467f52dac2e61a0a7b016ac6473a57da81bb8583"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py:67-148 | dalaran_py/dalaran_sdk/dalaran/archetypes/segmentation_image_ext.py:49-77 \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":"dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8c3c712697b95e2fa9e5703ddecfed2628b1af5f6c79af590b16987be2b6c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): dalaran_py/src/catalog/dataset_entry.rs:238-259 | dalaran_py/src/catalog/dataset_entry.rs:262-283 \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":"dalaran_py/src/catalog/dataset_entry.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"a822a6a481c5e7ec9c95b7b802103cd4351c88c30ee11154e854390a4cec9370"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/store/dl_chunk_store/src/properties.rs:264-289 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:837-868 \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":"crates/store/dl_chunk_store/src/properties.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c436610714d63458a85e04209c5cf7429830a494f7b7e160e3cdb589f4b79f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/utils/dl_crash_handler/src/lib.rs:268-288 | crates/utils/dl_memory/src/backtrace_native.rs:63-83 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_crash_handler/src/lib.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"34e188bfc0439a219dbee89542d3fc92c62e9baf0cceb1d165aed07144ef6e23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/viewer/dl_renderer/src/draw_phases/outlines.rs:356-380 | crates/viewer/dl_renderer/src/draw_phases/picking_layer.rs:315-345 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/draw_phases/outlines.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"f577b3c52eb32992db3bf2e7ea773b9bef7f182b1398bbc80ae082289e0ac948"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): docs/snippets/all/archetypes/state_configuration.rs:3-27 | docs/snippets/all/howto/state_timeline.rs:3-40 \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":"docs/snippets/all/archetypes/state_configuration.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f3b4d03f2388c2f3c2271949a312732f09ee4cff0ca4dcfa377bf5572c94737"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/store/dl_log_types/src/example_components.rs:170-191 | crates/store/dl_log_types/src/example_components.rs:275-296 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/example_components.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8db445736aeb35897867881f1da5b50b4be23c361188e141db5bfaa5f117307"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/utils/dl_auth/src/oauth/api.rs:64-84 | crates/utils/dl_auth/src/oauth/api.rs:89-109 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_auth/src/oauth/api.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"9080dcc59936d47a8508b1688ba49f8400c8ba4adac7b838eb28eb590ce39c9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/image.rs:68-110 | crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/nav_sat_fix.rs:75-105 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/image.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8d8686c7494a714375df97582976c4ece8bf5aaad5af74b93d31c6b3479d92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/store/dl_query/src/latest_all.rs:57-83 | crates/store/dl_query/src/latest_all.rs:89-111 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/latest_all.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b711453af8430e3a6c255af938156bae4efba1e9194ea42e8143a50e7dc1643"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/store/dl_log_encoding/src/transport_to_app.rs:476-500 | crates/store/dl_protos/src/v1alpha1/dalaran.common.v1alpha1.ext.rs:1224-1246 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/transport_to_app.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"456724292d10b638eac93cd22a462dd079f9c4bfe20a25059b8ab2b85886bd7e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/top/dalaran/src/commands/mcap/check.rs:41-71 | crates/top/dalaran/src/commands/mcap/info.rs:21-41 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/mcap/check.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e55e9a0f9345c01d1895d6777c47695007b6da36815223aaf694f03910cb18"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/viewer/dl_test_context/src/lib.rs:815-847 | crates/viewer/dl_viewer/src/app/mod.rs:929-958 \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":"crates/viewer/dl_test_context/src/lib.rs"},"region":{"startLine":815}}}],"partialFingerprints":{"codehealthFindingId/v1":"09ee2a58d708a990ad58708e2f13f5e85fc2c043c1289a3e1d0c44f6d5fca8fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/viewer/dl_view_graph/src/layout/provider.rs:121-144 | crates/viewer/dl_view_graph/src/layout/provider.rs:150-183 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_graph/src/layout/provider.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a590ede87e476746770d0c81b7f968448c3e53d24f95305e369cb7b7022f6bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/store/dl_lenses_core/src/combinators/map.rs:37-65 | crates/store/dl_lenses_core/src/combinators/map.rs:93-121 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/combinators/map.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c7cc4d54b7e9efc8ffbbb69ca82cd957616ab39a7b5b0b8197dd332f586417"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/utils/dl_perf_telemetry/src/prometheus.rs:298-321 | crates/utils/dl_perf_telemetry/src/prometheus.rs:329-352 | crates/utils/dl_perf_telemetry/src/prometheus.rs:360-379 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_perf_telemetry/src/prometheus.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc7c86ea9d7c0184bb007d4d1fda851064daac70710fb819d182266d65e76653"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/viewer/dl_viewer_context/src/view/view_class_registry.rs:55-83 | crates/viewer/dl_viewer_context/src/view/view_class_registry.rs:340-372 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/view/view_class_registry.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a209facaba2fb599f97c51f6ae3e05ac19bc3485ed82037f23412c9d0f50529"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): dalaran_py/dalaran_sdk/dalaran/datatypes/mat3x3_ext.py:19-40 | dalaran_py/dalaran_sdk/dalaran/datatypes/mat4x4_ext.py:18-39 \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":"dalaran_py/dalaran_sdk/dalaran/datatypes/mat3x3_ext.py"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e114e1ad72fb4ca33893bc3db9b7612ffbde9253b00c89fb045b9949c10698e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): docs/snippets/all/tutorials/any_values.rs:7-38 | docs/snippets/all/tutorials/dynamic_archetype.rs:7-39 \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":"docs/snippets/all/tutorials/any_values.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"da57a3cd45708fe19fc79210cbe4919c97c985441ea25ed93baf17cc59b78f89"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (42 corresponding lines): crates/utils/dl_auth/src/oauth/login_flow.rs:30-71 | crates/utils/dl_auth/src/oauth/login_flow.rs:113-157 \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":"crates/utils/dl_auth/src/oauth/login_flow.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b1abb8beda7d6388e1f79f1057ef032bb3db1ed1e174618650cd3bd48344fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/viewer/dl_view_spatial/src/view_2d.rs:240-263 | crates/viewer/dl_view_spatial/src/view_3d.rs:496-526 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/view_2d.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"605a9090300ffee9fe1c3b21c06b3aa18371994362b0ad50893eb8be2024c36b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs:32-68 | crates/viewer/dl_view_spatial/src/visualizers/ellipsoids.rs:32-70 \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":"crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6dae1a6dfaa6249ac800f7f306acd78dc29b46b6de2caeceb56bf83d85f5ccf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): crates/viewer/dl_blueprint_tree/src/blueprint_tree.rs:803-841 | crates/viewer/dl_time_panel/src/time_panel.rs:1349-1389 \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":"crates/viewer/dl_blueprint_tree/src/blueprint_tree.rs"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"65eb48d3cef60b93beb1bbff7039b365d25aeeb23385838a724f2679a257e31a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:284-320 | crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:327-356 \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":"crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"64381dc3d7b2f2e2fc6efe09cc14cb5d0cbbca0b059e3a130d6440b86e0b0341"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:489-522 | crates/viewer/dl_renderer/src/renderer/rectangles.rs:811-839 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/depth_cloud.rs"},"region":{"startLine":489}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7ec6871ea60cdf9feb013f1dc3d8807dd00a44e75d5b493e43ffb00ebcedfa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): crates/store/dl_lenses/src/semantic/ros2msg/voxel_grid.rs:118-143 | crates/store/dl_lenses/src/semantic/ros2msg/voxel_grid.rs:146-167 | crates/store/dl_lenses/src/semantic/ros2msg/voxel_grid.rs:170-191 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/src/semantic/ros2msg/voxel_grid.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8efdcb03e90de5460a9ba47d8e6ae1f0edb9d43ac2561da929f7a6211e34812"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:435-455 | crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:461-488 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6a0298666a5ee47e6ebdb0e2afa139e37c3897d811e05ff193462fe43dfcd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): dalaran_py/src/trace_context.rs:100-120 | dalaran_py/src/tracing_session.rs:77-97 \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":"dalaran_py/src/trace_context.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e5dfe4f77265fdb215468ca1460d3a3cc3f396ca49e03c33564cd177cc1fd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): dalaran_py/src/catalog/dataset_entry.rs:407-431 | dalaran_py/src/catalog/dataset_entry.rs:468-492 \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":"dalaran_py/src/catalog/dataset_entry.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"a06beba69fcf7d54455ead3c28990e0bcba09ba5d5d51b885b00cca630d81e2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/viewer/dl_view_graph/src/ui/draw.rs:140-161 | crates/viewer/dl_view_graph/src/ui/draw.rs:164-196 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_graph/src/ui/draw.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"23374a77fd65be515e3ffaaaa0eb3b2b690f4c5ea1f5ba7ddce41a0e3b373ad3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): dalaran_py/src/python_bridge.rs:1402-1433 | dalaran_py/src/python_bridge.rs:1484-1509 \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":"dalaran_py/src/python_bridge.rs"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a26bd2580deec3fd9af100108e10545f56660f9a6910b1af546fb479dbd096"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/viewer/dl_context_menu/src/actions/show_hide.rs:11-32 | crates/viewer/dl_context_menu/src/actions/show_hide.rs:71-92 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_context_menu/src/actions/show_hide.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"484fa03f045524ad0a7fc8274e8df21b37d12d075c0811a53c609e3e4a6c5eeb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/viewer/dl_dataframe_ui/src/dl_table_utils.rs:45-73 | crates/viewer/dl_dataframe_ui/src/dl_table_utils.rs:80-105 \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":"crates/viewer/dl_dataframe_ui/src/dl_table_utils.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3df650282ea1cd1f2ac9ac64ac03fd291caec75bbc677fc43ee67d01c131460"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/viewer/dl_renderer/src/colormap.rs:106-124 | crates/viewer/dl_renderer/src/colormap.rs:141-168 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/colormap.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"44a963a4343813ab8e5d3de3d832e8030562aaae2e5e3797d739d3034d3543fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/viewer/dl_view/src/visualizer_query.rs:68-100 | crates/viewer/dl_view/src/visualizer_query.rs:117-141 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/src/visualizer_query.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"8147f23dd0b8323481551457de208a873abee0ccdf43cd4351785eba6d40d472"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/viewer/dl_viewer/src/web.rs:431-456 | crates/viewer/dl_viewer/src/web.rs:476-504 \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":"crates/viewer/dl_viewer/src/web.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcca7f1865d41e983e20fce1b2bc4616a4260e880dc8f13ac6f084ed4eefe854"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): docs/snippets/all/archetypes/capsules3d_batch.rs:5-39 | docs/snippets/all/archetypes/cylinders3d_batch.rs:5-39 \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":"docs/snippets/all/archetypes/capsules3d_batch.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e853327bab87505d4a160a02b05e8dfa891a30fc491d1126d617159fcd6afc4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/store/dl_lenses_core/src/execute.rs:21-48 | crates/store/dl_lenses_core/src/execute.rs:56-75 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/execute.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"871e2f49369586b2fa62220dc5ad72a227648e6f05f1214eb183033f6e63118b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/utils/dl_crash_handler/src/lib.rs:296-317 | crates/utils/dl_memory/src/backtrace_native.rs:91-108 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_crash_handler/src/lib.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a45ae39bebaead7086487233a3217b37a9bf62c6f88821bd4728236b80bd8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/image.rs:34-66 | crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/nav_sat_fix.rs:46-73 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/image.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94da54474ccd0c27065513e3ea70b7cb38c247ef65cd6a467af85c09cc8e9ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:380-402 | crates/viewer/dl_dataframe_ui/src/filters/string.rs:86-120 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/filters/numerical.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"15047c6496d17cd6bf9598b4ad2f8dfa70f52d85dccf6c9f9b5ae3e8fcc18f9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): crates/viewer/dl_renderer/src/allocator/data_texture_source.rs:205-235 | crates/viewer/dl_renderer/src/allocator/data_texture_source.rs:264-294 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/allocator/data_texture_source.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"617f43295beb821884cf84d02ff64e1817f546c38fb6baa90cd8df6687be5289"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/utils/dl_perf_telemetry/src/telemetry.rs:385-411 | crates/utils/dl_perf_telemetry/src/telemetry.rs:413-445 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_perf_telemetry/src/telemetry.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"db98e5d3034f04df125807a915ffd52f4e5575a22737f141540f994594f6a1a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/store/dl_mcap/src/decoders/protobuf.rs:153-179 | crates/store/dl_mcap/src/decoders/ros2_reflection.rs:177-202 \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":"crates/store/dl_mcap/src/decoders/protobuf.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76833dad6844227ed4bd9ae6c2084c7e492923d384716b1e626ba2b86d8bc11"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/viewer/dl_view_spatial/src/visualizers/grid_map.rs:83-107 | crates/viewer/dl_view_spatial/src/visualizers/images.rs:56-80 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/grid_map.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2ec17c523b689540d05cb96f575c4a22b971b1063a41a817df60a254ea94b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/viewer/dl_data_ui/src/video_ui.rs:28-56 | crates/viewer/dl_data_ui/src/video_ui.rs:63-91 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/video_ui.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"27be6ed167c2b8a64bb730c83f74d4929ba47b8a08c171dbbec456ce780ebbf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/viewer/dl_selection_panel/src/item_title.rs:190-215 | crates/viewer/dl_selection_panel/src/item_title.rs:221-243 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/item_title.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd1967df5175777ca8c7ee16daf8e9013b82217a75e96e8a3222ffdd3f805fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): docs/snippets/all/archetypes/points2d_ui_radius.rs:3-34 | docs/snippets/all/archetypes/points3d_ui_radius.rs:3-32 \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":"docs/snippets/all/archetypes/points2d_ui_radius.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3c9f9b2f63026f0003fd187ba0c09b37fd1717e46fb7bef400304efbc437643"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/store/dl_lenses/src/semantic/foxglove/frame_transform.rs:11-37 | crates/store/dl_lenses/src/semantic/foxglove/frame_transforms.rs:11-37 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/src/semantic/foxglove/frame_transform.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"39894bad17b5878d20ace36e47d37252750e7c125803c4d4159fbece48838876"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/viewer/dl_view_spatial/src/caches/mesh_cache.rs:152-183 | crates/viewer/dl_viewer_context/src/cache/tensor_stats_cache.rs:56-77 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/caches/mesh_cache.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2f89c01cca76b73fb1fb66b8aff03ecc0f04b1bf9cca6f27aa9e57e22813f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/viewer/dl_viewer_context/src/view/view_query.rs:385-407 | crates/viewer/dl_viewer_context/src/view/view_query.rs:420-442 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/view/view_query.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fc598f26e2ea7c782939f15408dd958d02f832057e7351f0333c667c90fd52"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/top/dalaran/src/commands/mcap/mod.rs:129-145 | dalaran_py/src/chunk_stream/mcap_reader.rs:546-569 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/mcap/mod.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b961a8efaad17275db70d156258168f9d153630ab2650adced4c13449af191ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): docs/snippets/all/archetypes/line_strips3d_segments_simple.rs:3-21 | docs/snippets/all/archetypes/line_strips3d_simple.rs:3-20 \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":"docs/snippets/all/archetypes/line_strips3d_segments_simple.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36f2d067cdeb7821111fe20ca31c4ca5361da6646a4fe29a6844e745549c4c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 16\u002B corresponding lines): crates/viewer/dl_view_spatial/src/caches/mesh_cache.rs:187-202 | crates/viewer/dl_view_spatial/src/proc_mesh.rs:499-517 | crates/viewer/dl_viewer_context/src/cache/image_decode_cache.rs:212-231 | crates/viewer/dl_viewer_context/src/cache/video_asset_cache.rs:146-166 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/caches/mesh_cache.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c80924fe07357d24169ecc77f8b2b69ec65e29826e29af2f5957a00f8fff383"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/store/dl_chunk_store/src/dataframe.rs:251-273 | crates/store/dl_chunk_store/src/dataframe.rs:275-303 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/dataframe.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6657a5e98e6f8774dc7a09fd9cb433a6c64716f64b2e05ad5bc4a868f2b82c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/viewer/dl_viewer_context/src/cache/memoizers.rs:92-111 | crates/viewer/dl_viewer_context/src/cache/memoizers.rs:262-280 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/memoizers.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e09b818740ed904454402a4e02e5d11ac53bbb353f1a3adda0e118ca4ee7349"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): crates/store/dl_mp4_reader/src/lib.rs:43-70 | crates/store/dl_mp4_reader/src/lib.rs:92-118 \u2014 These two members are one piece of code written twice and then edited apart: 27 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mp4_reader/src/lib.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"7061afc364e3a7965e6039898be1366e2082c57f14c1b1e563f8aef215cee100"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/viewer/dl_ui/src/fuzzy.rs:145-160 | crates/viewer/dl_ui/src/fuzzy.rs:172-198 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/fuzzy.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4b2c2c75dce22ff46c77b1c64350a4fe952bd1a4d7c26fe9754f2cdae812afb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): docs/snippets/all/archetypes/pinhole_simple.rs:6-27 | docs/snippets/all/archetypes/tensor_simple.rs:6-19 \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":"docs/snippets/all/archetypes/pinhole_simple.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7cd340a26e777b6dee204ef2e6d417e6df50681179745d2af3143760b7ce24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): dalaran_pixi_env/src/dalaran_pixi_env/__init__.py:114-139 | dalaran_pixi_env/src/dalaran_pixi_env/__init__.py:143-166 \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":"dalaran_pixi_env/src/dalaran_pixi_env/__init__.py"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"90a4731ebcf1acf027273e7ad7d75a1ba0db0d72f9379e5f8c79ac6f9c324df7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/store/dl_datafusion/src/pushdown_expressions.rs:21-28 | crates/store/dl_datafusion/src/pushdown_expressions.rs:30-37 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/pushdown_expressions.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f30fbf8005490c6770514c273fcad0b7fcf88725b93386f07ab792b51635c1c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): docs/snippets/all/archetypes/annotation_context_segmentation.rs:5-31 | docs/snippets/all/archetypes/depth_image_simple.rs:5-19 | docs/snippets/all/archetypes/image_simple.rs:5-23 | docs/snippets/all/archetypes/segmentation_image_simple.rs:5-27 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/annotation_context_segmentation.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecdbf459a45a0602147d368f1c440ca713cc8c5c1449d39eb16dcc459b587a7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/store/dl_lenses/src/semantic/helpers.rs:13-34 | crates/store/dl_lenses/src/semantic/helpers.rs:60-76 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/src/semantic/helpers.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a943bd8e8470cb14a651ff67be1e0bc3d04cf7b05ace56b23988f98b48fcec6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/store/dl_redap_client/src/connection_client.rs:617-642 | crates/store/dl_redap_client/src/connection_client.rs:719-744 \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":"crates/store/dl_redap_client/src/connection_client.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcdc2e8e7be1b4c6ba50015a2c35d5fd3b08bfd1203d34f8ddc33fa11a5273a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): dalaran_py/src/catalog/dataset_entry.rs:104-116 | dalaran_py/src/catalog/dataset_entry.rs:119-131 \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":"dalaran_py/src/catalog/dataset_entry.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"844083568ba910903df3ed9be8a4bcd7d8ce7afc17a75af39768a2259238d560"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/store/dl_lenses/src/semantic/foxglove/camera_calibration.rs:13-38 | crates/store/dl_lenses/src/semantic/ros2msg/camera_info.rs:10-31 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/src/semantic/foxglove/camera_calibration.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"d333022c5e9d7165b6bf73246e6bc5acb2016150d1d7b856e62a1b9841c52b72"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/store/dl_chunk/src/chunk.rs:1673-1685 | crates/store/dl_chunk/src/chunk.rs:1688-1700 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/chunk.rs"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c252786aec9acbdc553ac1284c6b06d74dad8bdb25a7b926448545383fdcf47"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/store/dl_chunk_store/src/lineage.rs:390-409 | crates/store/dl_chunk_store/src/lineage.rs:427-446 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/lineage.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"50375694423bad1558952e5b9f412f972f4995aac8ec514f4b2df6c8a9693bd3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/store/dl_lenses/src/op/semantic.rs:225-239 | crates/store/dl_lenses/src/op/semantic.rs:243-257 | crates/store/dl_lenses/src/op/semantic.rs:281-295 \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":"crates/store/dl_lenses/src/op/semantic.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a0284f6a89224066a1f8a55d021de4d62e78b3d165bacb6842258de1dce9d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:44-61 | crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:43-59 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/line_visualizer_system.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"37c817d629c78b4c660201c9cd98c42132a069ab39d794464dfb5d88a4deb4ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): dalaran_py/dalaran_sdk/dalaran/datatypes/class_description_map_elem_ext.py:34-50 | dalaran_py/dalaran_sdk/dalaran/datatypes/keypoint_pair_ext.py:31-47 \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":"dalaran_py/dalaran_sdk/dalaran/datatypes/class_description_map_elem_ext.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7af26a3feb53a93235fa8e6545b506e50ac59708467c69e69d17d90561a7d64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/store/dl_chunk/src/unit_chunk.rs:69-86 | crates/store/dl_chunk/src/unit_chunk.rs:123-140 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/unit_chunk.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"049b0d629b0a23a534e80f05c4a1026dfdf1a40aaaa20c918be27ffc3a87f14f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/top/dl_sdk/src/recording_stream.rs:632-653 | crates/top/dl_sdk/src/recording_stream.rs:2266-2284 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/recording_stream.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e6441b8599937b954186611aa57e69c0671f45f980e8eca3a6bf71894288bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): crates/store/dl_tf/src/transform_forest.rs:596-625 | crates/store/dl_tf/src/transform_forest.rs:632-671 \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":"crates/store/dl_tf/src/transform_forest.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b9946a7d547e7e1935999f839506dec7c23260ba470ffd438d9eeda6b16b95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): crates/viewer/dl_viewer_context/src/view/view_class_registry.rs:468-491 | crates/viewer/dl_viewer_context/src/view/view_class_registry.rs:496-517 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/view/view_class_registry.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1a47d4e24bcf494b4c6ca484bc0c408bd278c20d9eba161225e793fd240410"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): crates/store/dl_datafusion/src/dataframe_query_common.rs:836-860 | crates/store/dl_datafusion/src/dataframe_query_common.rs:917-940 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_common.rs"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3e5a8d86f3f693a0547ec659b744c021f215a71b277759cffe21cde3b85624"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): crates/store/dl_datafusion/src/dataset_manifest.rs:78-109 | crates/store/dl_datafusion/src/segment_table.rs:78-109 | crates/store/dl_datafusion/src/table_entry_provider.rs:245-267 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataset_manifest.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"369b149a7ab36c66d7e5b1c532a0848699ee1a6dc61d86e0cbccad360b62b66f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/store/dl_lenses_core/src/selector/parser.rs:267-285 | crates/store/dl_lenses_core/src/selector/parser.rs:399-417 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/selector/parser.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"f094529fdb3831affc7200315c39923ddf25341acc0aa1b85c8f7ac57c10528a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/store/dl_server/src/dalaran_cloud/mod.rs:1210-1232 | crates/store/dl_server/src/dalaran_cloud/mod.rs:1275-1295 | crates/store/dl_server/src/dalaran_cloud/mod.rs:1336-1350 \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":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":1210}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d1296d53a31d01697abdc8d8a60dfb0f0d519b0a2ebcad34e7f5f4c993cda5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/store/dl_sorbet/src/column_kind.rs:41-60 | crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:66-80 \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":"crates/store/dl_sorbet/src/column_kind.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"863055cc01d7dc0f4016717694ca4d004b8d42746a9e7e9fe361a6a5fa02e680"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/store/dl_mcap/src/decoders/raw.rs:36-52 | crates/store/dl_mcap/src/parsers/ros2msg/scalar_parser.rs:117-139 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/decoders/raw.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d1114d1b0ad2a3e706343e487d31f2e52281e5296647cb68416d34cfc33741d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/store/dl_chunk_store/src/events.rs:51-67 | crates/store/dl_chunk_store/src/events.rs:398-417 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/events.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"b57a696e3b2beb067c27c780e57c467e8edad9b7bc24ed3632a02f9dcfb0d146"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 42\u002B corresponding lines): dalaran_py/dalaran_sdk/dalaran/archetypes/asset3d_ext.py:23-70 | dalaran_py/dalaran_sdk/dalaran/archetypes/asset_video_ext.py:27-68 | dalaran_py/dalaran_sdk/dalaran/archetypes/encoded_image_ext.py:43-106 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 42 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":"dalaran_py/dalaran_sdk/dalaran/archetypes/asset3d_ext.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d4cda72ee4b8198d2d4de533a33285e13a6937d5ec4c44c1462f3e33d51132"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): crates/store/dl_datafusion/src/dataframe_query_provider.rs:878-903 | crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs:537-562 \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":"crates/store/dl_datafusion/src/dataframe_query_provider.rs"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"070f11ff323ca2d1a95939f6a4b50683acb0c129e03ecd6ad871d9d0ee482d92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/store/dl_chunk_store/src/store.rs:1160-1173 | crates/store/dl_chunk_store/src/store.rs:1184-1199 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/store.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad9fce88e0b656baf7e9e206bcf8322ad35e67072bd8e8ff425aa924f9eebc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): docs/snippets/all/archetypes/graph_directed.rs:3-21 | docs/snippets/all/archetypes/graph_undirected.rs:3-22 \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":"docs/snippets/all/archetypes/graph_directed.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"84efdfbf1c227634706c7551e4a7632a38e4c1025f738565ae63668aec17cc05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): crates/store/dl_query/src/bin/clamped_zip.rs:315-352 | crates/store/dl_query/src/bin/range_zip.rs:456-496 \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":"crates/store/dl_query/src/bin/clamped_zip.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1cf56ca66294ff831a77a5192938bee9b01119e1332ca3d7cf543e2185e6b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/top/dl_sdk/src/log_sink.rs:75-99 | crates/top/dl_sdk/src/recording_stream.rs:2449-2473 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/log_sink.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"04267afecc0cce6335d53016b852ac58d84b73bc9f91102b0b605bd96a1af440"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): dalaran_py/src/python_bridge.rs:2139-2148 | dalaran_py/src/python_bridge.rs:2152-2161 \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":"dalaran_py/src/python_bridge.rs"},"region":{"startLine":2139}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efa707018483a812babf6894b5e60758d09d76b48c44d4c8c6eb460cb93b077"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/store/dl_query/src/latest_at.rs:648-669 | crates/store/dl_query/src/range.rs:228-248 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/latest_at.rs"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf3eba9a0ad657c2ee4117e36b84a9f3994567d271ed211094bf70b724f57dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): dalaran_py/src/catalog/dataset_entry.rs:171-185 | dalaran_py/src/catalog/dataset_entry.rs:204-220 | dalaran_py/src/catalog/table_entry.rs:115-129 \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":"dalaran_py/src/catalog/dataset_entry.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"29925e8130829d9d94abdb2e4b5474baedb8efbe8b97c0645d2e6e8cb05a791a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 21\u002B corresponding lines): crates/store/dl_chunk/src/chunk.rs:1231-1251 | crates/store/dl_chunk/src/chunk.rs:1257-1277 | crates/store/dl_chunk/src/chunk.rs:1283-1306 | crates/store/dl_chunk/src/chunk.rs:1312-1335 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/chunk.rs"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad34e2d496166622633e5645e1038a45e699d77e3e6fad9b06efda4d4e7b300"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:112-137 | crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:267-289 | crates/viewer/dl_dataframe_ui/src/filters/string.rs:60-78 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/filters/numerical.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"07cda2f075ffdaeaac28fa6bde7ef63e9eab641abd58754c0192b6cc44dfbc5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 50\u002B corresponding lines): dalaran_py/dalaran_sdk/dalaran/sinks.py:124-173 | dalaran_py/dalaran_sdk/dalaran/sinks.py:183-246 | dalaran_py/dalaran_sdk/dalaran/sinks.py:255-311 | dalaran_py/dalaran_sdk/dalaran/sinks.py:344-418 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 50 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":"dalaran_py/dalaran_sdk/dalaran/sinks.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28341e641053b7ad436ac7a1b97943e2e53470ffc71b44a876441bf9e3d479a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/viewer/dl_data_ui/src/item_ui.rs:549-564 | crates/viewer/dl_data_ui/src/item_ui.rs:570-585 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/item_ui.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c72172ba018166f2120c4f6ce69d3046cfa53c80a7cfa41f3abbb44b0756a95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): dalaran_py/src/chunk_stream/stream.rs:188-213 | dalaran_py/src/chunk_stream/stream.rs:221-251 \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":"dalaran_py/src/chunk_stream/stream.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"621ea4a97f2e3990ceb58486a4d73755bcfcaf09364ce20d72be2a188d7b6afd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/store/dl_chunk/src/iter.rs:325-334 | crates/store/dl_chunk/src/iter.rs:416-429 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/iter.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"03ea6965a41cae9b8a0acd05871b8e3a9fb77c517b22812741953f541dc4c16d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/store/dl_lenses_core/src/selector/parser.rs:338-353 | crates/store/dl_lenses_core/src/selector/parser.rs:463-478 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/selector/parser.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"fddfdc282353ca10b8409dd79a1a15a176794f8697f2b1d6e765b0c349b06635"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 19\u002B corresponding lines): crates/store/dl_redap_client/src/connection_client.rs:693-711 | crates/store/dl_redap_client/src/connection_client.rs:803-830 | crates/store/dl_redap_client/src/connection_client.rs:901-928 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 19 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/connection_client.rs"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23534cc45f7a17d3473427e44aa2b2b1526cae33569f9f38ed7c2ad3959173c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/viewer/dl_time_panel/src/time_selection_ui.rs:454-465 | crates/viewer/dl_time_panel/src/time_selection_ui.rs:472-483 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_panel/src/time_selection_ui.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"382ee0df57fff561fdacc98f7fec2f50307ede00abc4dc4bc7bc85251878429e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/viewer/dl_viewer_context/src/store_hub.rs:667-683 | crates/viewer/dl_viewer_context/src/store_hub.rs:711-730 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/store_hub.rs"},"region":{"startLine":667}}}],"partialFingerprints":{"codehealthFindingId/v1":"d052cce0ea125f83ee529d2e5f7f7c6771f16a0fcae36a8905b810889bde8d20"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): dalaran_py/dalaran_sdk/dalaran/robot/robot.py:78-81 | dalaran_py/dalaran_sdk/dalaran/robot/urdf_model.py:67-83 \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":"dalaran_py/dalaran_sdk/dalaran/robot/robot.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6452cb637594f1df0af159a4253f5ee01b1e33ce43d34986d917a3d8e8c033"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 21\u002B corresponding lines): crates/store/dl_lenses/src/semantic/foxglove/compressed_image.rs:11-33 | crates/store/dl_lenses/src/semantic/foxglove/compressed_video.rs:11-31 | crates/store/dl_lenses/src/semantic/foxglove/location_fix.rs:15-37 | crates/store/dl_lenses/src/semantic/foxglove/pose_in_frame.rs:11-33 | crates/store/dl_lenses/src/semantic/foxglove/poses_in_frame.rs:11-33 | crates/store/dl_lenses/src/semantic/foxglove/raw_image.rs:13-33 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/src/semantic/foxglove/compressed_image.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ca89c7e7070df65902ba2229d83effa8070b2a0bdaec34ffdee112191b08184"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/store/dl_protos/src/v1alpha1/dalaran.common.v1alpha1.ext.rs:764-782 | crates/store/dl_protos/src/v1alpha1/dalaran.common.v1alpha1.ext.rs:786-799 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_protos/src/v1alpha1/dalaran.common.v1alpha1.ext.rs"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"163382f7655780294278de53ffa36f7cc92715fcb0d3761c2d152f69678e4538"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): dalaran_py/src/catalog/registration_handle.rs:235-255 | dalaran_py/src/catalog/unregistration_handle.rs:135-155 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/catalog/registration_handle.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e80c71f89fdd3cad254126657c064ee4d62846fcd255af87de2bbdfed0c54f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): docs/snippets/all/archetypes/mesh3d_indexed.rs:3-21 | docs/snippets/all/archetypes/mesh3d_simple.rs:3-19 | docs/snippets/all/archetypes/view_coordinates_simple.rs:3-18 \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":"docs/snippets/all/archetypes/mesh3d_indexed.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"29045fe2a60341b3b6f65a745cf3ff560cb1e6b9479181b6336407efc4a63833"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): crates/store/dl_chunk_store/src/stats.rs:251-271 | crates/store/dl_chunk_store/src/stats.rs:306-326 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/stats.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"521dbf7cf270cce87d218e3ff19689c5d6796d02059dec71f46d1f1a6a340a58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/store/dl_importer/src/importer_urdf/joint_transform.rs:24-36 | crates/store/dl_importer/src/importer_urdf/urdf_tree.rs:222-234 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_urdf/joint_transform.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6dccfe8e019f4f143ee49dab93589cd4ad0798e7c1d7c9f7a578ba99f9a6c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/top/dalaran_c/src/lib.rs:310-319 | crates/top/dalaran_c/src/lib.rs:1038-1049 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran_c/src/lib.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13486742d2e8507b16085b7ccededb4ad08fabf70c0b58430618db52bf0dade"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/top/dalaran_c/src/lib.rs:1194-1210 | crates/top/dalaran_c/src/lib.rs:1235-1257 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran_c/src/lib.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8978ab099b3a7071a41c14fd1249d4df9ebbad579303486b9592f600d268c02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/viewer/dl_time_panel/src/time_control_ui.rs:108-126 | crates/viewer/dl_time_panel/src/time_control_ui.rs:291-307 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_panel/src/time_control_ui.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb894acf0485dca06c00da80a1bf0ff5daff23401395c6c8d5ff184a25e385f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/viewer/dl_view_spatial/src/visualizers/gaussian_splats3d.rs:236-247 | crates/viewer/dl_view_spatial/src/visualizers/points3d.rs:231-244 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/gaussian_splats3d.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc128f5188663a71866add134dbe1153ba440ad0d52384b7e98375fa1967b803"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): docs/snippets/all/archetypes/asset3d_simple.rs:5-18 | docs/snippets/all/archetypes/gaussian_splats3d_ply.rs:5-20 \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":"docs/snippets/all/archetypes/asset3d_simple.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c8d72c7e713a1d751719ed8d26a73f8d52aba50b588b14c1adb11fe40469a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/store/dl_dataframe/src/query.rs:1240-1252 | crates/store/dl_dataframe/src/query.rs:1720-1734 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":1240}}}],"partialFingerprints":{"codehealthFindingId/v1":"21646e96b005e41e6836b89c164defe871ba8a8683475364cbbcf2ef00943034"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/store/dl_server/src/dalaran_cloud/mod.rs:520-538 | crates/store/dl_server/src/dalaran_cloud/mod.rs:544-561 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ef7f45b85c4e4fa825acaa6b306fa335b4ed90d84d87df15fe3d991ff97fdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:384-402 | crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:408-433 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f94c65ccf99bd17e14573a99deb9d2e98535bb25caa73f812831d227ec45513"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): crates/store/dl_types_core/src/chunk_id.rs:185-185 | crates/store/dl_types_core/src/row_id.rs:177-177 \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":"crates/store/dl_types_core/src/chunk_id.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c60be2d145d7af250c447588d3cba13bc22ede90218bf458b60fd8647ace6aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): dalaran_py/src/catalog/dataset_view.rs:158-178 | dalaran_py/src/catalog/dataset_view.rs:186-208 \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":"dalaran_py/src/catalog/dataset_view.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"6662c84897ee711cdb50419591a00ceb259545789f382c314c402186f208ad86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/store/dl_entity_db/src/entity_db.rs:1147-1161 | crates/store/dl_entity_db/src/entity_db.rs:1170-1184 \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":"crates/store/dl_entity_db/src/entity_db.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"e794942e6471de3852fb6001f18ecaffc69fa2585c4638fa677d0a2b6ecd3dcb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/store/dl_grpc_server/src/lib.rs:1192-1209 | crates/store/dl_grpc_server/src/lib.rs:1211-1228 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_grpc_server/src/lib.rs"},"region":{"startLine":1192}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa5208ab7630a9a8e4128842c01bd914cd8e2658eac2119d87f495090e21435"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/store/dl_redap_client/src/connection_client.rs:646-662 | crates/store/dl_redap_client/src/connection_client.rs:748-769 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/connection_client.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ccda22d406c28fa9a80afd522cfa8a337b80995e5e85077aaa10449d70ca41e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/viewer/dl_component_ui/src/datatype_uis/singleline_string.rs:23-35 | crates/viewer/dl_component_ui/src/datatype_uis/singleline_string.rs:54-64 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/datatype_uis/singleline_string.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca49a103f7ca9370e1d84cbe4bda3eefd3e12343faf510dddb5e864c073836a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/store/dl_redap_client/src/grpc.rs:319-330 | crates/store/dl_redap_client/src/grpc.rs:405-419 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/grpc.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"466346ecf1a639436728964e8960a590d2807ace8d0b438fc0b8e567a227407e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/viewer/dl_arrow_ui/src/show_index.rs:300-316 | crates/viewer/dl_arrow_ui/src/show_index.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":"crates/viewer/dl_arrow_ui/src/show_index.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"44b412878f7897c500ec2483e7c15d41c9db339a7f5071a39bb9b3e65cb03e15"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): dalaran_py/src/lenses.rs:65-76 | dalaran_py/src/lenses.rs:84-99 \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":"dalaran_py/src/lenses.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"981489a187684a142bf2c7972f7efc3ddf95783725e412eabd04efea70f3253f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/store/dl_lenses_core/src/selector/lexer.rs:121-134 | crates/store/dl_lenses_core/src/selector/lexer.rs:208-221 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/selector/lexer.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"912f6d856882873afdac4cbaa8f4c057a3e6ac3c691e67da189e92158eaa342a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 17\u002B corresponding lines): crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1500-1516 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1528-1544 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1570-1586 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1711-1727 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"f186a5d1dc6eae4b8a5006fd7a0d1b59e879b6f0e4a63d6f0916ab0f847de701"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/viewer/dl_view_graph/src/view.rs:45-56 | crates/viewer/dl_view_spatial/src/ui_2d.rs:181-192 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_graph/src/view.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"97733620bc88b57c32b01c108c80d7d3145d3b89e4188cb9bac5471c54d4c967"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/store/dl_entity_db/src/entity_db.rs:1194-1211 | crates/store/dl_entity_db/src/entity_db.rs:1221-1238 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/entity_db.rs"},"region":{"startLine":1194}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b936de3690ed3b33e07e428d973ca0ffeb77047973df27080af0b169d9d3ac7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/store/dl_types_core/src/chunk_id.rs:74-90 | crates/store/dl_types_core/src/row_id.rs:82-98 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_types_core/src/chunk_id.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"61d4377af1a527bbbe6f67fc0a6b94f3706b546ddb90100f18dcdeaab3904a77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/top/dalaran_c/src/lib.rs:477-492 | crates/top/dalaran_c/src/lib.rs:959-974 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran_c/src/lib.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd466df6153ea0279c13b697e257093e2d76807e8de08ed900eb51f607802cc3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/viewer/dl_context_menu/src/collapse_expand.rs:59-73 | crates/viewer/dl_context_menu/src/collapse_expand.rs:81-93 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_context_menu/src/collapse_expand.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c1ab10b255fb1e4e49988f76c1524b2c13eda4c8d4fc82245448c48c9f319e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/store/dl_chunk_store/src/query.rs:442-455 | crates/store/dl_chunk_store/src/query.rs:468-484 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/query.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"33bff82ddca8f01eec3d34006466a40a2fe81c4b5e00d84fc22fecf1ec0ffc54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/utils/dl_crash_handler/src/lib.rs:251-263 | crates/utils/dl_memory/src/backtrace_native.rs:39-58 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_crash_handler/src/lib.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf21c171bf7abdeb374e354199fde4dc6e8d6c23581269d6dbd8f9c35e8b64fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): dalaran_py/src/catalog/datafusion_catalog.rs:44-54 | dalaran_py/src/catalog/table_entry.rs:135-148 \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":"dalaran_py/src/catalog/datafusion_catalog.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"4235361e6a58f2c3287a883fddd1994ca75579d9a1218c8dff8dcab4deb941d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): dalaran_py/src/python_bridge.rs:2603-2612 | dalaran_py/src/python_bridge.rs:2618-2625 \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":"dalaran_py/src/python_bridge.rs"},"region":{"startLine":2603}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a403ad93a6cc050c3426ad934e1efff14ca78a5232da07e1fd25f14f53bb1f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/store/dl_log_types/src/path/entity_path_filter.rs:436-457 | crates/store/dl_log_types/src/path/entity_path_filter.rs:463-481 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/path/entity_path_filter.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"308958a8cbb4eafb40ca6504fcf4629a85c711308db0058f831764635d9f3178"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 15\u002B corresponding lines): crates/viewer/dl_viewer_context/src/app_context.rs:433-447 | crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:112-131 | crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:170-184 | crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:191-210 \u2014 These 4 members are one piece of code written 4 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 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/app_context.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea4a0f1b406c1705db964d0833d1fac8839f0f179f39306f8bdbd3861fd5381"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/store/dl_log_encoding/src/dlr/frames.rs:163-187 | crates/store/dl_log_encoding/src/dlr/frames.rs:510-522 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/frames.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49a56e7c1f339ac8dd660c414b5d50aa866ea53cda93e588ece469e81d53d3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/store/dl_log_types/src/index/time_cell.rs:165-178 | crates/store/dl_log_types/src/index/time_cell.rs:180-194 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/index/time_cell.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12d43f2658155efc69bb15acc73afb5da78f36e5236ebc5189fbae0e99152ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/viewer/dl_view_state_timeline/src/view_class.rs:269-286 | crates/viewer/dl_view_time_series/src/view_class.rs:421-438 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_state_timeline/src/view_class.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21e1a9fd1e119655cd3552b381ff17d909291763286b0f7d6d07b3c66227eb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): dalaran_py/src/python_bridge.rs:2285-2306 | dalaran_py/src/python_bridge.rs:2331-2355 \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":"dalaran_py/src/python_bridge.rs"},"region":{"startLine":2285}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0d314026166c848fc4f759db0391d35e247342c831ae9b827dfc6726cb9746"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/store/dl_lenses_core/src/combinators/map.rs:245-260 | crates/store/dl_lenses_core/src/combinators/map.rs:295-310 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/combinators/map.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebda2d6308bcfc89cbbd3d5f690a8e6ef88f8f4e015f66ad80532c5851ead13b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/store/dl_redap_client/src/connection_client.rs:1500-1516 | crates/store/dl_redap_client/src/connection_client.rs:1529-1540 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/connection_client.rs"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0bc27e090bac55f4287401b6ea654d18e19182a39b71f435526aa9455451a71"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/store/dl_types_core/src/archetype.rs:160-172 | crates/store/dl_types_core/src/loggable.rs:133-147 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_types_core/src/archetype.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d6cf542c4b686bc096d4e409ec0fd646c814602e03d995e202084c4d59cfb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/store/dl_chunk_store/src/subscribers.rs:330-341 | crates/viewer/dl_view_spatial/src/spatial_topology.rs:143-157 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/subscribers.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e30100ebe9f894bc03572a5a6cc40fea11054563a60127fc209ed430df6a7e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/store/dl_protos/src/v1alpha1/dalaran.cloud.v1alpha1.ext.rs:81-94 | crates/store/dl_protos/src/v1alpha1/dalaran.cloud.v1alpha1.ext.rs:100-113 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_protos/src/v1alpha1/dalaran.cloud.v1alpha1.ext.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21b87ead5e96355bf01bb163482b5ba694fb0bf7c45ecbf95ea0aefb949b533"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/top/dl_sdk/src/global.rs:116-134 | crates/top/dl_sdk/src/global.rs:140-158 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/global.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"507d281cca6cbb19e4f1e64c674a40c1a2728a64e113ba259911a299ad40e22a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): dalaran_py/src/catalog/catalog_client.rs:242-251 | dalaran_py/src/catalog/catalog_client.rs:260-269 \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":"dalaran_py/src/catalog/catalog_client.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e43c8df815697e6204b417ad48ea0355cc64150ae6d7bf97a34cbf27fbf88a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): docs/snippets/all/archetypes/line_strips2d_segments_simple.rs:3-14 | docs/snippets/all/archetypes/line_strips2d_simple.rs:3-13 \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":"docs/snippets/all/archetypes/line_strips2d_segments_simple.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d3248b2c09066f286140f5325a49073f26a9adb617618c21a50f82c19756ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/store/dl_entity_db/src/dlr_manifest_index/time_range_merger.rs:405-421 | crates/store/dl_entity_db/src/dlr_manifest_index/time_range_merger.rs:427-443 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/dlr_manifest_index/time_range_merger.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78fc64926ce6f556401df52a8e6e05974c319b82f946cd6c2670649963c445f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/store/dl_importer/src/importer_archetype.rs:196-215 | crates/store/dl_importer/src/importer_archetype.rs:294-311 | crates/store/dl_importer/src/importer_archetype.rs:350-368 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_archetype.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0e7ba712d07e55db4470c08d4e968a7ce925745fec5aa42de73f0580895e80f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/store/dl_log_encoding/src/dlr/encoder.rs:348-365 | crates/store/dl_log_encoding/src/dlr/encoder.rs:375-393 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/encoder.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7ca33c90291eca703c87f71228c0043d4f46dc386baea54092564122208dfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/viewer/dl_view_graph/src/layout/geometry.rs:56-64 | crates/viewer/dl_view_graph/src/layout/geometry.rs:67-75 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_graph/src/layout/geometry.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dcc8449822150b61d680dfb4859b2781b6a3153d5210228f6c1ea24b92034b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/viewer/dl_viewer/src/app_blueprint.rs:175-188 | crates/viewer/dl_viewer/src/app_blueprint.rs:190-204 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app_blueprint.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"c80c4b1b019c87b9b33b9d5cc94c7cf2e27be031505ebf041357e199b3a9b571"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/viewer/dl_viewer/src/web.rs:417-424 | crates/viewer/dl_viewer/src/web.rs:460-472 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/web.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"66ddaa68708f886ebdbe85f74a036b2c8bd7b044674bdb2eac36577cb7c031ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/store/dl_chunk/src/unit_chunk.rs:366-377 | crates/store/dl_chunk/src/unit_chunk.rs:411-422 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/unit_chunk.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"28356125d8387da2b38e9758ebe0acba32f4a06b1e4d59b56c1b80654d548136"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/store/dl_datafusion/src/dataframe_query_common.rs:1002-1006 | crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs:259-263 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_common.rs"},"region":{"startLine":1002}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d924081e695773c9bd04b4dd09ac4c67c44efac6993261deb9b2f651c11fa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): crates/store/dl_sorbet/src/index_column_descriptor.rs:100-124 | crates/store/dl_sorbet/src/row_id_column_descriptor.rs:43-68 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/index_column_descriptor.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"382a7759f86c9101356452a613ae99196e1aa2a855ed44d3499a90ad4678f738"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:307-321 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:303-317 \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":"crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"92821e32fda7d59be264949621c0888d0a549d6947892e91d2480e4e1e35fded"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 20\u002B corresponding lines): crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:628-647 | crates/viewer/dl_renderer/src/renderer/lines.rs:597-618 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:625-645 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 20 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2494a2d8889b6ea764fd23d123d2aa55af270b27455716d8202f24517ff1b06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): crates/viewer/dl_viewport_blueprint/src/container.rs:343-362 | crates/viewer/dl_viewport_blueprint/src/container.rs:377-393 | crates/viewer/dl_viewport_blueprint/src/view.rs:324-343 \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":"crates/viewer/dl_viewport_blueprint/src/container.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9e46c6003b4537f25741d547cc1a9aced5e0913760971a5d5a718ce7402528"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): docs/snippets/all/archetypes/scalars_row_updates.rs:5-19 | docs/snippets/all/archetypes/scalars_simple.rs:3-17 \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":"docs/snippets/all/archetypes/scalars_row_updates.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce5c049115e3ac887709b1a87d872d969645268fa207dc73fa109e2ff14b7e98"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/store/dl_chunk_store/src/query.rs:525-536 | crates/store/dl_chunk_store/src/query.rs:657-669 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/query.rs"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d47bd8b2249d95597e22f1da106c57987b9a907d2c8627a2726761beabfb74f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/store/dl_log_types/src/index/time_int.rs:255-264 | crates/store/dl_log_types/src/index/time_int.rs:271-280 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/index/time_int.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d73e9d5e9a42966bd31d50b45a6405eda86a041aa49572c87948af4a2efe29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/store/dl_tf/src/transform_queries.rs:541-556 | crates/store/dl_tf/src/transform_queries.rs:567-582 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_queries.rs"},"region":{"startLine":541}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f7362893f061b5f54de5b9bc39cf69763ed436af14679855e63f6956f64ff0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/top/dl_sdk/src/recording_stream.rs:2642-2653 | crates/top/dl_sdk/src/recording_stream.rs:2677-2692 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/recording_stream.rs"},"region":{"startLine":2642}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3ace5ff85df7922a6c46ca20ea7c67f2c8bea2279fe8d21e125e598986852d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/utils/dl_perf_telemetry/src/grpc.rs:324-342 | crates/utils/dl_perf_telemetry/src/grpc.rs:353-366 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_perf_telemetry/src/grpc.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb82d2e00d64ecc74a2894d11041eee2c92506d6a7a9b3b3a92c50734696b372"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/viewer/dl_ui/src/ui_ext.rs:286-298 | crates/viewer/dl_ui/src/ui_ext.rs:306-316 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/ui_ext.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cc2585f97407660378a14beafd4288dd23588f9ff97b83f93b241f9da267914"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs:64-77 | crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs:79-91 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"4115c698188487fba3aaaa6a6b7032455a252d13b17e1a58217795531e749ef7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/store/dl_hdf5/src/streaming.rs:222-236 | crates/store/dl_hdf5/src/streaming.rs:243-255 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_hdf5/src/streaming.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abddfaf4ea9948f63cc043761c4a44bcc429d9df6cfbba6219133da8dd9777b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/store/dl_redap_client/src/connection_registry.rs:63-74 | crates/store/dl_redap_client/src/connection_registry.rs:81-92 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/connection_registry.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"898c66def5ed64f0aefe1d539e7fccd888f3dc5dbf5406f97dcf3d66ea605e83"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): crates/top/dl_sdk/src/recording_stream.rs:206-227 | crates/top/dl_sdk/src/recording_stream.rs:233-252 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/recording_stream.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"55371ce28e25f8723253a8be907b400ff3d9424ccf794bd7b9e67db0ad09c35e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/viewer/dl_data_ui/src/instance_path_ui.rs:464-481 | crates/viewer/dl_time_panel/src/time_panel.rs:1657-1673 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/instance_path_ui.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"40cddbf6a4ded355d370881930b9a88d9667f593dbe6cc368c88d42b97ad6e55"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/store/dl_importer/src/lerobot/datasetv2.rs:246-252 | crates/store/dl_importer/src/lerobot/datasetv3.rs:1263-1269 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/lerobot/datasetv2.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"a71aedd894645e9dd9b3ddd1767ead02e981cd5eed015b9f567b53f240fb8756"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): dalaran_py/dalaran_sdk/dalaran/ros2/costmap.py:207-250 | dalaran_py/dalaran_sdk/dalaran/ros2/costmap.py:254-301 \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":"dalaran_py/dalaran_sdk/dalaran/ros2/costmap.py"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f64521066ac99bd3e64371d0b3d349a17565d0818bbe79a30b11c05ddd40999"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/utils/dl_mutex/src/lib.rs:151-165 | crates/utils/dl_mutex/src/lib.rs:177-192 | crates/utils/dl_mutex/src/lib.rs:209-223 \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":"crates/utils/dl_mutex/src/lib.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"75c80cd1955a9684454f06e6246cc6ea4ade3be064fda79b8245cca2c59a6fdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/viewer/dl_viewer/src/web.rs:221-232 | crates/viewer/dl_viewer/src/web.rs:260-274 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/web.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"16fa11102259349946239f940a501cfa03fcd28302276d893cef3207162838e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/store/dl_lenses_core/src/selector/eval.rs:71-78 | crates/store/dl_lenses_core/src/selector/eval.rs:137-146 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/selector/eval.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea4f6529b50e5bc2a8cdc8ec8441264bc278d7c21bc46a8e8df491824152429"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/store/dl_sorbet/src/sorbet_batch.rs:120-130 | crates/store/dl_sorbet/src/sorbet_batch.rs:135-145 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/sorbet_batch.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"70843591a75064c057696665d4c60eed5a131f60cd581926582bcd4a5681e2c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/store/dl_tf/src/transform_resolution_cache/transform_cache_snapshot.rs:263-276 | crates/store/dl_tf/src/transform_resolution_cache/transform_cache_snapshot.rs:284-297 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_resolution_cache/transform_cache_snapshot.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0512ddec8e8bbcf31791aa1ff9e18930f4ebad169c1dc3d992f40caa0f7f76"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): crates/viewer/dl_view_state_timeline/src/visualizer_ui.rs:334-341 | crates/viewer/dl_view_state_timeline/src/visualizer_ui.rs:346-353 | crates/viewer/dl_view_state_timeline/src/visualizer_ui.rs:358-365 \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":"crates/viewer/dl_view_state_timeline/src/visualizer_ui.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe1dde4a40acfae54227689035c3090ad67fb9bc2d540b6d167a9f432603367"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 9\u002B corresponding lines): dalaran_py/src/python_bridge.rs:2182-2190 | dalaran_py/src/python_bridge.rs:2199-2207 | dalaran_py/src/python_bridge.rs:2216-2224 | dalaran_py/src/python_bridge.rs:2229-2237 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/python_bridge.rs"},"region":{"startLine":2182}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8acd1a04a6105e170cab98e41857468e6c82b27ead57d308fa5a638f9c7a013"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (38 corresponding lines): dalaran_py/dalaran_sdk/dalaran/blueprint/api.py:715-753 | dalaran_py/dalaran_sdk/dalaran/notebook.py:289-326 \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":"dalaran_py/dalaran_sdk/dalaran/blueprint/api.py"},"region":{"startLine":715}}}],"partialFingerprints":{"codehealthFindingId/v1":"454b0131b6fe8361fb5b0a89d6259d1d002b7e99971bbfafe2bb9463937df88f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/store/dl_log_types/src/index/time_cell.rs:136-143 | crates/store/dl_log_types/src/index/time_cell.rs:152-159 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/index/time_cell.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae48b4e98ea8811ea31e3b2ea732492af7a6473ef1e61965ed63ce32906624f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): crates/store/dl_protos/src/v1alpha1/dalaran.cloud.v1alpha1.ext.rs:1277-1294 | crates/store/dl_protos/src/v1alpha1/dalaran.cloud.v1alpha1.ext.rs:1395-1412 | crates/store/dl_protos/src/v1alpha1/dalaran.cloud.v1alpha1.ext.rs:1518-1535 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_protos/src/v1alpha1/dalaran.cloud.v1alpha1.ext.rs"},"region":{"startLine":1277}}}],"partialFingerprints":{"codehealthFindingId/v1":"d349c259165a691d3f2e6c83350b3244884a12cc8b806a74decb86a7148f8171"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/store/dl_server/src/store/table.rs:110-118 | crates/store/dl_server/src/store/table.rs:120-132 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/table.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d14fb2846c5e168c54472ea4427d6c48830aad059c8d5c7590b3c87317cdeea0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/utils/dl_arrow_util/src/arrays.rs:517-527 | crates/utils/dl_arrow_util/src/arrays.rs:537-547 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_arrow_util/src/arrays.rs"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"d241db8aa36b383727d487713f69a3e61be8aeee36f6cdd8a2b5c1ab5e54e95c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 7\u002B corresponding lines): crates/viewer/dl_component_ui/src/datatype_uis/bool_toggle.rs:9-15 | crates/viewer/dl_component_ui/src/datatype_uis/float_drag.rs:23-29 | crates/viewer/dl_component_ui/src/datatype_uis/float_drag.rs:45-51 | crates/viewer/dl_component_ui/src/datatype_uis/float_drag.rs:95-101 | crates/viewer/dl_component_ui/src/datatype_uis/float_drag.rs:125-131 | crates/viewer/dl_component_ui/src/datatype_uis/float_drag.rs:138-144 | crates/viewer/dl_component_ui/src/datatype_uis/int_drag.rs:15-21 | crates/viewer/dl_component_ui/src/datatype_uis/int_drag.rs:29-35 \u2014 These 8 members are one piece of code written 8 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 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/datatype_uis/bool_toggle.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d5379289b673a5218d784cd69b3837d7e9726aa6fc7037b21196c0df22f9f67"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/store/dl_datafusion/src/pipeline_budget.rs:1007-1018 | crates/store/dl_datafusion/src/pipeline_budget.rs:1054-1061 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/pipeline_budget.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f1a2705bd0f6f58f136c8728d2fe3be80b87b905dfe2278e63e8a8f3fe35ad1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:82-91 | crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:237-246 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/filters/numerical.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"676065d242ec768405268f9d8190fb97bcdfe48da8b59b5fb9b1a62868743a5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): dalaran_py/dalaran_sdk/dalaran/dynamic_archetype.py:199-258 | dalaran_py/dalaran_sdk/dalaran/any_value.py:97-152 \u2014 These two members are one piece of code written twice and then edited apart: 56 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/dynamic_archetype.py"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee983f079f1f0d20d879808033373aefd1ab4c46dc71a7a8500b99b71fa66ebc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/viewer/dl_component_ui/src/datatype_uis/float_drag.rs:104-116 | crates/viewer/dl_component_ui/src/datatype_uis/float_drag.rs:162-173 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/datatype_uis/float_drag.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"907c4ada3c18f2bb4f39bfdb66965277eac798818b934c2d6681e2f9a39fb429"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): crates/store/dl_chunk_store/src/subscribers.rs:195-204 | crates/store/dl_chunk_store/src/subscribers.rs:217-225 | crates/store/dl_chunk_store/src/subscribers.rs:238-246 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/subscribers.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bc8233acbe843a0fc651a588cefe506bb6ea16d8106909a156798a673c5e2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): crates/utils/dl_analytics/src/event.rs:159-173 | crates/utils/dl_analytics/src/event.rs:616-631 \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":"crates/utils/dl_analytics/src/event.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2edaef2f5eb07d3d09c5adf59d2dfc9c469e33b1661f0ea30953d19fbdc256f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): crates/store/dl_chunk/src/chunk.rs:307-323 | crates/store/dl_chunk/src/chunk.rs:452-469 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/chunk.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"833e86d365afdacb9b4fd987f43df088871a561f5a05f88c2c6e9066d1b6ef9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/store/dl_mcap/src/parsers/ros2msg/std_msgs/float64_multi_array.rs:24-30 | crates/store/dl_mcap/src/parsers/ros2msg/std_msgs/float64_array.rs: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":"crates/store/dl_mcap/src/parsers/ros2msg/std_msgs/float64_multi_array.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"3830b3b83d38a605e7dff95ac0a7983440f2586f679a66667a533e42cae37a8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): crates/store/dl_chunk/src/chunk.rs:1721-1740 | crates/store/dl_protos/src/lib.rs:396-413 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/chunk.rs"},"region":{"startLine":1721}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c13d7d86d1a7afbdc9b47a479eb28ae3f9aa0d3844fa3778ba3aeedab17632"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): dalaran_py/dalaran_sdk/dalaran/__init__.py:503-543 | dalaran_py/dalaran_sdk/dalaran/recording_stream.py:786-822 \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":"dalaran_py/dalaran_sdk/dalaran/__init__.py"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fe8fe2e24ed154f746dcffef6c111b9f297944a160914925a4830bad659b86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/utils/dl_perf_telemetry/src/lib.rs:100-109 | crates/utils/dl_perf_telemetry/src/trace_id_format.rs:31-43 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_perf_telemetry/src/lib.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a774540215958180a055c600652ebd48c9ea18f9b29f055ba9868b9e0a79e06"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): crates/viewer/dl_component_ui/src/datatype_uis/singleline_string.rs:10-16 | crates/viewer/dl_component_ui/src/datatype_uis/vec.rs:24-30 | crates/viewer/dl_component_ui/src/datatype_uis/vec.rs:36-42 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/datatype_uis/singleline_string.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b644ba0be56f4910269100f4a3fb4d56731a89afac82f87eb88f2df6927b9bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/viewer/dl_view_map/src/visualizers/geo_line_strings.rs:136-144 | crates/viewer/dl_view_map/src/visualizers/geo_points.rs: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":"crates/viewer/dl_view_map/src/visualizers/geo_line_strings.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f1b1d2641b3dcaa823205176da29117bc840f1a7db5719f09d7216483f9d4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): crates/viewer/dl_view_state_timeline/src/view_class.rs:182-195 | crates/viewer/dl_view_text_log/src/view_class.rs:155-169 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_state_timeline/src/view_class.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73dbdadea1e69e6c26d134c9eeb6523ec4e448f2af13af5025b32f175b13116"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): crates/store/dl_entity_db/src/instance_path.rs:101-118 | crates/store/dl_log_types/src/path/parse_path.rs:173-188 | crates/store/dl_log_types/src/path/parse_path.rs:247-266 \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":"crates/store/dl_entity_db/src/instance_path.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e82163355200ab4eedb93bf7c7744f00beb31c8848e83a2ea751dce11680e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/viewer/dl_dataframe_ui/src/datafusion_table_widget.rs:947-954 | crates/viewer/dl_dataframe_ui/src/display_record_batch.rs:208-215 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/datafusion_table_widget.rs"},"region":{"startLine":947}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba6ef8191e7148258d807f218ffccd271fbf217885eb5298111d0fdb38a7a088"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/viewer/dl_view_spatial/src/visualizers/points3d.rs:193-204 | crates/viewer/dl_view_spatial/src/visualizers/gaussian_splats3d.rs:199-209 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/points3d.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfabcb1437fc3c2c9382762ab66499ad819464e3055f2cf50a1814fb35cce2a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): crates/store/dl_mcap/src/decoders/protobuf.rs:185-193 | crates/store/dl_mcap/src/decoders/ros2_reflection.rs:228-233 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/decoders/protobuf.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"bda91f777e0fcda4456ae2a1fcddf00066c95191d0061a9ba37b412482ccce24"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/viewer/dl_ui/src/list_item/item_buttons.rs:187-197 | crates/viewer/dl_ui/src/list_item/custom_content.rs:107-117 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/list_item/item_buttons.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"88524665f42255eeeef63d349f73d1ddc428c6d1ae80ab3f19c28708acfc4826"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): dalaran_py/dalaran_sdk/dalaran/robot/_math.py:48-67 | dalaran_py/dalaran_sdk/dalaran/robot/urdf_model.py:87-92 \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":"dalaran_py/dalaran_sdk/dalaran/robot/_math.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c43a3879a98b93efb4c002f136e401971dbdd02a7bf8951f463e55ffbe9e2b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/store/dl_sorbet/src/column_descriptor.rs:77-83 | crates/store/dl_sorbet/src/column_descriptor_ref.rs:18-24 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/column_descriptor.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"324b889e5d87384ac535469b7fa64f6cf80299d5ea1d21f77c71dbc9bb7b7297"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/viewer/dl_renderer/src/allocator/cpu_write_gpu_read_belt.rs:716-723 | crates/viewer/dl_renderer/src/allocator/gpu_readback_belt.rs:512-518 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/allocator/cpu_write_gpu_read_belt.rs"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f4416aa4792546fdf8e85e6e7b3608d19d526891e1b494d12ebafeb89b77e7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/viewer/dl_ui/src/list_item/custom_content.rs:131-140 | crates/viewer/dl_ui/src/list_item/item_buttons.rs:214-224 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/list_item/custom_content.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6efe909fe74f811e613843910afde6f2bfbc6469c2a042f2129bda619bfc63"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): dalaran_py/src/chunk_stream/hdf5_reader.rs:54-63 | dalaran_py/src/chunk_stream/parquet_reader.rs:28-37 \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":"dalaran_py/src/chunk_stream/hdf5_reader.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98f68728b63ca9505e762d9ece26366c7c43f2701760d8769bba8da2e563928"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): crates/store/dl_datafusion/src/dataset_manifest.rs:125-139 | crates/store/dl_datafusion/src/segment_table.rs:125-139 | crates/store/dl_datafusion/src/table_entry_provider.rs:273-287 \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":"crates/store/dl_datafusion/src/dataset_manifest.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"703ef4b82f295a399aab7ed59d352140ba7b40bca080f4e082a905868454b503"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): crates/viewer/dl_renderer/src/draw_phases/screenshot.rs:106-117 | crates/viewer/dl_renderer/src/allocator/cpu_write_gpu_read_belt.rs:266-277 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/draw_phases/screenshot.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7322dd701ce3664362b4606166303954e4a7537678db7b3fcb45163152b69b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/viewer/dl_viewer_context/src/viewer_context.rs:239-249 | crates/viewer/dl_test_context/src/lib.rs:473-483 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/viewer_context.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe142983b6014e438a434a429090c80d7055fd24388e0961c852daffd286b1e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): dalaran_py/src/catalog/dataset_entry.rs:72-76 | dalaran_py/src/catalog/table_entry.rs:52-56 \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":"dalaran_py/src/catalog/dataset_entry.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"da757d7b35564cd22878087938fc8df5c7769016ba9a86ec7ec921eb8f343319"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/store/dl_mcap/src/decoders/protobuf.rs:594-604 | crates/store/dl_mcap/src/decoders/ros2_reflection.rs:616-631 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/decoders/protobuf.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"b232fbcc149c5291ce52517cb42f2dff21100307dcb02a6c246dab358b31ece2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/top/dl_sdk/src/grpc_server.rs:85-94 | crates/top/dl_sdk/src/web_viewer.rs:107-116 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/grpc_server.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b4f88a86b53c0ea9883f5764be56ef5da73e0c081afc73ab1bfee2bc7c36f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): docs/snippets/all/descriptors/descr_builtin_archetype.rs:18-27 | docs/snippets/all/descriptors/descr_builtin_component.rs:28-37 | docs/snippets/all/descriptors/descr_custom_archetype.rs:63-72 | docs/snippets/all/descriptors/descr_custom_component.rs:23-32 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/descriptors/descr_builtin_archetype.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5656c8e4f4965bf3902fa9b43c44796a7c60f43a0a6764c885af6e31cd4e2f04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): dalaran_py/dalaran_sdk/dalaran/archetypes/arrows3d_ext.py:25-67 | dalaran_py/dalaran_sdk/dalaran/blueprint/archetypes/line_grid3d_ext.py:23-57 \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":"dalaran_py/dalaran_sdk/dalaran/archetypes/arrows3d_ext.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e6a61191784a443184cdff3de5b650393939fbe2801db7cc8822f6dca08b74"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/utils/dl_quota_channel/src/async_broadcast_channel.rs:376-386 | crates/utils/dl_quota_channel/src/sync/mod.rs:321-331 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_quota_channel/src/async_broadcast_channel.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e7e776ffeaa246f09736ef7b04abdab5e296c19176f35862a330c2ec45fcd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py:151-157 | dalaran_py/dalaran_sdk/dalaran/archetypes/image_ext.py:276-285 \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":"dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9a4a22b746eedd15ea427d9cca24095fad3456e73445a20328d93adf24b493"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): dalaran_py/dalaran_sdk/dalaran/ros2/msg_map.py:196-212 | dalaran_py/dalaran_sdk/dalaran/ros2/naming.py:208-213 \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":"dalaran_py/dalaran_sdk/dalaran/ros2/msg_map.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"91c6b03039c4c84d4839d6134d35954b4fb8c5a2a7a04ab0c84bbb544ee1d85f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): crates/store/dl_log_encoding/src/dlr/decoder/iterator.rs:38-48 | crates/store/dl_log_encoding/src/dlr/decoder/stream.rs:25-35 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/decoder/iterator.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"6daeff2648d9c4033b08f8cf5f621e9637875bec38475e8723ba2f2325d331d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/store/dl_query/src/latest_at.rs:314-324 | crates/store/dl_query/src/range.rs:128-135 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/latest_at.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"e985b117a19eb6bd4978424fe748f69b5a1475556fda59b66519572778d52152"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/store/dl_query/src/bin/clamped_zip.rs:47-53 | crates/store/dl_query/src/bin/range_zip.rs:49-55 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/bin/clamped_zip.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6e3bd8695fc9d8cbf43b5061fc01aae2e6a6b0aecefad7c168739b3912f5d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/store/dl_query/src/bin/clamped_zip.rs:78-84 | crates/store/dl_query/src/bin/range_zip.rs:87-93 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/bin/clamped_zip.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"36d0dd1d96c5c15d288aabb8c6286f5b610e379567c4b708fa2f91c7ea606384"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/store/dl_log_types/src/example_components.rs:384-390 | docs/snippets/all/tutorials/custom_data.rs:65-69 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/example_components.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a140f5d9298cebaa771c05a42fea3ed1c1c63a2208aa5df38b30d358eca57a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): docs/snippets/all/concepts/how-does-dalaran-work/log-to-dlr.rs:1-10 | docs/snippets/all/concepts/how-does-dalaran-work/log-to-grpc.rs:1-11 \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":"docs/snippets/all/concepts/how-does-dalaran-work/log-to-dlr.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c706e232a8b548f80101f368eadee0114f8f6f8a845fc6efa772dcf3efdfac"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/store/dl_log_types/src/app_id.rs:176-180 | crates/store/dl_types_core/src/layer_name.rs:176-180 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/app_id.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c0c60cbbbbdde71548c4d0685fab013a78a8541c981b90a64f0e109ee08b41"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/store/dl_query/src/bin/clamped_zip.rs:40-44 | crates/store/dl_query/src/bin/range_zip.rs:42-46 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/bin/clamped_zip.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee910912bd596e21da7d635138f5d403ac8d335507f85c149e3a0578819fe999"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/store/dl_query/src/bin/clamped_zip.rs:71-75 | crates/store/dl_query/src/bin/range_zip.rs:73-77 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/bin/clamped_zip.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"1828fc9122fd247a4072e11c5ef86c895b1fd0621838ee70b56d0524c9447e66"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/utils/dl_video/src/h264.rs:182-195 | crates/utils/dl_video/src/h265.rs:197-204 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/h264.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4bf57fbbe9d334474f7b182a70fd29545be72901699809cbfc47ddbd016cf7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/store/dl_query/src/bin/clamped_zip.rs:108-112 | crates/store/dl_query/src/bin/range_zip.rs:80-84 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/bin/clamped_zip.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40f3730ac7a6319cc9a062bd662594271a89355edcca859bd142377578c3346"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/viewer/dl_context_menu/src/actions/move_contents_to_new_container.rs:33-39 | crates/viewer/dl_context_menu/src/actions/remove.rs:14-21 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_context_menu/src/actions/move_contents_to_new_container.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ccdd69e6940e375dfffba80bd995f11496a18e8ded96beb5ab4191f7e52a38"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): crates/store/dl_mcap/src/recover.rs:380-387 | dalaran_py/src/chunk_stream/mcap_reader.rs:385-392 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/recover.rs"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"522db8eee3fd43b3fff7e783b01389fe679c0ee0a584046259ac1061b1dd60ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): dalaran_py/src/catalog/dataset_entry.rs:78-81 | dalaran_py/src/catalog/table_entry.rs:58-61 \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":"dalaran_py/src/catalog/dataset_entry.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"263706c9de46d1a51578ae3912b2c6cc7fb908e0cb28a68df342fd7743a269e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/viewer/dl_dataframe_ui/src/filters/boolean.rs:294-298 | crates/viewer/dl_dataframe_ui/src/filters/string.rs:43-47 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/filters/boolean.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"90e25af594f97fd79f3cfc430d1eddcf7241af6ab7ebf2b81f2c6cf123ad528d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (1 corresponding lines): dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/_decoders.py:157-157 | examples/python/droid_semantic_search/ingest.py:107-107 \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":"dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/_decoders.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e9c3899625231925a47edb47ea3b584579a67a714e5733ba834e1d9a679222"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): crates/top/dl_sdk/src/grpc_server.rs:78-82 | crates/top/dl_sdk/src/web_viewer.rs:100-104 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/grpc_server.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfe32c6bcc9bda21d6b2bf47be9b87a789b98bb38bcc505a9aa0702738950020"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): dalaran_py/src/chunk_stream/chunk_store.rs:64-74 | dalaran_py/src/chunk_stream/lazy_store.rs:48-53 \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":"dalaran_py/src/chunk_stream/chunk_store.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"345b9709c61b608adf9f2bd23fccf6891ad18807a111e56f919651fa7a83f485"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): crates/viewer/dl_view_spatial/src/max_image_dimension_subscriber.rs:62-68 | crates/viewer/dl_viewer_context/src/annotations.rs:290-296 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/max_image_dimension_subscriber.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"49cfa2684905e568c408defa3c63dc3e1f9e289b87680c67f791e4dcff1825ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 4\u002B corresponding lines): crates/store/dl_chunk/src/batcher.rs:440-443 | crates/store/dl_log_encoding/src/dlr/file_sink.rs:53-56 | crates/top/dl_sdk/src/recording_stream.rs:1105-1108 \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":"crates/store/dl_chunk/src/batcher.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c92d627a2107009397157068279066702b9202385a0702ce49efe7ab2c5f3a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): crates/viewer/dl_view_graph/src/layout/result.rs:48-50 | crates/viewer/dl_viewer_context/src/view/view_class_registry.rs:424-429 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_graph/src/layout/result.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"151585b99001a557e1cdd01b63ad6e2a09a1f7bf8ca774ca78355f62ac0bf899"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (39 lines \u00D7 2): crates/viewer/dl_blueprint_tree/src/blueprint_tree.rs:752-790 | crates/viewer/dl_time_panel/src/time_panel.rs:1297-1335 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_blueprint_tree/src/blueprint_tree.rs:752\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_blueprint_tree/src/blueprint_tree.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"a322aaeb47aca8db4456031da6871dad2dc297be91aedb2ebbdffb76b9c95649"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35\u201336 lines \u00D7 2): crates/viewer/dl_view/src/query.rs:266-300 | crates/viewer/dl_view/src/query.rs:448-483 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/src/query.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"abfafe4c994b9ab3222f4b2b84d907cdbeca3e361a6c440f38cd3eca4e56ccfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): crates/viewer/dl_ui/src/command/recording_command.rs:402-432 | crates/viewer/dl_ui/src/command/ui_command.rs:452-482 \u2014 before extracting anything, compare \u0060crates/viewer/dl_ui/src/command/recording_command.rs\u0060 and \u0060crates/viewer/dl_ui/src/command/ui_command.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/command/recording_command.rs"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"272eebbd3a7d13ab0f6c644d518bffb8f5d7f388005a3599fbf6322c10e4066e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): crates/store/dl_importer/src/importer_urdf/mod.rs:73-102 | crates/store/dl_importer/src/importer_urdf/mod.rs:118-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 \u0060crates/store/dl_importer/src/importer_urdf/mod.rs:73\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_urdf/mod.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f5dc71028b1bab4b99ce7a8652ced56a884af4e2a1720daf3c5d9ff0ad7d61e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 6): crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:248-275 | crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs:250-277 | crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:261-288 | crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:265-293 | crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs:236-263 | crates/viewer/dl_view_spatial/src/visualizers/lines3d.rs:247-274 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:248\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0648b63a9ff200dce1b0b40972ed20e5677cac4751e6a9d219a588e7c66cb7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): crates/viewer/dl_redap_browser/src/entries.rs:376-404 | crates/viewer/dl_redap_browser/src/entries.rs:420-448 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_redap_browser/src/entries.rs:376\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_redap_browser/src/entries.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3a486a5b683c2f55e49fe4829eee1f1888f0162846ea54c9b1269279c2b5d41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:69-97 | crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:67-95 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_time_series/src/line_visualizer_system.rs\u0060 and \u0060crates/viewer/dl_view_time_series/src/point_visualizer_system.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/line_visualizer_system.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"acb351ba57daee54b5b1dd513a09146b67ce214813884d510b686c9d7cf7e325"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24\u201327 lines \u00D7 2): crates/store/dl_importer/src/lerobot/datasetv2.rs:368-391 | crates/store/dl_importer/src/lerobot/datasetv3.rs:412-438 \u2014 before extracting anything, compare \u0060crates/store/dl_importer/src/lerobot/datasetv2.rs\u0060 and \u0060crates/store/dl_importer/src/lerobot/datasetv3.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_importer/src/lerobot/datasetv2.rs:368\u0060 it begins part-way through the construct above it, so those exact 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":"crates/store/dl_importer/src/lerobot/datasetv2.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e7ff1fc46169c32015cf5a0f302b636021d84c6f2387f4d561906cdb3558a4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): crates/store/dl_redap_client/src/grpc.rs:472-498 | crates/store/dl_redap_client/src/grpc.rs:529-554 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_redap_client/src/grpc.rs:472\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/grpc.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"062bcbc6e4d51e5263eff44c341c6f99152ff35f9b138e17cac1c13b78c6fd29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): crates/viewer/dl_blueprint_tree/src/blueprint_tree.rs:809-834 | crates/viewer/dl_time_panel/src/time_panel.rs:1356-1382 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_blueprint_tree/src/blueprint_tree.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":"crates/viewer/dl_blueprint_tree/src/blueprint_tree.rs"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa534791c33690df21da349dd1309f05b77c6e3d739b97034f44f5e10bc3271"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201327 lines \u00D7 2): crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:844-870 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:882-906 \u2014 before extracting anything, compare \u0060crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs\u0060 and \u0060crates/viewer/dl_renderer/src/renderer/point_cloud.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:844\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs"},"region":{"startLine":844}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ee58c54c5a855a6e74e8c60ff9bcb3c7949302e352200c827ed573de573e3ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26\u201327 lines \u00D7 2): crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:93-119 | crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:111-136 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:93\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eec5eefc1feb5a02c608c31d06c85cd95935f558f4c8d22d851579963964d59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:393-419 | crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:245-271 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_time_series/src/line_visualizer_system.rs\u0060 and \u0060crates/viewer/dl_view_time_series/src/point_visualizer_system.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_time_series/src/line_visualizer_system.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":"crates/viewer/dl_view_time_series/src/line_visualizer_system.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19562fc2b182640c8206080811c8344e92efed69b5a64c9fdd5e3604619e8b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:544-570 | crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:424-450 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_time_series/src/line_visualizer_system.rs\u0060 and \u0060crates/viewer/dl_view_time_series/src/point_visualizer_system.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:544\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/line_visualizer_system.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb6d6c314d7a6b749fddc670bc8b991ee4af7d6fdd535a2b43aa1296d8c6026"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/store/dl_datafusion/src/dataframe_query_provider.rs:555-580 | crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs:285-310 \u2014 before extracting anything, compare \u0060crates/store/dl_datafusion/src/dataframe_query_provider.rs\u0060 and \u0060crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a52dcacca7fce68a40c95676692cf694c205620339c0c9779cc9c712beb246"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/store/dl_tf/src/transform_resolution_cache/tree_transforms_for_child_frame.rs:229-254 | crates/store/dl_tf/src/transform_resolution_cache/tree_transforms_for_child_frame.rs:301-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_tf/src/transform_resolution_cache/tree_transforms_for_child_frame.rs:229\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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, \u0060crates/store/dl_tf/src/transform_resolution_cache/tree_transforms_for_child_frame.rs:228\u0060 calls \u0060associated_entity_path\u0060 and \u0060crates/store/dl_tf/src/transform_resolution_cache/tree_transforms_for_child_frame.rs:300\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_resolution_cache/tree_transforms_for_child_frame.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb144d45553d323c0ad180e216a4d920464ad8136e12bd95a344d91aa60b7189"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2): crates/store/dl_query/src/bin/clamped_zip.rs:316-340 | crates/store/dl_query/src/bin/range_zip.rs:457-481 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_query/src/bin/clamped_zip.rs:316\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/bin/clamped_zip.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"43c246c1801218266e2d3a6fb3ed1020514d039443f04958533abcfe8e7bcb2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201324 lines \u00D7 3): crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:435-453 | crates/viewer/dl_renderer/src/renderer/lines.rs:719-740 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:775-798 \u2014 before extracting anything, compare \u0060crates/viewer/dl_renderer/src/renderer/depth_cloud.rs\u0060 and \u0060crates/viewer/dl_renderer/src/renderer/lines.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:435\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/depth_cloud.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e3b1091a73e9343e37a6bf5c8f7563c722c814ab9b38523ab564cfc0b9a2cf9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/store/dl_datafusion/src/dataframe_query_provider.rs:589-612 | crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs:317-340 \u2014 before extracting anything, compare \u0060crates/store/dl_datafusion/src/dataframe_query_provider.rs\u0060 and \u0060crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3b4c1f5c1d6c727b33cde2f5596ba24dfc54277e5fb093116d86f92e59205c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1138-1160 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1219-1242 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1138\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs"},"region":{"startLine":1138}}}],"partialFingerprints":{"codehealthFindingId/v1":"546a127bf247403b5d64c1cb6e1f46d94f3db3f1e04c183547801331507a156f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:226-249 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:221-244 \u2014 before extracting anything, compare \u0060crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs\u0060 and \u0060crates/viewer/dl_renderer/src/renderer/point_cloud.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:226\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"48197ed634780aa935a9650c8c864a3697d99f9ddd8546e5e6707f98d42fe1ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): crates/viewer/dl_viewer/src/ui/dev_panel/mod.rs:403-433 | crates/viewer/dl_viewer/src/ui/dev_panel/mod.rs:441-471 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_viewer/src/ui/dev_panel/mod.rs:403\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/dev_panel/mod.rs"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2126dbe89a1499d7025c18f1557344e2912aedcaef02009ea81a4316c43f4c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/store/dl_chunk_store/src/gc.rs:532-554 | crates/store/dl_chunk_store/src/gc.rs:578-600 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_chunk_store/src/gc.rs:532\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/store/dl_chunk_store/src/gc.rs:570\u0060 calls \u0060time_range\u0060 and \u0060crates/store/dl_chunk_store/src/gc.rs:524\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/gc.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b64068521233285fab27ff88fb1e1d53789ad417ae29a7f14d8ae5ee4f419e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201323 lines \u00D7 2): crates/store/dl_dataframe/src/query.rs:1298-1320 | crates/store/dl_dataframe/src/query.rs:1771-1785 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_dataframe/src/query.rs:1298\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":1298}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7b01180d937e6ca03ab473e15b890c3c1760655c7b19557388e34544dcdcfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/viewer/dl_component_ui/src/line_strip.rs:24-46 | crates/viewer/dl_component_ui/src/line_strip.rs:89-111 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_component_ui/src/line_strip.rs:24\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060value\u0060 to \u0060\u0026mut MaybeMutRef\u003C\u0027_, LineStrip3D\u003E\u0060 in one and \u0060\u0026mut MaybeMutRef\u003C\u0027_, LineStrip2D\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 after the matched lines, \u0060crates/viewer/dl_component_ui/src/line_strip.rs:47\u0060 calls \u0060col\u0060, \u0060label\u0060 and \u0060crates/viewer/dl_component_ui/src/line_strip.rs:112\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/line_strip.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"db72e9094f8fb044beb2b8fb7a96b61bf8911efd62c6266321c7a2b5aa98bf38"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/viewer/dl_selection_panel/src/view_entity_picker.rs:338-360 | crates/viewer/dl_time_panel/src/streams_tree_data.rs:110-132 \u2014 before extracting anything, compare \u0060crates/viewer/dl_selection_panel/src/view_entity_picker.rs\u0060 and \u0060crates/viewer/dl_time_panel/src/streams_tree_data.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_selection_panel/src/view_entity_picker.rs:338\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/view_entity_picker.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b31d693208396ef6cd79e334c0d957871c17af1ce71b866a381ffd6460b0967"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): crates/viewer/dl_selection_panel/src/view_entity_picker.rs:408-430 | crates/viewer/dl_time_panel/src/streams_tree_data.rs:178-200 \u2014 before extracting anything, compare \u0060crates/viewer/dl_selection_panel/src/view_entity_picker.rs\u0060 and \u0060crates/viewer/dl_time_panel/src/streams_tree_data.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_selection_panel/src/view_entity_picker.rs:408\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/view_entity_picker.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ffa2a800391bbcade1144e860ed533dd032787909ffa0fa3d9171885102549"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): dalaran_py/src/chunk_stream/hdf5_reader.rs:85-107 | dalaran_py/src/chunk_stream/parquet_reader.rs:107-128 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060dalaran_py/src/chunk_stream/hdf5_reader.rs:85\u0060 it begins part-way through the construct above it, so those exact 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":"dalaran_py/src/chunk_stream/hdf5_reader.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"831acba832a7b02e7debe1e93511ca03076e31df67463e354f216d4d367a0d00"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): crates/store/dl_grpc_server/src/lib.rs:404-425 | crates/store/dl_grpc_server/src/lib.rs:509-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 \u0060crates/store/dl_grpc_server/src/lib.rs:404\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_grpc_server/src/lib.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d95574a0022df3e2c076c421166d38982f0694cd45e3cbfa9c5b7d687e196bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201322 lines \u00D7 2): docs/snippets/all/archetypes/clear_recursive.rs:8-29 | docs/snippets/all/archetypes/clear_simple.rs:9-28 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060docs/snippets/all/archetypes/clear_recursive.rs:8\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/clear_recursive.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8781d3701dacc69fd730c7819525ee4c765de610c5d1947c89008d50ae34c36"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/store/dl_chunk/src/iter.rs:559-579 | crates/store/dl_chunk/src/iter.rs:787-807 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_chunk/src/iter.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/store/dl_chunk/src/iter.rs:784\u0060 calls \u0060offsets\u0060, \u0060lengths\u0060, \u0060collect_vec\u0060 and \u0060crates/store/dl_chunk/src/iter.rs:557\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/iter.rs"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d1c62306502e8ff985f2e88c9fcfa8aaf06a5a49b5bb6d0739da88c5223ab3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs:818-838 | crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs:889-909 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.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":"crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42b1f8c7f416162f6c913c5c29849663f126cbc12d9c2e9c74730c6461fca6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/store/dl_mcap/src/decoders/ros2_reflection.rs:148-168 | crates/store/dl_mcap/src/decoders/ros2_reflection.rs:303-323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/decoders/ros2_reflection.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b1d5ad41983a1acf04300d5eb65300b4a56d1841a9b119831f19c0180fab3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/viewer/dl_view_spatial/src/visualizers/points2d.rs:299-319 | crates/viewer/dl_view_spatial/src/visualizers/points3d.rs:515-535 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_spatial/src/visualizers/points2d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/points3d.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/visualizers/points2d.rs:299\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/points2d.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"a483e1375d494975b83db5aa3b96768b8c79e3b1376e7c4f7643f9a09552a528"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/viewer/dl_viewer/src/app/command_handling.rs:566-586 | crates/viewer/dl_viewer/src/app/command_handling.rs:598-618 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_viewer/src/app/command_handling.rs:566\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/command_handling.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb0682d25f2c3cecb9e0cc55e557fa4d550942d457a764c9dacc5c92afde79a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201321 lines \u00D7 2): crates/viewer/dl_viewer/src/web.rs:432-451 | crates/viewer/dl_viewer/src/web.rs:477-497 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_viewer/src/web.rs:432\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/web.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e708a13121eb5abffb693cebe7c33d109951f1de1a0e3c24a528fb666bc15ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/viewer/dl_viewer_context/src/component_ui_registry.rs:367-387 | crates/viewer/dl_viewer_context/src/component_ui_registry.rs:412-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_viewer_context/src/component_ui_registry.rs:367\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/component_ui_registry.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd1f4efc2048134859b4b546e4786f05130af222064532eb5b0f27582fba52c4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201321 lines \u00D7 2): docs/snippets/all/archetypes/state_configuration.rs:6-18 | docs/snippets/all/howto/state_timeline.rs:6-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/snippets/all/archetypes/state_configuration.rs:6\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/state_configuration.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2938f31197f638ee150f73ce5c2ab8d52e9cb5bd9d984139cb323774fe4e607"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 3): crates/store/dl_grpc_client/src/lib.rs:48-67 | crates/store/dl_grpc_server/src/lib.rs:128-147 | crates/store/dl_redap_client/src/lib.rs:124-143 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_grpc_client/src/lib.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d290c612d7bdd6f48082895ddb3408fcf4a172a2b81de49cb20fb3ccf8c3e258"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/store/dl_query/src/bin/range_zip.rs:129-148 | crates/store/dl_query/src/bin/range_zip.rs:339-358 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/bin/range_zip.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c9f77add4a9f60d01d4d190791aec03aae12f3d3ded82491da0ca59a554665"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:82-101 | crates/store/dl_sorbet/src/migrations/v0_1_2__to__v0_1_3.rs:53-71 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:82\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6a2f539126a20e2c6a4042e6fbff85d81669e00f4216241be8f7e42f97f163"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:146-165 | crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:298-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/filters/numerical.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5f28d03a344a261c4d8702549214cb9c09e7f3c87d0f955d164c1db8c03d52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201320 lines \u00D7 2): crates/viewer/dl_view/src/blueprint_resolved_results.rs:334-353 | crates/viewer/dl_view/src/blueprint_resolved_results.rs:362-378 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view/src/blueprint_resolved_results.rs:334\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/src/blueprint_resolved_results.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8a15412d2c9d58cd1bf3587cbf5b0708150dd58607353198ecc869c520ed58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs:33-52 | crates/viewer/dl_view_spatial/src/visualizers/lines3d.rs:34-53 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/lines3d.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs:33\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7bcad13e216149c8da548e7a652f1d531772bd6869d32f86e75bb5f4ba33797"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs:192-211 | crates/viewer/dl_view_spatial/src/visualizers/lines3d.rs:203-222 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/lines3d.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ab97fcf4976db202298a9ad26557bc335fc778f8c15790939b8516e916a823"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/store/dl_datafusion/src/dataframe_query_provider.rs:856-874 | crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs:463-481 \u2014 before extracting anything, compare \u0060crates/store/dl_datafusion/src/dataframe_query_provider.rs\u0060 and \u0060crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_datafusion/src/dataframe_query_provider.rs:856\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"186660be7d782cf87c431ba6dc991fe428ae44ffee097688f7b4f3bbb35f1541"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:188-206 | crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:360-378 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:188\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddf44cb3da4ea5d27ad4475089c90284a12f0c1bd5089bc8057690712f51350"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/viewer/dl_selection_panel/src/view_entity_picker.rs:242-259 | crates/viewer/dl_selection_panel/src/view_entity_picker.rs:298-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_selection_panel/src/view_entity_picker.rs:242\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact 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, \u0060crates/viewer/dl_selection_panel/src/view_entity_picker.rs:241\u0060 calls \u0060remove_filter_rule_for\u0060 and \u0060crates/viewer/dl_selection_panel/src/view_entity_picker.rs:297\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":"crates/viewer/dl_selection_panel/src/view_entity_picker.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"64b52437d51cbabc6abf3d026afd49a0b580a27927b5a981a1429e349cc7cb02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:34-52 | crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:43-61 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:34\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"c21368831a1aefcdc6d49de265067eaa45ba4176ec541bf52e9576f4dcc2a562"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:341-359 | crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:196-213 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_time_series/src/line_visualizer_system.rs\u0060 and \u0060crates/viewer/dl_view_time_series/src/point_visualizer_system.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/line_visualizer_system.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc2dd3703a06b74a83c41dc5e5475b12219dcb6684ee57dd3c1bbd119897285"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): crates/viewer/dl_viewer/src/texture_readback.rs:132-147 | crates/viewer/dl_viewer/src/texture_readback.rs:159-177 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_viewer/src/texture_readback.rs:132\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/texture_readback.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"b376261163698dfa0b7a5bffbef2b2c3a3c87a920ce5a7904ac25cfe7efa1636"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:285-303 | crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:329-347 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:285\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/blueprint_helpers.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f2cfd118f1cd8b69c4d0750cdcb2515264b4c8baedac53007f9b9b59ecbe90"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 3): crates/utils/dl_perf_telemetry/src/prometheus.rs:613-630 | crates/utils/dl_perf_telemetry/src/prometheus.rs:650-667 | crates/utils/dl_perf_telemetry/src/prometheus.rs:687-704 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/utils/dl_perf_telemetry/src/prometheus.rs:613\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_perf_telemetry/src/prometheus.rs"},"region":{"startLine":613}}}],"partialFingerprints":{"codehealthFindingId/v1":"15d9f2b2bbac05a181e0fea87fe2a643a64ce4532d4ffc51d4a902f5361790fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/store/dl_sdk_types/src/archetypes/gaussian_splats3d_ext.rs:128-145 | crates/store/dl_sdk_types/src/archetypes/points3d_ext.rs:40-57 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sdk_types/src/archetypes/gaussian_splats3d_ext.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"f653e7bee5fd9b8bae30ec3c65651fceb00f230c796e23681c457b41cba31a96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/store/dl_server/src/store/in_memory_store.rs:234-251 | crates/store/dl_server/src/store/in_memory_store.rs:310-327 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/in_memory_store.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"a310e64280d678c14b0e2f54ac523182b457adb7c3c80d732db6602fc2dbcec0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:137-154 | crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:182-199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:137\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76f20f135b4f9275df52a6f0aab6bea352eadc5c2204c644068e7dab8ec55eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201318 lines \u00D7 2): crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:206-219 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:197-214 \u2014 before extracting anything, compare \u0060crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs\u0060 and \u0060crates/viewer/dl_renderer/src/renderer/point_cloud.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:206\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d19c22867cc7b3faaeb806cc4bceb6d9c7744dbbed5a3415c7fc8690f1537993"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): crates/viewer/dl_selection_panel/src/view_entity_picker.rs:364-381 | crates/viewer/dl_time_panel/src/streams_tree_data.rs:137-154 \u2014 before extracting anything, compare \u0060crates/viewer/dl_selection_panel/src/view_entity_picker.rs\u0060 and \u0060crates/viewer/dl_time_panel/src/streams_tree_data.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 64 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_selection_panel/src/view_entity_picker.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":"crates/viewer/dl_selection_panel/src/view_entity_picker.rs"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43e125fea2f77fdffa7717c2117b6137c87f953a84e8dc79123185036ea1040"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2): crates/viewer/dl_view_spatial/src/visualizers/capsules3d.rs:201-228 | crates/viewer/dl_view_spatial/src/visualizers/cylinders3d.rs:197-224 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_spatial/src/visualizers/capsules3d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/cylinders3d.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 55 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/visualizers/capsules3d.rs:201\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/capsules3d.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"bece384f943816ce36b3106770da607bf2983e7201ee55a2df60db1a64dbe021"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/store/dl_chunk_store/src/writes.rs:696-712 | crates/store/dl_chunk_store/src/writes.rs:731-747 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_chunk_store/src/writes.rs:696\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/writes.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"c874f0422fef44a2147f947ca23ec139628db1ec85a88403d2c2244923b683f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/store/dl_datafusion/src/dataframe_query_provider.rs:879-895 | crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs:538-554 \u2014 before extracting anything, compare \u0060crates/store/dl_datafusion/src/dataframe_query_provider.rs\u0060 and \u0060crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_datafusion/src/dataframe_query_provider.rs:879\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider.rs"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9f2910420b532c6e288b2b0ffcfd1af3215b9b0701a8ae07ae7a4a27954ea4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs:93-109 | crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs:395-411 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a10ed0ec3ae785717f47f055c59bf5bac86d5298967b8532ea239a8f21ee06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/store/dl_grpc_server/src/lib.rs:381-397 | crates/store/dl_grpc_server/src/lib.rs:479-495 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_grpc_server/src/lib.rs:381\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/store/dl_grpc_server/src/lib.rs:496\u0060 calls \u0060is_empty\u0060 and \u0060crates/store/dl_grpc_server/src/lib.rs:398\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_grpc_server/src/lib.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d8888ef2d18c52facf3f6a6d46878288e4f650fcbb4c4956872cbbb2d4550ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): crates/viewer/dl_component_ui/src/datatype_uis/float_drag.rs:72-88 | crates/viewer/dl_component_ui/src/datatype_uis/int_drag.rs:66-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/datatype_uis/float_drag.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3f7670937c1e1db4e9ad4e930f37e400ece32f56c8ec084a046a8b196c5ca6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:123-137 | crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:273-289 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:123\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/filters/numerical.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"b09496feb32de95ba0f3c80a1b87d4c2ac3fc7d79eda5db27aa0e0212cdf6f30"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:304-317 | crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:155-171 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_time_series/src/line_visualizer_system.rs\u0060 and \u0060crates/viewer/dl_view_time_series/src/point_visualizer_system.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:304\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/line_visualizer_system.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"34d95ad30ceee978d451c45bb46c75d8971df85554f524628aba7aa809513ecc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): crates/viewer/dl_viewer/src/app_state.rs:739-755 | crates/viewer/dl_viewer/src/app_state.rs:763-778 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_viewer/src/app_state.rs:739\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app_state.rs"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b93db2524b1c8daf58948db59a752e7efe8fef07bd24d92aed2eaf2a4690f8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): dalaran_py/src/chunk_stream/stream.rs:195-211 | dalaran_py/src/chunk_stream/stream.rs:228-244 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060dalaran_py/src/chunk_stream/stream.rs:195\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"dalaran_py/src/chunk_stream/stream.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2700da3bfc5702f543f78b5fccb3690b82d4fe22802a06bc80626aad194104"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 4): crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs:219-234 | crates/viewer/dl_view_spatial/src/visualizers/capsules3d.rs:244-259 | crates/viewer/dl_view_spatial/src/visualizers/cylinders3d.rs:240-255 | crates/viewer/dl_view_spatial/src/visualizers/ellipsoids.rs:220-235 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/ellipsoids.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs:219\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/viewer/dl_view_spatial/src/visualizers/ellipsoids.rs:217\u0060 calls \u0060unwrap_or_default\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/capsules3d.rs:241\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1cbd774db3c518d468a509b5ace624d5cf0b822793c0bb37be9935d6999f46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201316 lines \u00D7 2): crates/store/dl_datafusion/src/pipeline_budget.rs:1488-1503 | crates/store/dl_datafusion/src/pipeline_budget.rs:1519-1530 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_datafusion/src/pipeline_budget.rs:1488\u0060 it begins part-way through the construct above it, so those exact 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":"crates/store/dl_datafusion/src/pipeline_budget.rs"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"5650b284c17b29035f89c5bd7b7f2e915c19c7127654f55b7663e60405842117"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/store/dl_log_types/src/path/entity_path_part.rs:60-75 | crates/store/dl_log_types/src/path/entity_path_part.rs:122-136 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_log_types/src/path/entity_path_part.rs:60\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/path/entity_path_part.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d19646aaf5f5292bd81085d469d15cdf20733b5f8a1b3fc44a1e41e53fbe10e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/store/dl_parquet/src/streaming.rs:77-92 | crates/store/dl_parquet/src/streaming.rs:103-118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_parquet/src/streaming.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":"crates/store/dl_parquet/src/streaming.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"14db5a607dd59f05f8cc3ea884098057a225b3e2c120533837bd9e522fe3866e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/store/dl_redap_client/src/connection_client.rs:1181-1196 | crates/store/dl_redap_client/src/connection_client.rs:1235-1249 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_redap_client/src/connection_client.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":"crates/store/dl_redap_client/src/connection_client.rs"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a8cbebe36a714d876548a5362f78fa87310394e0b875f43e48401e7cff5c14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/top/dl_sdk/src/grpc_server.rs:46-61 | crates/top/dl_sdk/src/web_viewer.rs:53-68 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/grpc_server.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af2fbb3a3ea67862f9250e5761fa59d036deb8fdfdc6c3c8f5c765fbd3b1684"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/utils/dl_crash_handler/src/lib.rs:273-288 | crates/utils/dl_memory/src/backtrace_native.rs:68-83 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/utils/dl_crash_handler/src/lib.rs:273\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_crash_handler/src/lib.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6b3fff42236d422ff0eb03e5daf234a7c0f8211b92f41abf7a8527118536866"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/viewer/dl_redap_browser/src/servers.rs:549-564 | crates/viewer/dl_redap_browser/src/servers.rs:600-614 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_redap_browser/src/servers.rs:549\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_redap_browser/src/servers.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"f684dadd1f89316f1acb0428e0864e5087132476840951171cf3be9dd3236ce9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/viewer/dl_view/src/query.rs:304-319 | crates/viewer/dl_view/src/query.rs:488-502 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view/src/query.rs:304\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/src/query.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb4bdedc205cc30db8763e1ee4e13a637a8991eb34c00d550a03686e496fb7b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/viewer/dl_view_dataframe/src/view_query/ui.rs:96-111 | crates/viewer/dl_view_dataframe/src/view_query/ui.rs:137-152 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_dataframe/src/view_query/ui.rs:96\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_dataframe/src/view_query/ui.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f22f36c361a17c54df52abe0145d8a3b7c03968c36e4de877f095ccdbd5006b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/viewer/dl_view_spatial/src/visualizers/images.rs:154-169 | crates/viewer/dl_view_spatial/src/visualizers/segmentation_images.rs:119-134 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/visualizers/images.rs:154\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/viewer/dl_view_spatial/src/visualizers/segmentation_images.rs:117\u0060 calls \u0060default\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/images.rs:152\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/images.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"5704d3e6ffbf9dab8c320525bf6175661b102c71081b903b3e596d52600ba8e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/viewer/dl_view_spatial/src/visualizers/points2d.rs:110-125 | crates/viewer/dl_view_spatial/src/visualizers/points3d.rs:328-343 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_spatial/src/visualizers/points2d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/points3d.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/visualizers/points2d.rs:110\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/points2d.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a765770249cbbe718ba5faf4e856f1faad7538a3ba3fef94134f288089826da7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/viewer/dl_view_spatial/src/visualizers/points2d.rs:214-229 | crates/viewer/dl_view_spatial/src/visualizers/points3d.rs:415-430 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_spatial/src/visualizers/points2d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/points3d.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/points2d.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c31d745fff434d2d81ccf6b10035ac1abce778b7301ab438716eea63246f7a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/viewer/dl_viewer/src/web.rs:203-218 | crates/viewer/dl_viewer/src/web.rs:826-841 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_viewer/src/web.rs:203\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/web.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c7dbd3d87e74ef59a9b7858c36aabedd0c1af8f9d2f71c872301c946d83a27"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/viewer/dl_viewport/src/viewport_ui.rs:1247-1262 | crates/viewer/dl_viewport/src/viewport_ui.rs:1269-1284 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_viewport/src/viewport_ui.rs:1247\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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, \u0060crates/viewer/dl_viewport/src/viewport_ui.rs:1262\u0060 calls \u0060Some\u0060 and \u0060crates/viewer/dl_viewport/src/viewport_ui.rs:1284\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport/src/viewport_ui.rs"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea79cce6550a3869748b812fb801420325dd944e930f96e1fc4bb8fdbb683486"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 5): crates/viewer/dl_viewer/data/quick_start_guides/quick_start_connect.rs:12-24 | crates/viewer/dl_viewer/data/quick_start_guides/quick_start_spawn.rs:11-25 | docs/snippets/all/howto/set_sinks.rs:22-34 | docs/snippets/all/quick_start/quick_start_connect.rs:13-25 | docs/snippets/all/quick_start/quick_start_spawn.rs:13-27 \u2014 before extracting anything, compare \u0060crates/viewer/dl_viewer/data/quick_start_guides/quick_start_connect.rs\u0060 and \u0060docs/snippets/all/howto/set_sinks.rs\u0060 as WHOLE FILES: 83% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_viewer/data/quick_start_guides/quick_start_connect.rs:12\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/data/quick_start_guides/quick_start_connect.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a90d357c90468384aeda171f18bb08cbef9a3b6353549522165b65fbb608fcc2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 4): crates/store/dl_chunk/src/iter.rs:479-492 | crates/store/dl_chunk/src/iter.rs:567-581 | crates/store/dl_chunk/src/iter.rs:640-653 | crates/store/dl_chunk/src/iter.rs:795-809 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_chunk/src/iter.rs:479\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"crates/store/dl_chunk/src/iter.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"66eb837d60b10946881df62e41d508dcf4d290ee0a864edcc510e6a1f54d1e31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): crates/viewer/dl_viewer/src/app_state.rs:641-655 | crates/viewer/dl_viewer/src/app_state.rs:679-693 | crates/viewer/dl_viewer/src/app_state.rs:740-754 | crates/viewer/dl_viewer/src/app_state.rs:764-778 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_viewer/src/app_state.rs:641\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app_state.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"882fda1f3ae91998eb763d6b8720a43ce134e3783a68d861d53817a9b21e172a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/store/dl_chunk_store/src/query.rs:124-138 | crates/store/dl_chunk_store/src/query.rs:144-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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/query.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcead45a2b245ee02daa5bd1cd82517f8bf06019a943403410582d8a77313834"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/store/dl_log_channel/src/receiver_set.rs:152-166 | crates/store/dl_log_channel/src/receiver_set.rs:188-202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_log_channel/src/receiver_set.rs:152\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_channel/src/receiver_set.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c401d8a3a9363bdbc2bc902db4030c9de6518b4cfb767f7facd3ee7b17f936"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/store/dl_log_encoding/src/transport_to_app.rs:256-270 | crates/store/dl_log_encoding/src/transport_to_app.rs:286-300 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_log_encoding/src/transport_to_app.rs:256\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/transport_to_app.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"57dff0376f8577ca6b539e8c5c9d16bfd2e45a69f5a41322700d37471c151588"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/store/dl_server/src/dalaran_cloud/mod.rs:1247-1261 | crates/store/dl_server/src/dalaran_cloud/mod.rs:1308-1322 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_server/src/dalaran_cloud/mod.rs:1247\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060request\u0060 to \u0060tonic::Request\u003Cdl_protos::cloud::v1alpha1::ScanSegmentTableRequest\u003E\u0060 in one and \u0060Request\u003CScanDatasetManifestRequest\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":1247}}}],"partialFingerprints":{"codehealthFindingId/v1":"3de16d0d19e75eee50fde96cecb5358c6f99a99a234f15b8c34be03dee8c4924"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/utils/dl_perf_telemetry/src/prometheus.rs:220-234 | crates/utils/dl_perf_telemetry/src/prometheus.rs:395-409 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/utils/dl_perf_telemetry/src/prometheus.rs:220\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_perf_telemetry/src/prometheus.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"b140ae786d34b0c19233c88fd3bf1fd95c9dbaaa211dc4afce4b6d89966ceb57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/viewer/dl_component_ui/src/time_range.rs:124-138 | crates/viewer/dl_component_ui/src/time_range.rs:168-182 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_component_ui/src/time_range.rs:124\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/time_range.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"97dd4577f66e3b1b0bbcb202ac449fbb32738052b42e74ade6fe7ed19381a300"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:801-815 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:829-844 \u2014 before extracting anything, compare \u0060crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs\u0060 and \u0060crates/viewer/dl_renderer/src/renderer/point_cloud.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:801\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2b26a1d1b64666f68026113d199ab7fee48040c9684fd01e28996c72e56a67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/viewer/dl_selection_panel/src/visualizer_ui.rs:253-267 | crates/viewer/dl_selection_panel/src/visualizer_ui.rs:500-514 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_selection_panel/src/visualizer_ui.rs:253\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/visualizer_ui.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ebf02e16d775b2a9c9f698288f58c4bd36f4803f05e86b84182e8874415bf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/viewer/dl_ui/src/command/recording_command.rs:436-450 | crates/viewer/dl_ui/src/command/ui_command.rs:486-500 \u2014 before extracting anything, compare \u0060crates/viewer/dl_ui/src/command/recording_command.rs\u0060 and \u0060crates/viewer/dl_ui/src/command/ui_command.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/command/recording_command.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49809a5b09989619b3d72f552db49dab3b1866bb8b462ff56355a4431e6453e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/viewer/dl_view_graph/src/layout/provider.rs:130-144 | crates/viewer/dl_view_graph/src/layout/provider.rs:170-183 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_graph/src/layout/provider.rs:130\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_graph/src/layout/provider.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e6379e922df833be87510c237420cab0469c68eeb7bd6403d81453b973bad24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:242-256 | crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:246-260 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:242\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea896150622ff566447444bc774ee7c96a0cb7f1fb5dd14e7b7b3164806f860d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/viewer/dl_view_spatial/src/visualizers/video/encoded_depth_image.rs:72-86 | crates/viewer/dl_view_spatial/src/visualizers/video/encoded_image.rs:53-67 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/visualizers/video/encoded_depth_image.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":"crates/viewer/dl_view_spatial/src/visualizers/video/encoded_depth_image.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5d851ed3c9e12b92f01c9678a55d37407cfadd68edca994ee5e422b820b6a06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:66-78 | crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:117-131 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:66\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/blueprint_helpers.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f35af86678ee98fa61b32568dfd77bf20853bf5798eebc565f6795c7a13e377"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/viewer/dl_viewport/src/view_highlights.rs:48-60 | crates/viewer/dl_viewport/src/view_highlights.rs:100-114 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_viewport/src/view_highlights.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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport/src/view_highlights.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"93645d0e222264a563cd25bec945ef7c173b8d5442ca55b5589bb3fd6a241ecd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201315 lines \u00D7 2): dalaran_py/src/python_bridge.rs:1408-1422 | dalaran_py/src/python_bridge.rs:1625-1636 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060dalaran_py/src/python_bridge.rs:1408\u0060 it does not close everything it opens, so those exact 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":"dalaran_py/src/python_bridge.rs"},"region":{"startLine":1408}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f1e027f0dc76446d8d4b86880a0bbe0e8a2120d18d96f4144de76693968de73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): docs/snippets/all/howto/any_batch_value_column_updates.rs:31-45 | docs/snippets/all/howto/any_values_column_updates.rs:33-45 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/snippets/all/howto/any_batch_value_column_updates.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":"docs/snippets/all/howto/any_batch_value_column_updates.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a70dd4549c8732c8afdde7c12aceb4e6c926660313977354814ecdc21e7b007"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 4): crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:466-479 | crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:800-812 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:828-841 | crates/viewer/dl_renderer/src/renderer/voxel_grid.rs:392-404 \u2014 before extracting anything, compare \u0060crates/viewer/dl_renderer/src/renderer/depth_cloud.rs\u0060 and \u0060crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:466\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/depth_cloud.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d1f96c6e84b5e6b14765dc380f9a65f760472e989538d393c89fe6528c7f93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 4): docs/snippets/all/descriptors/descr_builtin_archetype.rs:36-49 | docs/snippets/all/descriptors/descr_builtin_component.rs:46-59 | docs/snippets/all/descriptors/descr_custom_archetype.rs:81-94 | docs/snippets/all/descriptors/descr_custom_component.rs:41-54 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 4 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/snippets/all/descriptors/descr_builtin_archetype.rs:36\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/descriptors/descr_builtin_archetype.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"079f3e842c3aea72833f93b366acc8aa8dde24aaa8e292aea16ba6303133701c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 3): crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:205-218 | crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs:207-220 | crates/viewer/dl_view_spatial/src/visualizers/points2d.rs:239-251 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:205\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ca192ffe0bde0fbf2299833cb32b15f08fb9897844b2307521f115609924ad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/store/dl_data_source/src/stream_dlr_from_http.rs:21-32 | crates/viewer/dl_viewer_context/src/open_url.rs:867-880 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_data_source/src/stream_dlr_from_http.rs:21\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_data_source/src/stream_dlr_from_http.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1724ebef28e1f775e7d090b934a7bb1657b39bbf8267ab417f9bda464338fbf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/store/dl_datafusion/src/dataframe_query_common.rs:315-328 | dalaran_py/src/catalog/connection_handle.rs:560-572 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_datafusion/src/dataframe_query_common.rs:315\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_common.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c68c3a0404215e913eac85f6ae957edd21de3e56613a343bf680ea0c73d92b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/store/dl_lenses_core/src/selector/parser.rs:505-518 | crates/store/dl_lenses_core/src/selector/parser.rs:610-623 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_lenses_core/src/selector/parser.rs:505\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/selector/parser.rs"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca6794cd4a9c8dee7b05b75028845d55f8ab07b0e503f4176634a28cab79f6d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/store/dl_mcap/src/parsers/ros2msg/std_msgs/float64_array.rs:33-46 | crates/store/dl_mcap/src/parsers/ros2msg/std_msgs/float64_multi_array.rs:33-46 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/parsers/ros2msg/std_msgs/float64_array.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6d14396497430a9f31df387edc184bdb5fe8d3b5d61c5c2b88d112ba75668e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/store/dl_query/src/latest_at.rs:106-119 | crates/store/dl_query/src/latest_at.rs:170-182 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/latest_at.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"780d7a8d009ce16d41f9eb51d42c0b7cf94167393c58a6fee0df19d1a6870ddf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201314 lines \u00D7 2): crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:438-447 | crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:464-477 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:438\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"88801846550ebb04a69a58cdc592cca7db25e26f78e1ef570904e6996acdd05c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/utils/dl_perf_telemetry/src/prometheus.rs:277-290 | crates/utils/dl_perf_telemetry/src/prometheus.rs:452-465 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/utils/dl_perf_telemetry/src/prometheus.rs:277\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_perf_telemetry/src/prometheus.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"7038beaf5c18b62574a7cd3c6bad17b5cb5527c959d4198658a52a3cda6871ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/viewer/dl_time_panel/src/time_panel.rs:913-926 | crates/viewer/dl_time_panel/src/time_panel.rs:1107-1118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_time_panel/src/time_panel.rs:913\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_panel/src/time_panel.rs"},"region":{"startLine":913}}}],"partialFingerprints":{"codehealthFindingId/v1":"58e7aa1d162b220f3a4ace24f6bb6835b5270a4ef6ac69e59770f7ae62364dcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/viewer/dl_view_map/src/map_view.rs:636-649 | crates/viewer/dl_view_spatial/src/picking.rs:214-227 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_map/src/map_view.rs:636\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_map/src/map_view.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"e19835aad6b24551d5cbfa8dac2df8a42395b33e1b468ad45e5d837b7011801f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): crates/viewer/dl_view_spatial/src/view_3d.rs:585-596 | crates/viewer/dl_view_text_log/src/view_class.rs:498-511 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/view_3d.rs:585\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/view_3d.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"812d9ae75da49188ab94571cf57b9de60f24b97a06bfa32b88ab42aef5fce04f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/viewer/dl_view_spatial/src/visualizers/assets3d.rs:76-89 | crates/viewer/dl_view_spatial/src/visualizers/meshes.rs:78-91 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/visualizers/assets3d.rs:76\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/assets3d.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"9803c71e63abc549c9f8c15708cc48df50b0663bc42e030bcace9c24cfc2861d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201314 lines \u00D7 2): crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs:146-153 | crates/viewer/dl_view_spatial/src/visualizers/ellipsoids.rs:149-162 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/ellipsoids.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 63 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs:146\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"689eb4c296a284b332164105eae0ade533121847e62d6a2ac9dafeb4e3586c8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/viewer/dl_view_spatial/src/visualizers/gaussian_splats3d.rs:409-422 | crates/viewer/dl_view_spatial/src/visualizers/points3d.rs:448-460 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/visualizers/gaussian_splats3d.rs:409\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"crates/viewer/dl_view_spatial/src/visualizers/gaussian_splats3d.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ec343214ef22a5c982d98d9baa22eb3d371a7a8c5820e0145dfc759f09adfe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:265-278 | crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:310-323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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, \u0060crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:280\u0060 calls \u0060blueprint_timepoint_for_writes\u0060 and \u0060crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:325\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/blueprint_helpers.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"66868ffb4cc9267f66f87b211888d9eff81ec3163b2aab9189717a642faaba07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/viewer/dl_viewer_context/src/tensor/image_stats.rs:84-97 | crates/viewer/dl_viewer_context/src/tensor/tensor_stats.rs:80-93 \u2014 before extracting anything, compare \u0060crates/viewer/dl_viewer_context/src/tensor/image_stats.rs\u0060 and \u0060crates/viewer/dl_viewer_context/src/tensor/tensor_stats.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 \u0060crates/viewer/dl_viewer_context/src/tensor/image_stats.rs:84\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/tensor/image_stats.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc8c7a2b46d4c2a5b9fb9c601d9d062f385733c3a63ea96cf255e1d1f689825"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): dalaran_py/src/catalog/connection_handle.rs:469-480 | dalaran_py/src/catalog/registration_handle.rs:186-199 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060dalaran_py/src/catalog/connection_handle.rs:469\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/catalog/connection_handle.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb0e9ea8864f53c98da86b9ac500b1867434af085d6d9c981907a8f1e4feb8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): dalaran_py/src/catalog/dataset_entry.rs:246-259 | dalaran_py/src/catalog/dataset_entry.rs:270-283 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060dalaran_py/src/catalog/dataset_entry.rs:246\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/catalog/dataset_entry.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04a066a2fbc04339bb23537d8b80f9ff8f57c49a24dcc73fe201e6c9052845b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 5): crates/store/dl_log_encoding/src/dlr/footer/hub_dlr_manifest.rs:186-197 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1600-1612 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1626-1638 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1654-1666 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1684-1696 \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 \u0060crates/store/dl_log_encoding/src/dlr/footer/hub_dlr_manifest.rs:186\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/hub_dlr_manifest.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b97cc3758d98d067d93d1978697ca4db25e62a0ec5403c12ce4bd98e71a7f6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 4): crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:209-221 | crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs:141-152 | crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:213-224 | crates/viewer/dl_view_spatial/src/visualizers/ellipsoids.rs:143-155 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/boxes3d.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 \u0060crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:209\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"c531d6584fa246a97c7622c806631a7564766f08f6afe6be32d5d9fa0281a172"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:112-124 | crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:254-266 | crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:305-317 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:112\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"06c1a7befe5b045841b0291b068e50d95c9f138a9eeb3de93bc97a6cc66063f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/store/dl_chunk_store/src/writes.rs:1119-1131 | crates/store/dl_chunk_store/src/writes.rs:1151-1163 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_chunk_store/src/writes.rs:1119\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/writes.rs"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb88bd1ac2d615bb24c72552b12a2bfb3977e5c2a44698dc1b1302cf1f1f388"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/store/dl_dataframe/src/query.rs:1869-1881 | crates/store/dl_dataframe/src/query.rs:2326-2338 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_dataframe/src/query.rs:1869\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":1869}}}],"partialFingerprints":{"codehealthFindingId/v1":"444e57a0a7428e3de9767215b1b7cc8e73788b01c704b4a0d168b052fea2ed29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/store/dl_importer/src/lerobot/common.rs:130-141 | crates/store/dl_importer/src/lerobot/common.rs:162-174 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_importer/src/lerobot/common.rs:130\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/lerobot/common.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c3594bf5ab7de4bc343caa526e3efa808d58094ff5529dc5b91892a0895fbf0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/store/dl_log_channel/src/receiver_set.rs:137-149 | crates/store/dl_log_channel/src/receiver_set.rs:173-185 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_channel/src/receiver_set.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e605db564ea8063c28fdf5ec1fbf5ebc8b5825ece29f8d9a8a5c51f2663b559"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1434-1446 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1472-1484 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1434\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1432\u0060 calls \u0060Some\u0060, \u0060to_owned\u0060 and \u0060crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1470\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86a8f58c84fce29ceb6555a03567681827c811329b1b405e7c9e2fd869a5ca2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/store/dl_log_types/src/index/time_point.rs:210-221 | crates/store/dl_log_types/src/index/time_point.rs:227-239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/index/time_point.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"431856063a7cd416ba0f2b08c8f462bed7e331cd05de2a508468263ed0a9a9f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/image.rs:98-110 | crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/nav_sat_fix.rs:93-105 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/image.rs:98\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/image.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"c45a4359e0af850d1d96500bdb5cc9f87061a9b9217b7a9d9cbcca4c1c007e57"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/store/dl_sorbet/src/column_kind.rs:48-60 | crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:68-80 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_sorbet/src/column_kind.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":"crates/store/dl_sorbet/src/column_kind.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5602315b61d7337d774a12bd70b0e1de9ea23a399cda76013c808959b9b4b47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/viewer/dl_chunk_store_ui/src/chunk_store_ui.rs:477-489 | crates/viewer/dl_chunk_store_ui/src/chunk_ui.rs:205-217 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_chunk_store_ui/src/chunk_store_ui.rs:477\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_chunk_store_ui/src/chunk_store_ui.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"31e612c7dcbbe178db1f1a5dc34a140bec275df455747c0e951dcce5c6d1c050"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201313 lines \u00D7 2): crates/viewer/dl_data_ui/src/video_ui.rs:833-845 | crates/viewer/dl_data_ui/src/video_ui.rs:869-877 \u2014 both copies are in the same file, so extract the block 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":"crates/viewer/dl_data_ui/src/video_ui.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb0be33d9f6e686b414ab863a6ea330d6a54d1c2b5bcc0daa0011c55c75fed1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:496-508 | crates/viewer/dl_renderer/src/renderer/rectangles.rs:820-832 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:496\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/depth_cloud.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"117e1ddccbf34b12642fb2bd6a7fdd9c745ab1103aee0b87960d191190f9c830"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/viewer/dl_selection_panel/src/selection_panel.rs:714-726 | crates/viewer/dl_selection_panel/src/visualizer_ui.rs:1246-1258 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_selection_panel/src/selection_panel.rs:714\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/selection_panel.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"780c989bcf84cfbe50e9c18714cb5ee9914a227425023a67eb74e2c6fd707844"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/viewer/dl_ui/src/command/recording_command.rs:298-310 | crates/viewer/dl_ui/src/command/ui_command.rs:265-277 \u2014 before extracting anything, compare \u0060crates/viewer/dl_ui/src/command/recording_command.rs\u0060 and \u0060crates/viewer/dl_ui/src/command/ui_command.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_ui/src/command/recording_command.rs:298\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/command/recording_command.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b352b4ab0d24aadd3027661c0ea0f9d1610bc7bc42c5059d8097f3315e8a3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/viewer/dl_ui/src/list_item/label_content.rs:218-229 | crates/viewer/dl_ui/src/list_item/property_content.rs:273-285 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/list_item/label_content.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"bab9737615844677f24f1609f780030a0c6aee5413c533e1db0bb27fedc705af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/viewer/dl_view/src/clears.rs:39-51 | crates/viewer/dl_view/src/clears.rs:66-78 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view/src/clears.rs:39\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/viewer/dl_view/src/clears.rs:65\u0060 calls \u0060unwrap_or_default\u0060 and \u0060crates/viewer/dl_view/src/clears.rs:38\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":"crates/viewer/dl_view/src/clears.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"21002f9e4ef65fed9f21363bad2332b5b0fc69c511d04a2871a36c134c808b4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/viewer/dl_view_spatial/src/visualizers/cylinders3d.rs:86-98 | crates/viewer/dl_view_spatial/src/visualizers/ellipsoids.rs:58-70 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_spatial/src/visualizers/cylinders3d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/ellipsoids.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/visualizers/cylinders3d.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":"crates/viewer/dl_view_spatial/src/visualizers/cylinders3d.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"2316c623ea90dd956f11fed7cb2b128f1e3036e38c6d7d58e7e083bf151bfffc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/viewer/dl_view_state_timeline/src/view_class.rs:1127-1138 | crates/viewer/dl_view_state_timeline/src/view_class.rs:1157-1169 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_state_timeline/src/view_class.rs:1127\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_state_timeline/src/view_class.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e4da2fcee77725e9b4ed36a67d611cec3632bafea381385ed33dd7b404de04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:450-463 | crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:292-304 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_time_series/src/line_visualizer_system.rs\u0060 and \u0060crates/viewer/dl_view_time_series/src/point_visualizer_system.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:450\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/line_visualizer_system.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"738497437fb8f1448b338df869a95e792caaa95668b9c2e4f9b3f8918e6da94b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/viewer/dl_viewer/src/ui/dev_panel/server_streaming_tab.rs:533-544 | crates/viewer/dl_viewer/src/ui/dev_panel/server_streaming_tab.rs:558-570 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_viewer/src/ui/dev_panel/server_streaming_tab.rs:533\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"crates/viewer/dl_viewer/src/ui/dev_panel/server_streaming_tab.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd3af27eb2e8b1cb14dc153fea3b4d4ed43c30791c21b14cfd7d1c05a2fb1aa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): crates/viewer/dl_viewer/src/ui/share_modal.rs:302-311 | crates/viewer/dl_viewer/src/ui/share_modal.rs:330-342 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_viewer/src/ui/share_modal.rs:302\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/share_modal.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaad6076d6fa5bdd37906adc7735a075e2fca70f29f12c5f657ce99f33551e96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): dalaran_py/src/trace_context.rs:101-113 | dalaran_py/src/tracing_session.rs:78-89 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/trace_context.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50457c16f73b42c9c4c8c02bf3939979df58e449da69499b35e8e0574587475"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): docs/snippets/all/archetypes/state_change.rs:7-17 | docs/snippets/all/archetypes/state_configuration.rs:15-27 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/snippets/all/archetypes/state_change.rs:7\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/state_change.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"aacf909bf423884af17c0e257df1a382226a416687317d804ca3b86677ae1471"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): docs/snippets/all/archetypes/transform3d_column_updates.rs:8-20 | docs/snippets/all/archetypes/transform3d_row_updates.rs:8-20 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/snippets/all/archetypes/transform3d_column_updates.rs:8\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/transform3d_column_updates.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6f94cca542b8c70c8f35c21c402d522917fe71f7c89841afcb64d4a52dfc2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 6): crates/utils/dl_perf_telemetry/src/prometheus.rs:213-224 | crates/utils/dl_perf_telemetry/src/prometheus.rs:243-252 | crates/utils/dl_perf_telemetry/src/prometheus.rs:270-280 | crates/utils/dl_perf_telemetry/src/prometheus.rs:388-399 | crates/utils/dl_perf_telemetry/src/prometheus.rs:418-427 | crates/utils/dl_perf_telemetry/src/prometheus.rs:445-455 \u2014 all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/utils/dl_perf_telemetry/src/prometheus.rs:213\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_perf_telemetry/src/prometheus.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97fbed21b0dfff1c497b8c5cce08f43819e385141409d605b8b066406e67884"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/store/dl_chunk_store/src/query.rs:198-209 | crates/store/dl_chunk_store/src/query.rs:247-258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_chunk_store/src/query.rs:198\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/query.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"98ff38d4b434d3adbc4732a41893e11783cde6db8b51f8b3b70e3568b0d92724"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/store/dl_entity_db/src/dlr_manifest_index/time_range_merger.rs:406-417 | crates/store/dl_entity_db/src/dlr_manifest_index/time_range_merger.rs:428-439 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_entity_db/src/dlr_manifest_index/time_range_merger.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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/dlr_manifest_index/time_range_merger.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ddca7c2ab8afc4d64cdbb891d72c7e3da3d0b08aaf665bcd56d623646e8550"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/store/dl_log_types/src/index/time_real.rs:110-121 | crates/store/dl_log_types/src/index/time_real.rs:128-139 \u2014 both copies are in the same file, so extract the block 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 \u0060value\u0060 to \u0060f32\u0060 in one and \u0060f64\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/index/time_real.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9d7609d941b01eaffcdc5169df613b3c5b46f3a79aad8cdb30c6ed376a3908b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joint_state.rs:39-50 | crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joy.rs:35-44 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joint_state.rs:39\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joint_state.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"cedf87d3cf46f84e22935d971739be55f47ca8545d7676eb7ef4039f0fa8ff88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/top/dalaran/src/commands/dlr/merge_optimize.rs:492-502 | crates/top/dalaran/src/commands/dlr/stats.rs:170-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 \u0060crates/top/dalaran/src/commands/dlr/merge_optimize.rs:492\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/merge_optimize.rs"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"1160afe50e9177e0e2003fa04a8fa0e77e0aa4f529930ffe4ca51c2ea021f60b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/top/dalaran/src/commands/dlr/merge_optimize.rs:497-507 | crates/top/dalaran/src/commands/dlr/split.rs:181-192 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/top/dalaran/src/commands/dlr/merge_optimize.rs:497\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/merge_optimize.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb48294c660432901f35dfae01e2896c85a8410646a55ed72c6993b9dac5b5a5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 2): crates/utils/dl_perf_telemetry/src/prometheus.rs:301-312 | crates/utils/dl_perf_telemetry/src/prometheus.rs:363-370 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/utils/dl_perf_telemetry/src/prometheus.rs:301\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_perf_telemetry/src/prometheus.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f45d739e39e74431866dfcf5d98686fcefd696c4e472c6fe0d38bf0979335dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/viewer/dl_data_ui/src/item_ui.rs:714-725 | crates/viewer/dl_recording_panel/src/recording_panel_ui.rs:755-764 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_data_ui/src/item_ui.rs:714\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/item_ui.rs"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f9b3506879896d0bd972e0d9abdf777b84c610b73677472cf9b4720ce11af1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/viewer/dl_renderer/src/colormap.rs:113-124 | crates/viewer/dl_renderer/src/colormap.rs:157-168 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/colormap.rs:113\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/colormap.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd3bfd667d511b4d4b324d442f507c718923e2f1d4f60e3a7f210987c676b5b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:566-577 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:561-572 \u2014 before extracting anything, compare \u0060crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs\u0060 and \u0060crates/viewer/dl_renderer/src/renderer/point_cloud.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:566\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"3870f7a1770540b1feab01e3d4857811c2afddfa3a13f8a57cd6e80e2f574198"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/viewer/dl_view_spatial/src/eye.rs:582-593 | crates/viewer/dl_view_spatial/src/eye.rs:633-644 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/eye.rs"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"c17f1364ce74329f65d9f696cfdc1772ac58fd65e775f649f1b67a0415f632a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): crates/viewer/dl_view_spatial/src/ui_2d.rs:338-348 | crates/viewer/dl_view_spatial/src/ui_3d.rs:151-162 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/ui_2d.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b020989f029deceae07b9ef52574e5bed9c2865e64ad0623b6a3ed0fcee7334"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:94-106 | crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs:92-103 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:94\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1fc7f3b357d4199fd7b7ffb380d312da9b1979ff7ddca2f9a80ca22189e392"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:71-82 | crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:80-91 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs\u0060 as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 156 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:71\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0148cb4ee534a421e535f30c5464992be4368ae506616c8e56d3392eb2d4415d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): crates/viewer/dl_viewer_context/src/app_context.rs:434-445 | crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:171-180 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/app_context.rs"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f089fd208d9958a2ade23e9ab6e72e4d989ca8e67432f3cc7a825f49d02454"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/viewer/dl_viewer_context/src/selection_state.rs:207-218 | crates/viewer/dl_viewer_context/src/selection_state.rs:228-239 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_viewer_context/src/selection_state.rs:207\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/selection_state.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"afcbe1049b6aef98b7b19afd8fb2e51facc1db694aeff0e13854290e237d04ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u201312 lines \u00D7 3): docs/snippets/all/archetypes/scalars_multiple_plots.rs:38-49 | docs/snippets/all/archetypes/series_lines_style.rs:26-37 | docs/snippets/all/archetypes/series_points_style.rs:26-29 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function 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 \u0060docs/snippets/all/archetypes/scalars_multiple_plots.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. 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":"docs/snippets/all/archetypes/scalars_multiple_plots.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"2316b4a665586e299a1a112be8770b059ef71769142f2d4a8d87ace16cd3c11d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): docs/snippets/all/tutorials/any_values.rs:22-33 | docs/snippets/all/tutorials/dynamic_archetype.rs:23-34 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/snippets/all/tutorials/any_values.rs:22\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/tutorials/any_values.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee74ce20d2f406b627943d862857cd727968804197b4a219cbeed05388d36964"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 11): crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:250-260 | crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs:252-262 | crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:263-273 | crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs:217-224 | crates/viewer/dl_view_spatial/src/visualizers/capsules3d.rs:242-249 | crates/viewer/dl_view_spatial/src/visualizers/cylinders3d.rs:238-245 | crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:268-278 | crates/viewer/dl_view_spatial/src/visualizers/ellipsoids.rs:218-225 | crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs:238-248 | crates/viewer/dl_view_spatial/src/visualizers/lines3d.rs:249-259 | crates/viewer/dl_view_spatial/src/visualizers/points2d.rs:292-302 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:250\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. 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, \u0060crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:266\u0060 calls \u0060map_or\u0060, \u0060cast_slice\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:248\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4b28e5b146dfb133934e0110d5ebdf19324665df5df205ca1c7142c7e166e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 4): crates/viewer/dl_renderer/src/renderer/debug_overlay.rs:245-254 | crates/viewer/dl_renderer/src/renderer/generic_skybox.rs:174-183 | crates/viewer/dl_renderer/src/renderer/world_grid.rs:198-207 | crates/viewer/dl_renderer/src/resource_managers/yuv_converter.rs:555-565 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/renderer/generic_skybox.rs:174\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/debug_overlay.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9e262df4da8e5cb70c5fbaa0113296690f473c48307d7181023e3b84fb1e7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs:827-838 | crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs:898-909 | crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs:984-995 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"6945fa810f7aecc5254d4a88c4e11d3a0952e46e04ef6ce3ab2eead4a17884b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:700-710 | crates/viewer/dl_renderer/src/renderer/lines.rs:687-697 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:714-724 \u2014 before extracting anything, compare \u0060crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs\u0060 and \u0060crates/viewer/dl_renderer/src/renderer/lines.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:700\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52f6f7b54d35d918d5b4a719bee8d487a8ad20dc59edd4c20df4ecfa8fba65f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/store/dl_chunk_store/src/writes.rs:141-151 | crates/store/dl_chunk_store/src/writes.rs:163-173 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_chunk_store/src/writes.rs:141\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/writes.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0db2aa99e22277b7efa6e161d199ab0c5ede45ccf428260fce02f82c7ddff73"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/store/dl_importer/src/importer_dlr.rs:56-66 | crates/store/dl_importer/src/importer_dlr.rs:86-96 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_importer/src/importer_dlr.rs:56\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/store/dl_importer/src/importer_dlr.rs:67\u0060 calls \u0060clone\u0060 and \u0060crates/store/dl_importer/src/importer_dlr.rs:97\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_dlr.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"49362bd4aa245298942090bef58ab114f5f74f94ca75938b247cf8392381aa07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/store/dl_importer/src/lerobot/common.rs:145-155 | crates/store/dl_importer/src/lerobot/common.rs:179-189 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_importer/src/lerobot/common.rs:145\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/lerobot/common.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d1c5a47c2e0b787fb12584ceac351ecab429da6bcbf01b5a9695b7ab25ef3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/store/dl_importer/src/lerobot/datasetv2.rs:296-306 | crates/store/dl_importer/src/lerobot/datasetv3.rs:1300-1310 \u2014 before extracting anything, compare \u0060crates/store/dl_importer/src/lerobot/datasetv2.rs\u0060 and \u0060crates/store/dl_importer/src/lerobot/datasetv3.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/lerobot/datasetv2.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc424f469d1dcd1f430d1064c6302fd251cd89eceae05e2303e8334f831965e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/top/dalaran/src/commands/mcap/check.rs:48-58 | crates/top/dalaran/src/commands/mcap/info.rs:24-34 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/mcap/check.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b939e6b6bf27addd0355591de9d5dea33942ce478bc1cb1050863d68e9fb308a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/top/dl_sdk/src/recording_stream.rs:1843-1853 | crates/top/dl_sdk/src/recording_stream.rs:1866-1876 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/top/dl_sdk/src/recording_stream.rs:1843\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/recording_stream.rs"},"region":{"startLine":1843}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0621b62a449e1df7b94482a1e70843a61291767cae9e9445e162b45b0122c7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/viewer/dl_data_ui/src/item_ui.rs:554-564 | crates/viewer/dl_data_ui/src/item_ui.rs:575-585 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_data_ui/src/item_ui.rs:554\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/item_ui.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7aab27be056b13b78c018eb6b178fef32da9c4b46299e387bff8d5ad5045ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/viewer/dl_data_ui/src/video_ui.rs:854-864 | crates/viewer/dl_data_ui/src/video_ui.rs:886-896 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_data_ui/src/video_ui.rs:854\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/video_ui.rs"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"9785afd127c729a3aa4394ca86237b58f5922bb5af8b7807bbdc5092c9536cae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/viewer/dl_renderer/src/device_caps.rs:400-410 | crates/viewer/dl_renderer/src/device_caps.rs:467-477 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/device_caps.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":"crates/viewer/dl_renderer/src/device_caps.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e41408e001b58e072038c77afa5e8aefb5f7e3cf6e0aed248c5edf556c2f3d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/viewer/dl_renderer/src/draw_phases/outlines.rs:307-317 | crates/viewer/dl_renderer/src/renderer/compositor.rs:190-202 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/draw_phases/outlines.rs:307\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/draw_phases/outlines.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"848040014fef28bf5355994eb1e46b47d07a6f3186687bf1acdfaeaf7290598a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/viewer/dl_renderer/src/renderer/lines.rs:744-754 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:802-812 \u2014 before extracting anything, compare \u0060crates/viewer/dl_renderer/src/renderer/lines.rs\u0060 and \u0060crates/viewer/dl_renderer/src/renderer/point_cloud.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 113 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/renderer/lines.rs:744\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/lines.rs"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c04082621667c828a1a5df2d63515d1eea1df221a7f064f721debe65115ba2d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/viewer/dl_view_time_series/src/aggregation.rs:41-51 | crates/viewer/dl_view_time_series/src/aggregation.rs:141-151 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_time_series/src/aggregation.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":"crates/viewer/dl_view_time_series/src/aggregation.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"596430b720b9436b7293758e350fa00bec94c1111d0ffe5e175a27c52a54900e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/viewer/dl_view_time_series/src/series_query.rs:261-271 | crates/viewer/dl_view_time_series/src/series_query.rs:395-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 \u0060crates/viewer/dl_view_time_series/src/series_query.rs:261\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/series_query.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a3eec9499276d5609d94e0472af0d9b8d1b2ac2cfef0718e2ca2a65a9116ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/viewer/dl_viewer_context/src/image_info.rs:75-85 | crates/viewer/dl_viewer_context/src/image_info.rs:114-124 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_viewer_context/src/image_info.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":"crates/viewer/dl_viewer_context/src/image_info.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd12587c6dd13080e70dabea71d173aa39fe97cc6e99c6e52268eb6fa92bae9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): crates/viewer/dl_viewer_context/src/image_info.rs:398-410 | crates/viewer/dl_viewer_context/src/image_info.rs:413-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_viewer_context/src/image_info.rs:413\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/image_info.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"b143020e78b98b2229d84b18293f36088dec585cae622ec3764bb6dc6848de33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): docs/snippets/all/archetypes/capsules3d_batch.rs:29-39 | docs/snippets/all/archetypes/cylinders3d_batch.rs:29-39 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/snippets/all/archetypes/capsules3d_batch.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":"docs/snippets/all/archetypes/capsules3d_batch.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e5f03c065893740d639c6bd0dc6c91d681762b43eb549b2e117d4689806f39"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): docs/snippets/all/descriptors/descr_builtin_component.rs:62-72 | docs/snippets/all/descriptors/descr_custom_component.rs:57-67 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/snippets/all/descriptors/descr_builtin_component.rs:62\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/descriptors/descr_builtin_component.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"5074631ed8b5f0d0424a297f5b9ac820f7d1d1b40f343b28cdcd9794cdf7b29d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/store/dl_chunk/src/unit_chunk.rs:101-110 | crates/store/dl_chunk/src/unit_chunk.rs:154-163 | crates/store/dl_chunk/src/unit_chunk.rs:391-400 | crates/store/dl_chunk/src/unit_chunk.rs:434-443 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_chunk/src/unit_chunk.rs:101\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/unit_chunk.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"16650f961ada0be35d67724396b45c10e925b6d5b5029c5a707c126ea1c3805e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:455-464 | crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:789-798 | crates/viewer/dl_renderer/src/renderer/lines.rs:759-768 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:817-826 \u2014 before extracting anything, compare \u0060crates/viewer/dl_renderer/src/renderer/depth_cloud.rs\u0060 and \u0060crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:455\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/depth_cloud.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dab06f5dd29f7e618021baa1593e47ec8e333073b8d7bf69ce188971d601b9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 4): crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:212-221 | crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs:214-223 | crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:216-225 | crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:219-228 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:212\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d821c462d801d0d36a95361e0dbb430d2ea3dacd94faae7f947ce3da2c4cc22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/utils/dl_perf_telemetry/src/prometheus.rs:299-308 | crates/utils/dl_perf_telemetry/src/prometheus.rs:330-339 | crates/utils/dl_perf_telemetry/src/prometheus.rs:361-370 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/utils/dl_perf_telemetry/src/prometheus.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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/utils/dl_perf_telemetry/src/prometheus.rs:340\u0060 calls \u0060value\u0060 and \u0060crates/utils/dl_perf_telemetry/src/prometheus.rs:311\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":"crates/utils/dl_perf_telemetry/src/prometheus.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d30f817b1caedba981089e4d70322e482bf69ac009b17588384d9614d98c4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/viewer/dl_view_spatial/src/caches/mesh_cache.rs:141-150 | crates/viewer/dl_view_spatial/src/proc_mesh.rs:508-517 | crates/viewer/dl_viewer_context/src/cache/image_decode_cache.rs:222-231 \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 \u0060crates/viewer/dl_view_spatial/src/caches/mesh_cache.rs:141\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/caches/mesh_cache.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b26ac66cf5de5e34937cb83ffcfb77ca78fa1b82d0afb51cd48e8ad98ee811"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:69-78 | crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs:66-75 | crates/viewer/dl_view_spatial/src/visualizers/lines3d.rs:67-76 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs\u0060 as WHOLE FILES: this scan already matched 4 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 \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:69\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b843850e8546d3c9985d4bd0be20b09dd4df1163782d609609519f3fc8c849e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/store/dl_chunk/src/unit_chunk.rs:77-86 | crates/store/dl_chunk/src/unit_chunk.rs:368-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 \u0060crates/store/dl_chunk/src/unit_chunk.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":"crates/store/dl_chunk/src/unit_chunk.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1301ed43c885437f390d1dc50bcd939d398acaa7e40541a272c9f10b8fc24550"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/store/dl_chunk/src/unit_chunk.rs:131-140 | crates/store/dl_chunk/src/unit_chunk.rs:413-422 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_chunk/src/unit_chunk.rs:131\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/unit_chunk.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"785135861104eed0bfc1e7e04a6232e0979823f76fc1e2902d918ddca795cdf5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/store/dl_chunk_store/src/events.rs:52-61 | crates/store/dl_chunk_store/src/events.rs:402-411 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/events.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff753e2e6d64fd6efcc75017e697fc7956d4ab13a14d90655ee0c6398fa3bd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:448-457 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:811-820 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:448\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a3ed19adbbaefabe3118ae148c7fdc8e942d5d1c4cdec882b8ad1970ffc57e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/store/dl_tf/src/transform_resolution_cache/cache.rs:314-323 | crates/store/dl_tf/src/transform_resolution_cache/cache.rs:379-390 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_tf/src/transform_resolution_cache/cache.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":"crates/store/dl_tf/src/transform_resolution_cache/cache.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9c5945057f2741cd0e0c7a3294cd2f81126bc111cfd545edc9cfb1a0acb8c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:179-188 | crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:214-223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs:179\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_resolution_cache/cached_transforms_for_timeline.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc79977fea3da5d13b2553ccaccd6cdfee30cf4727f1297cadc1a2d3bb1eae2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/top/dalaran/src/commands/doctor/recording.rs:39-46 | crates/top/dalaran/src/commands/doctor/recording.rs:95-104 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/doctor/recording.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6b121565bbd0b7e2ddd532b9815b6aad80b6108e5c40a51883e63ac78e07ee8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/top/dalaran/src/commands/entrypoint.rs:1566-1575 | crates/top/dalaran/src/commands/entrypoint.rs:1581-1590 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/entrypoint.rs"},"region":{"startLine":1566}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a14695981508ffd84428a0116912dff4780638f62187bd93d2518caaba4e6b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/top/dalaran/src/demo_util.rs:119-128 | crates/viewer/dl_renderer/src/colormap.rs:250-259 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/top/dalaran/src/demo_util.rs:119\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/demo_util.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd533f921ce849fbee1c1067f4b875b4a4732221840ca95e2827a8c4d99f7c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u201310 lines \u00D7 3): crates/utils/dl_format/src/duration.rs:129-133 | crates/utils/dl_format/src/duration.rs:135-144 | crates/utils/dl_format/src/duration.rs:147-157 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/utils/dl_format/src/duration.rs:129\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/utils/dl_format/src/duration.rs:146\u0060 calls \u0060push\u0060, \u0060to_string\u0060 and \u0060crates/utils/dl_format/src/duration.rs:159\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_format/src/duration.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ed4f7543bd040a6ed838c3d8d218d228b3fd258fc0d25804d671f3e483bb98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/viewer/dl_blueprint_tree/src/data.rs:422-431 | crates/viewer/dl_blueprint_tree/src/data.rs:446-456 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_blueprint_tree/src/data.rs:422\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"crates/viewer/dl_blueprint_tree/src/data.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"26ed0a1a83a1e0698f0db4b2b2e90edc51e3548673ff4fa2083b8806b47c5308"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/viewer/dl_context_menu/src/actions/show_hide.rs:18-27 | crates/viewer/dl_context_menu/src/actions/show_hide.rs:77-87 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_context_menu/src/actions/show_hide.rs:18\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_context_menu/src/actions/show_hide.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"381be95ecc5325e8e5f787009e07d6d54f02e6174db3abe92dd774c9f0e3a055"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:718-743 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:731-756 \u2014 before extracting anything, compare \u0060crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs\u0060 and \u0060crates/viewer/dl_renderer/src/renderer/point_cloud.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:718\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6294fb4a1a3cbec8cecf85f32bb89235f692bb348c2930a0f30ba2643b13cfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs:223-232 | crates/viewer/dl_view_spatial/src/visualizers/lines3d.rs:234-243 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/lines3d.rs\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 106 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/visualizers/lines2d.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":"crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"645894c42b14eef8a55c37c8cf977e7eced6ef229e05cd48fe1a3aa10bf1c452"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:116-125 | crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:114-123 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_time_series/src/line_visualizer_system.rs\u0060 and \u0060crates/viewer/dl_view_time_series/src/point_visualizer_system.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/line_visualizer_system.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"580099ba868c0c338aff2fb14aa9522d6574282beb9de91f68d7b2721dd74458"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/viewer/dl_viewer/src/app/logic.rs:72-81 | crates/viewer/dl_viewer/src/app/mod.rs:1461-1470 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/logic.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee8ca2d5ede61fd2831acced8c87e1a88de0b4298356cb91e56f69f4b0c7ef7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): crates/viewer/dl_viewer_context/src/component_ui_registry.rs:224-233 | crates/viewer/dl_viewer_context/src/component_ui_registry.rs:361-368 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_viewer_context/src/component_ui_registry.rs:224\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/component_ui_registry.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"0395f6c492325c554294ea8b933dbe861a2a0ea7fe9bd52358174d920caf7253"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): dalaran_py/src/catalog/dataset_entry.rs:107-116 | dalaran_py/src/catalog/dataset_entry.rs:122-131 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060dalaran_py/src/catalog/dataset_entry.rs:107\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/catalog/dataset_entry.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a7708637709e658b8af9bc5ef330e238fc3f00f9ddb00f0a24d85ce73bded20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): dalaran_py/src/python_bridge.rs:1581-1590 | dalaran_py/src/python_bridge.rs:1612-1621 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060dalaran_py/src/python_bridge.rs:1581\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/python_bridge.rs"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"87693c1b468616081a310a40e8cd38da3b49c0b0d3a826da1adf5f5fdbc531af"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): docs/snippets/all/archetypes/graph_directed.rs:6-15 | docs/snippets/all/archetypes/graph_undirected.rs:6-15 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/snippets/all/archetypes/graph_directed.rs:6\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/graph_directed.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a6877d60061a4aaaf8c52e9a4a3d4ce796e65c2c86717b74ec27147f1a5d47"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/store/dl_sdk_types/src/archetypes/gaussian_splats3d_ext.rs:138-146 | crates/store/dl_sdk_types/src/archetypes/points3d_ext.rs:50-58 | crates/store/dl_sdk_types/src/archetypes/points3d_ext.rs:70-79 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_sdk_types/src/archetypes/gaussian_splats3d_ext.rs:138\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sdk_types/src/archetypes/gaussian_splats3d_ext.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c7797c2e1a5ef0735e6edec4061e468227c2e8547eb5cc11e189801289e975"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/viewer/dl_selection_panel/src/selection_panel.rs:711-720 | crates/viewer/dl_selection_panel/src/visualizer_ui.rs:1244-1252 | crates/viewer/dl_view/src/component_drop.rs:259-267 \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 \u0060crates/viewer/dl_selection_panel/src/selection_panel.rs:711\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/selection_panel.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d50cc5537c08e535d1fa8a5612bf1e2ecdb199015f370aa8bef0591ea23d5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/store/dl_dataframe/src/query.rs:1242-1250 | crates/store/dl_dataframe/src/query.rs:1722-1730 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61c90983853c3575af5baefcf4cb33f5cf527593241d5f8c58dd8f4bf568c8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/store/dl_entity_db/src/entity_db.rs:1148-1156 | crates/store/dl_entity_db/src/entity_db.rs:1171-1179 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_entity_db/src/entity_db.rs:1148\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/entity_db.rs"},"region":{"startLine":1148}}}],"partialFingerprints":{"codehealthFindingId/v1":"98433f17b7a596ac8232483c31233e10a269a6339b2397e69aba256f71c46f02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/store/dl_importer/src/lerobot/datasetv3.rs:1355-1363 | crates/store/dl_importer/src/lerobot/datasetv3.rs:1397-1405 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_importer/src/lerobot/datasetv3.rs:1355\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/lerobot/datasetv3.rs"},"region":{"startLine":1355}}}],"partialFingerprints":{"codehealthFindingId/v1":"da1c2bd8ac45230b6b0fe0c72d59be7a5d1f3f30f8d43b98df80a05920512c58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/store/dl_lenses/src/semantic/ros2msg/voxel_grid.rs:150-158 | crates/store/dl_lenses/src/semantic/ros2msg/voxel_grid.rs:174-182 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_lenses/src/semantic/ros2msg/voxel_grid.rs:150\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/src/semantic/ros2msg/voxel_grid.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"d937024d63dc1d0c334a473961cd34b3771ac6c00f2de6acafe813e21b721141"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/store/dl_lenses_core/src/selector/eval.rs:498-506 | crates/store/dl_lenses_core/src/selector/eval.rs:578-586 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_lenses_core/src/selector/eval.rs:498\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/selector/eval.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"46ef8e8f6b5a9b63b404c5adfe6ea19c35d54b96dc006129ba290b9c8faa1595"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/store/dl_lenses_core/src/selector/lexer.rs:122-130 | crates/store/dl_lenses_core/src/selector/lexer.rs:209-217 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_lenses_core/src/selector/lexer.rs:122\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/selector/lexer.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e406d8c506bca1dbc025cc2b8c9346d10afcd50b30f1512e473bc542de0da7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/store/dl_log_types/src/example_components.rs:210-219 | crates/store/dl_log_types/src/example_components.rs:315-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 \u0060crates/store/dl_log_types/src/example_components.rs:210\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/example_components.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b889c3709ed02796ad150a354085a455ce4930c18079420256ec5fb46e43050"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/utils/dl_arrow_util/src/format.rs:294-302 | crates/utils/dl_arrow_util/src/format.rs:349-357 \u2014 both copies are in the same file, so extract the block 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, \u0060crates/utils/dl_arrow_util/src/format.rs:291\u0060 calls \u0060format_dataframe_without_metadata\u0060, \u0060is_empty\u0060 and \u0060crates/utils/dl_arrow_util/src/format.rs:347\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_arrow_util/src/format.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fade4e0de6846cace330ebc6dbfd8255224554f1e23613576a232db675e707e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/utils/dl_auth/src/callback_server.rs:27-35 | crates/utils/dl_auth/src/callback_server.rs:70-78 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/utils/dl_auth/src/callback_server.rs:80\u0060 calls \u0060new_v4\u0060, \u0060to_string\u0060 and \u0060crates/utils/dl_auth/src/callback_server.rs:37\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":"crates/utils/dl_auth/src/callback_server.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"637555c4c4849375570a9a3b50bf0d2623c9ca95240f0dea5fa7a8e6bbfab89f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/utils/dl_auth/src/oauth/api.rs:76-84 | crates/utils/dl_auth/src/oauth/api.rs:101-109 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/utils/dl_auth/src/oauth/api.rs:76\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_auth/src/oauth/api.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52da8c5e5e3d32bff548f26d4722f6d62fc767e4c6c8bf42b4546d20be5c422"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/utils/dl_video/src/demux/mod.rs:365-373 | crates/utils/dl_video/src/demux/mod.rs:388-396 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/demux/mod.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb25adfa17ea19e9455def3203f073684e914fe00a42629b606c4591a68fe677"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/viewer/dl_chunk_store_ui/src/chunk_store_ui.rs:467-475 | crates/viewer/dl_chunk_store_ui/src/chunk_ui.rs:195-203 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_chunk_store_ui/src/chunk_store_ui.rs:467\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_chunk_store_ui/src/chunk_store_ui.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ac5c63a8e1deff3ac10f4ef59c443fc38095ef1fa038372df46bb36b0705e21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/viewer/dl_dataframe_ui/src/filters/filter.rs:144-152 | crates/viewer/dl_dataframe_ui/src/filters/filter.rs:155-163 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/filters/filter.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e173e0c255f98af6ac31b86fb959eb2923c7814e87651671b52e10b8ea663ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/viewer/dl_view_graph/src/ui/draw.rs:144-152 | crates/viewer/dl_view_graph/src/ui/draw.rs:172-180 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/viewer/dl_view_graph/src/ui/draw.rs:184\u0060 calls \u0060unwrap_or_else\u0060, \u0060text_color\u0060, \u0060gamma_multiply\u0060 and \u0060crates/viewer/dl_view_graph/src/ui/draw.rs:154\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_graph/src/ui/draw.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"0182a83390e9b2978522cef9fdb04d38b5dbe013e13e9edd13f11365ff3ce69d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/viewer/dl_view_graph/src/ui/draw.rs:365-373 | crates/viewer/dl_view_map/src/map_view.rs:508-516 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_graph/src/ui/draw.rs:365\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_graph/src/ui/draw.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"a18ae1cc4138b95e7f2bffbd040d88f6c1ba4b9b13df2dc25c893d4f7e0c78f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/viewer/dl_view_spatial/src/visualizers/points2d.rs:286-296 | crates/viewer/dl_view_spatial/src/visualizers/points3d.rs:500-510 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_spatial/src/visualizers/points2d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/points3d.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 70 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/points2d.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7847f93a737348f652a957a47c1e205235f1b9fd75e625258f973e922bb2e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:47-55 | crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:46-53 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_time_series/src/line_visualizer_system.rs\u0060 and \u0060crates/viewer/dl_view_time_series/src/point_visualizer_system.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 152 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_time_series/src/line_visualizer_system.rs:47\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/line_visualizer_system.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff66a233c52989e09b12b6e1f3c82ad93d73099f366c18901e746bf90d7a6d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/viewer/dl_viewer_context/src/item.rs:163-171 | crates/viewer/dl_viewer_context/src/item.rs:204-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_viewer_context/src/item.rs:163\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/item.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0551301dbcb424c4f6f90e096cf628531f6fb5da68ac26221a4c8bbd4cbc14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/viewer/dl_viewer_context/src/tensor/image_stats.rs:108-116 | crates/viewer/dl_viewer_context/src/tensor/tensor_stats.rs:104-111 \u2014 before extracting anything, compare \u0060crates/viewer/dl_viewer_context/src/tensor/image_stats.rs\u0060 and \u0060crates/viewer/dl_viewer_context/src/tensor/tensor_stats.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 \u0060crates/viewer/dl_viewer_context/src/tensor/image_stats.rs:108\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/tensor/image_stats.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2b426345f606cb23debc5b1abfe97172ce5fa33c9c465a1b8b864d826742f5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): docs/snippets/all/archetypes/line_strips3d_segments_simple.rs:6-14 | docs/snippets/all/archetypes/line_strips3d_simple.rs:5-13 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/snippets/all/archetypes/line_strips3d_segments_simple.rs:6\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/line_strips3d_segments_simple.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de281cd7b76567179aa5b411ff5cf05ce183c1517f897431ee3e7f641963f9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): docs/snippets/all/howto/any_batch_value_column_updates.rs:12-26 | docs/snippets/all/howto/any_values_column_updates.rs:14-28 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060docs/snippets/all/howto/any_batch_value_column_updates.rs:12\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/howto/any_batch_value_column_updates.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b85a3577ec8aa0de2873c0ee8c7872771ac1329eb432ac85859910a931543c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): docs/snippets/all/tutorials/dna.rs:68-76 | docs/snippets/all/tutorials/dna.rs:92-100 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/snippets/all/tutorials/dna.rs:68\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/tutorials/dna.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"128a65c8fa4d27eba221bac48a383f1e1765b9e80cc31c998787b9ece39fe49c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 7): crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:211-219 | crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs:213-221 | crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:215-222 | crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs:146-153 | crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:218-225 | crates/viewer/dl_view_spatial/src/visualizers/ellipsoids.rs:149-156 | crates/viewer/dl_view_spatial/src/visualizers/points2d.rs:244-252 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:211\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b25442e05861be90658543c17b1b81423e2ada038381b56e7af8ca7d359b688"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/store/dl_sorbet/src/migrations/v0_0_2__to__v0_1_0.rs:178-185 | crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:92-102 | crates/store/dl_sorbet/src/migrations/v0_1_2__to__v0_1_3.rs:63-72 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_sorbet/src/migrations/v0_0_2__to__v0_1_0.rs:178\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/migrations/v0_0_2__to__v0_1_0.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff8fe39197ea7094c4323ac09a16b0b7c335def55aa9a248464366fc025d6ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/utils/dl_auth/src/oauth/api.rs:45-52 | crates/utils/dl_auth/src/oauth/api.rs:74-81 | crates/utils/dl_auth/src/oauth/api.rs:99-106 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/utils/dl_auth/src/oauth/api.rs:45\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_auth/src/oauth/api.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cda3f71bbba5b5e925f63a8b22208d0e6805616c9554e9da0caf3e06aa2766"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/viewer/dl_viewer_context/src/item.rs:383-390 | crates/viewer/dl_viewer_context/src/selection_state.rs:207-214 | crates/viewer/dl_viewer_context/src/selection_state.rs:228-235 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/item.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"474fbb125370a69ed8a1a6c0a856398f970c4a5ff43915322b1dde6a3864f552"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): docs/snippets/all/archetypes/line_strips3d_batch.rs:9-16 | docs/snippets/all/archetypes/line_strips3d_segments_simple.rs:8-15 | docs/snippets/all/archetypes/line_strips3d_simple.rs:7-14 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/snippets/all/archetypes/line_strips3d_batch.rs:9\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/line_strips3d_batch.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bdf81b8c33f71e3c7c8dd3aa26c01c3b23a75ec563a5410f98ef5fdf5f3ba9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/store/dl_chunk/src/chunk.rs:1232-1239 | crates/store/dl_chunk/src/chunk.rs:1258-1265 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_chunk/src/chunk.rs:1232\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/chunk.rs"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dbc22eb42f6fc23a66fe12c7350e93a8db2138512dfc2cd518ffd6c37f129db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/store/dl_data_source/src/data_source.rs:165-172 | crates/store/dl_data_source/src/data_source.rs:217-224 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_data_source/src/data_source.rs:165\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_data_source/src/data_source.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"2efd1ecb6beea5efbe887e112273bf3903df7ca532d2a4acc15556e5edd90037"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/store/dl_importer/src/importer_parquet.rs:47-54 | crates/store/dl_importer/src/importer_parquet.rs:81-88 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_importer/src/importer_parquet.rs:47\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_parquet.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e74b98b3179e657225504cde9e4474e8cfdd0f0a376feb61315a5107b58090f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/store/dl_importer/src/lerobot/datasetv3.rs:1366-1373 | crates/store/dl_importer/src/lerobot/datasetv3.rs:1408-1415 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_importer/src/lerobot/datasetv3.rs:1366\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/lerobot/datasetv3.rs"},"region":{"startLine":1366}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e62c7e08206f5e2ae36bde67a35be164d4f841990d83ac7e9a0ddb86d53c2ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/store/dl_log_types/src/example_components.rs:196-203 | crates/store/dl_log_types/src/example_components.rs:301-308 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/example_components.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eea6021f91edce0d35ad7556ca411d9c1d00dce738e83a0ba5e7ad74f18f894"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/store/dl_query/src/latest_all.rs:58-65 | crates/store/dl_query/src/latest_all.rs:90-97 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/latest_all.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"7373f61959a9372a7e2684970d17bcdb9bf917b65a8d3e38254df9bfded392d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/store/dl_redap_client/src/connection_registry.rs:64-71 | crates/store/dl_redap_client/src/connection_registry.rs:82-89 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_redap_client/src/connection_registry.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":"crates/store/dl_redap_client/src/connection_registry.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"627d56b91961c1c6df739dde1d873dbcc30c1c74969a85ece6a84fdc34b2e6b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:90-97 | crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:215-222 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:90\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9159a32fae4edd315a6e13af6d228c934a6e665c3d76b46e0df7c6e2aba8b12"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/top/dalaran/src/commands/dlr/split.rs:990-997 | crates/top/dalaran/src/commands/dlr/split.rs:998-1005 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/split.rs"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"38852f7252840078effc81b34732846cde3a353d3b48a9a2edabffbfc92bc9c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): crates/utils/dl_crash_handler/src/lib.rs:300-312 | crates/utils/dl_memory/src/backtrace_native.rs:95-104 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/utils/dl_crash_handler/src/lib.rs:300\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_crash_handler/src/lib.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"1572ec617b7e559a8de4a1a35ed9221562f38d73965d640212b5a446640bc01e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/utils/dl_video/src/decode/mod.rs:284-291 | crates/utils/dl_video/src/decode/mod.rs:338-344 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/utils/dl_video/src/decode/mod.rs:284\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/decode/mod.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"28215e5ee0970cf76f2b74b56353ea1cff50360e34bfc84021b52c5f4b435548"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/utils/dl_video/src/demux/mod.rs:257-265 | crates/utils/dl_video/src/demux/mp4.rs:74-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 \u0060crates/utils/dl_video/src/demux/mod.rs:257\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/demux/mod.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f460eedc3482f7783c2a08267134cbf32cb8548992244c2887a0c6027c89b0f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/viewer/dl_selection_panel/src/item_heading_with_breadcrumbs.rs:54-61 | crates/viewer/dl_ui/src/list_item/item_buttons.rs:81-88 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_selection_panel/src/item_heading_with_breadcrumbs.rs:54\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/item_heading_with_breadcrumbs.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c072656b38f65437729e9e55200f30acfbe801811eb599e05de12078d9464c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/viewer/dl_view_spatial/src/picking_ui_pixel.rs:440-447 | crates/viewer/dl_view_spatial/src/picking_ui_pixel.rs:494-501 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/picking_ui_pixel.rs:440\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/picking_ui_pixel.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafc949c76cb66db96dc814365ae9d789a619bee763fcc294d0d41188c06a8ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/viewer/dl_view_tensor/src/view_class.rs:608-615 | crates/viewer/dl_view_tensor/src/view_class.rs:624-631 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_tensor/src/view_class.rs:608\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_tensor/src/view_class.rs"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc958e2b6dcfc583efa3a6e51517797e19f6ff6a315b85b8525c5cace1f40c3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/viewer/dl_view_time_series/src/series_query.rs:275-282 | crates/viewer/dl_view_time_series/src/series_query.rs:409-416 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_time_series/src/series_query.rs:275\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/series_query.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a66b17e7b17df89e457bdab5c6a9e8b2db6bc6570f4a164c2c70eb09810917"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/viewer/dl_viewer/src/app/mod.rs:832-839 | crates/viewer/dl_viewer/src/app/mod.rs:850-856 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/mod.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa487500c54b6caf7b695335ae8bdd1249c492fd2bdf4a3438895d0fd84f90a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/viewer/dl_viewer_context/src/tensor/image_stats.rs:46-53 | crates/viewer/dl_viewer_context/src/tensor/tensor_stats.rs:42-49 \u2014 before extracting anything, compare \u0060crates/viewer/dl_viewer_context/src/tensor/image_stats.rs\u0060 and \u0060crates/viewer/dl_viewer_context/src/tensor/tensor_stats.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 \u0060crates/viewer/dl_viewer_context/src/tensor/image_stats.rs:46\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/tensor/image_stats.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf119785be79c390fe5ed8dc47e5d4fc054054a229a08441fe514d6e4c510e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): docs/snippets/all/archetypes/arrows3d_column_updates.rs:16-28 | docs/snippets/all/archetypes/arrows3d_row_updates.rs:15-27 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060docs/snippets/all/archetypes/arrows3d_column_updates.rs:12\u0060 calls \u0060new_duration_secs\u0060 and \u0060docs/snippets/all/archetypes/arrows3d_row_updates.rs:11\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":"docs/snippets/all/archetypes/arrows3d_column_updates.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff54e9cfc7b5275c66ea252b988f3b40dd31a42d95f73b5e931c01080ca88d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): docs/snippets/all/archetypes/mesh3d_indexed.rs:6-15 | docs/snippets/all/archetypes/mesh3d_simple.rs:7-14 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/snippets/all/archetypes/mesh3d_indexed.rs:6\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/mesh3d_indexed.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70c92663180ec51289585cd7386ad4f69bb03682efb23d7cb11d4a42980b48d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): docs/snippets/all/archetypes/transform3d_hierarchy.rs:20-27 | docs/snippets/all/archetypes/transform3d_hierarchy.rs:30-37 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/snippets/all/archetypes/transform3d_hierarchy.rs:20\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/transform3d_hierarchy.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13e2f12226f22c9f2354917600b890fe3efa2c65548bdc2f0228d7c753712b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/store/dl_sorbet/src/migrations/make_list_arrays.rs:28-36 | crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:91-99 | crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:216-224 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_sorbet/src/migrations/make_list_arrays.rs:28\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/migrations/make_list_arrays.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"053277f28042a5c355461eb06961a37fc42eb7976e9b8afcabeea4acbf51c16f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): docs/snippets/all/archetypes/transform3d_hierarchy.rs:19-25 | docs/snippets/all/archetypes/transform3d_hierarchy.rs:29-35 | docs/snippets/all/archetypes/transform3d_hierarchy.rs:39-45 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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 \u0060docs/snippets/all/archetypes/transform3d_hierarchy.rs:19\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/transform3d_hierarchy.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f911c6ffd5c376498615674b9e254a7c2976b08de678ec8f470f791604482094"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/store/dl_chunk/src/iter.rs:477-483 | crates/store/dl_chunk/src/iter.rs:554-560 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/iter.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"82ef791575187f4165a044128780b978211e940b0870c97d5ea08784c61a8e64"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20137 lines \u00D7 3): crates/store/dl_chunk/src/iter.rs:661-663 | crates/store/dl_chunk/src/iter.rs:683-689 | crates/store/dl_chunk/src/iter.rs:697-703 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_chunk/src/iter.rs:683\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/iter.rs"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fa4ad7ae55781e820297ea2821bc12c4fc368c1a6c2cf1bc9c1a8726138bd8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/store/dl_entity_db/src/dlr_manifest_index/time_range_merger.rs:171-177 | crates/store/dl_entity_db/src/dlr_manifest_index/time_range_merger.rs:217-223 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_entity_db/src/dlr_manifest_index/time_range_merger.rs:171\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/dlr_manifest_index/time_range_merger.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30af893e8651cecbae4cef310e19a68b76b96829dc6154e1396549de399defd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/store/dl_lenses/src/op/semantic.rs:244-250 | crates/store/dl_lenses/src/op/semantic.rs:282-288 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_lenses/src/op/semantic.rs:244\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/src/op/semantic.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"a732394158bdeecc43678e231ea5ed373981ed136a43bb97403128ef5df23cf1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/store/dl_lenses/src/op/string.rs:13-19 | crates/store/dl_lenses/src/op/string.rs:53-59 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_lenses/src/op/string.rs:13\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/src/op/string.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4cbf8eba54fa91d773c3b80445a4dea02781831bdceac27a16ed985fb51e21d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/viewer/dl_component_ui/src/line_strip.rs:54-61 | crates/viewer/dl_component_ui/src/line_strip.rs:116-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 \u0060crates/viewer/dl_component_ui/src/line_strip.rs:54\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060value\u0060 to \u0060\u0026mut MaybeMutRef\u003C\u0027_, LineStrip3D\u003E\u0060 in one and \u0060\u0026mut MaybeMutRef\u003C\u0027_, LineStrip2D\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 after the matched lines, \u0060crates/viewer/dl_component_ui/src/line_strip.rs:62\u0060 calls \u0060col\u0060, \u0060label\u0060, \u0060format_f32\u0060 and \u0060crates/viewer/dl_component_ui/src/line_strip.rs:124\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/line_strip.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d7d239a958a47e434690590d60da0ae3211ad541b57ca7460d4b9001504e4d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:511-517 | crates/viewer/dl_renderer/src/renderer/voxel_grid.rs:352-360 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:511\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbb4741105375fdd7e9234fb324c667aebe3d86ebf86ac2400966e46e587854"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/viewer/dl_selection_panel/src/selection_panel.rs:1162-1168 | crates/viewer/dl_selection_panel/src/selection_panel.rs:1204-1210 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_selection_panel/src/selection_panel.rs:1162\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/selection_panel.rs"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d0b41d08b30ec02231f3e859fccc3a854dd3dbcfb879b346bae9728b1e402c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/viewer/dl_view_map/src/map_view.rs:629-635 | crates/viewer/dl_view_spatial/src/picking.rs:206-212 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_map/src/map_view.rs"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb4c04998fb273a7ff47cfe0302cf929e979df1e2de2b4e419f3efc54ee394c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/viewer/dl_viewer/src/ui/dev_panel/transform_cache_ui/paint.rs:107-113 | crates/viewer/dl_viewer/src/ui/dev_panel/transform_cache_ui/paint.rs:154-160 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/dev_panel/transform_cache_ui/paint.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"312f6e13d7756c0477fbcfa2da685142bc39945a2be390f9d2039a44367cc90a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/store/dl_log_types/src/example_components.rs:173-178 | crates/store/dl_log_types/src/example_components.rs:278-283 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/example_components.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae79aa08d7137c372c28901faa5d07b9f6cfad22661afb7ffc49822919a8cb1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/store/dl_server/src/dalaran_cloud/mod.rs:1642-1647 | crates/store/dl_server/src/store/dataset.rs:404-409 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":1642}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ae898a962155cbb60675b06299e5fb175e2fc586a27fdc2685b43f2fef4128"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/store/dl_server/src/store/dataset.rs:234-239 | crates/store/dl_server/src/store/dataset.rs:412-417 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/dataset.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3a6d24a484b6edc5bc16f6a25220f9af0caef8f81470bd0e5e18b0431cc1e4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/utils/dl_analytics/src/native/pipeline.rs:95-101 | crates/utils/dl_analytics/src/native/pipeline.rs:113-118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/utils/dl_analytics/src/native/pipeline.rs:95\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_analytics/src/native/pipeline.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"49bedd9863219b629d0114cb3cf479a62d6c36a2b393e0d17682470a77d95bfc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:191-196 | crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:348-353 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_dataframe_ui/src/filters/numerical.rs:191\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/filters/numerical.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"131c53dc9527e742e23f0150a043a4f57da089c89c992063e9eb682e3192617f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/viewer/dl_view_spatial/src/ui_2d.rs:366-371 | crates/viewer/dl_view_spatial/src/ui_3d.rs:415-420 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/viewer/dl_view_spatial/src/ui_2d.rs:365\u0060 calls \u0060view_context\u0060 and \u0060crates/viewer/dl_view_spatial/src/ui_3d.rs:413\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/ui_2d.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a2d9d472aa8be5c6dfe9d939551f40a556060a79ff6594699dad7465ce2d42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:238-243 | crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs:240-245 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:238\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"9feae5d096b10fbdf75f4c39a1d8e19167336f32294f6aa51169c0c3c287f793"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:384-391 | crates/viewer/dl_view_time_series/src/series_query.rs:400-405 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:384\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/point_visualizer_system.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"831d6d0072aaceaba533721ab37b1370223735bdbdefde78200f2e029c3fb19d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): docs/snippets/all/archetypes/points2d_random.rs:20-27 | docs/snippets/all/archetypes/points3d_random.rs:22-27 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/snippets/all/archetypes/points2d_random.rs:20\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/points2d_random.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b84a624b0c972ac633e58483bb5e97681c7c0c06b5dc787b5802ee2e027f212"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 8): crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:248-252 | crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs:250-254 | crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:261-265 | crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:265-270 | crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs:236-240 | crates/viewer/dl_view_spatial/src/visualizers/lines3d.rs:247-251 | crates/viewer/dl_view_spatial/src/visualizers/points2d.rs:288-292 | crates/viewer/dl_view_spatial/src/visualizers/points3d.rs:502-506 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/viewer/dl_view_spatial/src/visualizers/points3d.rs:507\u0060 calls \u0060map_or\u0060, \u0060cast_slice\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:253\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"7002f56a3bce48b8dd21826f0685eda39334967ac3ea387bf739cc013df85116"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:233-237 | crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs:235-239 | crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs:237-241 | crates/viewer/dl_view_spatial/src/visualizers/ellipses2d.rs:241-245 \u2014 before extracting anything, compare \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 103 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs:233\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"34b2f274223c2479812ffcdaa6a6f1cebe448287ebb882c1d4a3ba973690289f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/viewer/dl_component_ui/src/geo_line_string.rs:44-50 | crates/viewer/dl_component_ui/src/line_strip.rs:50-56 | crates/viewer/dl_component_ui/src/line_strip.rs:112-118 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_component_ui/src/geo_line_string.rs:44\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060value\u0060 to \u0060\u0026mut MaybeMutRef\u003C\u0027_, GeoLineString\u003E\u0060 in one and \u0060\u0026mut MaybeMutRef\u003C\u0027_, LineStrip3D\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/geo_line_string.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d9c8e4984fa59d69df433e16ed04589f79f5c14546eec38c685b2c8189e4b81"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/store/dl_chunk_store/src/query.rs:76-81 | crates/store/dl_chunk_store/src/query.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 \u0060crates/store/dl_chunk_store/src/query.rs:76\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/query.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"316316c8bebd41d6d929d788c910324e00fc824fd6c7cc26402fbece86c294bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/store/dl_importer/src/lerobot/datasetv2.rs:247-252 | crates/store/dl_importer/src/lerobot/datasetv3.rs:1264-1269 \u2014 before extracting anything, compare \u0060crates/store/dl_importer/src/lerobot/datasetv2.rs\u0060 and \u0060crates/store/dl_importer/src/lerobot/datasetv3.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/lerobot/datasetv2.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec6fbd3191737cdf5c942fa8bb6961da6139c9ba14609b3fa89a88cd9533577c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/store/dl_lenses_core/src/combinators/reshape.rs:294-299 | crates/store/dl_lenses_core/src/combinators/reshape.rs:307-312 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/combinators/reshape.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd1983ebcb10169a0c803b3b20e93c8b8e5adca8fdf82c56db3c7091486527a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/store/dl_parquet/src/streaming.rs:45-49 | crates/store/dl_parquet/src/streaming.rs:72-76 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_parquet/src/streaming.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba7272ceb397af8f16dc4aef62d5fb11c7cac12431ef97ec167fca28cb7ee06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/store/dl_server/src/dalaran_cloud/mod.rs:1213-1217 | crates/store/dl_server/src/dalaran_cloud/mod.rs:1242-1246 \u2014 both copies are in the same file, so extract the block 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 \u0060request\u0060 to \u0060tonic::Request\u003Cdl_protos::cloud::v1alpha1::GetSegmentTableSchemaRequest\u003E\u0060 in one and \u0060tonic::Request\u003Cdl_protos::cloud::v1alpha1::ScanSegmentTableRequest\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":1213}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72ae0f4be3b5370bc614f53bae4fea47309d95f7fac3f09ab24c8e71605cd1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/top/dalaran/src/commands/dlr/filter.rs:77-82 | crates/top/dalaran/src/commands/dlr/merge_optimize.rs:545-550 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/top/dalaran/src/commands/dlr/filter.rs:77\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/filter.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff801395b72de37f60859431b66eeaeab9b8f3ed50a6eb289adfdb690139213"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/viewer/dl_view_spatial/src/proc_mesh.rs:323-327 | crates/viewer/dl_view_spatial/src/proc_mesh.rs:335-339 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/proc_mesh.rs:323\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/proc_mesh.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"900921ba305c3f34f7e1d35eddd00f9f5a90107b5bdff1bd8697412ca042b47d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/viewer/dl_view_spatial/src/visualizers/gaussian_splats3d.rs:455-460 | crates/viewer/dl_view_spatial/src/visualizers/points3d.rs:498-502 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/gaussian_splats3d.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfef07defe205989517f1bc9d165ff2442f069cd2cc4c214e2de8533d969a242"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:324-331 | crates/viewer/dl_view_time_series/src/series_query.rs:214-218 | crates/viewer/dl_view_time_series/src/series_query.rs:371-375 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_time_series/src/point_visualizer_system.rs:324\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/point_visualizer_system.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"b474d3a3eb11c6cc73cdab8d89d0b8092450a9d6ac083d7de65aa87bef2e0115"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/viewer/dl_viewer/data/quick_start_guides/quick_start_connect.rs:7-11 | docs/snippets/all/quick_start/quick_start_connect.rs:7-12 \u2014 before extracting anything, compare \u0060crates/viewer/dl_viewer/data/quick_start_guides/quick_start_connect.rs\u0060 and \u0060docs/snippets/all/quick_start/quick_start_connect.rs\u0060 as WHOLE FILES: 94% of the shorter file\u0027s lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it \u2014 treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/data/quick_start_guides/quick_start_connect.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75b993e35700ac4fa00274290f3d4823d4a0781709434739ccf083c4b4bad2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs:1089-1095 | crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs:1369-1373 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs"},"region":{"startLine":1089}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b970a6434313de1040e5f5252c4e55b064b80d463989d6b2445ba4c8217b13d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): dalaran_py/src/catalog/dataframe_rendering.rs:140-144 | dalaran_py/src/catalog/dataframe_rendering.rs:179-183 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060dalaran_py/src/catalog/dataframe_rendering.rs:140\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/catalog/dataframe_rendering.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"df18b7311735f02f7138b26d35a0fe3e82dbd2f0bc90601bc73470ebacf21fd9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): dalaran_py/src/selector.rs:78-83 | dalaran_py/src/selector.rs:99-104 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060dalaran_py/src/selector.rs:78\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/selector.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e3f66ee5c76fdcbf9db0c7fb629a258bb675ad873da3bcb8aa596d66a8de087"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): docs/snippets/all/tutorials/dna.rs:62-66 | docs/snippets/all/tutorials/dna.rs:86-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":"docs/snippets/all/tutorials/dna.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97b196f98253f0852d702abb634ea931bd7777e2b3ffa2c9ff6d680767349bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/store/dl_hdf5/src/config.rs:85-90 | crates/store/dl_parquet/src/config.rs:98-103 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_hdf5/src/config.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b486b801670e594666868192d8ec40cf4e30fcc94bd7e93e9e458fd804f768"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/store/dl_hdf5/src/config.rs:105-112 | crates/store/dl_parquet/src/config.rs:118-125 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_hdf5/src/config.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b0d05e8b78133ff119b7d3418051308c42b6f308fc83a6b40edadf122830f21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/store/dl_sorbet/src/column_descriptor.rs:60-65 | crates/store/dl_sorbet/src/column_descriptor_ref.rs:40-45 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/column_descriptor.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20aa0992a4a883c6f35c92a85592a712504f85c59b51cef4564b3c9ccc941d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/store/dl_sorbet/src/column_kind.rs:29-35 | crates/store/dl_sorbet/src/migrations/v0_0_1__to__v0_0_2.rs:54-60 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/column_kind.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"219f204fdd3f868c1747ed1c08842cdb07e2b5c4e3194fe9619202978ba2d7bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 5): crates/store/dl_uri/src/endpoints/catalog.rs:47-51 | crates/store/dl_uri/src/endpoints/dataset.rs:168-172 | crates/store/dl_uri/src/endpoints/folder.rs:66-70 | crates/store/dl_uri/src/endpoints/proxy.rs:46-50 | crates/store/dl_uri/src/redap_uri.rs:141-145 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_uri/src/endpoints/catalog.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdaf913e27a025d078d38e52f8b2d6d0db243e5fee63559d300fd6cfff1ab4c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/viewer/dl_component_ui/src/geo_line_string.rs:10-15 | crates/viewer/dl_component_ui/src/line_strip.rs:12-17 | crates/viewer/dl_component_ui/src/line_strip.rs:77-82 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_component_ui/src/geo_line_string.rs:10\u0060 it begins part-way through the construct above it, so those exact 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 \u0060value\u0060 to \u0060\u0026mut MaybeMutRef\u003C\u0027_, GeoLineString\u003E\u0060 in one and \u0060\u0026mut MaybeMutRef\u003C\u0027_, LineStrip3D\u003E\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/geo_line_string.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"7edc84a4c594c48089efdc7303a83f16718b310d5a9161c86adb210445b25b33"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/viewer/dl_context_menu/src/actions/add_container.rs:29-36 | crates/viewer/dl_context_menu/src/actions/move_contents_to_new_container.rs:41-48 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_context_menu/src/actions/add_container.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ea6d7be75edc745f66dd9411e9ae84c86bf1a3b4e7ff4aff91a9721704498f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/viewer/dl_dataframe_ui/src/lib.rs:52-60 | crates/viewer/dl_redap_browser/src/servers.rs:699-707 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_dataframe_ui/src/lib.rs:52\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/lib.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bd1a54333242746bea6ed8e777ec0462cdc2c9948f95d52aacd6122711ed9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/viewer/dl_ui/src/list_item/label_content.rs:128-132 | crates/viewer/dl_ui/src/list_item/property_content.rs:63-67 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/list_item/label_content.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd97fbdb261edf433435dfbddbf79744cae33afa2ba5dfd64c8c4e25984b6dd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/viewer/dl_view_spatial/src/visualizers/gaussian_splats3d.rs:172-176 | crates/viewer/dl_view_spatial/src/visualizers/points3d.rs:146-150 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/gaussian_splats3d.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"812db8897d98ac1eb03e6a389c65c356ebfda07f7a3ec7e409e0be69c5a3c3ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/viewer/dl_viewer_context/src/cache/encoded_depth_image_stats_cache.rs:114-120 | crates/viewer/dl_viewer_context/src/cache/video_asset_cache.rs:136-142 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/viewer/dl_viewer_context/src/cache/encoded_depth_image_stats_cache.rs:111\u0060 calls \u0060clear\u0060 and \u0060crates/viewer/dl_viewer_context/src/cache/video_asset_cache.rs:126\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/encoded_depth_image_stats_cache.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf675dfeb815e51b05160102c38090dd24fa1023b6e27cd102397dc0e41eddf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/viewer/dl_viewport_blueprint/src/container.rs:334-339 | crates/viewer/dl_viewport_blueprint/src/view.rs:132-137 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/container.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd275d41315b882c72629ba41c7de2601e6819baa0ed8fa8fd7e406f319b2ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 6): dalaran_py/src/chunk_stream/engine.rs:666-672 | dalaran_py/src/chunk_stream/hdf5_reader.rs:256-262 | dalaran_py/src/chunk_stream/mcap_reader.rs:534-540 | dalaran_py/src/chunk_stream/mp4_reader.rs:246-252 | dalaran_py/src/chunk_stream/parquet_reader.rs:234-240 | dalaran_py/src/chunk_stream/urdf_tree_stream.rs:66-72 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 6 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/chunk_stream/engine.rs"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"b61557810abfa7d0d079afc438653003eef1c504ce72e7291a76d6629e11679c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/store/dl_datafusion/src/dataset_manifest.rs:62-70 | crates/store/dl_datafusion/src/segment_table.rs:62-70 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataset_manifest.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"536639ec14d3b2f67c74e6ae2f0902377258c10517ed988d0fffa9f03091466d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/store/dl_uri/src/endpoints/catalog.rs:24-30 | crates/store/dl_uri/src/endpoints/proxy.rs:23-29 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_uri/src/endpoints/catalog.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd32e74adf94c39e9c8811b3cdc54309bb4c83b9d96e609e0c70a564ffb69ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/store/dl_uri/src/endpoints/dataset.rs:143-149 | crates/store/dl_uri/src/endpoints/entry.rs:30-36 | crates/store/dl_uri/src/endpoints/folder.rs:43-49 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_uri/src/endpoints/dataset.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"1142fdcd94d143222b50d25f1f27c90a300209f0c47d069d1a5b7e0182b31431"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/viewer/dl_component_ui/src/color.rs:11-17 | crates/viewer/dl_component_ui/src/datatype_uis/range1d.rs:10-16 | crates/viewer/dl_component_ui/src/datatype_uis/singleline_string.rs:42-48 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_component_ui/src/color.rs:11\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060value\u0060 to \u0060\u0026mut MaybeMutRef\u003C\u0027_, impl std::ops::DerefMut\u003CTarget = Rgba32\u003E\u003E\u0060 in one and \u0060\u0026mut MaybeMutRef\u003C\u0027_, impl std::ops::DerefMut\u003CTarget = Range1D\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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/color.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2274a7809caa3cf9c44d9a3b77870f129918019e548181f2502283b20607df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/viewer/dl_component_ui/src/datatype_uis/view_uuid.rs:9-14 | crates/viewer/dl_component_ui/src/image_format.rs:9-15 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_component_ui/src/datatype_uis/view_uuid.rs:9\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/datatype_uis/view_uuid.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee3150df4e1797f73a6bb0ef7cbd74648718615453490c4bc2ef5d33dc5fb7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/viewer/dl_renderer/src/gaussian_splat_builder.rs:85-92 | crates/viewer/dl_renderer/src/line_drawable_builder.rs:81-88 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/gaussian_splat_builder.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1b95ecf541c77b0ecf4bf14a45cb3fd72a1ec94ae8b12308e8f456c0c0731c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/viewer/dl_ui/src/command/recording_command.rs:97-104 | crates/viewer/dl_ui/src/command/redap_server_command.rs:45-52 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/command/recording_command.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"50eb5fe06fd3485f51ff3279b33ea7fd5ffe1ac9d51c1d02e9c99e29a4c130ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/viewer/dl_view_bar_chart/src/view_class.rs:110-124 | crates/viewer/dl_view_tensor/src/view_class.rs:108-122 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_bar_chart/src/view_class.rs:110\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_bar_chart/src/view_class.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"873d59b62628a26247907fa4e07ef5ed0845db1ca7a5860c19a1d88baabc25df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/viewer/dl_view_spatial/src/view_2d.rs:273-280 | crates/viewer/dl_view_spatial/src/view_3d.rs:536-543 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_view_spatial/src/view_2d.rs:273\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/view_2d.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"305bdbd662e5c0503511fc959845441f6cde163da1deee2df2dd1a4fec847687"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/viewer/dl_viewport_blueprint/src/container.rs:365-374 | crates/viewer/dl_viewport_blueprint/src/view.rs:358-367 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/container.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"cde4aa19a1ba5ce26e2101d6b15fc88fecf903cdeb9cb50b56d03a05da651b18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): dalaran_py/src/trace_context.rs:67-77 | dalaran_py/src/tracing_session.rs:46-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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/trace_context.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e651167fc24bd0e28ba5cf9eead78b0943ba8c89298fc4f67bd960e47e2f57f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:669-695 | crates/viewer/dl_renderer/src/renderer/lines.rs:629-633 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:656-660 \u2014 before extracting anything, compare \u0060crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs\u0060 and \u0060crates/viewer/dl_renderer/src/renderer/lines.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:669\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"51575ca2b727542e90297f309b036aeacdb389fc06f36f34a3866bde6355682c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:745-762 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:758-773 \u2014 before extracting anything, compare \u0060crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs\u0060 and \u0060crates/viewer/dl_renderer/src/renderer/point_cloud.rs\u0060 as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:745\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"51362945400e0f349bb4a33b972a2843aae66b464e45f2308c6af1a680baffd4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/store/dl_server/src/dalaran_cloud/mod.rs:163-176 | crates/store/dl_server/src/store/in_memory_store.rs:273-289 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_server/src/dalaran_cloud/mod.rs:163\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a137e2a423901b0d559bf7e6d860c970a98c0140297b30a1088c20ad274aed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:585-599 | crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:617-631 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:585\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab66a1697d32c3ed3fe0d7a3f6a2c65cd323a8736b3cd6c05d6f7d8f566478d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/store/dl_chunk/src/chunk.rs:1288-1302 | crates/store/dl_chunk/src/chunk.rs:1317-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_chunk/src/chunk.rs:1288\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/chunk.rs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"73adcb2207aa255f693f7cc879c07515a7e0c3b5ac066af64be5e29b4b0124b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joint_state.rs:81-94 | crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joint_state.rs:105-118 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joint_state.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":"crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joint_state.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ada727fb13a38a1b2c544f179ed133a39d653514fcf7f3207c5612ec8a67805"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/store/dl_importer/src/importer_lerobot.rs:65-78 | crates/store/dl_importer/src/importer_lerobot.rs:103-116 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_importer/src/importer_lerobot.rs:65\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_lerobot.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"eda2ce7be4d73e1f5393dd8fc362e4930c8e88f3bce0a1b582f0fe07426dc854"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:117-129 | crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:196-208 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_viewer_context/src/blueprint_helpers.rs:117\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/blueprint_helpers.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b9c234906b22e96fd8b292135a67979aff87933e651013928a9e24bbe25783"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1062-1074 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1269-1281 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1062\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"5079d98eecec677bb437ceb3c268646ef3ef0a4e67367da6eb8ef40ae98a55fb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:416-428 | crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:473-484 \u2014 before extracting anything, compare \u0060crates/viewer/dl_renderer/src/renderer/depth_cloud.rs\u0060 and \u0060crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:416\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/depth_cloud.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33fe9be5bb0a2ace2506ea1cff5a2bbc1086fdaac1cafcf1126ea4a96d1b033"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:520-532 | crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:579-591 | crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:611-623 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:520\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8915091d438055b5872a17cb71721b3986d516992569c0587730f3f7fafd4c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/viewer/dl_selection_panel/src/selection_panel.rs:262-274 | crates/viewer/dl_selection_panel/src/selection_panel.rs:301-312 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_selection_panel/src/selection_panel.rs:262\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/selection_panel.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"31eb54467ea1713f62cb0df171ae0d6f2902de6f04d9b0af7a81f58be3b22f6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:417-429 | crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:474-485 | crates/viewer/dl_renderer/src/renderer/voxel_grid.rs:325-337 \u2014 before extracting anything, compare \u0060crates/viewer/dl_renderer/src/renderer/depth_cloud.rs\u0060 and \u0060crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:417\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/depth_cloud.rs"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0df085ecf36683d0e01483eba1bea1709e82752791adda1d630866557778e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): dalaran_py/src/catalog/segment_url_udf.rs:215-223 | dalaran_py/src/catalog/segment_url_udf.rs:232-243 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060dalaran_py/src/catalog/segment_url_udf.rs:215\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/catalog/segment_url_udf.rs"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7180624e2fd652138ef81e37f244541d68919f6395b82b048ca7f23a843788"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): dalaran_py/src/catalog/segment_url_udf.rs:101-112 | dalaran_py/src/catalog/segment_url_udf.rs:118-129 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060dalaran_py/src/catalog/segment_url_udf.rs:101\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it 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":"dalaran_py/src/catalog/segment_url_udf.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ac3f5a16d876392a8f2c209f725069e221f94f387a8f69479d3518e2ed5ef5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/store/dl_lenses/src/semantic/foxglove/point_cloud.rs:13-24 | crates/store/dl_lenses/src/semantic/foxglove/voxel_grid.rs:13-24 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/src/semantic/foxglove/point_cloud.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a5d5754b58b092ddccf8ad62d49e47fc27a316dcc9954fd789b30e2f0334d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/store/dl_lenses/src/semantic/foxglove/pose_in_frame.rs:12-23 | crates/store/dl_lenses/src/semantic/foxglove/poses_in_frame.rs:12-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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_lenses/src/semantic/foxglove/pose_in_frame.rs:12\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/src/semantic/foxglove/pose_in_frame.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"77d7d2abad3cf59f07f94b24bbc8c7cbed679025cfeb2400ff177e88a7bc9256"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): docs/snippets/all/archetypes/transform3d_hierarchy.rs:66-77 | docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:86-97 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/snippets/all/archetypes/transform3d_hierarchy.rs:66\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/transform3d_hierarchy.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b9eb7b7d0c7b3de350ab6ae128d264acd2bb26045a61c9fb73512551cd4f9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/store/dl_server/src/dalaran_cloud/mod.rs:433-443 | crates/store/dl_server/src/dalaran_cloud/mod.rs:491-501 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_server/src/dalaran_cloud/mod.rs:433\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0f0bba09ff1d12b2d3aedadea9bdad7d43fb06349b0b863d0fd3481130930b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:114-124 | crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:166-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 \u0060crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs:114\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/migrations/v0_1_1__to__v0_1_2.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a8765522c0f8578f7435d831949bba36b81b0a782043bec04b4b82cbe11e49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1062-1072 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1206-1216 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1269-1279 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:1062\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4032ac8f4e665685f37e08f0e748a3c342f4e81a753bb4d2dbe4356d4ea441"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/store/dl_data_source/src/data_source.rs:413-423 | crates/store/dl_data_source/src/data_source.rs:428-438 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_data_source/src/data_source.rs:413\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_data_source/src/data_source.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"65a7bdc0ccd6f5edd5a203a3f77e4a10b3c6c5ec593683c2316d162b32b5204a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:26-36 | docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:40-50 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/snippets/all/archetypes/transform3d_hierarchy_frames.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50f94fb92395f857b49e97aad192f755d7872a70679bc93de16bebedd778284"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/store/dl_importer/src/importer_urdf/joint_transform.rs:106-116 | crates/store/dl_importer/src/importer_urdf/joint_transform.rs:135-140 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_importer/src/importer_urdf/joint_transform.rs:135\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_urdf/joint_transform.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"87e60745079a75a9f8231cbe5fa565116b987b8b580026589bcbdbd6a346ee96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/viewer/dl_renderer/src/renderer/lines.rs:676-686 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:703-713 \u2014 before extracting anything, compare \u0060crates/viewer/dl_renderer/src/renderer/lines.rs\u0060 and \u0060crates/viewer/dl_renderer/src/renderer/point_cloud.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 113 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/renderer/lines.rs:676\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/lines.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b8b78dbc982cbb62029e4403e69a11800800efe131e69d9ef117d192525fa4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/viewer/dl_viewer/src/ui/share_modal.rs:288-297 | crates/viewer/dl_viewer/src/ui/share_modal.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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_viewer/src/ui/share_modal.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":"crates/viewer/dl_viewer/src/ui/share_modal.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"28f4bd29d66f8e389dbd0f30d3569bcc3c0657e6d4549ff00aec2fb21ba2a743"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/store/dl_lenses/src/semantic/foxglove/compressed_image.rs:12-21 | crates/store/dl_lenses/src/semantic/foxglove/compressed_video.rs:12-21 | crates/store/dl_lenses/src/semantic/foxglove/raw_image.rs:14-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 all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/src/semantic/foxglove/compressed_image.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac556785e46fabb3c2c8efdea72376a0409cf265d5b2ae5ecea272af1b8c12e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 5): crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:452-461 | crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:786-795 | crates/viewer/dl_renderer/src/renderer/lines.rs:756-765 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:814-823 | crates/viewer/dl_renderer/src/renderer/voxel_grid.rs:378-387 \u2014 before extracting anything, compare \u0060crates/viewer/dl_renderer/src/renderer/depth_cloud.rs\u0060 and \u0060crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/renderer/depth_cloud.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/depth_cloud.rs"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c325a9fc1746a3ea317b7a5f59ef66e0a56db3d0a47881caa5a4c1f7c0bdd7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:15-22 | docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:27-36 | docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:41-50 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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 \u0060docs/snippets/all/archetypes/transform3d_hierarchy_frames.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":"docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9beafe81a7c436215a451bbc13b1904716b86f2baee4c3239cfc9a6f96b52d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/viewer/dl_renderer/src/view_builder.rs:458-467 | crates/viewer/dl_renderer/src/view_builder.rs:497-505 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/view_builder.rs:458\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/view_builder.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcc28cc10733fe723ad656118c1557ef5b07e72d4c4914e04eeebd878bd397d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/utils/dl_video/src/decode/av1.rs:207-216 | crates/utils/dl_video/src/decode/av1.rs:220-229 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/utils/dl_video/src/decode/av1.rs:207\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/decode/av1.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3f617bccea3465e56ed2453cb0851f9f0eeac3987a6ad1856cea76f5383389"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/viewer/dl_renderer/src/renderer/rectangles.rs:768-776 | crates/viewer/dl_renderer/src/renderer/rectangles.rs:779-788 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/renderer/rectangles.rs:768\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/rectangles.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"2449fa68112123a1aa92e770f9d09650aeb359fdafe1fe2b67358c2b67bcff67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/viewer/dl_dataframe_ui/src/filters/boolean.rs:237-245 | crates/viewer/dl_dataframe_ui/src/filters/timestamp.rs:227-235 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/filters/boolean.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb23f5fed3e49e781ac2389dd3da20339b6368092bcd9b7923b2ee8941280bca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/store/dl_importer/src/importer_parquet.rs:37-45 | crates/store/dl_importer/src/importer_parquet.rs:71-79 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_importer/src/importer_parquet.rs:37\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060crates/store/dl_importer/src/importer_parquet.rs:69\u0060 calls \u0060into_owned\u0060 and \u0060crates/store/dl_importer/src/importer_parquet.rs:34\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_parquet.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7b681c36c6d7d8d0f3dc8fb9c3581bf7b216c40063b445e5cfaeefe13be15a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/viewer/dl_renderer/src/renderer/lines.rs:678-686 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:705-713 | crates/viewer/dl_renderer/src/renderer/voxel_grid.rs:309-315 \u2014 before extracting anything, compare \u0060crates/viewer/dl_renderer/src/renderer/lines.rs\u0060 and \u0060crates/viewer/dl_renderer/src/renderer/point_cloud.rs\u0060 as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 113 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/renderer/lines.rs:678\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/lines.rs"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"88d42b25a6b8bf164467ac2bd2079c85ca33808b1826b92125157dec11950af8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/viewer/dl_renderer/src/renderer/depth_cloud.rs:361-369 | crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs:442-450 | crates/viewer/dl_renderer/src/renderer/point_cloud.rs:652-660 \u2014 before extracting anything, compare \u0060crates/viewer/dl_renderer/src/renderer/depth_cloud.rs\u0060 and \u0060crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 35 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/renderer/depth_cloud.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/depth_cloud.rs"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0f1370eb456a39e03ea33e3a19e954ccf839fee645e53f047f4c53d4e48c69"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 4): crates/store/dl_lenses/src/op/string.rs:18-26 | crates/store/dl_lenses/src/op/string.rs:38-46 | crates/store/dl_lenses/src/op/string.rs:58-66 | crates/store/dl_lenses/src/op/string.rs:78-86 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_lenses/src/op/string.rs:18\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/src/op/string.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ce34d1ac27600f9f09b8374e4365d405599a8cfb0e494a82aeb0147ebc104b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): docs/snippets/all/concepts/transform3d_hierarchy_named_frames.rs:18-26 | docs/snippets/all/concepts/transform3d_hierarchy_named_frames.rs:29-37 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/snippets/all/concepts/transform3d_hierarchy_named_frames.rs:18\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/concepts/transform3d_hierarchy_named_frames.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a85b7e29ee4fe13c6c8b8204894de735d86dbafd60b0b9f8adbc36ea0ab691f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): docs/snippets/all/archetypes/points2d_random.rs:6-14 | docs/snippets/all/archetypes/points3d_random.rs:6-14 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/snippets/all/archetypes/points2d_random.rs:6\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/points2d_random.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ec6cef2bfe75c25132c68b33e05ece8a63605da9f285c97cd990db8fcfaae3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/viewer/dl_renderer/src/renderer/lines.rs:451-459 | crates/viewer/dl_renderer/src/renderer/lines.rs:465-473 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/renderer/lines.rs:451\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/lines.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"19d740707f5cd43b553bd40b6b1576ffd0a7749dc3cdc82db7f3f28fab35e74a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/top/dalaran/src/commands/dlr/stats.rs:571-579 | crates/top/dalaran/src/commands/dlr/stats.rs:586-594 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/top/dalaran/src/commands/dlr/stats.rs:571\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/stats.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb49f795f375c1c18ce4a32d469cb6bb16991ba45e94dd0143034ad69aa2b91"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/viewer/dl_renderer/src/draw_phases/outlines.rs:445-453 | crates/viewer/dl_renderer/src/draw_phases/picking_layer.rs:504-511 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/draw_phases/outlines.rs:445\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/draw_phases/outlines.rs"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"530ef05b5ceea89195a6d9efbb982da06498ec531b423e13dbe95a837a6d90d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): docs/snippets/all/concepts/transform3d_hierarchy_simple.rs:10-17 | docs/snippets/all/concepts/transform3d_hierarchy_simple.rs:24-32 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060docs/snippets/all/concepts/transform3d_hierarchy_simple.rs:10\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/concepts/transform3d_hierarchy_simple.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea7343c55bb35c0e8ccef4cc609b77fd3f74b34561d4ee31e2bcdf949c1b9b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:170-176 | crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:200-206 | crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:250-256 | crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:346-352 | crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:370-378 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs:170\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/src/semantic/foxglove/packed_element_field.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"60aea69bf6d02c1204dc452073cd28f7e9ed08cc1baf9a2eecd35d344e162711"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/store/dl_lenses/src/semantic/ros2msg/log.rs:78-85 | crates/store/dl_lenses/src/semantic/ros2msg/log.rs:108-115 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/src/semantic/ros2msg/log.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e825a4bd324c9db7f758269b317ce482bd94f1e0db0d068208559c0a53ddcc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): docs/snippets/all/concepts/transform3d_hierarchy_named_frames.rs:10-15 | docs/snippets/all/concepts/transform3d_hierarchy_named_frames.rs:19-26 | docs/snippets/all/concepts/transform3d_hierarchy_named_frames.rs:30-37 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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 \u0060docs/snippets/all/concepts/transform3d_hierarchy_named_frames.rs:10\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/concepts/transform3d_hierarchy_named_frames.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"f90166bcc356109ca33f02712ee75fd80a7c2e14cc70be4e3c246f565d87b69e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/top/dalaran/src/commands/dlr/stats.rs:224-228 | crates/top/dalaran/src/commands/dlr/stats.rs:240-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 \u0060crates/top/dalaran/src/commands/dlr/stats.rs:224\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/stats.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbf87caa67cabf476a9580a055d9980da49f7d7c5903db67b59a60be36f1744"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 5): crates/store/dl_lenses/src/op/semantic.rs:263-270 | crates/store/dl_lenses/src/op/string.rs:14-21 | crates/store/dl_lenses/src/op/string.rs:34-41 | crates/store/dl_lenses/src/op/string.rs:54-61 | crates/store/dl_lenses/src/op/string.rs:74-81 \u2014 there are 5 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/src/op/semantic.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed38a433dfafa031d384297ec613247b3fa883752df1472e546fe12ef6df46a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/store/dl_datafusion/src/dataframe_query_provider/io_loop.rs:367-374 | crates/store/dl_datafusion/src/dataframe_query_provider/io_loop.rs:412-419 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_datafusion/src/dataframe_query_provider/io_loop.rs:367\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider/io_loop.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc304c62e1866b237b802a46f882adb71062d7c63b397527c8d2bfe622bd046"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 7): crates/store/dl_lenses/src/op/semantic.rs:245-252 | crates/store/dl_lenses/src/op/semantic.rs:283-290 | crates/store/dl_lenses/src/semantic/helpers.rs:62-69 | crates/store/dl_lenses/src/semantic/image_helpers.rs:22-29 | crates/store/dl_lenses/src/semantic/ros2msg/log.rs:49-56 | crates/store/dl_lenses/src/semantic/ros2msg/ros_map_helpers.rs:24-31 | crates/store/dl_lenses/src/semantic/ros2msg/ros_map_helpers.rs:59-66 \u2014 there are 7 copies across 5 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 7 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/src/op/semantic.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab34b31d1362fb1928f96f36e4f8ea6e5f5539eee563475dfc48c3986cff40a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:405-412 | crates/viewer/dl_renderer/src/renderer/lines.rs:452-459 | crates/viewer/dl_renderer/src/renderer/lines.rs:466-473 \u2014 before extracting anything, compare \u0060crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs\u0060 and \u0060crates/viewer/dl_renderer/src/renderer/lines.rs\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs:405\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"f02949447dc26831c37f9cac292e2686c2f205d932bf0f0418f95c712181d565"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): crates/store/dl_lenses/src/op/semantic.rs:263-270 | crates/store/dl_lenses/src/op/string.rs:14-21 | crates/store/dl_lenses/src/op/string.rs:34-41 | crates/store/dl_lenses/src/op/string.rs:54-61 | crates/store/dl_lenses/src/op/string.rs:74-81 | crates/store/dl_lenses/src/semantic/foxglove/log.rs:32-39 \u2014 there are 6 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/src/op/semantic.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"369056d67574503af730522332ecec2c67877fa25c0e558399e450f52ee54847"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): crates/store/dl_lenses/src/semantic/helpers.rs:62-69 | crates/store/dl_lenses/src/semantic/image_helpers.rs:22-29 | crates/store/dl_lenses/src/semantic/image_helpers.rs:62-69 | crates/store/dl_lenses/src/semantic/ros2msg/log.rs:49-56 | crates/store/dl_lenses/src/semantic/ros2msg/ros_map_helpers.rs:24-31 | crates/store/dl_lenses/src/semantic/ros2msg/ros_map_helpers.rs:59-66 \u2014 there are 6 copies across 4 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 6 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/src/semantic/helpers.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ac93acba8c139ea97a34ded38f2c8bc1e950be97bb028796d5d68aa6968a8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/store/dl_query/src/cache.rs:219-225 | crates/store/dl_query/src/cache.rs:245-251 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_query/src/cache.rs:219\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/cache.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"9caaa69d0c371538b73476528a030fb517046f3015f0d6d87d86dd27efeb3fda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): dalaran_py/src/arrow.rs:27-33 | dalaran_py/src/arrow.rs:34-40 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/arrow.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"f24006a56cf363fd2c2398d338ed9e0110447c69bd40a051605b71f4a49a0831"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:67-73 | docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs:78-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 \u0060docs/snippets/all/archetypes/transform3d_hierarchy_frames.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. 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":"docs/snippets/all/archetypes/transform3d_hierarchy_frames.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4030d46dd0090a2d24448d568f34e865f25a36747a06337022c9e10cf2a96a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joy.rs:69-75 | crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joy.rs:76-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 \u0060crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joy.rs:69\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/joy.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"99494bff42fe5f1905a691737aab5e4236496134f386ae789bdfdec257f20b2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/viewer/dl_selection_panel/src/selection_panel.rs:211-215 | crates/viewer/dl_selection_panel/src/selection_panel.rs:232-238 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_selection_panel/src/selection_panel.rs:211\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/selection_panel.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"7675fbb2ccfba8b75fb7d66528f734ce9ce42b972f2e6d0e2162213b75c06552"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/viewer/dl_viewer_context/src/item.rs:327-333 | crates/viewer/dl_viewer_context/src/route.rs:60-66 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/item.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"356526ee01497a483e9ff779a0ed4ad0d6a02932f76d371bd225a4489c02a7e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:577-581 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:586-590 | crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:596-601 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs:577\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs"},"region":{"startLine":577}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9cdd556556ab7fea6d8e1bbda0d49c1c1ffce9bc8d1dcf513de8288e602d54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/viewer/dl_component_ui/src/geo_line_string.rs:36-41 | crates/viewer/dl_component_ui/src/line_strip.rs:39-44 | crates/viewer/dl_component_ui/src/line_strip.rs:104-109 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_component_ui/src/geo_line_string.rs:36\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/geo_line_string.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff319e5b2faaa33bfdbdbbc1ee61ef6acecfd35947c075702ca0ccff2764faca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): docs/snippets/all/archetypes/asset3d_simple.rs:6-11 | docs/snippets/all/archetypes/gaussian_splats3d_ply.rs:6-11 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a 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 \u0060docs/snippets/all/archetypes/gaussian_splats3d_ply.rs:6\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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":"docs/snippets/all/archetypes/asset3d_simple.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7500185f4b9dfd9133d17f961b6cb8728fc390cc478d09778be2fbb09202ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/store/dl_importer/src/lerobot/datasetv3.rs:520-524 | crates/store/dl_importer/src/lerobot/datasetv3.rs:555-559 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_importer/src/lerobot/datasetv3.rs:520\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/lerobot/datasetv3.rs"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"b30fd1badee21ca57a7f43c08e5a639b6bb4ad5275f7b6003af81e7a674b389e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): dalaran_py/src/catalog/dataset_entry.rs:240-244 | dalaran_py/src/catalog/dataset_entry.rs:264-268 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060dalaran_py/src/catalog/dataset_entry.rs:240\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/catalog/dataset_entry.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"226686c43c9c2d9e0f2d6392fd7dc2325f03e841fce95de3a05d1748a9abf357"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/store/dl_chunk/src/iter.rs:326-330 | crates/store/dl_chunk/src/iter.rs:417-421 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/iter.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ead6127b4a9553b2399eb43d061093d66e8e671f5bd1e912684b7c7c2583dd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/store/dl_query/src/bin/clamped_zip.rs:198-204 | crates/store/dl_query/src/bin/clamped_zip.rs:237-243 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/bin/clamped_zip.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf792e231c4f30511e6406a608a86c633ce7fa37ab99e570016c45892d5a4c63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/top/dalaran/src/demo_util.rs:109-115 | crates/viewer/dl_renderer/src/colormap.rs:240-246 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/demo_util.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"576fb0132b11461fb522a9dfacd914cd3a0bdb1c4a542995fc54d982cc19409f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): crates/viewer/dl_renderer/src/colormap.rs:319-323 | crates/viewer/dl_renderer/src/colormap.rs:337-341 | crates/viewer/dl_renderer/src/colormap.rs:381-385 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/colormap.rs"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e3131bd42443a7388c9e1f492e1b2e1221b63fe8dc2652b79f4135e712ad9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/viewer/dl_view_bar_chart/src/view_class.rs:227-239 | crates/viewer/dl_view_bar_chart/src/view_class.rs:241-253 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_bar_chart/src/view_class.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9823e9c93ca83802c36eaee1260128d3ea52a2d932cf92f51fec1cfa16e1bba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/viewer/dl_view_spatial/src/visualizers/mod.rs:76-80 | crates/viewer/dl_view_spatial/src/visualizers/mod.rs:103-107 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/mod.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbac1ff35d62f103c1e226e1057e7060cd8738a658f8dddb3b8f112aee124bd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/viewer/dl_view_spatial/src/visualizers/mod.rs:81-85 | crates/viewer/dl_view_spatial/src/visualizers/mod.rs:111-115 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/mod.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"781b78f4d7b1540f73d66a620a8935871ec99cfbf5a24cb0f8acfa38704bb427"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/viewer/dl_view_spatial/src/visualizers/mod.rs:86-94 | crates/viewer/dl_view_spatial/src/visualizers/mod.rs:117-125 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/mod.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f43cad83b364f892017c1a722781fc8392908a73eeb75026418af8a9073f6c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (51\u201357 lines \u00D7 2): dalaran_py/dalaran_sdk/dalaran/sinks.py:183-239 | dalaran_py/dalaran_sdk/dalaran/sinks.py:255-305 \u2014 both copies are in the same file, so extract the block 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":"dalaran_py/dalaran_sdk/dalaran/sinks.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"87803b21d087999e1c554739d388069feebacff7b6c2d20a2546907ec86e522a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (55 lines \u00D7 2): dalaran_py/dalaran_sdk/dalaran/archetypes/capsules3d_ext.py:29-83 | dalaran_py/dalaran_sdk/dalaran/archetypes/cylinders3d_ext.py:29-83 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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":"dalaran_py/dalaran_sdk/dalaran/archetypes/capsules3d_ext.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cdf2b9551b650128e956042cf7b701d2d432a06e7bffb340b700879a0034a6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (52\u201353 lines \u00D7 2): dalaran_py/dalaran_sdk/dalaran/archetypes/points2d_ext.py:26-78 | dalaran_py/dalaran_sdk/dalaran/archetypes/points3d_ext.py:26-77 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The 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":"dalaran_py/dalaran_sdk/dalaran/archetypes/points2d_ext.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"264b74d75e56d4028ca56b67596c329fcbd863d739773df121e6de3c0703daa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201343 lines \u00D7 2): dalaran_py/dalaran_sdk/dalaran/archetypes/asset3d_ext.py:23-65 | dalaran_py/dalaran_sdk/dalaran/archetypes/asset_video_ext.py:27-63 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/archetypes/asset3d_ext.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"91daca4e1b4fe99bacc304250aa9b7455ad32e8c5c93b9e51fd82ae95a7420ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201329 lines \u00D7 2): dalaran_py/dalaran_sdk/dalaran/robot/_math.py:104-131 | dalaran_py/dalaran_sdk/dalaran/robot/_math.py:203-231 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/robot/_math.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"62958cd459464b0d3737a94bf1051848382534b7f74a8ac0b27353c70fbc5bb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 2): dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py:118-143 | dalaran_py/dalaran_sdk/dalaran/archetypes/segmentation_image_ext.py:51-76 \u2014 before extracting anything, compare \u0060dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py\u0060 and \u0060dalaran_py/dalaran_sdk/dalaran/archetypes/segmentation_image_ext.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py:118\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3580c166cdea8826d7c9674c80b2000701188a9a2fc3987bedbd55d9a09e679"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u201316 lines \u00D7 3): docs/snippets/all/tutorials/dna.py:49-55 | docs/snippets/all/tutorials/dna.py:59-74 | examples/python/dna/dna.py:42-50 \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 \u0060docs/snippets/all/tutorials/dna.py: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. 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, \u0060docs/snippets/all/tutorials/dna.py:75\u0060 calls \u0060bounce_lerp\u0060 and \u0060docs/snippets/all/tutorials/dna.py:55\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":"docs/snippets/all/tutorials/dna.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd11819e3386ea3d7489a587003230592a149aa3a027482e2fb88b11ab5737f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): dalaran_notebook/src/dalaran_notebook/asset_server.py:49-60 | dalaran_notebook/src/dalaran_notebook/asset_server.py:64-75 \u2014 both copies are in the same file, so extract the block 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":"dalaran_notebook/src/dalaran_notebook/asset_server.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b53695bf5592e8492ddf545eccb8f37e5843824b2dd97185b03949ecf5d04bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py:116-124 | dalaran_py/dalaran_sdk/dalaran/archetypes/image_ext.py:208-216 | dalaran_py/dalaran_sdk/dalaran/archetypes/segmentation_image_ext.py:49-57 \u2014 before extracting anything, compare \u0060dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py\u0060 and \u0060dalaran_py/dalaran_sdk/dalaran/archetypes/segmentation_image_ext.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c959f35116bcbea1f0ba186325698f46006fce4304ba771406abd1ba5a51fa52"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): dalaran_py/dalaran_sdk/dalaran/_send_columns.py:164-172 | dalaran_py/dalaran_sdk/dalaran/_send_columns.py:177-185 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/_send_columns.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca72ee601636e33aa7fe582fea96b2fdbb546a0aa851660c26d863001a6bdb56"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (43 lines \u00D7 2): dalaran_py/dalaran_sdk/dalaran/archetypes/arrows2d_ext.py:26-73 | dalaran_py/dalaran_sdk/dalaran/archetypes/ellipses2d_ext.py:26-68 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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":"dalaran_py/dalaran_sdk/dalaran/archetypes/arrows2d_ext.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1abb614b7fc10ba74568d384c6e54eb6ba79c63d1013b84f73dc3ec666f28e2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py:43-50 | dalaran_py/dalaran_sdk/dalaran/archetypes/mesh3d_ext.py:34-41 | dalaran_py/dalaran_sdk/dalaran/archetypes/segmentation_image_ext.py:29-36 | dalaran_py/dalaran_sdk/dalaran/datatypes/tensor_data_ext.py:36-43 \u2014 before extracting anything, compare \u0060dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py\u0060 and \u0060dalaran_py/dalaran_sdk/dalaran/archetypes/segmentation_image_ext.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 43 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060tensor\u0060 to \u0060ImageLike\u0060 in one and \u0060TensorLike\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":"dalaran_py/dalaran_sdk/dalaran/archetypes/depth_image_ext.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d941f0d020029a7db8ea5bcb1ed9c7873ebf5e394b95ee76a9feafb258778a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): dalaran_py/dalaran_sdk/dalaran/robot/frames.py:197-202 | dalaran_py/dalaran_sdk/dalaran/robot/robot.py:248-259 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/robot/frames.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b95fea17dcb581dff35edc806b3fb6cae239c7139efdadd9267f57546231430"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (48 shared lines): scripts/ci/pixi_install_wheel.py:33-92 | scripts/ci/uv_install_wheel.py:32-92 \u2014 These two members are variants of one another: 48 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":"scripts/ci/pixi_install_wheel.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"08028b572f8dfd490bd27933817abee40a5b7f26b7bf89bdfac2acd0832c54a2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): scripts/ci/compare.py:48-60 | scripts/ci/count_bytes.py:53-65 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/compare.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0f31361301bdcf0e8203a03c785103520527dadafde1f4d1d920f4811913ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): scripts/ci/compare.py:64-73 | scripts/ci/count_bytes.py: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":"scripts/ci/compare.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e22fdc8f930bb0d7bb8aab7a9299c081f976e050e75960b978094d4d51bc8c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): examples/python/face_tracking/face_tracking.py:325-336 | examples/python/gesture_detection/gesture_detection.py:173-184 | examples/python/lidar/lidar/download_dataset.py:28-40 | examples/python/nuscenes_dataset/nuscenes_dataset/download_dataset.py:28-40 | examples/python/ocr/ocr.py:450-461 | examples/python/open_photogrammetry_format/open_photogrammetry_format.py:59-70 | scripts/upload_image.py:321-332 \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":"examples/python/face_tracking/face_tracking.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8625c87e7ef38ff8c7bc7d195d97b357b1e45eaf94a4315b0f1c1e59319e317"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (5 members, 50\u002B identical tokens): crates/store/dl_redap_tests/src/utils/dalaran.rs:76-171 | crates/store/dl_redap_tests/src/utils/dalaran.rs:209-270 | crates/store/dl_redap_tests/src/utils/dalaran.rs:321-574 | crates/store/dl_redap_tests/src/utils/dalaran.rs:599-694 | crates/store/dl_redap_tests/src/utils/dalaran.rs:1154-1235 \u2014 These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/utils/dalaran.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e43671376c12f5cbf6e8898b818f9f992cd3b5d495aa0fb04b649e1c8b7dc64"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): examples/python/graph_lattice/graph_lattice.py:25-61 | examples/python/graphs/graphs.py:47-81 \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":"examples/python/graph_lattice/graph_lattice.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e55ee107f69391ab78f3b5c67da06f22c64685bd99a2dad5caed04dced04bf4e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): examples/python/structure_from_motion/structure_from_motion/read_write_model.py:226-258 | examples/python/structure_from_motion/structure_from_motion/read_write_model.py:340-361 \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/python/structure_from_motion/structure_from_motion/read_write_model.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0c52157fdc4b0fbe32392d95526345c9b84d24fb032b30f3bf78779871e45e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): examples/python/structure_from_motion/structure_from_motion/read_write_model.py:191-222 | examples/python/structure_from_motion/structure_from_motion/read_write_model.py:313-336 \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/python/structure_from_motion/structure_from_motion/read_write_model.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"6378f1dd257c6dd2edeb6c826dc14f70f0772cab5ed78075ec2c960a49f6f345"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (49 corresponding lines): examples/python/face_tracking/face_tracking.py:351-411 | examples/python/gesture_detection/gesture_detection.py:210-258 \u2014 These two members are one piece of code written twice and then edited apart: 49 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/python/face_tracking/face_tracking.py"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea63fced62ba190b5d7d369cf3c7124110948f165b8c186be8a2d5879ea2374e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): examples/python/structure_from_motion/structure_from_motion/read_write_model.py:262-288 | examples/python/structure_from_motion/structure_from_motion/read_write_model.py:365-388 \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/python/structure_from_motion/structure_from_motion/read_write_model.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d46c191f8c024a2b65d09c9263e3735c12869cb763d6b2f36a494bc76c9f257"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): crates/store/dl_redap_tests/src/utils/dalaran.rs:954-992 | crates/store/dl_redap_tests/src/utils/dalaran.rs:1026-1062 \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":"crates/store/dl_redap_tests/src/utils/dalaran.rs"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a2f73da9bbbfad2c6d2d2ca0e4a7745e9c16ba89746d2ca6f76a040799e5f6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/viewer/dl_renderer_examples/depth_cloud.rs:407-435 | crates/viewer/dl_renderer_examples/depth_cloud.rs:449-478 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer_examples/depth_cloud.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1af4a40e63eec5ee5acd98dc5ac88cb3d335094f61848505af1da1fd0790a77"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): scripts/zombie_todos.py:327-344 | scripts/zombie_todos.py:348-365 \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":"scripts/zombie_todos.py"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"b91ca704a060621e79dbe7bb83c9da429b412a052765d6746e5ff20a19ad8d51"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): crates/utils/dl_test_mocks/src/otlp.rs:228-250 | crates/utils/dl_test_mocks/src/posthog.rs:261-283 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_test_mocks/src/otlp.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"f674b0f8c12c83f007a7c720115db212c5ebabed8d86816c506f9630f2f789e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): scripts/run_all.py:243-274 | scripts/run_all.py:318-342 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/run_all.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c84594200c14b53b41c64d03d01e3bd95b68782ecac2b5054d43a66c629dd6d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): examples/python/structure_from_motion/structure_from_motion/read_write_model.py:292-309 | examples/python/structure_from_motion/structure_from_motion/read_write_model.py:392-407 \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":"examples/python/structure_from_motion/structure_from_motion/read_write_model.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ecc8a6bd30735dd779cfd1b4e7f5376ba5e057d2bbcd3841851c4276523cba0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): examples/python/minimal/minimal.py:15-22 | examples/python/minimal_options/minimal_options.py:14-27 \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":"examples/python/minimal/minimal.py"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ad51c2744f0219e742e57c5b5b1e7f116dee301bbb6ce9b9e1dcb644c74963"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): crates/viewer/dl_test_context/src/lib.rs:1006-1024 | crates/viewer/dl_test_context/src/lib.rs:1027-1046 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_test_context/src/lib.rs"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"c021a74df07784f235a293677a8681dc3ff14a6c451f04bb893fe56c05b6d561"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): crates/viewer/dl_viewer_context/src/cache/video_stream_cache/test_player/encoded_depth_image.rs:37-52 | crates/viewer/dl_viewer_context/src/cache/video_stream_cache/test_player/encoded_image.rs:41-56 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache/test_player/encoded_depth_image.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd1b29b471f4deade330055b72e754d8d59b6fc124d8d92156e362b568bde4b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (8 members, 9\u002B corresponding lines): scripts/generate_view_coordinate_defs.py:162-171 | scripts/generate_view_coordinate_defs.py:179-187 | scripts/generate_view_coordinate_defs.py:202-211 | scripts/generate_view_coordinate_defs.py:219-227 | scripts/generate_view_coordinate_defs.py:241-249 | scripts/generate_view_coordinate_defs.py:261-269 | scripts/generate_view_coordinate_defs.py:283-291 | scripts/generate_view_coordinate_defs.py:303-311 \u2014 These 8 members are one piece of code written 8 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 8 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate_view_coordinate_defs.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"8034ee79058b45bce87daa89f45091963d2abb8a673ce8fbe7dc222af90c1544"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): scripts/append_web_viewer.py:65-88 | scripts/create_web_viewer_zip.py:60-86 \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":"scripts/append_web_viewer.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e47a1196068677cd9ff8f8c565cba90758d522c8f1f479ab837ef7818073b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): examples/python/drone_lidar/drone_lidar.py:30-47 | examples/python/segment_anything_model/segment_anything_model.py:47-63 | examples/python/structure_from_motion/structure_from_motion/__main__.py:79-90 \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":"examples/python/drone_lidar/drone_lidar.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f3085e80591518b087de4784b7ccf2f44a216cc510204facd294cc92dee115"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): scripts/generate_view_coordinate_defs.py:120-127 | scripts/generate_view_coordinate_defs.py:141-148 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate_view_coordinate_defs.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a56cd19a91b062430b2caf333312db4760f392e313e0734abb04e91eeb6ae5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): examples/python/using_index_values/using_index_values.py:53-92 | examples/python/using_index_values/using_index_values.py:96-129 \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":"examples/python/using_index_values/using_index_values.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8cac62e463d6010c54294fb21faf87c3ba5eb13ba05e8315f62b9c3da160deb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): scripts/ci/check_doc_order.py:17-29 | scripts/ci/check_skills.py:22-34 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/check_doc_order.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c733933654cdbce393ebbd6025a2eb51d32548a06a512aa319c5b3aec6528de"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 8\u002B corresponding lines): scripts/ci/generate_prerelease_pip_index.py:95-102 | scripts/ci/pixi_install_wheel.py:96-109 | scripts/ci/uv_install_wheel.py:96-108 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 8 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/generate_prerelease_pip_index.py"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e0bc16fddef55203768c2ddfcf73bb32da11651c83f747cdd04d81ca7402a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/viewer/dl_viewer_context/src/cache/video_stream_cache/test_player/encoded_depth_image.rs:13-21 | crates/viewer/dl_viewer_context/src/cache/video_stream_cache/test_player/encoded_image.rs:17-25 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache/test_player/encoded_depth_image.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6b38e447346f5f771a82014b2958c9545efb96849c4f8d23781f35dc8165f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): scripts/zombie_todos.py:299-309 | scripts/zombie_todos.py:313-323 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/zombie_todos.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"41c955b3fd14582afe6ec08d1279c62d41dcca05992a0b3327b1b722ef5c40c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): crates/store/dl_redap_tests/src/utils/client.rs:100-113 | crates/store/dl_redap_tests/src/utils/client.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":"crates/store/dl_redap_tests/src/utils/client.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b03fe77ec319d0d89a34753879166c162520c338b3786100f90cc563a2bf84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): examples/python/openstreetmap_data/openstreetmap_data.py:61-69 | examples/python/openstreetmap_data/openstreetmap_data.py:73-83 \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/python/openstreetmap_data/openstreetmap_data.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6d4c0436f0b8117fff2e23051699dc5d1eeec660b3a114a88ca8a4d185ffd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): examples/python/human_pose_tracking/human_pose_tracking.py:116-121 | examples/python/human_pose_tracking/human_pose_tracking.py:127-132 \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/python/human_pose_tracking/human_pose_tracking.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0234f57661e1221cf9721b34b90149c6b914a1631b99b616c725deac5871fcf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): scripts/ci/check_speculative_links.py:33-40 | scripts/ci/mdlint.py:430-437 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/check_speculative_links.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b166a24ed3f94fb63d14a93cbcbad0d81ab784c8c3be17d57f97e1d32ba1e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): examples/python/ros_node/main.py:134-141 | examples/python/ros_node/main.py:144-151 \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":"examples/python/ros_node/main.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ac51cbe7d416fe9e856a55b8a5a09b3d97423184de609f2bc441da21f1ca39"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): examples/python/clock/clock.py:68-77 | examples/python/live_depth_sensor/live_depth_sensor.py:93-103 | examples/python/robot_arm_teleop/main.py:193-202 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/python/clock/clock.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5a9b4ae8914090e24fa05a804561bb20f9e050e223de1bbbb72174a4f97b4c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): crates/viewer/dl_renderer_examples/multiview.rs:167-175 | crates/viewer/dl_renderer_examples/picking.rs:28-36 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer_examples/multiview.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb0b19cccd9c584a71790eb35fca5ff9e3c687715397e991b09ab8feedd93ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): crates/viewer/dl_viewer_context/src/cache/video_stream_cache/test_player/encoded_depth_image.rs:23-35 | crates/viewer/dl_viewer_context/src/cache/video_stream_cache/test_player/encoded_image.rs:27-39 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache/test_player/encoded_depth_image.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba17272d263051c6c517c0c35cdbeee5ec6254410af63c1c72f23ed367bae5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): examples/python/objectron/objectron/download_dataset.py:32-38 | examples/python/human_pose_tracking/human_pose_tracking.py:193-197 \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/python/objectron/objectron/download_dataset.py"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4134cb1f850ee0334b26ba0d74fba45064d72ce9048d1291344742a6bcb391"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 2\u002B corresponding lines): scripts/ci/build_and_upload_dalaran_notebook.py:26-27 | scripts/ci/build_and_upload_wheels.py:31-32 | scripts/ci/publish_wheels.py:33-34 | scripts/ci/update_dalaran_notebook_version.py:29-30 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 2 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/build_and_upload_dalaran_notebook.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f53dc1b69b84d0abd6292d66bd0e3d730355ae6173df11340e6527a9acb926a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29\u201330 lines \u00D7 2): crates/viewer/dl_viewer_context/src/cache/video_stream_cache/test_player/encoded_depth_image.rs:57-86 | crates/viewer/dl_viewer_context/src/cache/video_stream_cache/test_player/encoded_image.rs:61-89 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_viewer_context/src/cache/video_stream_cache/test_player/encoded_depth_image.rs:57\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache/test_player/encoded_depth_image.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff4c4f4f271f8ef2fb940856b7baccccd9d4b530826eb88459281c5f0cc037f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2): crates/viewer/dl_renderer_examples/depth_cloud.rs:110-147 | crates/viewer/dl_renderer_examples/depth_cloud.rs:192-229 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer_examples/depth_cloud.rs:110\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer_examples/depth_cloud.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f4b34097e2e8c664dca3510811aab76d0d1bd72206a968d58dd04ef649e46c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): crates/store/dl_redap_tests/src/utils/dalaran.rs:708-728 | crates/store/dl_redap_tests/src/utils/dalaran.rs:835-855 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/utils/dalaran.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab44021f17ca8919664261a052453094c1f99a435147ee5bf8e058a0f1c65e07"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/viewer/dl_renderer_examples/outlines.rs:122-141 | crates/viewer/dl_renderer_examples/picking.rs:187-206 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer_examples/outlines.rs:122\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer_examples/outlines.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f87fd0a53a54bf4b9e8fbefd397548af960be24db2c537f96ca0db8b185c3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2): crates/store/dl_redap_tests/src/utils/dalaran.rs:733-762 | crates/store/dl_redap_tests/src/utils/dalaran.rs:779-808 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_redap_tests/src/utils/dalaran.rs:733\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/utils/dalaran.rs"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"d267b784314406359766e544765d31744daec08d3ddadc38cd1c25e258046b0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201317 lines \u00D7 2): crates/store/dl_redap_tests/src/utils/dalaran.rs:326-342 | crates/store/dl_redap_tests/src/utils/dalaran.rs:604-617 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/utils/dalaran.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffbc292b26ca9f259d35dbf13355f14506e1d646f7208140a12cf96701d3514f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/store/dl_redap_tests/src/utils/dalaran.rs:81-95 | crates/store/dl_redap_tests/src/utils/dalaran.rs:214-228 | crates/store/dl_redap_tests/src/utils/dalaran.rs:1162-1176 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/utils/dalaran.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b7b1afad2eece18302ce134c497a7eaa98fcd27df90b3f2d2c0306bf845f3c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): crates/store/dl_redap_tests/src/utils/dalaran.rs:712-726 | crates/store/dl_redap_tests/src/utils/dalaran.rs:839-853 | crates/store/dl_redap_tests/src/utils/dalaran.rs:888-902 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/utils/dalaran.rs"},"region":{"startLine":712}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c4caa60f49de4faafc76e95e63ae54d706e7f478f0bbda496e4cfd2e2d982b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/store/dl_redap_tests/src/utils/dalaran.rs:468-482 | crates/store/dl_redap_tests/src/utils/dalaran.rs:489-502 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_redap_tests/src/utils/dalaran.rs:468\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/utils/dalaran.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"04b8ded0c021513f03919dacdab25253d90c0c96af6f9272c726dba49fb1a18b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): crates/store/dl_redap_tests/src/utils/dalaran.rs:494-506 | crates/store/dl_redap_tests/src/utils/dalaran.rs:669-683 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_redap_tests/src/utils/dalaran.rs:494\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/utils/dalaran.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6fa6ed1974c0082d5053842a76eaede3b3e947e62adbfc641c3c6c30cc3285a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/store/dl_redap_tests/src/utils/dalaran.rs:158-171 | crates/store/dl_redap_tests/src/utils/dalaran.rs:257-270 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_redap_tests/src/utils/dalaran.rs:158\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/utils/dalaran.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"b233361b84d4c0816d22f6a53bf3e8a6234c988f668861df1c4fe871de59efbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/store/dl_redap_tests/src/utils/dalaran.rs:509-521 | crates/store/dl_redap_tests/src/utils/dalaran.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 \u0060crates/store/dl_redap_tests/src/utils/dalaran.rs:509\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/utils/dalaran.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"067532a84df13493a0187e824e593793dacbc2335c5836b8b34a5f7f8fe6f35b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/store/dl_redap_tests/src/utils/dalaran.rs:333-343 | crates/store/dl_redap_tests/src/utils/dalaran.rs:846-856 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_redap_tests/src/utils/dalaran.rs:333\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/utils/dalaran.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96762d6147d10b94665cf8a9dbe8fe73a56cc057e23a8afbeea949812aaa023"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/viewer/dl_renderer_examples/outlines.rs:51-61 | crates/viewer/dl_renderer_examples/picking.rs:134-144 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer_examples/outlines.rs:51\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer_examples/outlines.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"50196486b06495e2d90ff0a1da9e773ec45767a7b247ea0b6be153bdbbe607aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/store/dl_redap_tests/src/utils/dalaran.rs:454-463 | crates/store/dl_redap_tests/src/utils/dalaran.rs:477-486 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_redap_tests/src/utils/dalaran.rs:454\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/utils/dalaran.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e6ddb70c702346ece6522037c5a53a2f80fcbe3c14ffe257144f7bb81a22ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/store/dl_redap_tests/src/utils/dalaran.rs:508-517 | crates/store/dl_redap_tests/src/utils/dalaran.rs:680-689 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_redap_tests/src/utils/dalaran.rs:508\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/utils/dalaran.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"54410039a32bc9bffc0ed6a68f33fdc02c9b2ee434e689cfcf26758c6167035d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): crates/store/dl_redap_tests/src/utils/dalaran.rs:157-165 | crates/store/dl_redap_tests/src/utils/dalaran.rs:256-264 | crates/store/dl_redap_tests/src/utils/dalaran.rs:519-527 | crates/store/dl_redap_tests/src/utils/dalaran.rs:529-537 | crates/store/dl_redap_tests/src/utils/dalaran.rs:1219-1227 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/utils/dalaran.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07963a75f2d2b9340539900d49c9f030f68b60a0c48f5d274585eb322371f8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): crates/store/dl_redap_tests/src/utils/dalaran.rs:474-482 | crates/store/dl_redap_tests/src/utils/dalaran.rs:494-502 | crates/store/dl_redap_tests/src/utils/dalaran.rs:555-563 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_redap_tests/src/utils/dalaran.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/utils/dalaran.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5c5f13c3d1e4a696ed5848b15af6c349a1f7d7b4064675a00015c866238f94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 8): crates/store/dl_redap_tests/src/utils/dalaran.rs:88-95 | crates/store/dl_redap_tests/src/utils/dalaran.rs:221-228 | crates/store/dl_redap_tests/src/utils/dalaran.rs:333-343 | crates/store/dl_redap_tests/src/utils/dalaran.rs:611-618 | crates/store/dl_redap_tests/src/utils/dalaran.rs:719-729 | crates/store/dl_redap_tests/src/utils/dalaran.rs:846-856 | crates/store/dl_redap_tests/src/utils/dalaran.rs:1105-1112 | crates/store/dl_redap_tests/src/utils/dalaran.rs:1169-1176 \u2014 all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_redap_tests/src/utils/dalaran.rs:88\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/utils/dalaran.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a33e92b777d1ca7b44c31b34ff450d31614415f43ef0664202e699f99c96f29"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/store/dl_redap_tests/src/utils/dalaran.rs:359-365 | crates/store/dl_redap_tests/src/utils/dalaran.rs:624-631 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/utils/dalaran.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fa6761c82e40c92524ad009ef0cd80a26d09157821da0b97c2c09aefca60b9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/store/dl_redap_tests/src/utils/dalaran.rs:108-113 | crates/store/dl_redap_tests/src/utils/dalaran.rs:370-375 | crates/store/dl_redap_tests/src/utils/dalaran.rs:1188-1193 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/utils/dalaran.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b4a4fc0a930bfd57107c0c4b690c10a6da00d1e58e690c091accb27f5deae62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/utils/dl_test_mocks/src/otlp.rs:239-244 | crates/utils/dl_test_mocks/src/posthog.rs:272-277 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/utils/dl_test_mocks/src/otlp.rs:239\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_test_mocks/src/otlp.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"0484407fc4e749552f23213a48080c54114cde07878034fde6bba500af663767"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 4): crates/store/dl_redap_tests/src/utils/dalaran.rs:109-114 | crates/store/dl_redap_tests/src/utils/dalaran.rs:371-376 | crates/store/dl_redap_tests/src/utils/dalaran.rs:630-634 | crates/store/dl_redap_tests/src/utils/dalaran.rs:1189-1194 \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 after the matched lines, \u0060crates/store/dl_redap_tests/src/utils/dalaran.rs:117\u0060 calls \u0060MyLabel\u0060, \u0060to_owned\u0060 and \u0060crates/store/dl_redap_tests/src/utils/dalaran.rs:638\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/utils/dalaran.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"0164bfd35fd722eec7b1554840c59cd3ca664157846b52a27c350b46d2baa29a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/utils/dl_test_mocks/src/otlp.rs:256-263 | crates/utils/dl_test_mocks/src/posthog.rs:289-296 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_test_mocks/src/otlp.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"510ff47a18070e517800421e9dfe9848ccb21f51aff3c39f50d3fc1bed48e398"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/viewer/dl_test_context/src/lib.rs:1011-1024 | crates/viewer/dl_test_context/src/lib.rs:1033-1046 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_test_context/src/lib.rs:1011\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_test_context/src/lib.rs"},"region":{"startLine":1011}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bf902ffc3452333848937e63c6034ad9103fcc6e7bd685a6208db60aebc8ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/viewer/dl_renderer_examples/picking.rs:132-143 | crates/viewer/dl_renderer_examples/world_grid.rs:64-75 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/viewer/dl_renderer_examples/picking.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":"crates/viewer/dl_renderer_examples/picking.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"957c54f1429af23de1e406e8c0f17e1578478c8ec60375a24fdda723fe20e688"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/store/dl_redap_tests/src/utils/dalaran.rs:281-287 | crates/store/dl_redap_tests/src/utils/dalaran.rs:326-332 | crates/store/dl_redap_tests/src/utils/dalaran.rs:604-610 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060crates/store/dl_redap_tests/src/utils/dalaran.rs:281\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060crates/store/dl_redap_tests/src/utils/dalaran.rs:290\u0060 calls \u0060blueprint\u0060 and \u0060crates/store/dl_redap_tests/src/utils/dalaran.rs:335\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/utils/dalaran.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"d002f0d1283d3c9f3fd91c8a0723a6565a7ab449ee1b97e52dad6618c994ec8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): scripts/ci/pixi_install_wheel.py:54-84 | scripts/ci/uv_install_wheel.py:48-78 \u2014 before extracting anything, compare \u0060scripts/ci/pixi_install_wheel.py\u0060 and \u0060scripts/ci/uv_install_wheel.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/pixi_install_wheel.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcebd2d294cee83fe992064eacba846bbbc96dc16aa4fd6f00abee806474356d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): scripts/upload_dlr.py:62-88 | scripts/upload_image.py:285-311 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/upload_dlr.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea615bad5374c5030c451fcff5e852c16a69ce6ee0183cce4b5ca97bb71edda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): examples/python/any_scalar/any_scalar/market_demo.py:98-121 | examples/python/any_scalar/any_scalar/market_demo.py:122-145 \u2014 both copies are in the same file, so extract the block into one function there 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/python/any_scalar/any_scalar/market_demo.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3261534fc4c779c4ce051f6a4414562b178ed2e6225185dbc8830e208d35a76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): examples/python/lidar/lidar/__main__.py:30-49 | examples/python/nuscenes_dataset/nuscenes_dataset/__main__.py:41-60 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/python/lidar/lidar/__main__.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e0b1b3756b09e3c8fd4835c53587b108502717d8028b31cc6d0ede743a2481e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): examples/python/face_tracking/face_tracking.py:438-455 | examples/python/gesture_detection/gesture_detection.py:277-293 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060examples/python/face_tracking/face_tracking.py:438\u0060 it begins part-way through the construct above it, so those exact 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/python/gesture_detection/gesture_detection.py:276\u0060 calls \u0060add_argument\u0060 and \u0060examples/python/face_tracking/face_tracking.py:438\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/python/face_tracking/face_tracking.py"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e420d2e49e2026af9e758b607dd3ca300eb126fe6d7a4e4bc71b7888d9e485"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3): examples/python/structure_from_motion/structure_from_motion/read_write_model.py:106-120 | examples/python/structure_from_motion/structure_from_motion/read_write_model.py:191-205 | examples/python/structure_from_motion/structure_from_motion/read_write_model.py:313-327 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it 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/python/structure_from_motion/structure_from_motion/read_write_model.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"359bc768a72fb2fd2bc804c3b5e65fb1137ca7a6007e89e904b3e63710947341"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): examples/python/droid_semantic_search/ingest.py:57-70 | examples/python/droid_semantic_search/search.py:47-59 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/python/droid_semantic_search/ingest.py:57\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. 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/python/droid_semantic_search/ingest.py"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c270b49d28709085c95f1f7dd8de43799d5c90b591c0dc6251deaece13fda84"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): examples/python/lidar/lidar/__main__.py:78-91 | examples/python/nuscenes_dataset/nuscenes_dataset/__main__.py:290-303 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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/python/lidar/lidar/__main__.py"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a833d85b3a98d4d3aedf676f7065853ccc07f9752d43a292e31575623cf5295"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201314 lines \u00D7 2): examples/python/live_depth_sensor/live_depth_sensor.py:27-37 | examples/python/live_depth_sensor/live_depth_sensor.py:51-64 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/python/live_depth_sensor/live_depth_sensor.py:51\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted 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/python/live_depth_sensor/live_depth_sensor.py"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbc19344ffe2fd9be62db4ebf98c6710df7b9e37583217f26a58e634ac28402a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): examples/python/structure_from_motion/structure_from_motion/read_write_model.py:226-238 | examples/python/structure_from_motion/structure_from_motion/read_write_model.py:340-352 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/python/structure_from_motion/structure_from_motion/read_write_model.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"414fb7ae35a28faee5941ff5569b90c14cc8c5c1db2a2f1952f75d803518440a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): examples/python/dataloader/prepare_dataset.py:87-96 | examples/python/droid_semantic_search/prepare_dataset.py:128-139 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/python/dataloader/prepare_dataset.py"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"99ae1ba485d3d2b54992767e3e9eb552c6375084c243cd8777cddb9807781988"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): examples/python/face_tracking/face_tracking.py:374-385 | examples/python/gesture_detection/gesture_detection.py:226-237 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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, \u0060examples/python/face_tracking/face_tracking.py:387\u0060 calls \u0060resize_image\u0060 and \u0060examples/python/gesture_detection/gesture_detection.py:242\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/python/face_tracking/face_tracking.py"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"24165892106c35a2ba06a52e19e44b3cb6349f87bb70048a30fb03e4dcbf41b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): scripts/ci/pixi_install_wheel.py:33-44 | scripts/ci/uv_install_wheel.py:32-43 \u2014 before extracting anything, compare \u0060scripts/ci/pixi_install_wheel.py\u0060 and \u0060scripts/ci/uv_install_wheel.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/pixi_install_wheel.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"99fbf1d6bd0c26c04461acd6c6d7186e78368b64eb72eb54a6c8f7ec7f59c763"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): scripts/update_docs_url_rewrite.py:93-102 | scripts/update_docs_url_rewrite.py:115-126 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/update_docs_url_rewrite.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce748cee6499c2d65b013b8152936c5637fb7aa0a9140255af3466c3a9e5e226"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): examples/python/graph_lattice/graph_lattice.py:34-44 | examples/python/graphs/graphs.py:54-64 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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 \u0060examples/python/graph_lattice/graph_lattice.py:34\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/python/graph_lattice/graph_lattice.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6849ab68ccf09fb16dc148664514e389b2899c92efaff907df7f1bb79ac45a76"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): examples/python/imu_signals/imu_signals.py:94-102 | examples/python/imu_signals/imu_signals.py:153-163 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/python/imu_signals/imu_signals.py:94\u0060 it begins part-way through the construct above it, so those exact 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/python/imu_signals/imu_signals.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7af56264acac66e08e8ee6b7c09cb2b455f516e710ec5e2b8fe57fb21fa52d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): examples/python/lidar/lidar/download_dataset.py:44-54 | examples/python/nuscenes_dataset/nuscenes_dataset/download_dataset.py:44-54 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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/python/lidar/lidar/download_dataset.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a928c2ccf2685a52b4432ee72bbaed79b5a7b070fbbd18120a2383a16c7adf93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): examples/python/structure_from_motion/structure_from_motion/read_write_model.py:212-222 | examples/python/structure_from_motion/structure_from_motion/read_write_model.py:248-258 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \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/python/structure_from_motion/structure_from_motion/read_write_model.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"503d2c5a58a4fb773add045a66f4e47e409c38b2fe5eed99f62eb188bf922f01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): examples/python/detect_and_track_objects/detect_and_track_objects.py:443-452 | examples/python/human_pose_tracking/human_pose_tracking.py:165-174 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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/python/detect_and_track_objects/detect_and_track_objects.py"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffdcc575c5d775f799603bd27889c156c9911837c50d913970d6012badfff7c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): examples/python/nuscenes_dataset/nuscenes_dataset/__main__.py:182-191 | examples/python/nuscenes_dataset/nuscenes_dataset/__main__.py:197-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. 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/python/nuscenes_dataset/nuscenes_dataset/__main__.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c0b773b9d856ceccde900dad66541de4e775ef83e844b2aea49c3bfb7ce3b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): scripts/lint.py:101-110 | scripts/roundtrip_utils.py:15-24 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lint.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3a4de121b571fc2d67e488ba54d4eddbe3538928286c23ae96dc126e2fa50d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7): examples/python/face_tracking/face_tracking.py:328-336 | examples/python/gesture_detection/gesture_detection.py:176-184 | examples/python/lidar/lidar/download_dataset.py:32-40 | examples/python/nuscenes_dataset/nuscenes_dataset/download_dataset.py:32-40 | examples/python/ocr/ocr.py:453-461 | examples/python/open_photogrammetry_format/open_photogrammetry_format.py:62-70 | scripts/upload_image.py:324-332 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/python/face_tracking/face_tracking.py"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd2e28cef913e83c5fcde4084ff438723e9443d1cb8c1e0cc8d62361b7bed0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): examples/python/face_tracking/face_tracking.py:390-398 | examples/python/gesture_detection/gesture_detection.py:242-250 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/python/face_tracking/face_tracking.py:387\u0060 calls \u0060resize_image\u0060 and \u0060examples/python/gesture_detection/gesture_detection.py:237\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/python/face_tracking/face_tracking.py"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"6450b83cd692eb373e29f5b40faae066596cbfde52e5bab9cb26376fa7d63245"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): scripts/lint.py:1727-1735 | scripts/lint.py:1739-1749 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lint.py"},"region":{"startLine":1727}}}],"partialFingerprints":{"codehealthFindingId/v1":"493a7567ef2b67a81f16a1c6ca96c2f7953491991937654862709330a14fc61a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): examples/python/aloha_lerobot/aloha_lerobot.py:36-43 | examples/python/so100_pickplace/so100_pickplace.py:54-61 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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/python/aloha_lerobot/aloha_lerobot.py"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3c59d208f1ce294984899040aa2cc25693669099fe6092d44eec5c78ce73888"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/zombie_todos.py:337-344 | scripts/zombie_todos.py:358-365 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/zombie_todos.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4a4468ee5d9eb838552efa847114d4239229c75ebc7179d6ba28e8a1511cec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): scripts/ci/approve_workflow_runs.py:41-49 | scripts/ci/check_pr_checkboxes.py:22-30 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/approve_workflow_runs.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"958918a0ff560df9620bbd26e705400da554791c42626239173e4cca029e6e9f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/ci/compare.py:53-60 | scripts/ci/count_bytes.py:58-65 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \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.py"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"9565cc1e603b9c997d556aa3eb0ba2b9dc4c753f8ad9b92dcff927490f108c6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): scripts/ci/python_check_signatures.py:132-137 | scripts/ci/python_check_signatures.py:162-167 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/python_check_signatures.py"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e2e51c1dddecf0a1d357d08344254898b0c79b1387feb422655429e996fb2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): examples/python/structure_from_motion/structure_from_motion/read_write_model.py:331-336 | examples/python/structure_from_motion/structure_from_motion/read_write_model.py:356-361 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. 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/python/structure_from_motion/structure_from_motion/read_write_model.py"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"a805a7ae77601e82a1c03f1c3dff7f96265fc1d01562211897ac81464d2f4ef2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/ci/compare.py:69-73 | scripts/ci/count_bytes.py:74-78 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from 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.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"097422dfed2db8b3b2211661ed7f949650083c5a345fc7b7b73fd88f18988b19"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/ci/pixi_install_wheel.py:88-92 | scripts/ci/uv_install_wheel.py:88-92 \u2014 before extracting anything, compare \u0060scripts/ci/pixi_install_wheel.py\u0060 and \u0060scripts/ci/uv_install_wheel.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/pixi_install_wheel.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eaa213bc5eb1c5ce5bcc6aa4b89661788591a33018566ee1a0aea86669d0972"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): examples/python/face_tracking/face_tracking.py:340-347 | examples/python/gesture_detection/gesture_detection.py:188-195 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. 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/python/face_tracking/face_tracking.py"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac945a2d9c5fe6dc49879541ff7dcbe828d921d4eb888122af72c1b84f9ec0c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): examples/python/lidar/lidar/download_dataset.py:58-66 | examples/python/nuscenes_dataset/nuscenes_dataset/download_dataset.py:58-66 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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/python/lidar/lidar/download_dataset.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d66f5ab9ba8d7fa2a6bc22e24bf767ae3822904612286d01721ac5c0ccdcde"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): scripts/ci/compare.py:24-31 | scripts/ci/count_bytes.py:29-36 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. 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.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"658739e257ea7aa2588e068221784a308da91e72e40d97e99e98f4657e198927"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): scripts/ci/bundle_and_upload_dalaran_cpp.py:23-27 | scripts/screenshot_compare/build_screenshot_compare.py:67-71 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or 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":"scripts/ci/bundle_and_upload_dalaran_cpp.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8bffbda96ab6e047703a5a0148132d3bca04730abae6276c73d746cb2cd2f11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): scripts/ci/upload_docs.py:293-298 | scripts/ci/upload_docs.py:395-400 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/upload_docs.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"ade48f2ae4b9fc606b200dd33feb035958d09f33f1595dd18b41fbe142df7428"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project dalaran: dalaran has instability 0.95 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5741b9a20c62225507b848a2d739a17bb668dd5113c1b818865d2fda0a0efc3d"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project dl_blueprint_tree: dl_blueprint_tree has instability 0.91 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0f05836654acf05fb86d1d884ce4384143ff944d9be3e2fac245b87b69088f4a"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project dl_chunk_store_ui: dl_chunk_store_ui has instability 0.91 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0d0025c6c41b8bca90d7205f512e9ef77d2d6a33556da5f7c34e2e2280f300b8"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project dl_dataframe_ui: dl_dataframe_ui has instability 0.88 with 3 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1cfe996128e2653faf93c6af446dec81c365893fd4c6455e8fe5fc4e192457d7"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project dl_datafusion: dl_datafusion has instability 0.86 with 3 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"35ebe4127bdfa0ce529771e024f6e5c8651561fa9c9dad35e56f05a0d47a1799"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project dl_hdf5: dl_hdf5 has instability 0.83 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"238068e71cb96a394e4869371fbbda1486135ffde006d59b43fd0990740fc8de"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project dl_recording_panel: dl_recording_panel has instability 0.92 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"042b4d4caf7bbb1804a69020ab5c2839ad0ea0fb9bac797ed9c6a8ca2efac329"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project dl_redap_browser: dl_redap_browser has instability 0.89 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8db3669b03a67a6e6e6fa570ebd3fd674609de2b16db1596ec8b7f7c952af1bf"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project dl_sdk: dl_sdk has instability 0.83 with 4 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"276cea01bd53277faa400d915ee814952cfcb29f1bceeca140ba67cb6862ee7d"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project dl_selection_panel: dl_selection_panel has instability 0.89 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ab4e78f958da97dd1d045c5df91c19be8acbdefcbda05f6c512a0a0652a604a2"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project dl_server: dl_server has instability 0.82 with 4 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"86e33ee98e5e5f8b765fb212e7dd653ad531d28cf6cc9428a92899a62858c9f9"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project dl_test_context: dl_test_context has instability 0.94 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1efa72bda20e220ead8ea1a4697bef396cf167107a9cab4d0647c8b4410b3c59"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project dl_tf: dl_tf has instability 0.83 with 2 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7c10b3b52b50c76f60ad367f61613fa7b81a64e79c4e3723ede49efdfd39f4d7"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project dl_time_panel: dl_time_panel has instability 0.94 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e202d8aa4c4fcd06b3aaaa757e226fd257ccb123804615c4597834abe78071ed"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project dl_view_bar_chart: dl_view_bar_chart has instability 0.91 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"df58f1db052c7fdeba51f4e500ed9843948e0e1606752306d4a7e031f4f7944b"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project dl_view_dataframe: dl_view_dataframe has instability 0.94 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d9a8eea187da90087800bf09b5934a4b594e959e974b2fabfa711528041a1ab7"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project dl_view_graph: dl_view_graph has instability 0.93 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"767df485dcd62e6059a6fbb73c5af5f4a68f63727d0ff42f09019085071e8868"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project dl_view_map: dl_view_map has instability 0.93 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3834a9c683197bf93cec1412ca9236000bb10616cb44c0886f1e2c03684ff455"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project dl_view_spatial: dl_view_spatial has instability 0.95 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9bda169738a580de342e8edb94440530e5e4d1877a922109fe5288dfb6a45515"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project dl_view_state_timeline: dl_view_state_timeline has instability 0.92 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"4e6bed4b147b81d8adb546b4b93bc245c1065da37a6a4e08eb3d61d26cbfae64"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project dl_view_tensor: dl_view_tensor has instability 0.92 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c3326c21fa806e9c4232a7d15c17b0d6f3751358fb2db340daba740501cbe7fa"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project dl_view_text_document: dl_view_text_document has instability 0.89 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e0594f73e9212787b54f0da00e49b5d5163e49e022b05a099efaf72af4dfd255"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project dl_view_text_log: dl_view_text_log has instability 0.93 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dac608dd244cbe5d3880480ee573abbebdf357444d61d98a9876a2878135c582"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project dl_view_time_series: dl_view_time_series has instability 0.94 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"279a13011d48e4dcc5611e3209cdb547f8d3c7443a587bdc87e81b4f8d4093bf"}},{"ruleId":"D5","level":"warning","message":{"text":"Unstable project dl_viewer: dl_viewer has instability 0.98 with 1 dependents."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cd5ce09dd2c44ce9450363bc9c55df67e922eb618b93d067f7032ff81b42b89a"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: dl_build_tools: dl_build_tools: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 13 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"869766ca6e4833f1ff37d57261f833997229f828f2450e611690dbb2e7b4e163"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: dl_grpc_headers: dl_grpc_headers: 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":"8bb41f1d543e6a3b4d566ac1893964422bc7dbb7b7bb6911994fd6877aabe27b"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: dl_rvl: dl_rvl: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"83957bd92fc151f675ab6a57c7514de67ff886d8c001162e67783c520b946593"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: dl_span: dl_span: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 5 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9b4bfb3d23fe3bef2da09e3340f13aeefdca1946106476f2cbcf5394ee60f0c9"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: dl_tracing: dl_tracing: abstractness 0.00, instability 0.02, distance 0.98 \u2014 zone of pain \u2014 concrete and depended on by 59 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8e9b7c05a1c5e6dd5a63852d45f609d9d8b4239b58ab2d6625542ffbe94fd67f"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: dl_format: dl_format: abstractness 0.00, instability 0.05, distance 0.95 \u2014 zone of pain \u2014 concrete and depended on by 35 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"309d4ae47db00a4721779d3975575585888cf4fe69e637385d8fb29afd57052e"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: dl_build_info: dl_build_info: abstractness 0.00, instability 0.07, distance 0.93 \u2014 zone of pain \u2014 concrete and depended on by 13 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"8a343f96633e69e38fe1694a5c3504f3ca3b5ec0f4cce5fda490a0e761a5420d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: dl_web: dl_web: abstractness 0.00, instability 0.10, distance 0.90 \u2014 zone of pain \u2014 concrete and depended on by 9 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b8b0047991738a739a73d94f0a78e6d5072f0a6a9272755c5b1c2ea4225aef59"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: dl_log: dl_log: abstractness 0.14, instability 0.00, distance 0.86 \u2014 zone of pain \u2014 concrete and depended on by 71 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"965a36cc3337308e4dfb8ea96acc45f9af91aa7221b498d0a05ba0bbaeb9fbdf"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: dl_quota_channel: dl_quota_channel: abstractness 0.00, instability 0.14, distance 0.86 \u2014 zone of pain \u2014 concrete and depended on by 18 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9b972ee6784d0bc04680d204e650efde1e042b76555223816bde164301f83070"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: dl_tuid: dl_tuid: abstractness 0.00, instability 0.17, distance 0.83 \u2014 zone of pain \u2014 concrete and depended on by 10 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ac936060062c468045ed9bbe6750d37e131fa77a2531a57443f941d65ceaf151"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: dl_mutex: dl_mutex: abstractness 0.00, instability 0.18, distance 0.82 \u2014 zone of pain \u2014 concrete and depended on by 9 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"de02045ccc87ade391c9a34ab67e3101ddd848c4d48103a7b1cf3d75197fea47"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: dl_log_types: dl_log_types: abstractness 0.06, instability 0.13, distance 0.81 \u2014 zone of pain \u2014 concrete and depended on by 59 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bb8eb4736d7b6e7489883242949d0d8dbda926d0a86efbcff9e60f23ec45431b"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: dl_capabilities: dl_capabilities: 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":"e34b18c746b6c822516e8485c2e23f3dc9f4c424bd2064d5bad77523d0c12827"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: dl_string_interner: dl_string_interner: 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":"556a1bffe1574ea389f0ee4d7d2a63927bc7e1ba47d9a2efdcfa8c020a833224"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: dl_uri: dl_uri: abstractness 0.00, instability 0.20, distance 0.80 \u2014 zone of pain \u2014 concrete and depended on by 20 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9901fbdaee8107975990f0400f89840a346d97ff6cddcc951fcef1c29765d168"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: dl_backoff: dl_backoff: 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":"ce320ba6aad5e2704f47f046ba9a18bda08af0525ef402230c009c7fde8e0f2e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Chunk (LCOM4 4): Chunk\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/chunk.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b96f912adf047727842fcf20bf576497a161dd880fdba39217ca4622c747b2"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: McapImporter (LCOM4 4): McapImporter\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_mcap/importer.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"34cd20f3220843913cb1c53ec74117f1a1bfacbe9810c4582e89d49f4c4ddf6f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Notification (LCOM4 4): Notification\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/notifications.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9de99e32a1fd7ac82d4ab1f73ff6564f78f4b2f0bdf86fe2936979be9781e8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: History (LCOM4 4): History\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/history.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"39abfaf8a62c51e992da20a988f62d561b53aacbdc7cae2d9f8b50fb313b542f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: TilesDelegate (LCOM4 4): TilesDelegate\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport/src/viewport_ui.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec62d4d499e76d69b6b2c4b9f0e302c27ea8fd0e891a51346a275e1624ea6789"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_viewer/src/app/command_handling.rs: crates/viewer/dl_viewer/src/app/command_handling.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 94 in App::run_system_command at line 73. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_viewer/src/app/command_handling.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/command_handling.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff479d7528d5ca64df6a44836f86a12a6172733c62442f3764e05c636496a9d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/lint.py: scripts/lint.py changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 93 in lint.lint_line at line 191. 2 of those changes were fix/bug commits, and the other 18 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-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- scripts/lint.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/lint.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"118b704ed1c38b55007d6c505dfd112b1c00002c85a29541486b72f309fa3bdf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_viewer/src/app_state.rs: crates/viewer/dl_viewer/src/app_state.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in AppState::show at line 208. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_viewer/src/app_state.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app_state.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9cdac306e4e3734f3fb84e553c84fb03068edcbe3ce2a9f99b06a8fd471079c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_viewer_context/src/time_control/command.rs: crates/viewer/dl_viewer_context/src/time_control/command.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 59 in TimeControl::handle_time_command at line 202. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_viewer_context/src/time_control/command.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/time_control/command.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"587d39604f4b55749a72a59217ebc7247dd055e473a233600700e6af23b42494"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/store/dl_datafusion/src/dataframe_query_common.rs: crates/store/dl_datafusion/src/dataframe_query_common.rs changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in DataframeQueryTableProvider::scan at line 446. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/store/dl_datafusion/src/dataframe_query_common.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_common.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"6903e222c34b6cd09f11f7d470e75fd1a463b06b864bc1db06351738ff091835"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_viewer/src/app/add_data_source.rs: crates/viewer/dl_viewer/src/app/add_data_source.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in App::load_data_source at line 63. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_viewer/src/app/add_data_source.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/add_data_source.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c7cdc6b101177bd0b133a408b4baf65a6b1f0f9f125efd37dae003d73fb67f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/top/dalaran/src/commands/entrypoint.rs: crates/top/dalaran/src/commands/entrypoint.rs changed 27 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in Args::generate_markdown_manual at line 383. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/top/dalaran/src/commands/entrypoint.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/entrypoint.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"2857092eefeec78a8395c191dc3866dea42f700c33049ba6892bfecd4aaa429b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/build/dl_types_builder/src/codegen/python/mod.rs: crates/build/dl_types_builder/src/codegen/python/mod.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in dl_types_builder::codegen::python::code_for_struct at line 773. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/build/dl_types_builder/src/codegen/python/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b6f5d924e0c60b8a43353ef9f18ee84bbfe175e4a72b881c76e39776fcf93df"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/store/dl_data_source/src/data_source.rs: crates/store/dl_data_source/src/data_source.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in LogDataSource::from_uri at line 83. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/store/dl_data_source/src/data_source.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_data_source/src/data_source.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"8558483c5b53f9b7e4ec2557380fbdd613bf6ae220110edea3432206c6aac61c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_view_spatial/src/ui_3d.rs: crates/viewer/dl_view_spatial/src/ui_3d.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in SpatialView3D::view_3d at line 124. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_view_spatial/src/ui_3d.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/ui_3d.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"20dd480ad592cd5803736662c274785c5cfd5e152c051ce7e89b081a837f34bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/store/dl_chunk_store/src/writes.rs: crates/store/dl_chunk_store/src/writes.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in ChunkStore::insert_chunk_impl at line 280. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/store/dl_chunk_store/src/writes.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/writes.rs"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"1738ed39ede24de236804e1128cc9f28eaa3c77599b70abd46153b7c53534ab4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_selection_panel/src/selection_panel.rs: crates/viewer/dl_selection_panel/src/selection_panel.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in SelectionPanel::item_ui at line 161. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_selection_panel/src/selection_panel.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/selection_panel.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef6d0cc3c3586541f70d4d488e5fb5e7f68c8426471ae885ee1a809f543a1cd1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs: crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in dl_datafusion::dataframe_query_provider::cpu_worker::chunk_store_cpu_worker_thread at line 728. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c55a40417b558efae1c113ea79a3c33a09eefbb78d56d7defc1f8057cb5897"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_redap_browser/src/servers.rs: crates/viewer/dl_redap_browser/src/servers.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in dl_redap_browser::servers::error_ui at line 428. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_redap_browser/src/servers.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_redap_browser/src/servers.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"68140734c9218b7c616b070c89d96b5e9e25eb25cba99ca606be76b778aae180"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_viewer_context/src/open_url.rs: crates/viewer/dl_viewer_context/src/open_url.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in ViewerOpenUrl::open at line 570. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_viewer_context/src/open_url.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/open_url.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d84ac86de99707e070f3bf2067d3706b95bca410beac43d096db1b648939639"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_viewer/src/app/logic.rs: crates/viewer/dl_viewer/src/app/logic.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in App::receive_messages at line 149. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_viewer/src/app/logic.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/logic.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"a72de071011805a50c28bd381fbd6c9a9db040aece08110ccc461b1afada308f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_viewport/src/viewport_ui.rs: crates/viewer/dl_viewport/src/viewport_ui.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in ViewportUi::viewport_ui at line 54. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_viewport/src/viewport_ui.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport/src/viewport_ui.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c2c3797318bc566bfa42e8edff895829eef771705d4d254c5eaf2f116f01b08"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs: crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in dl_viewer_context::cache::video_stream_cache::handle_out_of_order_chunk at line 1974. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs"},"region":{"startLine":1974}}}],"partialFingerprints":{"codehealthFindingId/v1":"593da0d9b38723a3c815b0891111bc758b64304e5cfb1a2cd39b1335ba85178c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/generate_changelog.py: scripts/generate_changelog.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in generate_changelog.main at line 413. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- scripts/generate_changelog.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/generate_changelog.py"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"514bae970abe049cbe6b61ac783df0b034832cd2522f3ed70a83e6ce68fa08fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/_decoders.py: dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/_decoders.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in VideoFrameDecoder._decode_to_target at line 314. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/_decoders.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":"dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/_decoders.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"e185c50573442ca6ac3cfa9d2a2d0031f236c579002a35f4502d60a9bf97f6dc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/store/dl_datafusion/src/pushdown_expressions.rs: crates/store/dl_datafusion/src/pushdown_expressions.rs changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in dl_datafusion::pushdown_expressions::apply_filter_expr_to_queries at line 256. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/store/dl_datafusion/src/pushdown_expressions.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/pushdown_expressions.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ad395a91ea4f5f0083477a011b3fa7b653d015d4467344f362ba2ba853b3a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_data_ui/src/video_ui.rs: crates/viewer/dl_data_ui/src/video_ui.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in dl_data_ui::video_ui::video_data_ui at line 93. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_data_ui/src/video_ui.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/video_ui.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8ac2ae42c80f2be02ad3d35dc54212959608e19442feb99f88868a9d59c23a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/store/dl_datafusion/src/pipeline_budget.rs: crates/store/dl_datafusion/src/pipeline_budget.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in PipelineBudget::reserve_with_priority at line 1472. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/store/dl_datafusion/src/pipeline_budget.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/pipeline_budget.rs"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e82680cdca462a5d8c8d62a5e27edd08862fab5173431532cbc6897c80065fc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/store/dl_entity_db/src/dlr_manifest_index/chunk_prioritizer.rs: crates/store/dl_entity_db/src/dlr_manifest_index/chunk_prioritizer.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in ChunkFetcher::next_chunk at line 881. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/store/dl_entity_db/src/dlr_manifest_index/chunk_prioritizer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/dlr_manifest_index/chunk_prioritizer.rs"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"1532225afd001733c5938d0a2b9622768a9bedf9364bfd00eee2fca12ea69aca"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utils/dl_perf_telemetry/src/telemetry.rs: crates/utils/dl_perf_telemetry/src/telemetry.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in Telemetry::init at line 483. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/utils/dl_perf_telemetry/src/telemetry.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_perf_telemetry/src/telemetry.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccc49ce8d381aaeed2cbb4128884e81259a43b1d1b1c5ea3e333175e4df66d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_time_panel/src/time_selection_ui.rs: crates/viewer/dl_time_panel/src/time_selection_ui.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in dl_time_panel::time_selection_ui::loop_selection_ui at line 57. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_time_panel/src/time_selection_ui.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_panel/src/time_selection_ui.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21b2f2e110627a4966b57caa1cdeeea538bedd24c5adcadaaf29d60a04d1e5a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utils/dl_video/src/demux/mp4.rs: crates/utils/dl_video/src/demux/mp4.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in VideoDataDescription::load_mp4_from_reader at line 36. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/utils/dl_video/src/demux/mp4.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/demux/mp4.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"30e9c1b29e9d0277c4ab92dbaeee288ae99c591ee9893cb2ab441fc9e510193d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/top/dl_sdk/src/recording_stream.rs: crates/top/dl_sdk/src/recording_stream.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in dl_sdk::recording_stream::forwarding_thread at line 1593. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/top/dl_sdk/src/recording_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":"crates/top/dl_sdk/src/recording_stream.rs"},"region":{"startLine":1593}}}],"partialFingerprints":{"codehealthFindingId/v1":"17b095be751efbc1445a5d1dd63190e32cce8a2e2e612f7b8172ef6a72851fab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_data_ui/src/entity_db_ui.rs: crates/viewer/dl_data_ui/src/entity_db_ui.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in dl_data_ui::entity_db_ui::grid_content_ui at line 103. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_data_ui/src/entity_db_ui.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/entity_db_ui.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd6ca0e315868f03f44f191bd112f82b791724d0d43cd7b083bc7cee2b68d8c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: docs/snippets/compare_snippet_output.py: docs/snippets/compare_snippet_output.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in compare_snippet_output.main at line 91. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- docs/snippets/compare_snippet_output.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":"docs/snippets/compare_snippet_output.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4a4d5699f0ef0893629689cfdc1e442d8e12cd1b0dc803aee3998cba2dc66e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/store/dl_chunk_store/src/rebatch_videos.rs: crates/store/dl_chunk_store/src/rebatch_videos.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in dl_chunk_store::rebatch_videos::rebatch_video_chunks_to_gops at line 46. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/store/dl_chunk_store/src/rebatch_videos.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/rebatch_videos.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9acb7a6f69eab5bbdaa6eea78c6546a9d5d3367d744eca3d472c4136f405ccd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_dataframe_ui/src/preview_renderer.rs: crates/viewer/dl_dataframe_ui/src/preview_renderer.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in dl_dataframe_ui::preview_renderer::preview_timeline at line 379. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_dataframe_ui/src/preview_renderer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/preview_renderer.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc16a8e06104e8c40dffce98a65c94baff466b6382e046a048630cfbb78f6e8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_redap_browser/src/server_modal.rs: crates/viewer/dl_redap_browser/src/server_modal.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in ServerModal::ui at line 165. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_redap_browser/src/server_modal.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_redap_browser/src/server_modal.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1c7435c5296a3fffba0b9d6cd2bb0b43afb9b87658e5b1b904801b0a28a87d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/top/dalaran/src/commands/dlr/stats.rs: crates/top/dalaran/src/commands/dlr/stats.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in StatsCommand::run at line 33. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/top/dalaran/src/commands/dlr/stats.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/stats.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbd02de6375da39cd221beab80410bdae8c45687081dad0427abe3485ac9ceab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_ui/src/ui_ext.rs: crates/viewer/dl_ui/src/ui_ext.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in UiExt::native_window_buttons_ui at line 999. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_ui/src/ui_ext.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/ui_ext.rs"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9afafb405de5f2b9dcba17a397b5428118a35b5b0222415c829194c706370e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_viewer_context/src/item_collection.rs: crates/viewer/dl_viewer_context/src/item_collection.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in ItemCollection::copy_to_clipboard at line 200. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_viewer_context/src/item_collection.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/item_collection.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a665cc24f334ea3cfafde40793481fa7808544b7e2d54a91e4ee78feb72f514"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/build/dl_types_builder/src/codegen/docs/snippets_ref.rs: crates/build/dl_types_builder/src/codegen/docs/snippets_ref.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in SnippetsRefCodeGenerator::generate_fallible at line 126. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/build/dl_types_builder/src/codegen/docs/snippets_ref.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/docs/snippets_ref.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f68efba630c4cb5df2a60a87f3ca3b8d9999dc5a2ecef4a29f9221c704333e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_view_time_series/src/point_visualizer_system.rs: crates/viewer/dl_view_time_series/src/point_visualizer_system.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in SeriesPointsSystem::load_series at line 188. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_view_time_series/src/point_visualizer_system.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/point_visualizer_system.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b8d810141f609473b75ae89b5ef0be17640b824984853ea0e77cdc1c07ca5f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/ci/sync_release_assets.py: scripts/ci/sync_release_assets.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in sync_release_assets.fetch_binary_assets at line 38. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- scripts/ci/sync_release_assets.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/sync_release_assets.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"52037d96b126e8cec1100b31e9cb4a4ee50d12a69cdc15c462062087539ec0cf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_view_spatial/src/view_3d.rs: crates/viewer/dl_view_spatial/src/view_3d.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in SpatialView3D::on_register at line 66. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_view_spatial/src/view_3d.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/view_3d.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"818ed350ee07c8b27d51fe60c2be8d80f7936b07bb35789c0ad41b694b99630f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/store/dl_log_encoding/src/dlr/decoder/state_machine.rs: crates/store/dl_log_encoding/src/dlr/decoder/state_machine.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Decoder::try_read_impl at line 173. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/store/dl_log_encoding/src/dlr/decoder/state_machine.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/decoder/state_machine.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"009e20c980caa5a8b79f6fa3979628c8f88735e5d33d2d90c70aa18472a13d4b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/top/dl_sdk/src/spawn.rs: crates/top/dl_sdk/src/spawn.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in dl_sdk::spawn::spawn at line 206. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/top/dl_sdk/src/spawn.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/spawn.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebe0c4c3c4e18423b866a94f167bb432e94144170947a2816c872512607168a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/top/dalaran/src/commands/dlr/split.rs: crates/top/dalaran/src/commands/dlr/split.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in SplitCommand::run at line 85. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/top/dalaran/src/commands/dlr/split.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/split.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"aedca53f9658930c5abddfd15323d7fba532de8eb15b7845b68ebfb814616b9f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/store/dl_lenses_core/src/execute.rs: crates/store/dl_lenses_core/src/execute.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in dl_lenses_core::execute::execute at line 329. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/store/dl_lenses_core/src/execute.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/execute.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d98000fc850f34294291f4befa026fcd34cd8d6ca1c635b1cc5d3f0c54536e1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_view_spatial/src/picking_ui.rs: crates/viewer/dl_view_spatial/src/picking_ui.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in dl_view_spatial::picking_ui::picking at line 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_view_spatial/src/picking_ui.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/picking_ui.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0376545bbbac2b4b41a3ed3747ed7d66d45c7760f30beec568cf26693be25a61"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/build/dl_types_builder/src/codegen/rust/serializer.rs: crates/build/dl_types_builder/src/codegen/rust/serializer.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in dl_types_builder::codegen::rust::serializer::quote_arrow_field_serializer at line 472. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/build/dl_types_builder/src/codegen/rust/serializer.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/serializer.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ea67e27b212ccc9812023595e0beee1351e83877b84324cfe078ab9b417e9c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/build/dl_types_builder/src/docs.rs: crates/build/dl_types_builder/src/docs.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in dl_types_builder::docs::doclink_translation::try_translate_doclink at line 287. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/build/dl_types_builder/src/docs.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/docs.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"9695c623e8420a1a9ff6d7a4fef336e5d82bc9277a8584256577b9772b0d3965"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_view_spatial/src/max_image_dimension_subscriber.rs: crates/viewer/dl_view_spatial/src/max_image_dimension_subscriber.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in MaxImageDimensionsStoreSubscriber::on_events at line 98. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_view_spatial/src/max_image_dimension_subscriber.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/max_image_dimension_subscriber.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2b5cc9791d165b02e0472197847f07781e4b768ca0c89eeca1ae81aab5e9f9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_viewer/src/prefetch_chunks.rs: crates/viewer/dl_viewer/src/prefetch_chunks.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in dl_viewer::prefetch_chunks::prefetch_chunks_for_recordings at line 29. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_viewer/src/prefetch_chunks.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/prefetch_chunks.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cef84b4c58df4b223b03ab7bc37e5ac6ec09b9f66e89564a31a87b50208d3a3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_component_ui/src/variant_uis/redap_uri_button.rs: crates/viewer/dl_component_ui/src/variant_uis/redap_uri_button.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in dl_component_ui::variant_uis::redap_uri_button::redap_uri_button at line 15. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_component_ui/src/variant_uis/redap_uri_button.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/variant_uis/redap_uri_button.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"3005c2e9f168081c769a75e25938f52e13dce4447a6caef10e9e3d607e2d781b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_viewer_context/src/tensor/tensor_stats.rs: crates/viewer/dl_viewer_context/src/tensor/tensor_stats.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in TensorStats::from_tensor at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_viewer_context/src/tensor/tensor_stats.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/tensor/tensor_stats.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"9833788082431cc9631bfb1274f59d1591999fe938146a2716ee458966ab842e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_ui/src/list_item/list_item.rs: crates/viewer/dl_ui/src/list_item/list_item.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in ListItem::ui at line 439. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_ui/src/list_item/list_item.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/list_item/list_item.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2cbceb6a8015082a35351c10fd6f4c5e9395029068a41ed8f7eb655db4567e4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_view_dataframe/src/dataframe_ui.rs: crates/viewer/dl_view_dataframe/src/dataframe_ui.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in DataframeTableDelegate::header_cell_ui at line 254. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_view_dataframe/src/dataframe_ui.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_dataframe/src/dataframe_ui.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdd047c591c424b335dbb4a8d9279470bdaac46cdfa7b42836d0771aff2eedb0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_viewer/src/ui/dev_panel/transform_cache_ui/paint.rs: crates/viewer/dl_viewer/src/ui/dev_panel/transform_cache_ui/paint.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in dl_viewer::ui::dev_panel::transform_cache_ui::paint::draw_transform_cache_contents at line 214. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_viewer/src/ui/dev_panel/transform_cache_ui/paint.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/dev_panel/transform_cache_ui/paint.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"975458c81520d19815addc8c69db6997533c8d62653e94434e9c2a10a3a65b1f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: dalaran_py/src/catalog/segment_url_udf.rs: dalaran_py/src/catalog/segment_url_udf.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in SegmentUrlUdf::invoke_with_args at line 168. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- dalaran_py/src/catalog/segment_url_udf.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/catalog/segment_url_udf.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"1061cd4abd9c71530f522c4384c7d857bf7461afcfd20a64c5f166712767c7a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_data_ui/src/item_ui.rs: crates/viewer/dl_data_ui/src/item_ui.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in dl_data_ui::item_ui::entity_db_button_ui at line 610. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_data_ui/src/item_ui.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/item_ui.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e6dfb6cddb71fbfbbf15db02b339a7469d4e3d3e2943530cb3d693c51fab4a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/store/dl_sorbet/src/migrations/v0_0_2__to__v0_1_0.rs: crates/store/dl_sorbet/src/migrations/v0_0_2__to__v0_1_0.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in dl_sorbet::migrations::v0_0_2__to__v0_1_0::rewire_tagged_components at line 29. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/store/dl_sorbet/src/migrations/v0_0_2__to__v0_1_0.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/migrations/v0_0_2__to__v0_1_0.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a12f5f0e9328c1f22f09aae54d8c2950d4e35fdb285a66d24235954ad542052"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_view_spatial/src/shared_fallbacks.rs: crates/viewer/dl_view_spatial/src/shared_fallbacks.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in dl_view_spatial::shared_fallbacks::register_fallbacks at line 27. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_view_spatial/src/shared_fallbacks.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/shared_fallbacks.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc34ff48dc0299c043cc9bd77e142f67b8c59c2ad75e3c81f8fd24ef135af322"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_viewer/src/viewer_analytics/event.rs: crates/viewer/dl_viewer/src/viewer_analytics/event.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in dl_viewer::viewer_analytics::event::open_recording at line 64. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_viewer/src/viewer_analytics/event.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/viewer_analytics/event.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6217deea930efe84d87b996a417f081020d0a08fd017582cab804880a4bb64"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/store/dl_importer/src/importer_external.rs: crates/store/dl_importer/src/importer_external.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ExternalImporter::import_from_path at line 141. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/store/dl_importer/src/importer_external.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_external.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a80b425ed410d64ff50ace28bf3d38c829bb2b45ac3d505623b72599d60bc0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/build/dl_types_builder/src/objects/from_rust.rs: crates/build/dl_types_builder/src/objects/from_rust.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in Parser::parse_named_type at line 673. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/build/dl_types_builder/src/objects/from_rust.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/objects/from_rust.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3d83fc8410909f473ebe5521715ecbd2b265e186d02421ceb16bdf991493f78"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/top/dalaran/src/commands/dlr/route.rs: crates/top/dalaran/src/commands/dlr/route.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in dalaran::commands::dlr::route::process_messages at line 103. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/top/dalaran/src/commands/dlr/route.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/route.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"59c72dea1d0426ab0de7df034432165dcd56bef785d5034283ab16a5f4ad448f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/build/dl_types_builder/src/codegen/cpp/mod.rs: crates/build/dl_types_builder/src/codegen/cpp/mod.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in dl_types_builder::codegen::cpp::quote_fill_arrow_array_builder at line 1870. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/build/dl_types_builder/src/codegen/cpp/mod.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/cpp/mod.rs"},"region":{"startLine":1870}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4aaa8f7e1c5980721fdeb18068f0c7f03764e723dc0e5d4bcb9812323e07b57"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_renderer/src/gaussian_splat_builder.rs: crates/viewer/dl_renderer/src/gaussian_splat_builder.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in GaussianSplatBatchBuilder::add_gaussians at line 203. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_renderer/src/gaussian_splat_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":"crates/viewer/dl_renderer/src/gaussian_splat_builder.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"34ed6eca02595d7f99afd5b56c2d35b2833aa0be58b5aee1536a22c2a76e1f2c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_view_time_series/src/fallbacks.rs: crates/viewer/dl_view_time_series/src/fallbacks.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in dl_view_time_series::fallbacks::register_fallbacks at line 13. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_view_time_series/src/fallbacks.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/fallbacks.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"1414c6c68c9143069ba095e65b84c6dc157ed97eec3e725db569ee51e53bdbdd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/store/dl_lenses_core/src/selector/eval.rs: crates/store/dl_lenses_core/src/selector/eval.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in Expr::eval at line 420. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/store/dl_lenses_core/src/selector/eval.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/selector/eval.rs"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc4f792fcdb7860b5486d39cd4c84e5702f1947b5c1fe8b39bc4bb5224e3278"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: dalaran_py/dalaran_sdk/dalaran/archetypes/pinhole_ext.py: dalaran_py/dalaran_sdk/dalaran/archetypes/pinhole_ext.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in PinholeExt.__init__ at line 16. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- dalaran_py/dalaran_sdk/dalaran/archetypes/pinhole_ext.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":"dalaran_py/dalaran_sdk/dalaran/archetypes/pinhole_ext.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"6283b35bfa44477851961667f32904a977561bf1962243dd59f99a9ea683847a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/viewer/dl_ui/src/text_edit.rs: crates/viewer/dl_ui/src/text_edit.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in dl_ui::text_edit::autocomplete_text_edit at line 17. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- crates/viewer/dl_ui/src/text_edit.rs\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/text_edit.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d736ffac52ac6471dbedd29571c08d72cefe98b7d8ffd1e01caac470b8ea06"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: dalaran_py/dalaran_sdk/dalaran/robot/robot.py: dalaran_py/dalaran_sdk/dalaran/robot/robot.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is Robot.log_joint_states at line 674), 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(robot): move URDF meshes by publishing frame transforms, not just hierarchy\u201D; \u201Cfix(urdf): nest URDF geometry under its entity path prefix, accept inline markup\u201D; \u201Cfix(viewer): do not leak the StoreHub when quitting after a screenshot\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-05-09..2026-08-07, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-05-09 21:35:49 \u002B05:00\u0027 --until=\u00272026-08-07 21:35:49 \u002B05:00\u0027 --full-history --no-merges -- dalaran_py/dalaran_sdk/dalaran/robot/robot.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":"dalaran_py/dalaran_sdk/dalaran/robot/robot.py"},"region":{"startLine":674}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ba4a39bc08c643c0a86b22868d989da0e7d5178a32affeb2fa7b4218cbac3f"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 32 significant file(s) lose their only recent owner: dalaran_py/dalaran_sdk/dalaran/robot/robot.py, dalaran_py/dalaran_sdk/dalaran/ros2/msg_map.py, dalaran_py/dalaran_sdk/dalaran/ros2/costmap.py, crates/store/dl_importer/src/lib.rs, dalaran_py/dalaran_sdk/dalaran/robot/conventions.py, dalaran_py/dalaran_sdk/dalaran/robot/urdf_model.py, dalaran_py/dalaran_sdk/dalaran/tools/bundle.py, crates/store/dl_log_encoding/src/dlr/frames.rs (\u002B24 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dc314cdaa47eae263ea98e6fcbeb5b42e54e2336495edb09288021d2856cbf7d"}},{"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: crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs, crates/utils/dl_quota_channel/src/async_broadcast_channel.rs, crates/viewer/dl_renderer/src/gaussian_splat_builder.rs, crates/store/dl_types_core/src/layer_name.rs, scripts/check_forbidden_dependencies.py, crates/viewer/dl_component_ui/src/datatype_uis/int_drag.rs, crates/store/dl_redap_client/src/api_response_stream.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"be15a5d1ad9e9d628bd51dc820838ae0937e8624c845f35659860d6b74b2f0f6"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #3: If anonymized user #3 becomes unavailable, 5 significant file(s) lose their only recent owner: crates/viewer/dl_viewer/src/ui/dev_panel/transform_cache_ui/paint.rs, crates/top/dalaran/src/commands/mcap/check.rs, crates/viewer/dl_viewer/src/ui/dev_panel/transform_cache_ui/model.rs, crates/viewer/dl_viewer/src/ui/dev_panel/transform_cache_ui/layout.rs, crates/store/dl_mcap/src/parsers/ros2msg/tf2_msgs/tf_message.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b7d6dcabbb172006b576a157aa372671ad2ea382bc444f6958ade3cd47284415"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #4: If anonymized user #4 becomes unavailable, 5 significant file(s) lose their only recent owner: crates/utils/dl_web/src/fs.rs, crates/utils/dl_async/src/lib.rs, crates/viewer/dl_viewer/src/background_tasks.rs, crates/store/dl_log_encoding/src/dlr/fingerprint.rs, crates/store/dl_redap_client/src/analytics_exporter.rs. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"fbc6176bcfcadc5ba59e3e15396371b2f5cdafaa793ba068b46b8247466bc117"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #5: If anonymized user #5 becomes unavailable, 4 significant file(s) lose their only recent owner: dalaran_py/dalaran_sdk/dalaran/experimental/_hdf5_reader.py, crates/store/dl_hdf5/src/walk.rs, crates/store/dl_hdf5/src/load.rs, dalaran_py/dalaran_sdk/dalaran/experimental/_dlr_reader.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ef35c7a63c142d8efff9387dce45291385260735699bc18819ae695679ad3dcd"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #6: If anonymized user #6 becomes unavailable, 3 significant file(s) lose their only recent owner: crates/utils/dl_video/src/decode/ffmpeg_cli/transcode.rs, dalaran_py/dalaran_sdk/dalaran/experimental/_mp4_reader.py, scripts/ci/check_skills.py. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"432bde2192f3d59eb2ffd68b1471088e8876c998d332a7b8fe36f35e6f06e883"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 9 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (69 single-owned of 1170 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; 1170 of the 1713 production source files in this repository met that bar). They are anonymized user #7 (2 file(s)), anonymized user #8 (2 file(s)), anonymized user #9 (2 file(s)), anonymized user #10 (2 file(s)), anonymized user #11 (1 file(s)), anonymized user #12 (1 file(s)) (\u002B3 more) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: crates/viewer/dl_view_state_timeline/src/visualizer.rs, crates/viewer/dl_component_ui/src/color_swatch.rs, dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/manifest/_manifest_build.py, dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/manifest/_manifest.py, scripts/update_docs_url_rewrite.py, scripts/ci/generate_prerelease_pip_index.py, crates/store/dl_sdk_types/src/transform_frame_id_hash.rs, crates/viewer/dl_view/src/visualizer_query.rs (\u002B5 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): could have flags to add attributes (color, radius...) to put some more stress \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":"tests/rust/plot_dashboard_stress/src/main.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"780e5b5f2aa1cfa793273f890766834f3d59429a6a3564ded2618b729e3e4405"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): We have to copy the image every time since the tensor buffer wants to \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":"tests/rust/log_benchmark/src/image.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e52b8e6a71bff517ef2ca7d04db35ec6fec88a0fb43e913b3fb24fbee35fc86"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-4929): We should properly show the application id,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rust/dl_integration_test/tests/integration/internal_catalog.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c453ad15134f503cf0693dbcd9df1b7538ed2e86894b777fbd47ae492cb3e1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-5355): We currently still show too many toasts. Once we have improved"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rust/dl_integration_test/tests/integration/internal_catalog.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b13bd43f540b6b1015870e70fd6f5c4a82fb2410bd3b5beb5fc956ed516693f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-4929): Remove this mask once the catalog app id matches recording app id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/rust/dl_integration_test/tests/integration/internal_catalog.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee739d536ea1023714e7eb122e12b937c400b5992e1a19a486898c49f03679a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(aedm): count the labels in the selection panel only \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":"tests/rust/dl_integration_test/tests/integration/multi_container_test.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd20502471d159c249e3890a3d4ef900adb01ec6e33b6d3f9af7f3cda1947753"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cmc): could have flags to add attributes (color, radius...) to put some more stress \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":"tests/python/plot_dashboard_stress/main.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"c77dc21b8761dd412690f1611d2491dc7501f8bda3cedf6c6a6e03304f2f755d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(#4185): Investigate this."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tests/python/gc_stress/many_large_single_row_recordings.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c5d371e1cfd8c1816568e9a5ab464a307f1154f9b7f217cbcb52e4b2f44871"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ab): add variants (unordered, overlapping timestamps, 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":"tests/python/chunk_zoo/chunk_zoo.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"85bc59c3fbeac1be78e82b73a4ef82fcffa2597ef6038cbecc0029ce38d7fe0d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jleibs): implement lint-cpp-files \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":"scripts/fast_lint.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23778782732f4c408de658d2d7ae5c8330f0f4d9123969c328c4d4a8198beca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # NOTE: we intentionally add TODO:s with names below, which the CI will not be happy about. Hence the # NOLINT suffixes \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":"scripts/generate_changelog.py"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa7439eb34fccc55da593d57d59114db719267ab5f8e272c1cfb82ee7717c924"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(#2388): This script can potentially go away or be significantly reduced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/generate_view_coordinate_defs.py"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"f68a90c1af48284e3b9de50fe49d7b2b4f5e2126da79cf1520f4407b02e9cdf1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(RR-3355): Use a shared utility for this"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lint.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aac6512cf99e067aff87e2ffa38f1e375a6c2a53b9d940e6c9ccfb1c6f27ccd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(RR-3355): Use a shared utility for this"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/roundtrip_utils.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"678615d6f50c7dafdb7c125602b32a2de41359bb9a482337ae5d004ddf36482f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(#6077): figure out how we best link to our own code from our docs"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lint.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c20cc712dbcdbaaaa340dab3474b92e5c6dad74a1d72bc895049b286dcc82e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(#6730): parse all .gitignore files, not just top-level"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/lint.py"},"region":{"startLine":1986}}}],"partialFingerprints":{"codehealthFindingId/v1":"8742592cae5d3cae99e6966a11205a1c0bd1341aaebd6bd2fe61f9d08cd399b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(#6730): parse all .gitignore files, not just top-level"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/nbstripout.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"da565789489dfbc9aefbe10be5eaacdba14eb7107c988c6026c45dc607d1be6c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ab): remove when mediapipe is 3.12 compatible \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":"scripts/run_all.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac663187643ec83cc589d30024094c3292947ac8e3e4b9ce1f07f1eaeb60029"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ab): remove when mediapipe is 3.12 compatible \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":"scripts/run_all.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0036ae7320aa68244d4605349c67ec78dc6ddd80f5f538aceab8fcb37fcc1fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ab): remove when torch is umap-learn/numba is 3.12 compatible \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":"scripts/run_all.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e14ba80458adfad2d652223b7f4931fec247665640897e8f6e4a7bb46deb884"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # Check for internal issue references (TODO(#1234))"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/zombie_todos.py"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"035565d464e92103301efdccf466cf686065c210fc0513c827e7e6a141efc698"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # Check for external issue references (TODO(owner/repo#1234))"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/zombie_todos.py"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"b256cae54827d221a896ae463288700a6a424d196a6e41397769e65dd0db744b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # Check for Linear issue references (TODO(ABC-123))"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/zombie_todos.py"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"885186a69a41a720cf9e9d365e4888c2d693fdf00ceab34a7e92ea67e805878e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(emilk): parse all .gitignore files, not just top-level \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":"scripts/zombie_todos.py"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2d88c0495df39a211a3ad812b14ac151b734711cf77bd393f3d542a6d475ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(andreas): nightly channel would be better, but the dependencies that requires make things hard to get to run. \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":"scripts/screenshot_compare/build_screenshot_compare.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"38de41da47c39ba2c1eb6c005b73f98ab40be7098b3b2556fa0546364734ed8b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(andreas): nightly channel would be better, but the dependencies that requires make things hard to get to run. \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":"scripts/screenshot_compare/build_screenshot_compare.py"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e33fff38befcef89849356a55f8c74c9f1fc6a82f4f14d2d2de43e7959b430"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(andreas): This file should really be split up. \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":"scripts/ci/check_large_files.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"11263ed96c68c656140abdea4b6afeca7d643fd11b44fb014bac28f843b862e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(emilk): break this up into smaller files \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":"scripts/ci/check_large_files.py"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"1af329b7a788b39303deb9e76bd6bddad91da9ced4345fc8a6e4622660efd87a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(#11199): remove this hack"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/crates.py"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b4c64457b3f20c333c8b058727d2f749320200ae4881c63572fd5c726676d13"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jprochazk): invalid link \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":"scripts/ci/mdlint.py"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7894993bcfa556a60b257645ad8aed1d1d3597568eb01ab501224f413e2cb9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jprochazk): invalid link \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":"scripts/ci/mdlint.py"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"5036cb4d5248874294857cc6955ddd03ba82ea95ec0e134469bf46ecbebd6668"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(lycheeverse/lychee#972): Windows absolute paths don\u0027t work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/pr_link_checker.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9137b6720cde2e09c07903d044caef6645485f20c74ed854a5458ad7c441c7e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(#7779): Remove this special case once we have a better way to handle these methods"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/python_check_signatures.py"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"731b96386681ef779dc33b67e84fd6424df8a7f8261da3de6446230479d64aa3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(#7779): It\u0027s somehow even worse for these."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/python_check_signatures.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44ad0c561901ac6202417eb66f15f315c2201f24b67838ff127f2d16014b747"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(emilk): When we update to Python 3.11, use e.add_note \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":"scripts/ci/python_check_signatures.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d656a23d24990f6d4f26a3101c53786621329af0b22e07e61da3fd670f2be9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(emilk): When we update to Python 3.11, use e.add_note \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":"scripts/ci/python_check_signatures.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"732332af83da4629ac3a60fa57e821ea842a632b0055e7b53bdefecd47469e14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(emilk): When we update to Python 3.11, use e.add_note \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":"scripts/ci/python_check_signatures.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"6223fc59b1c53bbe461af7b0bc242e3789e331863612c892de63f761ddce7c94"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(emilk): When we update to Python 3.11, use e.add_note \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":"scripts/ci/python_check_signatures.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2bf2a0f157cf5a715202256ffb1fdf6e9b3a5c42e9eef27e8daed071fb93513"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(rust-lang/rustfmt#6934): cargo-fmt passes all target paths for an edition to one"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/rust_checks.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c91e5ab29cd1741d23e045ee97f7e0af2f4c32cdbed01b9a5428daf23b5c73"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): This example needs to support animations to showcase Dalaran\u0027s time capabilities. \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/rust/raw_mesh/src/main.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b24a866cf856313de954c81f5c7a5d32e018d664ecb6110d82586fdec9eb83a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): move all dalaran args handling to helpers \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/rust/raw_mesh/src/main.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"8082d3b3fcf3bb7bd13c551e19259bab7211e3a7d5f9ffe033b18392d5cdff0c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): pick correct set \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/rust/raw_mesh/src/main.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a0bd50b62a8d41041bc55d89861d322f450c03f0c2b74fdba357ec862a0424"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): pick correct set \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/rust/raw_mesh/src/main.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"34a044816ae02aae80eed4d4e857b297172b1b9e5f129be54735c52fb949475e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): support for albedo textures \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/rust/raw_mesh/src/main.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"38f1b2194688d299274e78385a5644cd75f840106b9160f6f4f91ad2e31a89f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): I can\u0027t figure out why I need to do this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rust/objectron/src/main.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"af9be1508eeed4dff9886ea983cc11f84aa7fefa1823096c7152102b9ebef4ff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): we shouldn\u0027t be using those preprojected 2D points to begin with, Dalaran is \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/rust/objectron/src/main.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c7b6157d004ac97968b989d0445e04dded346f902ead4ea3a5bd9ce14d0acd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#3841): In the future, we will introduce so-called stateless APIs that allow logging"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/rust/external_importer/src/main.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"f053c18933c854e04fd989e7d9beb79baccd3f6f4991586d2e7eaeb333054b3d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(#11760): Remove unneeded args when examples infra is fixed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/python/using_index_values/using_index_values.py"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"2859057dc4e6ad6ecc1cd066aa58e2caad58fade479ead2151d1d79bef600be4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(#11760): Remove unneeded args when examples infra is fixed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/python/server_tables/server_tables.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a7845e6922a543b59c28db3cd84bd618821ddc44b36c826a88f15cb9ac7c07c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(#11760): Fake output to satisfy examples infra."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/python/using_index_values/using_index_values.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"295801f524ddba3aad4a4a75ce8720358e0c116bcf5caa219c8e3da4d5053bef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(#11760): Fake output to satisfy examples infra."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/python/server_tables/server_tables.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"35612679a3972001e6fa109c5cba66c4778a863fd25c682858a1e7306cfc502d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jleibs): Tensors with class-ids and annotation-coloring would make this much slicker \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/python/segment_anything_model/segment_anything_model.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bab0aa1a2cd48df870e101a23ee1866403de1d108d6ac8ddd4779b260a76a19"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jleibs): we could instead draw each mask as a separate image layer, but the current layer-stacking \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/python/segment_anything_model/segment_anything_model.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7b23212715bd755e96554fc7cb9e9d4f71a8ebc043545c8710f4583a1044ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(#3559): We should support 4x4 matrices directly"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/python/raw_mesh/raw_mesh/__main__.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"291ea33914f94fb72dae4ba542584e9571479c9f3fee9c04996a9ec3af82947f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cmc): re-enable obj meshes when we support those on the viewer\u0027s side \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/python/raw_mesh/raw_mesh/download_dataset.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c3c362143122e984fc064f80315900aefee0a3431cf341f73aac3fd19e058a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(emilk): figure out why this is 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":"examples/python/objectron/objectron/__main__.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c43948df8a4570696d024f33b2f2c5f002cd99f8d6277686a4fe8defdd490a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(#10632): We don\u0027t want the radius for the trajectory line to be the same as the radius of the points."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/python/nuscenes_dataset/nuscenes_dataset/__main__.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbdb702fd1c6d4cce1219a05771099bfd293ae26b6774870c4a1b645f9a71d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(#7333): this utility should be included in the Dalaran SDK"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/python/drone_lidar/drone_lidar.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0c768e9f034eb5a01d348f34cdb65cf2d9114263244e4be75d7a84df249f69"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: # hack for now since dataset does not provide orientation information, only known after initial visual inspection \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/python/arkit_scenes/arkit_scenes/__main__.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"60e678635ae2f2ca794e9c5390d40e9ac1b5a1675f2a0ffa51236f09be8ee6ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cmc): That would be UB right now (and doesn\u0027t matter as long as we are on the untagged index). \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/python/air_traffic_data/air_traffic_data.py"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"47ee11312a63f98c5a53f6108a93b44ab3ee5339192518aef67f56aa3964f2d7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ab): this blueprint would be massively improved by setting the 3D view\u0027s orbit point to FRA\u0027s coordinates. \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/python/air_traffic_data/air_traffic_data.py"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"92dcb0c5fed2b85b85a9c20398a0f1a8130aead2619cda8c1505a47594339037"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#3408): remove unwrap()"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/build.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c958729e85d1bea23ebb080b566a2a93c7d9a5185b98142f5b6a35e4e674311"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#3408): remove unwrap()"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer_examples/2d.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"33133aa927f92c17fc8f40e450dea1b5748949987f6fcc62a65c1c99efc370be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#3408): remove unwrap()"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer_examples/framework.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f188e73535e5c100e2050e5ebb7655200bf581ea2f401f74b0008d73f20e4b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#3408): remove unwrap()"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/lib.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0453046db12310dbf0ca0f70d0e06ba87cad8af2ffc53f7e211b6121e5c2ad93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#3408): remove unwrap()"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/stream_from_http.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a71396b884e350bba8e1af6ff73de66facaed20e15e565c48ed41eaab70c17b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#3408): remove unwrap()"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/examples/memory_usage.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4becd4b5c67e59117d10f7f665980fa596a06c5319c9486ab7737261e65c511"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#4047): some snippets lack a main, they should come with their necessary stub code commented out so that we can re-add it here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/build.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0234727158a237651cb599b1ce2bad64e378597fd45b00dfc08b470a7e00eab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ab): change this to merge properties instead, when we have proper \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":"docs/snippets/all/concepts/chunk_processing.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7a2e5cf76c0f4847dc6c06809f5a77cc6513f0787c855e333abc04e16cde76"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#5521): log VisualBounds2D"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/concepts/different_data_per_timeline.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53624487bd6dee7ae185751df95dfca4fa37d88edfc9791865926062e572a48"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#5521): log VisualBounds2D"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/line_strips2d_batch.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"d117616b4ae5cc5bca0ee8565264495b3cc192f4cb1c3e408c48835b6b176c0a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#5521): log VisualBounds2D"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/line_strips2d_segments_simple.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff66a96d38b202cb55581cb241ee357e3b3174decab45885660bc1cebca17f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#5521): log VisualBounds2D"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/line_strips2d_simple.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"6536923b2d047c1128e1535bef31fe3ce5ab12c48a53bfb424ef91110a4bfaeb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#5521): log VisualBounds2D"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/points2d_random.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebca8fb058cc6f3dab9ba8ac33aa65ed36d273541316afbcd217a620002ceeee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#5521): log VisualBounds2D"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/points2d_simple.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95205914da29eac41b28a10e393163421520454a8a30d5e3a958384100edad2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#5521): log VisualBounds2D"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/points2d_ui_radius.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b0579672d46d399d721588ea0d40debbb57a9ffb5c6ac575a752d2b5a36c20e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(#5521): enable this once we have it in Rust too, so that the"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/transform3d_hierarchy.py"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9eb1ffde90cb0186f88d328f6e1e456c4902699dd10f10e9cc2d199e6d5eca3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(#7354): Only mp4 is supported for now."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/video_auto_frames.py"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a797d0ec10601d82634bf3bbca54c0bb7eaac4bd9009257c0042c997a2e177ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(#7354): Only mp4 is supported for now."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/video_manual_frames.py"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"401cc4a1d2d920e565a94543cb954504d81fa19f6330e2da3a86e6ebc2b324b6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(#10090): Dalaran Video Streams don\u0027t support b-frames yet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/video_stream_synthetic.py"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e72260a8a0a213ad0aa5c8c77b70ad4864c062fc61689bd8f404205fcddfc3a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#5520): log VisualBounds2D"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/line_strips2d_ui_radius.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff515cedc9d7403d1f5fda8d564c782d48a5f48207605a14ba0062e8bd932c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#5521): log two views as in the python example"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/transform3d_hierarchy.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"9db4b5a376d0fa30b76fb2d0c0b7b4819fe8798f4de7e8b7cdd9aaaebcbf0f70"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#7354): Only mp4 is supported for now."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/video_auto_frames.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83fbab81037f352e8be47fb938d3cb37808f1b0d2b604601b5c827715705a10"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#7354): Only mp4 is supported for now."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/video_manual_frames.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"00694c9c677aacf481c68cb7c45714c6049032a0f5fb1bb885226139f67f622c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#5520): log blueprint once supported"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/archetypes/video_manual_frames.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"df001524f376d779d55fb8c1cba63c98a1c666e3802b83cb9ef3c64bcb551b03"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jleibs): Actually verify the serialized arrow data has the right values \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":"dalaran_py/tests/unit/test_annotation_context.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f5ebf2daf820158f21112c8d296305664929d5ae597b3952e53afb2b7b6a34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jleibs): This should ideally capture the field name as mat3x3 as above \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":"dalaran_py/tests/unit/test_expected_warnings.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"55ae6e4c7419f655a2e477ff52f7856bf4cd64d0ebe54cbc01be72a6f398ad1e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(andreas): It would be nice to support scalar values here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/tests/unit/test_instance_pose3d.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c09a6b21cfdb5b484684acb2467a66719cb304af8dc21c08182b351e7ae68be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jleibs) send_warning bottoms out in TypeError but these ought to be ValueErrors \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":"dalaran_py/tests/unit/test_tensor.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"73eb3ba66d690fd849e9aa87b8903506a0de33effb72c82da131d80cd2c31a87"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jleibs): Figure out why mypy is confused by this arg-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":"dalaran_py/tests/unit/test_view_coordinates.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"946d6fa376306cc024a3072077c4bd95146bc5259ae53342f3acd14998e797ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ab): we should have Chunk.__eq__ \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":"dalaran_py/tests/integration/test_chunk.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ab296e079985f6309211992d7fedaf3d8f5a60a0198e7112cd0a4a3e7c0d04"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ab): we should have Chunk.__eq__ \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":"dalaran_py/tests/integration/test_chunk.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4b76951b05ef630afb79d4c47a61dc8ee7c5ffcd875f3baaceec0e34342004"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ab): this feels somewhat ad hoc and should probably be replaced by dedicated local fixtures \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":"dalaran_py/tests/e2e_redap_tests/conftest.py"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e19511108710e76a58302be572251d05f169db6c028eeaf21bf64e8e0b09a97"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(#12122): It\u0027d be nice if the connection timeout was configurable, so we would not have to wait for 30 seconds for this test."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/tests/e2e_redap_tests/test_client.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07929f9b612e77d86090f9d25a6075411b05c5793aad8b1ff49bf8399ae8110"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ab): quite obviously, there needs to be many more tests here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/tests/e2e_redap_tests/test_dataframe_query_view.py"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"20e77c744f72f3c3b6fa4048a7703b74b90179c4aef62bae433a07ceeb6a0b40"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nick): This only works for a single shared index column \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":"dalaran_py/tests/e2e_redap_tests/test_dataset_query.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cf77a6f7aeb2560b5c954f9bffe8a463fa07225526ad26c876d1e35ee55644"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ab, jleibs): this example is slightly unfortunate because it is more about filtering rows than \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":"dalaran_py/tests/e2e_redap_tests/test_dataset_views.py"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"c882de385b1f754540cd89417691ed71d0998ad1ed1bbdde1e9e23e075cddec2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(RR-3177): we should fix our server implementations such that this test passes"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/tests/e2e_redap_tests/test_registration.py"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"87767f4a9f00e859ea16ea5d604f849717eb44fd2dd2da039aafa3a009f1c568"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(RR-3177): we need to extend the APIs for this"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/tests/e2e_redap_tests/test_registration.py"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"43fc5f6109cff7a53f30d5f2496c0a72cc0c716bcef3a9b5ad1ac29fb1f63610"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(RR-3172): Whether we have version metadata or not is currently highly nondeterministic, so we need to filter"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/tests/e2e_redap_tests/test_segment_id.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed823da00892c1e3d436063a9ab4e3239b59583831c3ac6835cdb1ce3dff3f96"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jleibs): Consider attaching this metadata table directly to the dataset \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":"dalaran_py/tests/api_sandbox/test_draft/conftest.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d4c50d8520a4b97eed207fbf4f718fef12a05ee58c289d55a67dfdccf46733"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jleibs): Consider attaching this metadata table directly to the dataset \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":"dalaran_py/tests/api_sandbox/test_draft/conftest.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ec4c81a971366a060fb5a0a5c682518cf5f61ee1c44a6dd032669643359683"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jleibs): Consider attaching this metadata table directly to the dataset \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":"dalaran_py/tests/api_sandbox/test_draft/test_dataset_basics.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"c86c7622cb6246eabe28fc1a36199b8232c044dee31c8877aea896fb4aa8aa15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jleibs): Consider attaching this metadata table directly to the dataset \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":"dalaran_py/tests/api_sandbox/test_current/conftest.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"82d79f75d1675b3a2df645db578fa33780735d2f5c74418347ed5e8725e47de0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jleibs): Consider attaching this metadata table directly to the dataset \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":"dalaran_py/tests/api_sandbox/test_current/conftest.py"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e7319f0d32fe80b0d1839b9b13ccfd1d34ce2c9ac95406da98832cd51176f0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jleibs): Consider attaching this metadata table directly to the dataset \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":"dalaran_py/tests/api_sandbox/test_current/test_dataset_basics.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a9db8e820589c1b6970fcaeb7eef82cfc85e88c3cdbb0b553f52d3c8c9d4b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): move to before we arrow-serialize the data \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":"dalaran_py/src/arrow.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"c479cbdbb4aea18dbebbbb1738fd350daad007eca17f1b07f246a54532c59265"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): move to before we arrow-serialize the data \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran_c/src/lib.rs"},"region":{"startLine":1127}}}],"partialFingerprints":{"codehealthFindingId/v1":"258e248c2162c86a48a24f4183ccc435c2f2045928303b81ead120783851f9ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#2116): drop unused recordings"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/python_bridge.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"124789d4a4b6beca7464b5a03541bfc3a2fc27fc9ee98757d6b87a42a87c9aef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tokio/tracing#2499): allow installing multiple tracing sinks."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/python_bridge.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8c874e26702f5db1c0ca47f583014ab8a240c8717008ad98928b642cfdc664"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs) expose this as a python 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":"dalaran_py/src/python_bridge.rs"},"region":{"startLine":2557}}}],"partialFingerprints":{"codehealthFindingId/v1":"af52722906c0a764950a0b452181abe7edc63649057d5dcd0c2908baa4ab0285"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): are there any security concerns with leaking authkey? \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":"dalaran_py/src/python_bridge.rs"},"region":{"startLine":2676}}}],"partialFingerprints":{"codehealthFindingId/v1":"0005afdda46cbe7aed49d9a859bda6ab9fdf8c5cd4ee00a6d866eabdf97b9a4c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): In the future, we probably want to merge this with the other APIs. \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":"dalaran_py/src/viewer.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"00326b08918debdb9f74e3aab18e35721ec0717ef08565c91db411b52473657c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-4850): this is the synchronous (no-thread) reference case for the shared"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/chunk_stream/dlr_reader.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2edc5fdc492a36849829d6af9162e833d36b7d6a5e9aeca0d4611be6bf1632"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-4850): this spawn-thread \u002B bounded-channel block is hand-copied across"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/chunk_stream/hdf5_reader.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c59f3556d8df6dcbe6e57e748fb2da17ca1ade19e62c5365452fb1be7885a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-4850): this spawn-thread \u002B bounded-channel block is hand-copied across"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/chunk_stream/mcap_reader.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3b9074a444c19e16d1dcc30bea1439823ef2c3c296ba1289364be5aaabefb6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-4850): this spawn-thread \u002B bounded-channel block is hand-copied across"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/chunk_stream/mp4_reader.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2d0ba75fb4409919b71930e1b205ca668156aa4abba23ed6e18e2a60a16702"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-4850): this spawn-thread \u002B bounded-channel block is hand-copied across"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/chunk_stream/parquet_reader.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"0060fdb75c58fb53d6f30c4e1b4c06ac9c1d93785a66a7e7712787209f04bf6f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(perf): \u0060col_chunk_entity_path()\u0060 parses\u002Binterns one \u0060EntityPath\u0060 per chunk. \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":"dalaran_py/src/chunk_stream/lazy_store.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"6addaf1bffbced874bff6690535f6b61d3c40970f61444907302b272fcf71ec4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(RR-4545): this is hardly an optimal strategy. We need the ChunkProvider to expose a streaming"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/chunk_stream/lazy_store.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e75e2b1e2186155bf1c1211792049c5fde5f258f1b00a88f4b676cb52a3098"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-4850): revisit as part of the shared iterator\u2192ChunkStream adapter \u2014 this"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/chunk_stream/mod.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d82573f900c78199ee4db8060a0ed6177e0ea7f0334058ab3317868934ddfeb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(RR-4717): Why do we need this? Because \u0060StructuredFilter\u0060\u0027s representation is not general"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/chunk_stream/stream.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"cea29edd0c77f041536d52506c5036e2dd98da411a5c0436d7b4cf1a1eee8840"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): in theory we should be able to merge strictly overlapping contents \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":"dalaran_py/src/chunk_stream/stream.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"33d45e6eef9cd598efd337a4488b13c63bd7e379c66a58d8fd62b1870fee156f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(RR-4265): should this be a iterator _factory_ instead?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/chunk_stream/stream.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdef04ed5d5e18e220753950415576c0e01bbb6aeeb7a35741ebda50e457b758"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): abstract this behind \u0060StreamFactory\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":"dalaran_py/src/chunk_stream/stream.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"682883570434d42e7e0a05d20c6d7b9fb21e8d0a87edfdcf85c7de10ea157c6d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): migrate this to the \u0060ConnectionClient\u0060 API. \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":"dalaran_py/src/catalog/connection_handle.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8781b27c0518674743d1ec99e52bc37686df5c0f67dd64ad9dffc14f563a69"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): Make this streaming \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":"dalaran_py/src/catalog/connection_handle.rs"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f64d1d4aa6ba609076fc2df359c3d423c681af0da4f3ef6f0f48d9f5e92cdb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): Still need a better pattern for getting these schemas \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":"dalaran_py/src/catalog/connection_handle.rs"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"91a7c8ba8e835fe4505acfeccb13a9d236e7aa059c7427a998104f7cf61e2552"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): not sure we want this to be public \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":"dalaran_py/src/catalog/dataset_entry.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"90943d40bad9395172a17e9df2aa14864706506bc5464af952f29327b9358ada"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(RR-3157): add the ability to filter on components, not just entity paths"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/catalog/dataset_view.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"923e40e1186db319a6946623058b5fd0095412a9974f4f351e0f59e56e5c7113"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3158): the API allows using a datafusion dataframe to specify segments. If actual"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/catalog/dataset_view.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f795b6e0d0f20dd135c364cd09c8d86552310e47333ae37f522229112a88fb2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): use jiff when updating to pyo3 0.24.0 \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":"dalaran_py/src/catalog/entry.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6204fbbfdf7b5c6350e577d964ca28ec55c0ecdd1dfe58db26f73ea8ea75bd7d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): use jiff when updating to pyo3 0.24.0 \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":"dalaran_py/src/catalog/entry.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e2ecdc2bfa0a6d5cf8d2c0378d2df579a184f9c7bd2aea4947e4b417f52cf6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): we could move this validation over to \u0060Self::return_type_with_args\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":"dalaran_py/src/catalog/segment_url_udf.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a33a3bc42c06ce597105742371dd90056d6e70587f4a0a585728626ae7c9b6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): this is an unfortunate lot of cloning just to format a URL string, but \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":"dalaran_py/src/catalog/segment_url_udf.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebb25690fca8877e87db4ff8cc57596eb6d0d7c4d2dd5c1f45d8aa0aaa79458"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): expose metadata about the table (e.g. stuff found in \u0060provider_details\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":"dalaran_py/src/catalog/table_entry.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"caa8a2ca02566932d20818c06786faba69ff3434960f08fb5b85346e5027a707"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(#12746): Stabilize table blueprint APIs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/catalog/table_entry.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"336ec99fa9f4b928907db44f48ae702fc767f24984b29b3058c471f18bd6714a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(#12746): Stabilize table blueprint APIs."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/catalog/table_entry.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f935ef3af50f4041bd6ff06af50eaaa261430a903162b802fa173df841f557f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#9853): rename to \u0060ComponentColumnLike\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/catalog/type_aliases.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"19473446ef7df42dd0cd5135659991d175d928f44db8838cf2c20e631aed14d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(#3793): defaulting recording_id to authkey should be opt-in"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/__init__.py"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd852b92ffa7ec9ad3ed682d02157da006b78fec9894031b234ba6f97eceac92"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(#3793): defaulting recording_id to authkey should be opt-in"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/recording_stream.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"64756cded6a584aab3514f0da5a9bbd50f54df637bce29656273eddeb9572bb5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jleibs): Profile is_instance with runtime_checkable vs has_attr \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":"dalaran_py/dalaran_sdk/dalaran/_log.py"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ad41d28207e24cff5fb103aee701fb3a0cc6c40807da1b7238011bb8e2b014"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(#3841): expose timepoint settings once we implement stateless APIs"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/_log.py"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e05551c61b0fae9d1123264ff03a1a3d389e0ffb9c5415ec83362f627e5847c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(cmc): expose timepoint settings once we implement stateless APIs \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":"dalaran_py/dalaran_sdk/dalaran/_log.py"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"72f7557de26f9b43bfc0e21a8c25c4e4f245a8befc6baf948003e6f6584b3ef5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(zehiko) add back timezone support (#9310)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/_send_columns.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"a102a5644a390ceb57a587e45b4a233bd3f94f52062bab40a4175b117733d685"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jleibs): Context/stack should be its own component. \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":"dalaran_py/dalaran_sdk/dalaran/error_utils.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"326b27cb92494dd40060540799f025a6df8aa1104a3b14e441819f167430f47d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(RR-1154): this is yet another consequence of stateless APIs not being first class"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/recording_stream.py"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"59dfa5e1de95c585ec6a6e33fe3a045713866a524828f0d245bb3379e61d42c8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(emilk): rename to something with the word \u0060index\u0060, and maybe unify with \u0060disable_timeline\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":"dalaran_py/dalaran_sdk/dalaran/recording_stream.py"},"region":{"startLine":959}}}],"partialFingerprints":{"codehealthFindingId/v1":"1205f922ab86abbab4c4fc703f0600ed5a0aeb96d1e9138a5e9e1b06a4c6844f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(emilk): rename to something with the word \u0060index\u0060, and maybe unify with \u0060disable_timeline\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":"dalaran_py/dalaran_sdk/dalaran/time.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7307159004302cccb9dffd73ecb07caf74401abdb1674d4a7366e83f309d00"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jleibs): Do we need to pass something through here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/recording_stream.py"},"region":{"startLine":1580}}}],"partialFingerprints":{"codehealthFindingId/v1":"31aa5d462d369b8d13f835011560b90fb44eb21125118e1e01914750288f80fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(emilk): rename to something with the word \u0060index\u0060, and maybe unify with \u0060reset_time\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":"dalaran_py/dalaran_sdk/dalaran/time.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"afcacb251796d31b7925f00a6f2493cbb7a6e55b01ff8f95d496e8814d23fd78"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(RR-4795): we should use a SDK-provided context (with pre-populated UDF, etc.) instead of global_ctx"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/experimental/_chunk_store.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"3226cb9dc07d32e0bd7759fd24e1b5d63adfacd823175cbaba651370797312c5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ab): improve this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/experimental/_lazy_chunk_stream.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d52a32813293b9bc2c3a3546b962b12b70e58ba58d65e2f412ebb09e20fbeba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(RR-5007): this should ideally be codegened"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/experimental/_lens.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6afc05900c71c62016c8809e1b01bfa953bc5b351a8546ee31fb6049c51a2e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(RR-5007): this should ideally be codegened"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/experimental/_lens.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe2d491bba784289fe9ec361d10db2fb85f4b1bf6d73c2cbc9911de381a9f24b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(RR-5007): this should ideally be codegened"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/experimental/_lens.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"2047050df891caa6026f8b8d960dcd1bd5ccdbd174ed0c5426838bc829f6aec3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(RR-5007): this should ideally be codegened"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/experimental/_lens.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"9288564ed30d65212a97c16a12f76bc76ce329f88b0807886dae066b94216558"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(RR-5007): this should ideally be codegened"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/experimental/_lens.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"92794c7e676956573dcbcef96d73f0207c91e27af0847a7eddb7065e8318d92d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(RR-4999): drop the .pipe and use a struct-constructing selector once structs are supported"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/experimental/_lens.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"38bab11b640275500f18a4168350cf7268d9652c66e30e39e697adbeee932edf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ab): this API is a reflection of the current state of the MCAP reader and mirrors \u0060dalaran mcap convert\u0060. It\u0027s \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":"dalaran_py/dalaran_sdk/dalaran/experimental/_mcap_reader.py"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"ead79386714e7b22fe850f86a0a6fb67f1312c78c2c528cc908475b50697533e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(RR-3481): we should be able to stream multiple record batches instead of having to merge to one. This"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/experimental/_viewer_client.py"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"b976ad01f8e9d80f59e0889a3db023744146a768ee3c931c2dc366b40124571b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(guillaume): expose \u0060thread_count\u0060 as a user-facing parameter \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":"dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/_decoders.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa8eb1921e5f8594aca1ab063150d6dbb4bf1b5e4f7948135fc9f250b4d6da6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(RR-4751): we should measure whether we can optimize this by doing precise queries when \u0060VideoStream::is_keyframe\u0060 is present."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/_decoders.py"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b5813d6d9299a7cc4deedb86ecbcb8f4a8d37c369a2c23aeb47c543e1f151c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(isaac): Will be able to do check server side with upcoming DF changes. \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":"dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/_utils.py"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"f512ed532e965868dfd330a1a3b240d36afdcf29100ed7be48c1a1abef90885e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(guillaume): dictionary-encoding \u0060segment_id\u0060 at *read* time (one UUID per \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":"dalaran_py/dalaran_sdk/dalaran/experimental/dataloader/manifest/_manifest_build.py"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"43f5cbbea5ad3b2eeef64fa8b23cdf4ddd18263f60cb9e64502820db4aee9c14"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jleibs): Re-enable null support \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":"dalaran_py/dalaran_sdk/dalaran/datatypes/class_description_ext.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8e72f1cf889dc1e1b3b0ad686e484a9260563a0d572f1bb2fad14a8de70975"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jleibs): Re-enable null support \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":"dalaran_py/dalaran_sdk/dalaran/datatypes/class_description_ext.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"31ee6736fc6a048c8fddcf54c47c75c02d0bef8ab1a2f2e336e8fbfd82048c9a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jleibs): Should also provide custom converters for shape / buffer \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":"dalaran_py/dalaran_sdk/dalaran/datatypes/tensor_data_ext.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6656c1130c960e4e168740ca1d9ed6e652903de49a4dfeadcf15a75a965a3c90"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # noqa: ARG002 TODO(jleibs): why is \u0060force\u0060 here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/datatypes/tensor_data_ext.py"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d1bd5523ae900d796c6d814c6b8ac01abeabb3c4a739fb9d13f03cb4fc6fbdc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(#2641): this is needed until we support default values."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/datatypes/tensor_dimension_selection_ext.py"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"2128242e5148c5d4180a745eb8c3c76086756efeb69b64e3242e327d943f050c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(astral-sh/ty/#2538)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/catalog/_catalog_client.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdd132a4c4e9c5ea7dadc6c7e52d327540fa7899df89233ef973306a476e2d5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(#12612): switch to \u0060StrEnum\u0060 when we drop Python 3.10"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/catalog/_entry.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d3d03c6aff847b6c42683d7e5bff66705020f58f20e655b8c1536260cdaf45"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(#9922): we should support control columns like row id as well."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/catalog/_schema.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ce30da449a79c7c2ebe75d22fc40d3398e95ca577c213b364bbd9834fd33be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jleibs): Doing this on raw arrow data is not great. Clean this up \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":"dalaran_py/dalaran_sdk/dalaran/archetypes/bar_chart_ext.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"59897fe03babd1c5ff78916c7b312ecc38415d2249231bd8bbf46c09d41f3b91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ab): the purpose of this override is to rename the required parameter and make it keyword-only. Should be codegen-able? \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":"dalaran_py/dalaran_sdk/dalaran/archetypes/geo_line_strings_ext.py"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"c94b73c71477f45282f88749aa50d96a52263b0bb197dee0c1f098c2455ff10d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(ab): the purpose of this override is to rename the required parameter and make it keyword-only. Should be codegen-able? \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":"dalaran_py/dalaran_sdk/dalaran/archetypes/geo_points_ext.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"a174990da212fca8794f1f25f5ee535fcdce156733f7b817bb91f4cd895678a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jleibs): Validate that bytes is the expected size. \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":"dalaran_py/dalaran_sdk/dalaran/archetypes/image_ext.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"84e0d83510fcef787a5c694d4155f732ecf4eb7ca91958b86edc2e1494373711"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jleibs): Validate that bytes is the expected size. \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":"dalaran_py/dalaran_sdk/dalaran/archetypes/image_ext.py"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33ffe24e0af5ddf2b41764d6ceaf087c9902a37f2e17e3e48bbf595d1228f8d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jleibs): Would be nice to do this with a field-converter \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":"dalaran_py/dalaran_sdk/dalaran/archetypes/image_ext.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14aba617ae942c159525309bb414dc0590a26a3422471788185dc7c6ac73580"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jleibs): Support conversions here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/archetypes/image_ext.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb75a21e21b0625a43a1cb0cdb54be7e742d0a5827ba075f54cf5ec4cbae8e15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(andreas): Use a union type for the Pinhole component instead ~Zof converting to a matrix here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060# REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/archetypes/pinhole_ext.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"68ac6955bebc0d7ed20566337c6ef2f0c1826efa269e2ad6b7a1f0cbd6dcaf22"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(emilk): check that it is 2 elements long \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":"dalaran_py/dalaran_sdk/dalaran/archetypes/pinhole_ext.py"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"040cdd8790b4d5199db95e40bd3877864c3c848a9efcb3c936a8b2a175e5aafe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jprochazk): update \u0060override_panel_state\u0060 to accept \u0060PanelState | undefined | null\u0060 as 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":"dalaran_notebook/src/js/widget.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc5ea824b07a3c128b7f4ea0d96957ea47be9b5c8616a363d770fa756caa939e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(nick): This traitlet is only used for initialization \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":"dalaran_notebook/src/dalaran_notebook/__init__.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"148b8b767e70be7afacb0933096914d6dd7ef9e580d8b153bd33410535ab90e7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(jan): maybe allow unregister by making this a map 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":"dalaran_notebook/src/dalaran_notebook/__init__.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"32daf49c3b50e6630e12df84d104048b9eab23ffa59c68aa11df6a3b3d473cce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Should we create a bunch of worker threads as proposed by https://docs.rs/tiny_http/latest/tiny_http/#creating-the-server ?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_web_viewer_server/src/lib.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb050dfc29ed23e9892493b54d374752c4cc28aff6ad3fd7085e79d47d9b935"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6061): Wasm should be compressed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_web_viewer_server/src/lib.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"d36ebbd590176448638ea536d1a78bfbb71f212cf625c6e89e9c5b694f3f38e0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#8249): configure blueprint GC to remove this entity if all that remains is the recursive clear."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/container.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"2406952e7b023003262e220b3cd65aa18a2e91aafa5ef20933743d7c81dbbf24"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#8249): configure blueprint GC to remove this entity if all that remains is the recursive clear."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/view.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99d22c9a1dc356c4d41a9af54246e7ac5ec3a6d841a29e54200fe43e56c1f17"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6321): This shouldn\u0027t necessarily prevent us from adding it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/entity_add_info.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d98f1feeaac10ef2a8b77285557314cebe5262f8285f5b97d31fdb41c3191e0a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(andreas): This is transitional. We want to pass on the view spawn heuristics \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/lib.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2186d795fcf46425cbe9ad3b66ab85663db88873348cdefbfde7d81217dd911"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): This should be a helper somewhere. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/view.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"043952649d4784966f4fa16c3bbb819770be5a6f067c686d1eab0a684bf072c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Build this only once for every type of view. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/view_contents.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"39426d6f7614db4ca91ade1d88207771d0d29e87b50e6a8cd2a4157c8979b26b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): integrate with \u0060add_entity_tree_to_data_results_recursive\u0060 above. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/view_contents.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfca03d3612abbdacbfab58430df8acf9ca8bb49e3729ab475cbe3832abd6d01"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): remove bool parameters \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/view_contents.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6adbf4801e6bb7a6741de89cfb4bdf6bfcfad23a1f8269f4272b9219b5e044"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): remove bool parameters \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/time_control/mod.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"37af12b7644e022502b69ac5f4480e319745a4b3d24b7b78d5777454af35c0ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): remove bool parameters \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/ui_ext.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15eb357d080d2b9d7a4e001cca3f88e52bd27b67b361a9bdce6bd79e3525b0d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): remove bool parameters \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/connection_client.rs"},"region":{"startLine":1432}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c9c3aabf78cecd9f71434d45d003bc086d4fdb3bc95605c0bad568c26bd769"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Why not keep the component data while we\u0027re here? Could speed up things a lot down the line. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/view_contents.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b23158083d72d3cb108892b79b091f11ea67eb1c39d17d0814e58a03ffa0b26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Should we batch more queries in general together here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/view_contents.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2bf8d6cfee0e5e44ff806935277a9fc950236464e16412e328381d0bef89d78"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): Making this work requires merging the EntityTree walk with a minimal-coverage ExactMatchTree walk \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/view_contents.rs"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a92258e63b5774adf1482bc766f63915e9e1ea294c224bb664a1dfae63c1f55"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas,jleibs): \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/view_properties.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"9769f7fdbe79e76df8622039231efc984526ae9b96247322ebb76fb306cedf71"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(#5742): note that \u0060Item::DataResult\u0060 with entity path set to the space origin or some"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/viewport_blueprint.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f1006316007fe8d1e195099fbead85125a8f9b655fd43ca61cedada5be28ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#5742): including any path that is \u2014 or descend from \u2014 the space origin is"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/viewport_blueprint.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"527fed596759666bafc3784fcbd86b2cbc02f0a12eab23bd638773c28dd6bc7b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): Make this only update the changed fields. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/viewport_blueprint.rs"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"20efb67feda99fdd9b0254c8ef8baef1345022823058633720894bec4ec0ab53"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): consider diffing the tree against the state it was in at the start of the frame, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/viewport_blueprint.rs"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7296e13e5a7cad8d9a7a02d81d6f89f988f7f14418fcbd153164b88a4bb9a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): the \u0060rev()\u0060 is better preserve ordering when moving a group of items. There \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/viewport_blueprint.rs"},"region":{"startLine":1151}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd3c1cb7e054eddda316942c9742b59524a51420ec5ab2a287be49f731ff815"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): use design tokens \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/src/ui/add_view_or_container_modal.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12012a727bc4cc1cff9c63c124a18b778b340b27d48881319ae90d3615d7e2d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): use design tokens \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport/src/viewport_ui.rs"},"region":{"startLine":1137}}}],"partialFingerprints":{"codehealthFindingId/v1":"c974fdb1eb65f0d93890272d4df96252826e5f89d57700389d753f5dc0925963"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): cfg test this only? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport/src/lib.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac88327c82138af5c550aa46a81de1d7dc10d91efe730babd5d265a02b25a8c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#4433): This should go to analytics"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport/src/viewport_ui.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e2e6582f10e4d2f70ccb8be1de92b422a080e99438b3df3e33d9489876f0dbf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): use design tokens \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport/src/viewport_ui.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"c962681bfd8be37609ceddc984fa3a0e1307be71c8a91c41ee8fed5c8e2c5f83"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): use design tokens \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/welcome_screen/example_section.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1d59422d1d15abc33f39a91824f637b56b39da9097c62bde3c727d91abc641"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): use design tokens \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/welcome_screen/example_section.rs"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"9305afd68da025c9d7960a4c9e5dcc7a483d543b61ceec31e84bde8937a32581"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): use design tokens \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/ui_ext.rs"},"region":{"startLine":728}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae74fa095070e126cac8abc115ad225632643400fa855346be890ee22664dab2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): Is there a better crate for this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/command_sender.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"5367ccb65bc6cc31a0793cda69342bf6af55a9f9892744531573c3366c49671e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Is this operation common enough to cache the result? If so, here or in the reflection data? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/component_fallbacks.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b86284abea7980ba0e3a8cd97cc2567e92a49d06d849e9b164ee0e7df87cd5e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// Older component uis - TODO(#6661): we\u0027re in the process of removing these."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/component_ui_registry.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d51b3906c9a3399962964499a027be7738f01e594a795551bcc6ceec7cd8e0f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Is that always what we want? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/component_ui_registry.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb6c6a8f42444af002c2042a9f8731563ab9cab2dddf260f5d2b9599901fb92a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): should we instead revert to using the component based ui? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/component_ui_registry.rs"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aac5bb9d17428eebe73e8084651139fdd38feaa7c440a7bf9cb9414e40112f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): needed to avoid the pill being cropped, not sure why? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/drag_and_drop.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e29163bf90cfdb3c6517168cbee0f02b59ca90df4197571e01b08990ba64363"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): can we do this more efficiently? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/image_info.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42642b017bbab5c1c5b8265a44e24c6adcdcb55368fee0c98f48db26c7eff91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): doesn\u0027t take blueprint into account! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/image_info.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5c74ad2f24d69e3fb101730cfe602fa832bd116780711fc53d0dff726a6553e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6008): support stride"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/image_info.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3ae5e724603a020472cb129e44f38302aa5c6088651b8f6d2cd4f7fd5b03fe5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6008): support stride"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/tensor/image_stats.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b077209ec4065caabdf96e8da7ac9f35b018bdad79ac9ccaa789f9d79c2b104c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): this can probably be optimized. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/image_info.rs"},"region":{"startLine":369}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9c44de9b1cac4220d446ad774533d7e74a14b33af432e41f690f168afe9fb9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): support selecting a specific component of a specific instance. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/item.rs"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb6a47c97c3e140d1c5389d29fa678491a6113083826ebe23217e102d00fac8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(lucasmerlin): Should these be copyable as URLs? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/item_collection.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98e375f1a5da43bfe10b7785b94b9d4c94459783ebd9c601c72a12f0ab0cb2e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): Make \u0060TableId\u0060s copyable too \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/item_collection.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ce4fc1b2dba92ecd6de904934e0c35bd6d28e26e2f59c8782123416085e9696"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): it is not very meaningful to copy the \u0060StoreId\u0060 representation, but \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/item_collection.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1192aa91afecb9b6d67fdb354dddb4daf47df1c1eae70b41ec6326913ed2f87"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Move to its own crate? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/lib.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6b8721880c4c4ced2fa283e67a75acefc5c3af751266f7b7f69d3f84fe7c7c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): there is a lot of overlap between this and \u0060LogDataSource\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":"crates/viewer/dl_viewer_context/src/open_url.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a7ddeb69f35282367b1f6880cfade8ae5c3528c642fc0987ac119914657d4a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Not all item types are supported right now. Many of them aren\u0027t intra recording, so we probably want a new schema for this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/open_url.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fc6c8a62c0cad231eb0a2553651488c40fb91b2ad5bed7d083d6ecdfb4493a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas) this is centered around latest-at queries. Does it have to be? Makes sense for UI, but that means it won\u0027t scale much into Visualizer queriers. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/query_context.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"7291c7b1634a0a4e3701e6213cfaaebf9d62ac522f256db7004d76827ace3200"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): This is super messy: we rely on this being filled out by \u0060DataQueryPropertyResolver::update_overrides\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":"crates/viewer/dl_viewer_context/src/query_context.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"c57698dc7333d081552af9deb85f238bdbe6117179a6083901b89bb53dbe76b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): Add \u0060applicationId\u0060 here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/recording_or_table.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"41eac31cc4f5ec6100f758c01263d601c4475b38f034eec9b4bca415bcbd4d6a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(isse): It would be nice to only switch to newly loaded items if 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":"crates/viewer/dl_viewer_context/src/route.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b105ea448930d4df674220ad1fdf25cd72670e9b4749f41b46c6d909484761"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): remove this app-id centric 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":"crates/viewer/dl_viewer_context/src/route.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c6998f9e4d613f4d733f08b9f82de888d00f080edc13dcef4f4550d6ec3c32"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6282): Improve this error message."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/store_hub.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7da325996174a6be2649cd7068aeef8755cb4b14ca2fb583b589b72ba3e2079"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6282): Improve this error message."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/store_hub.rs"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"dacfea29c5773cea077b0bd50fed24f02a2971fa95c893b855b2112ebc315cc1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(jleibs): In the future this can probably be handled with snapshots 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":"crates/viewer/dl_viewer_context/src/store_hub.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"959e0e3f5dc904ff34dd32a2794ebc7b09e659d507bb19a64b6378f49156f717"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#8249): configure blueprint GC to remove an entity if all that remains of it is a recursive clear"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/store_hub.rs"},"region":{"startLine":1230}}}],"partialFingerprints":{"codehealthFindingId/v1":"2158062d017a3fb7aceda2db2071f3fd14a146fbef7b032ec6cb8a0c5246569e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(emilk): decide based on how much memory the blueprint uses 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":"crates/viewer/dl_viewer_context/src/undo.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"927620c7815d822c77fae7b3b50f843f9be6a792bac4debad22ec9f15417c125"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): we should _also_ look for long streaks of changes (changes every frame) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/undo.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"4af3826e8cd8373f0a3c5deded953b3eec08f06a18160790bd724e166d20d8dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-2730): If egui properly tracked when we\u0027re scrolling we wouldn\u0027t have to do this time check."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/undo.rs"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b48fb726a3482fdb2dbc33d0aa6668acbf92a674dee0ccb58e8abb3073a271"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): This could have a generation id, allowing to update heuristics entities etc. more lazily. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/viewer_context.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdb0e580f1d90e0e8bc9b92337f7ef7423ba1c1b5f574393925b297894fcee74"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(andreas): Should we always do the intersection with \u0060maybe_visualizable_entities_per_visualizer\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":"crates/viewer/dl_viewer_context/src/viewer_context.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"020c60bbd22e9dc942a9881a1497f18a1c931f1428e5823979d3bd4d3f03177a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): Ideally this wouldn\u0027t be necessary and we could make the assessment \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/viewer_context.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"6177ba340196c444d3c5f6d3d82f0452c999cc8c34b9568fd3d309c01156b1fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Can we move some of these to the \u0060dl_view\u0060 crate? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/view/mod.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8666f6a8a3438ea9435ee47e0df51ad385a0821f5479c8bd50f1367cb4de37"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): This should likely be \u0060PerVisualizer\u003CSelectedEntities\u003E\u0060 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":"crates/viewer/dl_viewer_context/src/view/named_system.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43fd79e2762298af557a071ce1f3d32ba3c05eae41c0bff6fe62374a3a8f0ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Should \u0060ViewClassLayoutPriority\u0060 be part of this struct? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/view/spawn_heuristics.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6f85751e688d69216737164b0c50844cbcc18719f47e1dacd070beb81a76468"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): shouldn\u0027t we always do it like that? a bit confusing, but as of writing we rely on the sorting behavior of \u0060new\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":"crates/viewer/dl_viewer_context/src/view/spawn_heuristics.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a95b6865f232441a9efaf25c2490e8dd8dccc2c0d10d9130db46c58817ba177"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Consider formulating a view instance context object that is passed to 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":"crates/viewer/dl_viewer_context/src/view/view_class.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6c287e535fc548b9f3771acf485d25c530b6f36f20c620b644fbc4a5fe02141"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-4506): Remove this flag (and all sites that branch on it) once the Status view"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/view/view_class.rs"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d971d4af7ca27cc90f5aa2f207a59028f6e4d890387dd87a405b49279aaec1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#6918): also provide ViewerContext and ViewId, to enable reading view properties."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/view/view_class.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"802fd8b3c953a54f04ce682e58e94d80a504a76aeb7b307538f4f829c2f6e11d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3076): Eventually we want to get rid of the _general_ concept of \u0060space_origin\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/view/view_class.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ba6edeaa0a29cdfeded0063abe1b16b7c0306e8451b3101d7c14f4b792d5351"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3076): Eventually we want to get rid of the _general_ concept of \u0060space_origin\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/view/view_class.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"859de99b6e8b3f433f777d47a94fddda6ca6d25955c769702d738c95fb617a69"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3076): Eventually we want to get rid of the _general_ concept of \u0060space_origin\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/view/view_class.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c40511bbdd181529223c02e53a214a396d5ec1e4eb32148948c79364a75608f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3076): Eventually we want to get rid of the _general_ concept of \u0060space_origin\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/view/view_context.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf23fe3784e1c6f8cdfea8215da223ef918c80f4ee152f1c3ceee7c167dd083"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(wumpf): Right now the ui methods control when and how to create [\u0060dl_renderer::ViewBuilder\u0060]s. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/view/view_class.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1a94b77ba9f7ac97505de859b0b1d397e724727d73f4396308801c33605db41"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Executing with rayon here is a bit of a deviation from our usual pattern. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/view/view_class_registry.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0eff7415d23f832efca59b55225688564f89d699e6bbb2e184d6fad46d870b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): This probably needs a better name now that it includes class name \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/view/view_context_system.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c93c1065e7ca41da9ba99894a42863eb87d3a65dcafa65768c5c16524e8075"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): can we avoid writing out needless data here? Often there are no mappings, so we keep writing empty arrays. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/view/view_query.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"31687b92d7b655a672b02b4c8b4d159b7dc8de04bf4238549d1ecdba2edbcac3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6541): Check the datastore."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/view/view_query.rs"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"777cb174bd30eee2e72d57ea50bf080af1cb6f97cfc9b73dc2c43acf633c8384"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6541): Check the datastore."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/view/view_query.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a151f9592caad2695024d55a03b0b064af22d17e42c0318bccf6b9ebb45ff5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(andreas): This should be the result of a [\u0060crate::ViewContextSystem\u0060] 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":"crates/viewer/dl_viewer_context/src/view/view_query.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd691f32b01a548470ad319a03048b5e8768f032ac5acee6f54b24a843bfe879"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Would be nice to bundle this with \u0060ViewState\u0060 by making \u0060ViewState\u0060 a struct containing errors \u0026 generic data. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/view/view_states.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cd6fedae7d74635a63595d5e45156df1a3e3a4f1bd59e44287f860135e09ee9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(isse): Should we have one preview state per table/dataset? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/view/view_states.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"af11caa08add9958a62658f7296da0209188deee7e1797fd8903fbbef3d7d761"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): It would be great if we could support \u0060BinaryArray\u0060 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":"crates/viewer/dl_viewer_context/src/view/visualizability_constraints.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"906c9becf2317b41252742ffa8c4174d4bb3b52c53a87edd0d9d88340106c3ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): It would be great if we could just always access the latest reflection data, but this is really hard to pipe through to a store subscriber. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/view/visualizer_entity_subscriber.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b204502d63d485f119b951a31f3be934321e78734123fd864fba8f442533cb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Need to react to store removals as well. As of writing doesn\u0027t exist yet. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/view/visualizer_entity_subscriber.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e70eb504a015ae7b7b518ae2ff7d4b28d7eb70e84c0125f68f5e14f2268f6a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): Eventually we will want to hide these fields to prevent visualizers doing too much shenanigans. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/view/visualizer_system.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4570a6dbcf855a8cd0928a4534c15984b892a7abc4b63e85902a383b4409eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): This should be able to list out the ContextSystems it needs. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/view/visualizer_system.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2f6e2cffdeb17370626454c5fa7f1a4a48566f630e1962a4115bfd9dd42520"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): estimate based on data \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/time_control/mod.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b2299c4bb30c991b545029472f4a97ca78f2d06b147018bc2c94ac6073d043"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): This should be a blueprint property and follow the usual rules of how we determine fallbacks. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/time_control/mod.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9423ae03592142f8247fd2a4503977c80718bff2098a18146c4869472f69e49"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jan): throttle? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/time_control/mod.rs"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdfd9987065f0674ec1ecb89b8d32a1727cbb36e6415d343bf595dc13da02cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Move tensor utilities to a tensor specific crate? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/tensor/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01adb221c5f99c659aabf754c8b5229549e6aa859fe8cd491c289787e61528b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Prepare callbacks should run in parallel. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/gpu_bridge/dl_renderer_callback.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"63d0e616b8e453d6d467edc8a07a4a337a8c0d2a592a5373783f57e5ab27ee2d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): It would be nice to paint an error message 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":"crates/viewer/dl_viewer_context/src/gpu_bridge/dl_renderer_callback.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc71b92358381f743ecb8dd34531a575b2972e9d6369dc033ca95750b168c58"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#4433): Shouldn\u0027t show up like this."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/gpu_bridge/dl_renderer_callback.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3407f4bc5fbd9ae087a71835c68c0e63f48ab3804c4eb0ed49b274d6f8c18ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): let the user specify the color space. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/gpu_bridge/image_to_gpu.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"510e2581556fa2c678faafb01019a56056876170ab226a010c102664248f2ae0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(wumpf): There should be a way to specify whether a texture uses pre-multiplied alpha or not. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/gpu_bridge/image_to_gpu.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"622453b3c804a6ca693fce0b644434b92f06192c43a82cee2cc51b6127e85e7e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#4624): The range should be determined by a \u0060DataRange\u0060 component. In absence this, heuristics apply."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/gpu_bridge/image_to_gpu.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf5770421cb82ae5645288db491fe780c01bf7f18ef5b4d6046d11d6dbe30fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(andreas): The consumer needs to be aware of bgr conversions. Other conversions are already taken care of upon upload. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/gpu_bridge/image_to_gpu.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"e589e8c96ab1d6a2702b1a9b3a90dd8aa91819004b9825eccddacd1872ebe333"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10648): All image data ingestion conversions should all be handled by dl_renderer!"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/gpu_bridge/image_to_gpu.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"516bc038e1525777208b3fb94daa08979be446c4415b9efa03b55b78fc580c25"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Investigate if there\u0027s underlying expectation for some of these (for instance I suspect that NV12 is \u0022usually\u0022 BT601). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/gpu_bridge/image_to_gpu.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"c97b26effa49003ba20fe5d796dde29f9c87ba5c6dd272df8db6dcb9d1e499ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Expose coefficients. It\u0027s probably still the better default (for instance that\u0027s what jpeg still uses), \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/gpu_bridge/image_to_gpu.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7b96c038c63e4ed0422b0109f6c15e47fd2e6a83513e77b06944900323bc449"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): premultiply alpha, or tell the shader to assume unmultiplied alpha \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/gpu_bridge/image_to_gpu.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4378d1fb54011f06cfbc7b16c3efa252e3c76bdc3b04fd4e0c33dca4614ab34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): optimize by combining the two steps into one; avoiding one allocation and memcpy \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/gpu_bridge/image_to_gpu.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfa794fe685d0b97b6e7f4d7dcca9e9e9881467c32c2de5088bad9770ede9489"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-4570): Ideally the stats would be derived from the frames the video player"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/encoded_depth_image_stats_cache.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d27da610c1d70f6e78b5cd437efcec810dcabb20cbb8cd0cab6ab35697dd822"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-4570): Remove this, we want to use the video player instead of this"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/image_decode_cache.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"08292af4c70312d35a0af0f2bf7cb4c66ca325223ddf0bcb115e68d6c5bae4cb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): a more incremental purging mechanism, maybe switching to an LRU Cache \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/image_decode_cache.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a411d6944ea4ee8b8b873ab4e3faadf7cc61feb19f0cd00ddb49ca349829039"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Do we _really_ have to have all these caches in \u0060dl_viewer_context\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":"crates/viewer/dl_viewer_context/src/cache/mod.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"33c6ee47842bab2a20aa6666aed08d40112207d7fb3264c80a79f6fee5eac416"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Should validate whether all codecs ever logged are the same, but it\u0027s a bit tedious. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f2b8e9824f529b0b98f986cda39875d87e4849827ac2a86b0cd84274f75b8a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Can we be more clever about the chunk range here and build up only what we need? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa941783e041f364e141fc18fabe88954a5a681183a65595c07d9addf94bcefb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10090): No b-frames for now."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d57c658fec8e3159906c72d7a7ab76adc5365a2f97956d9aa80970f4bc40a42"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10090): No b-frames for now. Therefore sample_idx == frame_nr."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"89546bc3c220b7f0bfac2e4d3c52c69bd0db917a6a354b36c739c1a39fe10bd0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10090): No b-frames for now. Therefore sample_idx == frame_nr."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs"},"region":{"startLine":1439}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01d3c4d1efab3ebf27c7089dadcc72a6fcc77903e53fc30ee6627f33fe6b0ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10090): This doesn\u0027t work if we have b-frames since they"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c64259862bb9da7ea2f1f8e1075a7e3a76274ce3b47e94edec785a3a01ffd3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(isse): Since samples could potentially be anywhere. We could \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs"},"region":{"startLine":1610}}}],"partialFingerprints":{"codehealthFindingId/v1":"8162edb9219f4ddda489fdd8a6aa7d52050d1f3e393e4a6ac67a2239c8566c44"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#11737): Remove the serde derives since almost everything is skipped."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app_state.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a0143522029aa1d6063a79bef78e7db0ccacaa8dc8f1d2a569c04a0b6861661"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Large route-dispatch match, one arm per \u0060Route\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":"crates/viewer/dl_viewer/src/app_state.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"410b7797004c900cdca6cb1ac269447c48967a99f6b1572636b6a01c45156692"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): If we move viewport loading up to a context where the EntityDb is mutable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app_state.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e545426b9c0a714446f2981d94ca301513c8c9f241fc1fb09df825c5f80383"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): offer \u0060spawn_async_promise\u0060 once we open save_file to the web \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/background_tasks.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"27150928c2f5da76de5ebefffff920a6855110e3d94516fa9941ca7d60ae55b4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#8475): Add the ability to pick adapter by name."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/lib.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"72ff1afa06129ef299bb0679d33c6cec6a4576e4270aeb3ca9ba020b0ea8eb1c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): eframe should have an API for this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/lib.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab85353dfb96341e79a953aa3c0e2c6503ee6aa2632030372b0880e4fcc45668"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#2579): implement web-storage for blueprints as well, and clear it here"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/lib.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b82f5db4160274677a81d5c0443f6d51fd10b0a67c9dba45bbfe196f0a232d1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#8064): should clear the _actual_ cache directory, not the default one"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/lib.rs"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"c956f4022f0cba2e042d60d66c7e1ce3ca235fdfeca309c28fa4a8d25fd2aa10"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#2579): Implement equivalent for web"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/saving.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c6dd92ce3904cbb1bc3d2b0dc4989ced1dcc45ea12f75745b3403a5d59c26e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): Determine this value from the environment. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/saving.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"9465242e03b5123c934bdeb5ca569a8984796cdc6d81fb4df6cf6c22e3715076"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-1878): Would be great to grab this from the catalog server when available."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/startup_options.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d9a2ec739c502cca4e5751efc74adeff84405e17c941855a108433cdd63d3b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): Unclear what we want to do here. More data is coming. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/web.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f765b3dd05cec0c3a51ed648187b3d4405a89c77a0e861a75a7b416b08b280"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#10737): we should refer to logical recordings using store id (recording id is ambiguous)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/web.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"06079a35ef7bc098b96ffac69b7b1dae0f315dcfcb910c4ac8db2eb99805aa3b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#10737): we should refer to logical recordings using store id (recording id is ambiguous)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/web.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c622d5829d37d3902d9e0e300359954b476cc9ac7fb82c18de3a68cf04e3901"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#10737): we should refer to logical recordings using store id (recording id is ambiguous)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/web.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc05fb9acad9b5941ee630e71817bbff6e50cc95dd2b6680dccc189d6b80bf66"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#10737): we should refer to logical recordings using store id (recording id is ambiguous)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/web.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d898813f0618955ffc090e0907195a2f4f0904700f9d81a44de2c8768d92b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#10737): we should refer to logical recordings using store id (recording id is ambiguous)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/web.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a09be1cde948e034ef9ee77143bfc684ee99bed60255e7914724cc6064d0fab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#10737): we should refer to logical recordings using store id (recording id is ambiguous)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/web.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8d587a3de2237fa681808f2ef4e3a9ac3cf711921417be6055807d5a260782"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#10737): we should refer to logical recordings using store id (recording id is ambiguous)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/web.rs"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"afcab0490b422e5be79d6b9b23098967dbb29b95951be14d7a0742ce39941431"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#10737): we should refer to logical recordings using store id (recording id is ambiguous)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/web.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1053fd8b8f4f01ff7d6f76dbd48e4c8010679772fa5ceb2f70ad52e79f0f0cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jprochazk): figure out a way to auto-generate these types on JS side \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/web.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c5794adced2544c8aece206c4d3bd1585492ecaa639b8f76de02d334317a50f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): Move the remaining generic JS helpers to \u0060dl_web\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":"crates/viewer/dl_viewer/src/web_tools.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a4800dac6ac331628317e96b14f6b04d07d3cf01748ba20edb083b632630f7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Send C SDK version and set it. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/viewer_analytics/event.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"7db611537b0585f691afcde89fd8189f96b5621cfb1ef19f5f290d69c307b1c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): only enabled if there is something to undo \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/dalaran_menu.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"de027d9a2579f057ee008096f0fda8061e5c8fd81f1e16acbb1badabf42060ff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): only enabled if there is something to redo \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/dalaran_menu.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e1003dbfef5199385619f537c80e53ab0d7fa0e1b06b645fe40a98279742a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): In practice the loop (green) selection is always there \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/dalaran_menu.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9e0dff157443aac2d838efec07735eee75be23351c85f771f62dab04ff10497"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(wgpu#5170): Use std::fmt::Display for backend."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/dalaran_menu.rs"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a3fa5dffe0ce7e1de8ea801c6eaff5245a90ed48b1c793ec54b601c4517003"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(wgpu#5170): Use std::fmt::Display for backend."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/dalaran_menu.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4c441d76e41bf0b4e63116f67730b6cacfdd5961d72d290a0cee46439c8574b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): decode using https://github.com/gfx-rs/wgpu/blob/767ac03245ee937d3dc552edc13fe7ab0a860eec/wgpu-hal/src/auxil/mod.rs#L7"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/dalaran_menu.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"32abb73edecba1ac96351e7f0e73571142ec84e3465936e80d8c4be53585b3d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): needed for alignment, we should use egui flex 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":"crates/viewer/dl_viewer/src/ui/settings_screen.rs"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"8364f0ce020de0c406656b6d0e423babfa24dd613f50b5b0b21ff1d387c6ddf9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): needed for alignment, we should use egui flex 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":"crates/viewer/dl_viewer/src/ui/settings_screen.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"8367f64abdd93fc449a3d1361baa3a9e627ad534d5f9b3454d5b3a0fcdc13d70"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): This is slightly glitchy: you can still type and we forget about it immediately. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/share_modal.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"db6378b620befe2ff770092107b46a70ec18f48b8cc289ea24437816e69956eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): why is this not a thing, should we make it 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":"crates/viewer/dl_viewer/src/ui/share_modal.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c1e5b50b0e45df61f49282bd5442c14377c71d2913aa9daa453f4b2ae62abcf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): What we _actually_ want is a group of toggles that are all vertically aligned and take up the entire width. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/share_modal.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"65b51dae9de3c3faf95bc1a8dc031e5aea5577048c4b6f8bebc9d10de48f9eab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Force running two steps to ensure relayouting happens. TODO(andreas): Why is this 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":"crates/viewer/dl_viewer/src/ui/share_modal.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0372d4a037d4ba9e9aaeef69f9c65699a765c615315511524bc3aa841cfbf3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): This should probably only run on \u0060title_bar_response.drag_started_by(PointerButton::Primary)\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":"crates/viewer/dl_viewer/src/ui/top_panel.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"400bc412e01eefe8d16c1af486314a29ca469cc0a6527385ade476cefc5cd21e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): This should probably only run on \u0060title_bar_response.drag_started_by(PointerButton::Primary)\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":"crates/viewer/dl_ui/examples/dl_ui_example/main.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"7832dfe9bfb3257261906799a8a31494a50f39d020ee23932b64dad141ad93c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#5177): This workaround is needed to avoid the click to \u0022leak\u0022"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/welcome_screen/example_section.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf367f131f7b96220b92d94bff7796d9316c6299625f710fe273f112843eea48"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // We respect the theme, but TODO(ab): use design tokens \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/welcome_screen/example_section.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc25b02560ff67e0c2a225c7f74577f0bb9b106819b78129b21e6f827ed55b4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): figure out why that happens \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/welcome_screen/mod.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ebfb742c374d1b07e558a71abb7dc9fc367a8d9a1d16677bc5b4327af79cdc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): in the future we could have a VRAM flamegraph here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/dev_panel/mod.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf1aaa5622be7e516c1558e96bbe287883eca9ed89090980d371d88d6ed31cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): this will become useful again once we introduce compaction settings. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/dev_panel/mod.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"313fc3908a38722dc18baa096ba385f73d6d04dc65ef95bd182dbcbaa02fa882"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): turn off plot interaction, and always do auto-sizing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/dev_panel/mod.rs"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a213e5f1c6ad2c7f4cf77dae231b4f57d9dd2872ab43a04137e289417d35b74"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-5309): Keep \u0060.dbl\u0060 files on the legacy importer until the server supports"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/add_data_source.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"06119467b3f3fbc520c1fb78a4c65f04911ee77f4e56fec8902892d323637ea4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-5309): Keep \u0060.dbl\u0060 files on the legacy importer until the server supports"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/add_data_source.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7566c7760cc5f30c847b1a8c82cb0da18b7a6f64f6b1e00c57c22000352440"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tokio-rs/tokio#1529): positional reads block the reactor; use \u0060std::fs::File\u0060 until"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/add_data_source.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f6424623b70958db7c0c6744e3c4cfdd584893c5bf2c9e78acccbefb5fd106"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-5309): Handle RRDs without recording stores as standalone blueprints."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/add_data_source.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"63bc3413f35b5f2c89b9b474192054c08d78edda7bd0970731b2fcc81f0afd0a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-5309): Register embedded blueprints that lack a \u0060make_default\u0060 command once the"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/add_data_source.rs"},"region":{"startLine":646}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfa8fa464b90c5a5d7a9db57c7f746ab75953afd12114ddc7cac53a6a9d19fe9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3713): show a blueprint for it anyway"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/command_handling.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba33fce93355c5183a9df56448efcd0cb47ac882c49f34dd881c640d07c51f7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3713): show a blueprint for it anyway"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/logic.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7529982f5652d30be3916648fc0c151ce10394e67727ea3701e23f26f0ce7ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): exactly what things get kept and what gets cleared? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/command_handling.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d599c92e28776bad7e9e1d07a4e59f4441f615dd0ddbfe1171915468b48317e"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hacky: Shrink so we don\u0027t accidentally include the border of the view. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/command_handling.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f9b8c2e5089ae2f1aece631dfd5bb2ae4b3a19be1be29b2ab3bed668c0dd2e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#12481): Depending on the platform we a request repaint alone isn\u0027t enough to wake up the viewer."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/command_handling.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"495f14aad939937932d341de1e2bfe2b719d2d6a1a424c441025a8d264550a98"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10967): We still stream in some data after that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/command_handling.rs"},"region":{"startLine":1671}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f972ef2f7b1d8c49c769b98c0f9d2a6524cfe9d971a67f3ff01c594eb99de3d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): unify this with \u0060ViewerContext::save_file_dialog\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":"crates/viewer/dl_viewer/src/app/command_handling.rs"},"region":{"startLine":1848}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58035d0b35f4420187cae94a9b7c35e7a6d8876a0d1098f0c19666349904690"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6984): Ideally we wouldn\u0027t collect at all and just stream straight to the"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/command_handling.rs"},"region":{"startLine":1860}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e1b1833584026d72127468b1cf96432052bcf9820d9703b760cef655d9a8c5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk/egui#8299): Remove once the egui fix lands"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/logic.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e8fa24e36ef70178645cad9f1830a1403e79430d5714d2d55811b1e450a183"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#5514): handle loading of active blueprints."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/logic.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e1170dbb7ccadcd4048f57bd58442c763cf1254db0da36a57fd8ba4832b7f7"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack: we cannot go to a specific timeline or entity until we know about it. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/logic.rs"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd7b5e8bce6cbe597d6929fb2aa0b15729e0edb575a4ef7764e30e92f8692d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): For now we don\u0027t append anything to existing stores and always replace. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/logic.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"f401c9a28882b3ae50cf8692ff8692619576cfadeeaaa3f711ec01c03c3d37ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): When we actually append to existing table, we will have to clear the UI \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/logic.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66702f1a70c601fbb25f121c30ff6ad0ede2166e6b35f9efd1ce5a7aeff7ffa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-4257): Don\u0027t hack mid-point time"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/logic.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"80432d8afe181627309986320ec012e6a19d3a2a633cada001a4a2d940df75cb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#2849): More thorough error-handling."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/mod.rs"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"f34bcd0b8cdd47ab7eb86302a8f483026f6244aed4bfb9a4956b85f00df7b5b4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk/egui#7899): allow consuming events before egui uses them to move keyboard focus."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/mod.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bdabf4c065c4c14dc47474a2b0ebc4c78dee440c8349ea7669e54f1a9c99e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk/egui#7659): allow disabling certain egui shortcuts."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/mod.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad9de0f530598b7cfbe296110a7c59a986edf0ae888bb7eb593110f5dbe9ce0e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#2579): implement web-storage for blueprints as well"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/mod.rs"},"region":{"startLine":1214}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea19dbc26aca80ba2d34b460d2aec86dcc8e237528a503bd8835c506613dc93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#2579): implement persistence for web"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/mod.rs"},"region":{"startLine":1734}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc372ddf9fce982282e2884b4f5c053170dcbe2af813cceb54875e64d05c16c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): Should we push this into a background thread? Blueprints should generally \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/mod.rs"},"region":{"startLine":1795}}}],"partialFingerprints":{"codehealthFindingId/v1":"58de4c3075a9eef99bb0433716ff97b0adc159d3b96b4f21070e2f1b15f895a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3435): Once we can index into \u0060FixedSizeListArray\u0060 using selectors,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/tests/blueprint.rs"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b6888f3b7bca159121a2b5eb73a8db3810ea9fea5155483c5136a111c37efb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Relying on the default==placeholder here instead of going through a fallback provider. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/line_visualizer_system.rs"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"0179c0067072c4f5cb3e108980c2c79175fb351830ac858ca96da92101e08a3a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): skip invisible? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/series_query.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ea5f0483dc7cb3112323c45431ccd4429754f8e476b736a4e9db4783566f33"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#4969): output a thicker line instead of zig-zagging."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/util.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca5cdd449787c72975e870c6503ed45554f881339a13474f675e50cd423f09a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#5075): Boxed-zoom should be fixed to accommodate the locked range."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/view_class.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df73e1fbe943a44456d7784b5b03359bef356c879d17633c9894d1d04c59af4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): This should be a blueprint component. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_text_log/src/view_class.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"95af197d93d581256b377a4a48a09f98cd4554cb4834416acdd9185616a15e2a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Should filter text entries in the part-system 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":"crates/viewer/dl_view_text_log/src/view_class.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c2e986d896722b068f82b788d26cef92f0eebb92c2153498884a2071ee6941"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): this draws on top of the headers :( \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_text_log/src/view_class.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"0349a37a209269e2ed116dbfe9ee89655843b64f4632ec0dd93e72b2ffb104bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): It would be more efficient (both space and compute) to do this lazily as \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_text_log/src/visualizer_system.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"632477a6e0484860bbf52e252edec4e24945f9a4b929e379968d4e4b0cb08971"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): better handling for multiple results \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_text_document/src/view_class.rs"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03b07329516f6c7785618c8ace91d4f60956ecc14a123b42f5b3835f16c2857"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): make these buttons respond on hover. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_tensor/src/tensor_dimension_mapper.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c49277ea815286ce4c777aa67e3a5484d04208ebbb3cf6911bd2c3ccd993031"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Listitemify \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_tensor/src/view_class.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9ddb7b4ee83c23061159af4377dd0b785f881b95024569771d9e90a8a22fe7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6075): Listitemify"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_tensor/src/view_class.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb969019dc94176fef64f6aaa7b9e4245d01d3c5eb4896e462c7c43c3ca7b62c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): this is a bit too inconsistent with the other UIs - we don\u0027t offer the same reset/option buttons here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_tensor/src/view_class.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"a413e85200da922255e4061648f9875e2300743a22c15a7a464afaba84d653d1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): allow for mipmapping based filter \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_tensor/src/view_class.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e67372621de3d20c7da609fe03a50e1480c924a52994109e4ac3f96fbee9783"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): draw actual arrows behind the text instead of the ugly emoji arrows \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_tensor/src/view_class.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"e883524a9429bc15159e81e4e8cfab50b8e83aaafd6104b7dc1e7b86f4678b53"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3076): We don\u0027t correctly pick up the target frame from a pinhole origin without coordinate frame."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/tests/project_2d_and_3d.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"2411feca31e06283da42da32183e2058369464c894193bc749e57804d9a0739f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10090): Video stream doesn\u0027t support bframes"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/tests/video.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f389bf9333024a58433ef9419fcc107fd8cee6d944712f0f9e569201543249"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/eye.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be7e9b5398395e07f9589deee85046bb044c0dd9e2424930766428c1b823c5d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_types_core/src/reflection.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfe6e4e40e58f0ed3cf6c6f31fb9276f1d692c3ea8bad97bf727f66e8bae98aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_types_core/src/reflection.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a17e8f2b02434ea6500e92879c10f54382330ce35a3048580e96c81be1d5604"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/eye.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5dc8c6262bad979baa7b29729ad09a225e2b2eb2713dbd889941cee4808874"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Interpolating between perspective and ortho is untested and likely more involved than this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/eye.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24a9ffee564119cb0d20c45effa35bb865fcf5edd80e9681bc2af530c648893"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // radians-per-point. TODO(emilk): take fov_y and canvas size into account \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/eye.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"d445cea98e960b0272548c5731af08756de2f4d404e54744fae30299ca36c639"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): why do we need a negation here? O.o \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/eye.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"af96e20640dfef4344f6fd206a5e5fda2f25437566900312113853f432d9525f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): inform the users somehow that scrolling won\u0027t help, and that they should use WSAD 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":"crates/viewer/dl_view_spatial/src/eye.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b93aaf87677e6f4259d00a9d77c2f537dc3a70b1d74c856c6675f85f617f9e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(michael): find a nicer way to handle this, e.g. through a dedicated \u0060interacting()\u0060 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":"crates/viewer/dl_view_spatial/src/eye.rs"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9086456a0cf542afc6eb85a796a86d76bd73a47109ffdf1a818d75c4666613"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): We should only have MeshHandles here (which are generated by the MeshManager!) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/mesh_loader.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e664a05b3139b4b53bc22b7d182a932b619d89a9edebaa5b1a243e9033d07b51"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): load CpuMesh in background thread. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/mesh_loader.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21087cccf2eb26572d96e1e7cbdb4dfc8636ccbe72d2a68abd1a83ac05aec10"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Calculate normals \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/mesh_loader.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"2491af27c91671a3beb4cf615751888d8a77daada6c1c3a3df77ca23f7b54940"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(wumpf): Can we avoid this copy, maybe let DrawData take an iterator? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/pickable_textured_rect.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4a9144f61c13f329e28193d334d451476d7d9d15afad166b578e9e7ed39207"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Interaction radius is currently ignored for rects. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/picking.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad238a18995f5d45f4a87a2f5e0e510efd94dc999b59ac456d715d346728e03"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#1818): Depth at pointer only works for depth images so far."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/picking_ui.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a4c9116512327551eaa8e39a7120460afcbaae302978b3a679441217a0e16e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): GPU picking doesn\u0027t tell us which visualizer produced the result. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/picking_ui.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0bde2c5a4b19eae619a66a9feacff8258e643306496b58d002e5fdfba6f29a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): GPU picking doesn\u0027t tell us which visualizer produced the result. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_map/src/map_view.rs"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f9e7596f82c9edcbe387e2c10eaa7f9128ea83e0435967db7b1e7a19bfe27e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Should there be context if no item is hovered at all? There\u0027s no usecase for that today it seems. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/picking_ui.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"8daf0a32829c3cb539d3e8f839f5e83c71fcfffcb9ee3c5d3686fbde62748f6b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): use \u0060parent_ui.painter()\u0060 and put it in a high Z layer, when https://github.com/emilk/egui/issues/1516 is done"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/picking_ui_pixel.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"553e51f6b95d5bb45947d6b39e460eab29caaf4fb8eb6f31e826df2f843085dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Should parts of this be a utility in dl_renderer? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/picking_ui_pixel.rs"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2475188d1e12a2d1b58b3c802da7e78bc792a72ee4d5adb8199ac2387611fbd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): When Pinhole is an archetype instead of a component, \u0060pinhole.project\u0060 should do this \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/pinhole_wrapper.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa51dc62248b2e2b4798495e46e3c4351d5b8b8730509902d27010a1314fd54"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#1361): This is a bad approach to rendering capsules of arbitrary"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/proc_mesh.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd09124e6a8e2b21cae207f0e64943515cc664644201249a8d66eb798d9bce6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(kpreid): This should instead be a GPU buffer, but we don\u2019t yet have a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/proc_mesh.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"2330a88985279d55f316747ea9b5653ec089147287b6e15a3341dbb958b25d5a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(kpreid): This would also make sense to contribute back to \u0060hexasphere\u0060 itself. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/proc_mesh.rs"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de042a0d237100a336ec3dc6391da28d2fc91383d8a85c9ae8b410ab7ad79df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): What if there\u0027s several camera visualizers? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/shared_fallbacks.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"de384885301e1006bb56fd1aca72b6a489f727054e6de7831aa1714e0f402a1a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/spatial_topology.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4f24145f7180097a193138b65e2f85a857d3ae05949ded0afb643d3ebe79d61"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/view_3d.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"308a8a1076e7b9659d4d4acf53aacb9dfd5916ed5d2c58e648abab166d163cbd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/context.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a46dddcc9d6891e4513380e5647fd695523a3bfb9c0f812e5aadd523dcffe5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/demux/mod.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"27a5da5716fe8c0eb5ac5e240d00a080676fc7ff9f0a949f91d574ff128834e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(andreas): Should turn this \u0022inside out\u0022 - [\u0060SpatialViewState\u0060] should be used by \u0060View3DState\u0060, not the other way round. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/ui.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd07c70ebb7a47aad0db0a10e4f2146b1e15a40add7769b64c07829eab4f1cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): very simplistic heuristic \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/ui.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f48334a0abcb21f50ab97fb1ccef2e2210932f17f359d160ce02e7bd177f525"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#1640): 2D labels are not visible in 3D for now."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/ui.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b6aca70bdd84126b883d54aa5b749e853049dc4c2a266012aac9776c307f6ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#1640): 2D labels are not visible in 3D for now."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/ui.rs"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"50323fcf3c9ce3cefd9ce868901373a39c8f2583f3b4f0ac549303a2082adb69"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#1640): 3D labels are not visible in 2D for now."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/ui.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e97d026f68f8c1d010a4c1bca0d85d46183079f9608f1da534ae11ebd8e0b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Make configurable. Could pick up default radius for this view? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/ui.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28c9ae88beba4ac145f554a5bf9367fdd1d53154cd946778c979a6cc1902ae0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Make this an enum so the user can choose between showing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/ui.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"92c870cdf94217c696dc6af0a7809e6f2d4a4da7eeb672c5246f30e2fa928b03"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): some way to visualize the resolution rectangle of the pinhole camera (in case there is no image logged). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/ui_2d.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2a10189d99088f41d4dc4c9312a41537ab3b14683fb645e1258ce88de2ab193"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Use the same eye \u0026 transformations as in \u0060setup_target_config\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":"crates/viewer/dl_view_spatial/src/ui_2d.rs"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"108ed3726faae3d73b32f7fdd38476c97b21e28b08dfa417a7164392d53f4804"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#1025):"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/ui_2d.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d08d703838ddc3cfd204deada7ee0ebcafc784740782327443bea0b3536dac7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#1025):"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_forest.rs"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"b64b2d3f80fc4dbb5d6b39eee3ed8d91e3e7898eb175528a928261aaf0bc343a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Support anamorphic pinhole cameras 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":"crates/viewer/dl_view_spatial/src/ui_2d.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b51b56d8405b796922f74b462af752c75fe083f6e8d2cd6d8939a640386a1b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#8373): The need to scale this by 500 is quite hacky."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/ui_2d.rs"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0e59c73623b3e304f9ee52e50b303d38206fdf866bd0837b63ec4c33daeefce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Fade this out. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/ui_3d.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d093104bee277fbe2da6b0e72d9642767fa3ba5b1098ddb400f8ea22873f4f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Idea for nice depth perception: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/ui_3d.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"626e3c959e501d915a70ae1abb548253e2c0a831468249b2e15f2a0b8d7b60c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Make this dashed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/ui_3d.rs"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"f12a20367212970fcf5f6d47c996795f89c4b15315714e91d553c64dca70cb42"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): It makes sense that we query the bounding box from the view_state, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/view_2d.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"74d40db608c66211b171bd4a23c66ef7a3f932b5dbfe9a384b31d1aff863e2de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): if there is a single image in this view, use that as the default bounds \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/view_2d.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"81706bd50e899bfbd20dbbd4c9e2216a8387909fa6f482fc17f58f988d5bb798"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): list_item\u0027ify the rest \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/view_2d.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7517c23f7ce17a0cafb1cb7b2987155fe0a8120ff877c357853c9988e3ef47"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): list_item\u0027ify the rest \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/view_3d.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e64962767889a3762e3d10012c9fca14c168ea938c6c3948f11469f23210b00"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): Maybe merge this entity into each child \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/view_2d.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca8618c1b924c0132389db941fc19335582de43e2fb5abd6b1e0b778f0fe35a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#2663): Note that the view coordinates component may be logged by different archetypes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/view_3d.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f324c02382fe64bd3a373138879360faf37592dc8e7fd138154d29b3cb45ed4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#1611): The color picker for the color component doesn\u0027t show alpha values so far since alpha is almost never supported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/view_3d.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad777447c198efe5cc253eb1d80912c44f3419782938013b8630a1b541439ee9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Introduce a utility for this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/arrows2d.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7c78c40cd5574ff134db85d74e659bc71588bdb9d4527b48cfb89b0e6597ef0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Introduce a utility for this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/arrows3d.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a7ac7075350760cd4da55bed2d60493bb9e7d7b902d2134222e90ae222a608"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Introduce a utility for this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/boxes2d.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5954e7da15724fd40c68670cfbcd38f8d324eb4e4c7d931b565fd936783f7e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Introduce a utility for this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/ellipsoids.rs"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"91852b9f019c69d9cba6fbe479274d648ff0b5edf531fd4cbc70d9146477bb6b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Introduce a utility for this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/lines2d.rs"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8d67ea8791c7d5e043ae04876de3874b89b379167122cbb5e079a176bf39fcf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Introduce a utility for this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/lines3d.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7eb926124556d05e50895a6b199b71ecfb57e47cd7ab0d787ebba9aea68d808"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#5974): this is subtly wrong, the key should actually be a hash of everything that got"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/assets3d.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"e831dfe2581d5e5c53cb5af4d6c746612956d3a436749f3affd810bd3b1744c9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#7026): This a rare form of hybrid joining."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/assets3d.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"8de79e0ff1a310ff83e274f703acb3d55d0b219f6ef1b4e1e24373c0f596023d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): honor the culling settings from the mesh file if any. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/assets3d.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"16394b5a4c2c7eb7399ac3fcd7103f84d6fa710cb250b632cd1f1789ba3c75d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kpreid): Is there any non-historical reason to keep that. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/boxes3d.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a64f19eac661346747382c225dd49fce3b3a6d904b1af7a76d633aa95099f4f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // This can happen with various frame id mismatches. TODO(andreas): When exactly does this happen? Can we add a unit test and improve the message? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/cameras.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcce01269d904b27601dfb1733625ea8b768b1849470e81b8e95f93d31a1d9d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kpreid): Replace this entirely with stretchable meshes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/capsules3d.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad539338a99dfb5a3ccc36e831698285b896bd0c285a1e54f7ba3487182f79f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kpreid): subdivisions should be configurable, and possibly dynamic based on \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/ellipsoids.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"4037474920f620b6646bce64b097edfa7fb0b285e5540c20393ae124a875b20e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3840): create a proper default-provider for this"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/gaussian_splats3d.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4c08bbb56fd9b5fb5c909432e1c886ebd0f1e0e57d4cf36d5a4443b8e14e47"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#7026): We should formalize this kind of hybrid joining better."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/meshes.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"811e428c472383cd83497c77cbcd4aad8f6f5d1c43dab1e48693eac0d72f15ea"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#7026): We should formalize this kind of hybrid joining better."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/utilities/proc_mesh_vis.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c776650984c1be067bf925fa6f39a794adba20cc3baac939c4e9e3de5638a28"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jan, andreas): consider adding DrawOrder to video \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/mod.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1c34ddceef42c5d096919a161e866c22b8b6ac1101276c93c522f1dc9c55c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3840): Fallback should be already incorporated into the query."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/mod.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e9cb1ea1caca703baf9cd9bb7ff5956f7e300f947b4cb3e77ba2ae8285ab2b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3840): Fallback should be already incorporated into the query."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/src/annotation_context_utils.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"e013cd80be9e7b32dab0f7b6d041fea5a430a76498af9b7af7b14bc7258ce525"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3840): Fallback should be already incorporated into the query."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/src/annotation_context_utils.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a4b60e4ae72bcbd343c279ce764845751d4d32e1fc2413524c1aa609574d92"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): surface as visualizer warning. Handle correctly when cached! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/mod.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2939f5cc08c032f976b4625ccea6df1076e1f8c15eaa51d58cfda4e161daf5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): array casting _is_ possible here. Maybe it\u0027s faster to do these checks separately? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/mod.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c818824521eb29de3b0f32dfbb3dcdd189ecb9b236f7753ef9c84cb02688b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): We should be able to compute this already when we load the keypoints \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/mod.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e6ae9ee1069634e176dbb42b99c2987cf9cf789383e3670878ea01cce11869c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Make configurable. Should we pick up the point\u0027s radius and make this proportional? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/mod.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"be00b4d2e195384d462560ec4fc189f833adb6b6aeafa70cd7015fa8114c1b87"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): The following is a quick fix to get multiple instance poses to work \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/points3d.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0ab58bba572d31e3ebdbf5d1c893105113121b0f167ada0be7c0c6be2c47d6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): In the future we could make the \u0060show_frame\u0060 component an enum to allow \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/transform_axes_3d.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"74840053725dd32439a5ab37b4332bd2ed06606199725e85949335ae1f8437e9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Should ignore range queries here and only do latest-at. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/video/video_frame_reference.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b38a27145f6a3afc98bde923c3319f990d27370dc781dd22aa935333d48a61"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): A smoothed over time (\u002B discontinuity detection) bounding box would be great. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/utilities/labels.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa6f280fe8b427c5967a09bb8602e366888c396d97c0ed808ed56f6978b6480c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(kpreid): Should be using instanced meshes kept in GPU buffers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/utilities/proc_mesh_vis.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3021d0f34c704afb1b600a34532f8546f5e5effef10ac3800b4ed8e7882b26e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(#7026): Document how the number of instances is derived from this data."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/utilities/proc_mesh_vis.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44c67691aa48c0b70b4a1e33e3e0a986a3287ef7ab57984536b70d4e152e386"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): make configurabe? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/utilities/proc_mesh_vis.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df3c8fe9c94933321990b80b8ea00762082cfe3b8de4de587a850023c09c4a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): What\u0027s actually keeping us from allowing the 2D view to be rooted _under_ a pinhole, e.g. \u0060/pinhole_here/some_2d_stuff\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":"crates/viewer/dl_view_spatial/src/visualizers/utilities/transform_retrieval.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"13ef6c0ee74fbbb32c35342c63871224422236e12180c42b28a27042fcf76cb0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas, grtlr): We should not re-query all those transforms. We still have them around in \u0060tree_transforms_per_frame\u0060 (and a bit below in later \u0060self.transform_infos\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":"crates/viewer/dl_view_spatial/src/contexts/transform_tree_context.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a317c9d90a3a7eaf58cbba1af63140955822c9564e710420ee3a3f5d75bd49"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): But what if there\u0027s many pinholes visualizers? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/contexts/transform_tree_context.rs"},"region":{"startLine":594}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8652f91bdd5a893259006b12d3efa27c7fd393d1c8299194adc591dea11d09"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3076): this fails right now since if there\u0027s no data at all we don\u0027t create data results."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/contexts/transform_tree_context.rs"},"region":{"startLine":941}}}],"partialFingerprints":{"codehealthFindingId/v1":"62c7c79dc7632edfa85c4da9fe7dd078201310372784860942d6c25d5805a10b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Maybe these should be different concerns? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/caches/mesh_cache.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"633d8cfbdde2ddc858d7c3dd1d11a2e727f768f314f2c73829b40d744e428351"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): This looks slow. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_map/src/map_view.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af3d5cb8d049703a11540b2750e720ad483cf9c9a1439e3de5e301895bf0522"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): show in UI and save in blueprint the auto vs. manual pan state (may require \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_map/src/map_view.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad3da6d81df7cca76b2e4198dbf660ff4deb2ad21dc6bc7c3651d1150859659"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#7884): support more elaborate auto-pan/zoom modes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_map/src/map_view.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac04f82e1c3fa76a3bbcaaa90a7f31435e0ce3596db5524ff250c5b6c6b3c36"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): we need a better handling of this, but requires upstream work (including \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_map/src/map_view.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab1f64f81a03bd1b2863fceb45aebc32aca2ebcbc30c55c122509b18ceba7ba8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): this utility potentially has more general usefulness. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_map/src/map_view.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab735d18f3aade9dff3bcc9f7a4b2bcae0b59037225709f3e1cbfa4b969c47e6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab, andreas): this part is copy-pasted-modified from spatial view and should be factored as an utility \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_map/src/map_view.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"363203bdac457495dc086bea61cd3ee50edc151e040c5d4778b8e94c0067aa85"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): should we keep flushing out the gpu picking results? Does spatial view do this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_map/src/map_view.rs"},"region":{"startLine":488}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1b6604f857ea260e4afb5eba2ff791566dbde6ed3b7dec7745d91142d5c205a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab, andreas): this is a partial copy past of dl_view_spatial::picking_gpu. Should be \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_map/src/map_view.rs"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8cb564e4d2a95d254f4d8cf04170c140b0834168ab64fcd8bfd7ebfcd9c83d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab, andreas): the block inside this particular branch is so reusable, it should probably live on dl_renderer! (on picking result?) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_map/src/map_view.rs"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c9c7daed1bcb6c90161b76029e5505180ec182e3a232320d57599a3409e748"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#8013): we use the first vertex\u0027s latitude because \u0060dl_renderer\u0060 doesn\u0027t support per-vertex radii"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_map/src/visualizers/geo_line_strings.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c35556d3b4817da1d5b5caaedd7e0c0e8561045e2737e8712f0e40620fe1f2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab, andreas): boilerplate copy-pasted from points2d \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_map/src/visualizers/geo_points.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"689bcdf70381f40b19ec5d2b2d46270a1d430d1883a5887ca69c7b0f161110da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): should use the actual tile size from the map provider (always 256 in practice) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_map/src/visualizers/mod.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f3c3083d541e1a5df7f4a3d6af2df5069c1572f7e835da9fa951b73104c609"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): investigate instabilities in the graph layout to be able \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_graph/tests/basic.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca115ce92438aae8e7dc32d92590ff522ba1779461dc8067b9ee06904777d2b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): could we (improve and then) use reflection for this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_graph/src/visualizers/edges.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a388fe0994b77bca88245ab2fd7ea1e3ad9d91f97ab6dd3391bcea83477f9a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): why not data_result.query_archetype_with_history \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_graph/src/visualizers/edges.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03d6a9eef50927dd9a9f07638c78775f046235acf2f38ebeaca9a767718c3a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): why not data_result.query_archetype_with_history \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_graph/src/visualizers/nodes.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65d9be6169f351f1853a2667d7c0eaede78aa2194e136bd44711d15cc4a8cf2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): This is just a crude (upper) approximation, as the resulting bounding box can be too large. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_graph/src/layout/geometry.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"a149901e043d2ac0efb2ebdac6b60c12cec1c24065568167179f50d7c81d65c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): Do this more efficiently, as this currently rebuilds all helper functions. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_graph/src/layout/provider.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa44bf8c1aa6eb0ee293d1695a09432f8ee8b258ab5f8a5072432097cac8574"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): We could probably consider the actual node size here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_graph/src/layout/provider.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f58ded38b3fda6cca95dd1dcf76ce6c3caf7a2e1ab46c38f24dfdef547747e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): The actual length of that spline should follow the \u0060distance\u0060 parameter of the link force. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_graph/src/layout/provider.rs"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b881014d19b16cd3cb4c2eaa555756d9f3230b00d78396207ee209b68e723dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): We mostly use this for debugging, but we should probably \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_graph/src/layout/result.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"36442e51de50660884cc89d12cec3b82311b0fb1d0e3847b981091208b03cd15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): Consider something more storage efficient here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_graph/src/graph/ids.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"692405441ef0a8ff171ae794868fe7e2201386eb78e8d35e73d5d4bb6dc88021"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): We should see if we can get rid of some of the cloning here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_graph/src/graph/mod.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"a966c836b0f74182a1e038e97c91d9db5cff3786478c49c160f581bb2c7ecf3c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): factor this into a helper as soon as we use it elsewhere \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_dataframe/src/dataframe_ui.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3e62bacf60e5c75d6ec1cf44ebc2c85e0447a26fac40813f0c495842f064da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): expand column(s) to make sure the text fits (requires egui_table fix). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_dataframe/src/dataframe_ui.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c573cd730f58ec9de3ec0248f3459b6e3bff70b42c086eb76007e6b86c43624"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): this is done for every cell but really should be done only once per row \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_dataframe/src/dataframe_ui.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b796535a404c055a8d793c50cd699bb7b95b53896afa56610cfc2cf9501dc6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab, emilk): ideally, egui::Sides should work for that, but it doesn\u0027t yet support the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_dataframe/src/dataframe_ui.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"4602c6fd318eff0f781cf42fee5b50ae4308eefef7f5f47ab7c7774aebc55bd1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): why are we dealing with a ViewerContext and not a ViewContext here? The later would have the query results readily available. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_dataframe/src/view_class.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"a728b1acb1256feecf01162368e9c7dbafd3507f98b3add04dff8d024766d637"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // selected_columns.row_id = true.into(); // TODO(#9921)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_dataframe/src/view_query/blueprint.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"77748224ba214b429dc3ae1416afa2163f48d2b90b710cc20b39dcc3cdc2754f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // row_id, // TODO(#9921)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_dataframe/src/view_query/blueprint.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef9bca344dcf1420a5848b283eac9b30afaa68b3e2d34286d303ee5e91f73f8d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#9921)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_dataframe/src/view_query/blueprint.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"748fe02c5d2ca8f04f2a2abd64c843160fd0b14afceafe43be2aa088e901df77"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#9921): add support for showing Row ID column"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_dataframe/src/view_query/ui.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25fe2848fcc6380ad432f29192b11a58b58d879fa7bf13b665e5c706ea45d43"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): use this all the way. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_bar_chart/src/visualizer_system.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ca794470880b1b46b748666e7f55a40ceb8a54c164639ad747092c1daf12aec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): It\u0027s a bit overkill to do a full blueprint resolved query for both the range \u0026 latest-at part. This can be optimized! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/src/blueprint_resolved_results.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"2232cd1752b0bc567f396fd804f88913b3ef30c121d71df635e53065ceb7d43f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): We should be able to do better than this and determine hashes for queries on the fly. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/src/blueprint_resolved_results.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f2ed973c15fa631c2b53b25d68c4def45e8e914880274f571fd5dda45e1594"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr,andreas): Not all of our errors implement clone (looking at you \u0060ArrowError\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":"crates/viewer/dl_view/src/blueprint_resolved_results.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"603bae3cb2b2428cd11eced621617a9dcd5b5f46c74b5d561a85246f397f93fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): this \u0060collect_vec()\u0060 sucks, let\u0027s keep an eye on it and see if it ever \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/src/blueprint_resolved_results.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"02295311262ac31a49d870bfde0297d5c6d6e8aa2d073dc31f4bb51f4a3c8317"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Would be nice to get rid of the extra clone and vec allocation here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/src/blueprint_resolved_results.rs"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5842701ff403ceaabbb42afea1452f9a772d1ef64392700453f37212a7fc082"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(#5305): Note that this uses the old codegen\u0027d deserialization path, which does some"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/src/blueprint_resolved_results.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa011a78fae282fea32b75291819ebd76200ec67c30824bcc84015158f5c7e21"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Picking just the first here is a stop gap measure. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/src/component_drop.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"3939c765dd84bd0bda6ef06608db152fbcd1b17a26966a4dc082ea7d7b09f664"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): It would be nice if these wouldn\u0027t need to be set on every single line/point builder. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/src/outlines.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9ce7e810f44247eaf85a44bd5834643c34281d06d9eecc012482142070f217"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): Ideally we\u0027d make a more informed guess about nullability here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/src/query.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"56719eee64f310551d5acf72d5a97a4ccd0cb35d60949989a254c8a78d21226e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): It would be great to avoid querying for overrides \u0026 store values that aren\u0027t used due to explicit source components. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/src/query.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9209a5b540018384c9434106882486f2684ea06a4e2eea3bab8377da9efdc9c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): It would be great to avoid querying for overrides \u0026 store values that aren\u0027t used due to explicit source components. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/src/query.rs"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"98958148191e3cc8f4bd573a9a6815423b1c7fbbfb2208aeae433837fbcd464c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Rather strange to have a latest-at query in here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/src/query.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"4310a34df04e1b1dc4cc70a734b23e9dfd956173ed981cfbd0c6fd2a3896c09d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Batch these queries? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/src/query.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"93574bb67689cac7babc21767a1e59d8b97203bfd420529ea18a0dd6868a2799"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): The next logical thing here is now to save it to the default blueprint! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/src/view_property_ui.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"891d6e186db9aed9ff94e97889f3f094c85e267618e96f0a594c17b183680005"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Needed because we set clip_rect_margin. TODO(emilk/egui#5605): remove clip_rect_margin"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/alert.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"579c2e870a2294f97a4195d5b677ee7ca70091b2106e37da39ae0781e68d2610"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): move the native window buttons to match our Self::title_bar_height \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/context_ext.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"83b4196d7bdce817ca1b92352aa6d2dff1d9289432fd19ce7eb3d681cf97d5c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): move hard-coded values into .ron files \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/design_tokens.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"927bfe1d420264dec06021ad2de6d7cd82f4981500671d70a029bfb32ae3ea2e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): font sizes should come from design tokens \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/design_tokens.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"2354db38d0b15fd192ce80113772659c5f790e485dc3ee393ab0cde62a5598ee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(lucasmerlin): Update all tables to the new design \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/design_tokens.rs"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c03beadf93efe339958156812563075b403af70e0fb371b4b633fca52206b9f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // lineHeight: String,  // TODO(emilk) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/design_tokens.rs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf12be768302ef351b2f9e662719beddcfe6e9b736f57b982289233630c9101"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // letterSpacing: String, // TODO(emilk) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/design_tokens.rs"},"region":{"startLine":1166}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7a7a9b83fba2ceef559281a3be3ceffdd18147679073f97efbd45e0f873720"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): ideally _all_ text edits would be styled this way, but 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":"crates/viewer/dl_ui/src/filter_widget.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d386f0b63184fcd369772712b791613dd2bedfa10e6cf3328e0eeb9bcd94034d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): use short_duration_ui \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/notifications.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"5196e65fbca66251aa33c192009905c774d0ddf1ed72deac346e2a44c5ee0444"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): this space is not desirable when the content actually is list items \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/section_collapsing_header.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"375ee90f9b2993d5dcc3b7d95d69097dc899fd3117ed48679bacc796f5e11d5e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(lucas): Find a better way to deal with body / monospace style \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/syntax_highlighting.rs"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1e3ddc3e4d3690ec04d075bb0f6359e134f591e803ececd97e46d58cc5f77a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(aedm): warn users if they generate snapshots on a GPU. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/testing.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca2d0bbc29867985043e083ed9f55e0c0c843134b42558f65ae81930dd129e8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(abey79): distinguish the two types? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/time_drag_value.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"d468d2d2218f4788e2703e8bb0d1ffa7ef7bf69f0461d11b8394233982b4675b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(abey79): is this the correct TimeType? https://github.com/rerun-io/rerun/pull/9292#discussion_r1998445676"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/time_drag_value.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de6109bfe6156e92a672a5004e97caebd64eb1a0c3aaf8be6f4d65c5c33d9e5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk/egui#7537): add the contents of this function as a callback in egui instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/ui_ext.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb6dc4d5e8d49b6fb120b017d7420a462e76318b9327a3c34ff200a249cb303"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): get from design tokens \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/ui_ext.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9110d776f18854c458d8269a4dbd29156ac7eb23821118a7918261adf70741e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): this used to be used for inner margin, after registering full span range in panels. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/ui_ext.rs"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"91aeee465e954112bc1651b5b2815897d4d9452b7c9fde75447789c4b7210c67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): use design token for indent \u2014 cannot use the global indent value as we must \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/ui_ext.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a4c7542feffafb1307748a8d1424966384749ba269988b021b8eab7a5ab4e9"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack: ensure we don\u0027t paint outside the lines on the Y-axis. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/ui_ext.rs"},"region":{"startLine":1149}}}],"partialFingerprints":{"codehealthFindingId/v1":"8350c677b93effe8f5aa6eeb941aeaa49cd5084bfd50cfe409f3ec6b6ca10c26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): make the button itself a \u0060ListItem2\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":"crates/viewer/dl_ui/src/ui_ext.rs"},"region":{"startLine":1198}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdb4059ef85e3c0f5632ba1a3b982e8afbbe4343c7e715f3c7d0d024b7c12222"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6315): must be merged with \u0060Self::data_label\u0060 and have an improved API"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/ui_layout.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db189d283b21e25cc5901cc4d6fb749da551dad9c88efaf80cf1d9b66df413a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Dangerous to let this grow without bounds. TODO(emilk): let it grow up to \u0060tooltip_width\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":"crates/viewer/dl_ui/src/ui_layout.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c39a9c25ebaa9d8fa85d5ba9057952dd459a00ec67f77dec778b74b651f2a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6315): must be merged with \u0060Self::label\u0060 and have an improved API"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/ui_layout.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"127dc2682c9158229715225667589efad3e8a600e00e9619a74bdff688430966"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#11211): do proper fix"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/ui_layout.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ddf46b26e72136a7a2160338fbda70f595e0b57954529dce3736c64a9edea55"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): in the future, that should be a \u0060Vec\u0060, with some auto expanding mini-toolbar \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/list_item/custom_content.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"87fb3bc0bab55dcd63df4c6aa9a0e3589ae1e5429f1c7dc10c0dfec14ba8ebe9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): in the future, that should be a \u0060Vec\u0060, with some auto expanding mini-toolbar \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/list_item/property_content.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"c104ddcc37624182d1d04b489d38b5cffd170c52c0cd31b96321b0a699692bf4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): accept multiple calls for this function for multiple actions. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/list_item/custom_content.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"99697b53af1f8872ef8d44ace96d140c25fd9e0575c32ba230d9246c2f0abd8f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): support multiple action buttons \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/list_item/custom_content.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dcd1b4e52dd902e5c8768b7730d53b7dfa0f6c1f0eb507157866b897880f863"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// Sets [\u0060Self::with_always_show_buttons\u0060] to \u0060true\u0060 (TODO(emilk/egui#7531))."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/list_item/item_buttons.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09153e493b2cc7c262a831abb79482afd46795c29516646d376175498567f3d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// Sets [\u0060Self::with_always_show_buttons\u0060] to \u0060true\u0060 (TODO(emilk/egui#7531))."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/list_item/item_buttons.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8aa5c754de65b3c304efea169bc5f264466f16a407c1fede417de522ef80099"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// Sets [\u0060Self::with_always_show_buttons\u0060] to \u0060true\u0060 (TODO(emilk/egui#7531))."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/list_item/item_buttons.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f71ac2e289c181fb63c7d160abe45bb18797d12e06d5136f7b691a0eda53c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// Sets [\u0060Self::with_always_show_buttons\u0060] to \u0060true\u0060 (TODO(emilk/egui#7531))."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/list_item/item_buttons.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab2961768b7bcc95ec1b269b1991c8fd578c7828422027a36d513d0aa55e766"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): these should probably go as WidgetText already implements that \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/list_item/label_content.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b421ab24134c2091887cddf38d4e4321b38fa1edda8e82154618d103b8548d73"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): this is a hack to implement the behavior of the blueprint tree UI, where active \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/list_item/label_content.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"404a569090abf7f0288dff9e9b09cf0b412bbfb755dea38f89da8e4fd59ee75f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): should use design token 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":"crates/viewer/dl_ui/src/list_item/label_content.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c677331b0993404d9a7f9faac4e22859038ca1a2a2cbfa72c9c71897c518f64"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): should use design token 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":"crates/viewer/dl_ui/src/list_item/label_content.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bc5c67eaa3810824d9e9867d098ba2eb16faa5c2a4b7b26d23a71c0e15b33c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): should use design token 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":"crates/viewer/dl_ui/src/list_item/label_content.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b4fcf3c773f3e58d7b2e3fd267032de383add81f22b0ff0c678eca72bc4a74"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): ideally there wouldn\u0027t be as much code duplication with \u0060Self::ui\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":"crates/viewer/dl_ui/src/list_item/label_content.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca911ebf02b9115c609987fc3caee7c29d57daa6a523fea9dd082f95b87fe755"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! TODO(ab): provide some top-level documentation here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/list_item/mod.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef8c582a03c2e0ebdeec08d13c9833e4d7da517afb498511b0b01bd4bb74bd1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): could the return type be just a bool meaning \u0022inner interactive widget was hovered\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":"crates/viewer/dl_ui/src/list_item/mod.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"39f302256ae516a16496162ab69288e9a3c0f04a872b84e69f6ba6774061565e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): icon styling? link icon right of label? clickable label? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/list_item/property_content.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"8973ff5a30925a7671b6333abcdf06cbdda33c8bb304c01789803c509d64106d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): this heuristics can certainly be improved, to be done with more hindsight \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/list_item/scope.rs"},"region":{"startLine":296}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d9d4142942a33f5a13a3ee1a4e40296eba9880e5d1e666990cc73b7252b2098"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(lucas): Why is gap sized halved?? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/dl_form/form_strip.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c828e37fd830c754d330ab6912d05fe788681ab9432050f130d2deee10aa7aa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): use Help/IconText 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":"crates/viewer/dl_ui/src/command/ui_command.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"7045b49dff8f71086968963cf1eb4353f48f7b0dd5b088f07c631e4ba3356286"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): this demo could be slightly more interesting. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/examples/dl_ui_example/main.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bd757f6a2fedb7bb6d71e8d5118fb125ddcb5eec731b6f8a80c83fdfd9ebc3a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3863): Allow globally customizing combobox icon"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/examples/dl_ui_example/main.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"76cf5fdacf6828f08ea4cef3723eaaf6e438d0fa656bfece6df8e44142bdeb80"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(lucas): 4 should be the correct value, why does 2 look right? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/examples/dl_ui_example/right_panel.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73f59c2047f8f0357334064171cbd653722e2e240f2cb6965fc18a4cb53327f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3864): ComboBox should allow customizing the icon globally"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/examples/dl_ui_example/right_panel.rs"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"f713b554a8373160adaf7ff9d983e5226c04f254dfb178deda4af3ff834fc923"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3864): ComboBox shouldn\u0027t wrap button in a horizontal"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/examples/dl_ui_example/right_panel.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3f4f3513ce8682b921e546f09c2a708f6a034c8206f54cfadfd8ed55c2a78a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): we should also test what happens when GC kicks in. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_panel/tests/time_panel_tests.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cf9de1fa21d4d0349681f6c807cce1702572c2a86c8b1e607938e04b069aa58"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): early-out if density is 0 for long stretches \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_panel/src/data_density_graph.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3c8feee2340ac089a8da556307b78247a50f1f00fef7156859c52b6359f8c9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // const CREATE_TIME_LOOP_CURSOR_ICON: egui::CursorIcon = egui::CursorIcon::ResizeHorizontal;   // TODO(rust-windowing/winit#4390)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_panel/src/lib.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad92b5e498d8c51c304fc9c8a18c97aa15c93499ca97ea577c59292a35721a8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Sorting this by time range would be great as it would allow us to slice ranges. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_panel/src/recursive_chunks_per_timeline_subscriber.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db9aa6d00dd3bebe930a7f73d1d41c20e800043ca8e34c979c6ea4e5e3db2be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Would \u0060num_events_cumulative_per_unique_time\u0060 be more appropriate? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_panel/src/recursive_chunks_per_timeline_subscriber.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"3df8626626d0b74f2311514fb5a039f7c1f80c31d773a151e7294f5160ee2ccb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jprochazk): check chunk.num_rows() and chunk.timeline.is_sorted() \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_panel/src/time_panel.rs"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cafd6e5bddc168aa4b1c284e695e6330b422c2adb3e7b44b7209226f716ce34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): Could we consolidate this with \u0060TestBlueprintCtx\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":"crates/viewer/dl_test_context/src/lib.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"f48c4feb8c99bcc20dc52dfafdd82cfa528d19ee77c0d8c6d15c083cf1328b23"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): There should be a way to opt-out of this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_test_context/src/lib.rs"},"region":{"startLine":627}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc6ea510608d9b5d5700accb6356b58c81522b8265e13a7095f39beb6a2533f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): should this be removed entirely in favor of \u0060run_once_in_egui_central_panel\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":"crates/viewer/dl_test_context/src/lib.rs"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce48a5496fab87d6c55ba33779c8cd3a23ec19a4bc7df5b496a2874f4f8ad8bd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Components in \u0060active_defaults\u0060 should be sorted by field order within each archetype. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/defaults_ui.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b742e32dd5214d341dbcf7da674eb29b345ee506d5aff9611552882fa52465"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): In theory this is perfectly valid: A visualizer may be interested in an untagged component! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/defaults_ui.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e6d9807f3c14460e5e281074084814eef61a90d8a2c6bbab0436381c9df2dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Can only handle single line editors right now. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/defaults_ui.rs"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"931ee2306e9f528f24eb8f151a6b101e76069e89c8a86c86cbd8ac430a004663"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10649): the projection breadcrumbs are wrong for nuscenes (but correct for arkit!),"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/item_heading_with_breadcrumbs.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0f7d1ff05bfc917a1976e5452e042ff34d51fdfa4e038afece2e99d0ffe80d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10566): There should be an \u0060EntryName\u0060 in this \u0060Item\u0060 arm."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/item_title.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"160a8df8cd3f71178ff70481af718aa48fc0add83297486f3eecf819477d2b97"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(lucasmerlin): Icon? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/item_title.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"31631863c1ae77f0f43f867828701f541bd7e47eb1ae0b865f53f63fa5cbf7eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6450): check that no warning/error is logged"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/lib.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"68b80de79d03cf0a28f013291e1ca986416502db4cb1d5eff77fb9b2a91a4f28"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): this should probably be \u0060impl DataUi for Item\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":"crates/viewer/dl_selection_panel/src/selection_panel.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa4edf8d0dd4639eff4f86dddac639b3ef3877de44a9911a1ed0ac88db754d46"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6075): Because \u0060list_item_scope\u0060 changes it. Temporary until everything is \u0060ListItem\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/selection_panel.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1cf97787f97b904ab37b4eed7f5bad784dd6c20078bf5ca1b4806fbb8e78a02"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6075): Because \u0060list_item_scope\u0060 changes it. Temporary until everything is \u0060ListItem\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/selection_panel.rs"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b336d35b99564a3a5320dd31a963c897e5185510bf1b35280e9fa3ede407b7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6075): Because \u0060list_item_scope\u0060 changes it. Temporary until everything is \u0060ListItem\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/selection_panel.rs"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc852984939a7fccc901e8c5ceb5f6c66fd2e8260f0081c25103ef2b5560cce5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6075): Because \u0060list_item_scope\u0060 changes it. Temporary until everything is \u0060ListItem\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/selection_panel.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"05627ce8fb0f21dedb033c1bf7b0cb8d13ea93649239a912c836d3392e71f8c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6075): Because \u0060list_item_scope\u0060 changes it. Temporary until everything is \u0060ListItem\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/visible_time_range_ui.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"946df172fe7b81e89557546fba488ab0d6f09011c5bdd3e465aab2171bb20115"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Talk about this root bit only if it\u0027s a spatial view. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/selection_panel.rs"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"2629a3e7b6a5ae373128d767275a81e2b80394139bea8985ae0dade5535f7ad9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#4560): this code should be generic and part of dl_data_ui"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/selection_panel.rs"},"region":{"startLine":1318}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d8675c0552abc888082b4e2a870700f323fc7b8a4348d2d6548da5a332f03a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): Better design-language for excluded. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/view_entity_picker.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"80896ef1e4344647229cff424f9d676161b2cba1edba28f4874b69ff724514f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): use \u0060CustomContent\u0060 support for action button to implement this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/view_entity_picker.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b738e8770cdbe1baf9cfa1c8e2ff934b2eb50d6fbdde989e47c8160d79d63c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#4895): we should have/use a much simpler heuristic API to get a list of compatible entity sub-tree"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/view_space_origin_ui.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"86384ff09b494c8c677185562dd190ae57bd4b060ff1fe1ec211a8d5ac8d7a38"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Figure out how to deal with annotation context here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/visualizer_ui.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c986d79035b6018519e65646ee193ea806018041885e5eba8952dd671bfbdc89"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Should we show required components in a special way? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/visualizer_ui.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"2717099ef3f3b4d91da475b84752ba8e479eaf36b2cd48aa74f9851ac7b69d06"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): What about annotation context? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/visualizer_ui.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f7e01aa0e6f1a93a46cab413f949cf93d91c2a5eb517fd6e7c14c6ae575acf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk/egui#7531): Ideally we would hide the button unless hovered, but this"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/visualizer_ui.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bafd65efcc1bb17304a95d4aa53cdb6e2ff08ba33890e9b1ecc0a3a11197f4b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Add data ui for component descr? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/visualizer_ui.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64b7b1ab0f6e89c465ccc5a394e16530aa96fec7c054f5ea427bdd984aa886c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Right now we are _more_ flexible for required components, because there we also support \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/visualizer_ui.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a6a98d95cf58524014c83c2188a0db5786908364710e0de3522d79128a236ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(aedm): Weird label, but we need to find this item in the integration test somehow. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/visualizer_ui.rs"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"d90397fd7f466f4898d60d27e669c5d4fe1d67e25a8cdbacde2e0d1e01f818d7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Shaky argumentation. Override and default could also fail? If not now, maybe in the future? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/visualizer_ui.rs"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"70b63104c1526c710e0625e7d08110ed48248b689674fdb1af2ba778d075508a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Don\u0027t write the type if it hasn\u0027t changed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/visualizer_ui.rs"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43ed2a06c02efd48206c780b639813805c2f47abf18fedfd355e95a931a2edb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#1426): unify camera logic between examples."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer_examples/depth_cloud.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f35ae44508730326b72e2478ecbd94c8ccffdc53113088836b68829964fb56"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#1426): unify camera logic between examples."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer_examples/outlines.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e7075ad6cae04425fadcda5bc2221d733253b2ff486013515e72d754636005"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#1426): unify camera logic between examples."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer_examples/picking.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"db322bc04f125207f7c5aadf4d857d63d858e66cf098a2d5675a9d266ab6f8de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Only pauses rotation right now. Add camera controller. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer_examples/depth_cloud.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"17000e764534b32681ae55bf328d40b8fff8b04432ac8acde5c85241333edd2b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Only pauses rotation right now. Add camera controller. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer_examples/multiview.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81e252d6a2bdb1ee2f69512d2d3ca53801afe691fabe9ef2e213002f9323854"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Display a median over n frames and while we\u0027re on it also stddev thereof. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer_examples/framework.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b03868fbbd998d75fec033a4c78fbf050be8b93372d8593e8dc6e35cdc365f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): port this to the winit 0.30 API, using maybe https://docs.rs/winit/latest/winit/platform/web/trait.EventLoopExtWebSys.html ?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer_examples/framework.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"d096e920356c8ecd9fbef6dc841497d5958c4a318cfd4a30f5925db2b6ba09bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#1426): unify camera logic between examples and add a free camera."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer_examples/world_grid.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"36dc09a8b42b5cbec7b79f7c957dde3261ad93fc271ac6714d7c19ac4bd4d260"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): this should only run for release builds \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/build.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8c057027726a046aea358cbc941f1b37c93cdd599f5eec16cf6483138e5bc47"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): At the moment we only look for breaches of hermiticity at the import level \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/build.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6b508799303685998ed5e96ead1d1f1508969a48bab004f06144e6a4d881d5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): On native we could offer higher counts. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/context.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c50d71fbf45d4ec57214bf747bed49fab3532fcf96a4368a47e78e9c15627f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Add a way to force the render tier? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/context.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"053062b3fca5b93719ceaeeb153f158255b57844b5b831e6f46de7b3304b252f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(andreas): We rely on egui for the \u0022primary\u0022 submissions in \u0060dl_viewer\u0060. It would be nice to take full control over all submissions. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/context.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"686ebe4bfc2089a2643122b360b6b5443f450f1e11d3e5cbf53014a1acae8204"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): For better performance, we should try to bundle this with the single submit call that is currently happening in eframe. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/context.rs"},"region":{"startLine":537}}}],"partialFingerprints":{"codehealthFindingId/v1":"da86978e635e309cff715b0d8da930a49532fb28b214cd799c111fd5f03c4219"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(wgpu#3583): Incorrectly reported by wgpu right now."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/device_caps.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3837ab564ae44779bb6aa4f22263cc7feed6f7175b1bb9579d360980d599a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //   (TODO(andreas): Ideally we\u0027d test that as well to check it is well-behaved, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/device_caps.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"80824cff8b070656f7161937afafaf170c932d48acca2abfb0966878d2208fd1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): GPU based validation layer sounds like a great idea, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/device_caps.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"0945ff968f7485ea8221b47b9a3ec13fb59032406250a23a8a4cfe562860d332"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#12788): Safari WebGPU broken on 26.4 (3D content fails to render)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/device_caps.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ed5869c6f6f58d88cb5bc905e4c9c19bd934b6779ecc342e70fdcd2981c1d0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#11009): Fix videos on WebGPU firefox"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/device_caps.rs"},"region":{"startLine":509}}}],"partialFingerprints":{"codehealthFindingId/v1":"9526065da049409dac627ea95c59171386b826c9f122870ef4435a26c0e10d2a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(wgpu#5166): But if we get this wrong we might crash."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/device_caps.rs"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b923f6ddce425d7aa09862567f3d503d02d6dbb7d288d97dd099e1c89287ad3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(wgpu#5166): But if we get this wrong we might crash."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/device_caps.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad93fbb115fe50f747345359471ac861f4c6c57b26b20e72745502ef60f43098"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(wgpu#5167): And we also can\u0027t query the config."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/device_caps.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c762d7306b94f8da849db14c47f78304b2e464b005bd251f50f7e72cc74a5eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(wgpu#5167): And we also can\u0027t query the config."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/device_caps.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"4938998e9e9cb73694957da055d95630f48a761073712ee000fcec3cf008cf74"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): might want to support implicitly dropping file suffixes at some point, e.g. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/file_resolver.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f9aad02890e75d78292bb1e0698680efb826b87b55abb1e8046da29cef2bd3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): codespan errors? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/file_resolver.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f78ab446b9aa06adc6bcf3b09002c7cb1e17c9da7dc53edfbdc9c264e3c99cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): might want an actual test using \u0060DALARAN_SHADER_PATH\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":"crates/viewer/dl_renderer/src/file_resolver.rs"},"region":{"startLine":640}}}],"partialFingerprints":{"codehealthFindingId/v1":"99b695b7d479711378d34ff6ceba0c6f96573df8229ea3c748e21750fad5ff22"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): check error contents \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/file_resolver.rs"},"region":{"startLine":786}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcc26e284bbec8e4e5adeaac6c0e718bdb6b2e0a42e22b03b9174f60f46d8316"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): check error contents \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/file_resolver.rs"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"8688b53c3c8a02d49eaf39f0a6ef1d8cb25e8365a719f906effa85f4de4590d0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Creating the resolver here again wasteful and hacky - should use resolver from render context for shaders. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/file_server.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a16a433b81e2fe2aa44847a412d55239068952454f95c66fcadeb6f8a510336"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Sounds like an problem waiting to happen! Need a better solution for this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/file_server.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d328b6ea43c020ead36bb90eb79279799303f9739dff87ca5dbcfc34efce305"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(gfx-rs/wgpu#7708): We want to use \u0060all()\u0060, but can\u0027t since it includes shader stages that aren\u0027t available on WebGPU."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/global_bindings.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"d02b48667de67f98de72c4fd19caad6c16736886a8cbaa9842cfe960e8da04ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(andreas): We could make significant optimizations here by making this builder capable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/line_drawable_builder.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"67eaa5024051abf1190bea5f16f2d39259db4d77aeafc418466251e34ce6c7f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): It would be nice to pass on the iterator as is so we don\u0027t have to do yet another \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/line_drawable_builder.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"8935af0a72caefdf89ba87967c065614374f16ce96cf9d9b6560dcf1dd0cd53d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): There\u0027s likely some low hanging fruit here to make this faster by collapsing into a single call to \u0060add_vertices\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":"crates/viewer/dl_renderer/src/line_drawable_builder.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"0da97db9a44b9aa2b6ee7d38e139de709449518f1a2ce6748429af8685f09f2b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Compress normals. Afaik Octahedral Mapping is the best by far, see https://jcgt.org/published/0003/02/01/"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/mesh.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"59f4439c258d0206f68dcb654c95113b8e25c3f000676fe02bd66d6adab27873"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Take read-only context here and make uploads happen on staging belt. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/mesh.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f84eaa9e59b112f5882445e5963c9c6fe98daf289aa93d8c482edf7f488979"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Have a variant that gets this from a stack allocator. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/mesh.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab681c37e2dbe2d56dac23a660af69828e19f744f43127b3d102693e15fb1367"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#12223): handle texture transparency"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/mesh.rs"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afca7efbf3499865bc2fb0f2ac8221d891fc03729fe2db451ddcfefdd3e3f02"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Consider using unsafe set_len() instead of vec![] to avoid zeroing the memory. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/texture_info.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"abcdb785d5f4d3db660310159937f3584b37c934af49881b66733c27a3d63f29"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Consider making \u0022render processors\u0022 a \u0022thing\u0022 by establishing a form of hardcoded/limited-flexibility render-graph \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/view_builder.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef0a8f82622f8887b245613789033e7a2bd8a723c477bab3be2b3c4bbd11140"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Should tonemapping preferences go here as well? Likely! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/view_builder.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4291c459d5f8cdafc9fb6ce8ad360a2c1ca550edfb1093cd5e0f3cfc75c30c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): should not always be active. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/view_builder.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c406dab47ac33233114b0d2c2cfa9da4e07c4a97efca5a60870f3a35baba5ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): The fact that this is a draw phase is actually a bit dubious. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/view_builder.rs"},"region":{"startLine":663}}}],"partialFingerprints":{"codehealthFindingId/v1":"c32bdc0a3d1db628c85a376aa552100ae8e56bf6545151c202c63a31bb2f55b3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): No longer having those lifetime issues with wgpu may still save us some locking though? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/view_builder.rs"},"region":{"startLine":755}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecd6b6b0ba4dc2838ef5016285f3aabe20cbc9ce71bf23c3e3b8aa404d22851"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Formalize this somehow. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/view_builder.rs"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"13b24b0803f9d30de8a457e414c3b735ccef53187469bf8c9fd1a7dfc465e7fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas) what about non-default views? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/wgpu_resources/bind_group_pool.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"167c0480b4a3f2ee8bfcd6e37ac48b3d34c20bf6f23f689876e728816f2984ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): We\u0027re failing this check currently on dl_viewer\u0027s shutdown. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/wgpu_resources/dynamic_resource_pool.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ec6f008625f75b51dd61eef962dbc25cfdd7f7767af4f0ffc49bf781aab4b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas) use SmallVec or similar, limited to 4 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/wgpu_resources/pipeline_layout_pool.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b8f6180c9b66d46ea74209e02d49a29788e68e76af6b833ae5e9041499fe59"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): error handling \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/wgpu_resources/pipeline_layout_pool.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"555fed3b1451cd7259c9fd3e9816d5a8af97a45e07535b88e8aaa44ede577753"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): certainly not unwrapping here \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/wgpu_resources/render_pipeline_pool.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bcaa99304185617de443a54331f3b3db095bc5a848cb84d36d77c995ae34753"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): handle non-WGSL shaders. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/wgpu_resources/shader_module_pool.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"888fd8a064d9d16989ab20e2bfb70979fe57a30bf1b71b4351b20ce1c021e4c9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(andreas): These should be solved with a pre-processor. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/wgpu_resources/shader_module_pool.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c27d87e6d825e4471bcf5c8a90a0652c4b741c7cb784d3d0591132440b317e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas) What about custom views? Should probably have a separate resource manager for it! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/wgpu_resources/texture_pool.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"83210f01bda62974b953a3d4485b804aa22d256900f498c65dd890eeb3eb32dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): \u0060ImageDataDesc\u0060 should have RGB handling! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/video/chunk_decoder.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a10a70b86c799c399462cb3f14d361c07678741485b88877687ac88614e0b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Right now this combines both color space and pixel format. Consider separating them similar to how we do on user facing APIs. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/resource_managers/image_data_to_texture.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f2370d149fed1c66e39b7e67837b261eccd4799de72a144f0d5760abc39998"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(andreas): This is a temporary measure until we cover what dalaran covers. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/resource_managers/image_data_to_texture.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a4fb3c5fceadf9de1fe191adf78bdf2d69ae995ff1f744b5745db6e5ec7f87"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10648): Add rgb (3 channels!) formats."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/resource_managers/image_data_to_texture.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6c5f173728500d2fe56c6d4ae36103f055f2855b3d3e7944f176bcb33619f7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): As we stop using \u0060wgpu::TextureFormat\u0060 for input, this should become obsolete. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/resource_managers/image_data_to_texture.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e70664bab1f61a3b12933f43511a90dbc96e5fa58b7307232a45997d596ec9f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(andreas): This should be a kind of factory function/builder instead which gets target memory passed in. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/resource_managers/image_data_to_texture.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"06399690c9a611878310e65ded2a7341d9835c087658b11e42f90a3915e0e6a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //generate_mip_maps: bool, // TODO(andreas): generate mipmaps! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/resource_managers/image_data_to_texture.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd5ece2d713cbcf26ef0454020496fb3f0211537dfd66276ff6a1e7572249a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Nv12 needs height divisible by 2? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/resource_managers/image_data_to_texture.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"760db13113429b850a7e878b8b030377a9bdceaba81fcc19091ffac21132a952"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#12223): Determine \u0060AlphaChannelUsage\u0060 if it is set to \u0060DontKnow\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/resource_managers/image_data_to_texture.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6461562f7380e70040eb07cf9958316ffbde9b25c2faa20bee39b4c4d561461"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(jleibs): All usages of this should be replaced with \u0060get_or_create\u0060, which is strictly preferable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/resource_managers/texture_manager.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf4f0eda9a8d9df87bca3b289b2e9150c45231af97dc6b8cbc20f6514fddc55"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Disabled the warning as we\u0027re moving towards using this texture manager for user-logged images. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/resource_managers/texture_manager.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"99913240a949a545e92a66a8d165c7aa8abd9b33d1070886c95452dbef6b7c4f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): What about higher bit ranges? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/resource_managers/yuv_converter.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a0fa7d57ebb12d0dede9f91a15faef6a661ebab8edf21b6907e650dbeb2149"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): How to deal with higher precision formats here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/resource_managers/yuv_converter.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef8e265c249507c08803c6342d58f2b4a13d7943574fba2fb5455fd3496a0dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Why not use [\u0060wgpu::TextureFormat::Rg8Uint\u0060] here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/resource_managers/yuv_converter.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdcfe5ec3a030b571418690d90151c226d18c8a6ea84ad9f17f5717643ed295d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Maybe this shouldn\u0027t miss-use the \u0060DrawData\u0060/\u0060Renderer\u0060 interface? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/resource_managers/yuv_converter.rs"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc21da7c0ea71340f780d3962e1109ea315170cb6aaedd6317708684f3bdd88"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Does this have to be on the global view encoder? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/resource_managers/yuv_converter.rs"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"bff2f5bdddf9ceccc4d977e55201b5ca09e86cbdfd8e7a0db0f5ae5df9757907"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#1611): gaussians don\u0027t sort against other primitives yet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"00df853213b0312cad9fb22743b8ea1ca875d63bf9aa2de755fb1f57f8fd0b26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): If we limit ourselves to 65536 line strip (we do as of writing!), we get 16bit extra storage here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/lines.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"4345ba70da65cbcec6221a0d84c1ae1bbc7527b1879769f7d902785bfe36f75c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#1611): transparency, split drawables for some semblance of transparency ordering."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/lines.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d864a30dc080b917d1fb467cd82944ec2522a7b1fb271226558e9c8bca6badf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#1025, #4787): Better handling of 2D objects."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/lines.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e06b86aae2c853073fecf523caccc459cfda4666749b80fe67458effdd0736"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Don\u0027t have distance information yet. For now just always draw lines last since they\u0027re quite expensive. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/lines.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"97195b3b3eb937e6ce30750326d88346cb54397bb56687312a8af0eff38494df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(andreas): Could be moved to per batch flags. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/lines.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b24b4b790543bc2b2d74e810fa963d6a63ba326b63d4cbbc087163a2dd0858"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(andreas): Could be moved to per batch flags. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/lines.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"5514f2451947f631c25f1c704aa118be9dcbae56ba69e83e899439c8f6b39953"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(andreas): We don\u0027t apply scaling to the radius yet. Need to pass a scaling factor like this in \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/lines.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"81e6d304925c2ee13588a1ca94057466ea4b75759d3d9b6c7862c34920761a93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(andreas): We don\u0027t apply scaling to the radius yet. Need to pass a scaling factor like this in \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/point_cloud.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f3e0bc7c8b06c941146e34d48a01683ff8594ab2d7cafe92a57e898e017b95"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): There should be only a single bindgroup with dynamic indices for all batches. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/lines.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"3982c33ce559a585ad57430250f851e1900f2937cf8bf7fe81bed63655c91963"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): There should be only a single bindgroup with dynamic indices for all batches. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/point_cloud.rs"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c029b6f0d0f23539314a72164b937eaf6a8563f7a44fd99acf35cc92b0fea04"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Use a temp allocator \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d8440aab9b0d3b1b17f01f1f7f2742e58f7a067b5209c9b5d0692edeec00177"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): precompute these two. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"222ea37ee5498b72dc6bbc8d7e926613cbae5e6fa5342050adab68972fbd7184"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): That\u0027s a lot of arc cloning going on here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"39041c6ba98b8e586f0489992d1d01840c8c81ed5aa80d583f25947bacd982ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): We\u0027re currently not re-using draw across several views \u0026 frames. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/mod.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3de0e5a605a104b3276260083ccd9e3baa07b7ec306c08b928d191e816f4285"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): This might also be the right place to introduce frustum culling by extending the view info. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/mod.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"08479ecc3f80371a25d529576878264a9dfc3e0724381560138944b445ca6899"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(michael): This step size is heuristic and might need revisiting for large scale differences. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/plane_clustering.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0be91d4418dd891d5e97e4cf75d7ad8313335e2be812c56a71b22ad67afe175"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(michael): this could potentially use a threshold for near degenerate rectangles. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/plane_clustering.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7a0265135f98746fa92ba49d4655da02de3d20cec8f6f196f5a6078f277643"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#1611): point clouds don\u0027t sort against other primitives yet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/point_cloud.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"476009877ca8e66dd42b1715ad0cc63d43d56464f18aa417b821bb21274c3985"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#1025, #4787): Better handling of 2D objects, use per-2D layer sorting instead of depth offsets."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/point_cloud.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"d139ebc5b9a0706849f84fbe0f8348822c5b9f2f4c047985b1b6a94b44856c61"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#1025, #4787): Better handling of 2D objects, use per-2D layer sorting instead of depth offsets."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/rectangles.rs"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3bb90a062e9b7917e2623db63c7dfe0c366c75636adf71cd2ff1cadd1b8b2f6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas, emilk): Sort points on the GPU immediately before drawing instead of creating \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/point_cloud.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c714c2163eafdf2b1a4756eea5607fa663f24e61a17b2d2a1aefcec590ec848"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): propagate error. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/point_cloud.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2482308d2ae3effa1b8ad7db492e5e13b76a482c7f60cbecf8021dc54fb07fd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! Transparency: (TODO(andreas):) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/rectangles.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d773f4ba982f2d897dfec9b6c21c3aee733e8010b9b0c2089a7eb316523868"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Offer mipmapping here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/rectangles.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcecb51467141b9ad96bc592cdd006fc7bf6f1977e8d4eab95e54aaec50d172"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10648): to be replaced by dl_renderer based on-input conversion."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/rectangles.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"84adf3745d040867df4e48afaa042629cecdcde520d00e026a9f6a24f14e2c94"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): continue on error (skipping just that rectangle)? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/renderer/rectangles.rs"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf4a505252995420562de35e10aa56b19767269404b44c56c4a92a9cdda0b06"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas) Merge all obj meshes into a single dl_renderer mesh with multiple materials. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/importer/obj.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae42cbb006f110c3f093871ade657b375158e520632947eadf68ba79e1f2cb61"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): proper material loading \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/importer/obj.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9fafeca581fd71efe960b3601b4bc5e4102eac33ead9702c361486e5a4469ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(hmeyer/stl_io#26): use optional name from ascii stl files."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/importer/stl.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8248af9dedef2cf5496afa8a6078a64a0f075a5f47c0fca2d625b444329e868"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#4507): Expecting to need this once we use this in views. Also very useful for debugging."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/error_handling/error_tracker.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ff5d54b05f254b26b744108de6ee86fcc298e70dc509efe39701e6293eb3f9e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(#4507): Users should be able to create their own scopes feeding into separate trackers."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/error_handling/error_tracker.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7c5893f01ee3bc203de0cd4d389934de9c68b5cbac94b8640cfb965909fd850"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): once we have traits/more dynamic interfaces for phases, they should own the sorting configuration. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/draw_phases/draw_phase_manager.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66d1aed9eac2bd52ad98761d031a3040887a04ac8cdf1603a03c158d9beca1d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): In the future this should also dispatch to specific phase setup \u0026 teardown which is right now hardcoded in \u0060ViewBuilder\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":"crates/viewer/dl_renderer/src/draw_phases/draw_phase_manager.rs"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d5b4226c93a8135dee8868ab0c737654b17a6557e85f433916ffbf7bc5aa1a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): The concept of DrawPhase implementers is very much in progress! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/draw_phases/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92de9bc73576ccc9a4afddadc017012ca0bb00813c5bdd9a1a8a7856ac63145d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(andreas): Should every phase/processor be associated with a single \u0060wgpu::RenderPass\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":"crates/viewer/dl_renderer/src/draw_phases/mod.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03b8d13b4401be5523ac6e412124417cfd7b6413d237778cab556c369c8e6f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Is this a sort of DrawPhase implementor? Need a system for this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/draw_phases/outlines.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"950ebaee13282005cf25ec2d0d4f8f5f31363a8f2a169a57eb9c4af01b783874"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // * TODO(andreas): Make overdrawn outlines more transparent by comparing depth \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/draw_phases/outlines.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27effb7eb85e7cca583a9b25e1f3b16c31bcfb3fa70d079cb3a599be63acaca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! TODO(andreas): One thing to add would be more anti-aliasing! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/draw_phases/screenshot.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"98f18a2e57d85544df4daacc0fbf6b6f9a5ad3f4a0ec2984081840f63f08c899"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): optimize the extend 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":"crates/viewer/dl_renderer/src/allocator/cpu_write_gpu_read_belt.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aa5e7cea1eee27488788f124542813cd31ac814189f113e68f62cb4f6cc3fef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(andreas): Adaptive chunk sizes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/allocator/cpu_write_gpu_read_belt.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a7344684507b0bb7b7fdca44c651f6b0975111be194d0a762dc25aa0da8164"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(andreas): Adaptive chunk sizes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/allocator/gpu_readback_belt.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb96298599d38497b95143f19c052511a4432eb2267522d768de4de53904b20"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3840): make sure the default comes from a proper default-provider!"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/allocator/data_texture_source.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d6a508665b2b195393e96b0d3818a904d6cd1d37362a6ecc568391ede94679f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Unused \u0026 untested so far! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/allocator/gpu_readback_belt.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"27eda291d4ea0c9ccefabe3e6436e02508755e66a1a3c9bda43d81347f33eaa3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(andreas): Shrinking after usage spikes (e.g. screenshots of different sizes!) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/allocator/gpu_readback_belt.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"59a6deee34055bbe0b52f9f362c626e9f7576e820e943b93db91865896d2a1a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Use \u0060map_buffer_on_submit\u0060 https://github.com/gfx-rs/wgpu/pull/8125 once available."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/allocator/gpu_readback_belt.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7efb3d72fce1d2b976be412efd66672c1d8d4fbc240b91b4c29ee2559d8fe46"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): just use \u0060Vec::drain_filter\u0060 once it goes stable. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/allocator/gpu_readback_belt.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"bac7e8cb28e31c5d720a4cd186a9c436442e7c9c5c3f3199287df8aa13f576cd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Can above mentioned reordering _actually_ happen? How contrived does a setup have to be for this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/allocator/gpu_readback_belt.rs"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"062a7660ede451856ba4f6e294a01a40eb06455a6738a0e82776a6a5a9a76023"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Can above mentioned reordering _actually_ happen? How contrived does a setup have to be for this? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/allocator/gpu_readback_belt.rs"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c66ba2b7c52b0432f5c9d6bb4d4142f43cb19d7835716cb187be9ca315b5444"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): we currently load the ENTIRE list of datasets. We will need to be more granular \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_redap_browser/src/entries.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b4ac29a67b49b39d02388fa3e517c12a9a2de1feb3c49b7fd7eaea90b31b75"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): these do not exist yet \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_redap_browser/src/entries.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e695838a2e064497bcb505c8cba31010f35f6c13d3c8d20ffbbdb541598aef4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-4874): this replaces the whole session context, dropping the DataFusionTableWidget"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_redap_browser/src/servers.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"7785c29b3d630a86ed90e5131a76f96dfde6e6e61b5500cde492b1a94be67781"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): borrow checker doesn\u0027t let me use \u0060with_ctx()\u0060 here, I should find a better way \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_redap_browser/src/servers.rs"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a0f7a59abe548623ef60411734eaf42771d9f224e50550f722730183957c52"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-5031): Depending on how much customizations we need to do,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_recording_panel/src/data.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3bee829a2ae84308dd404e6a6e5dbcd8c99071c2298676eabac87adff6c9bb3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#11792): this whole feature would be massively more useful if we left the selection"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_recording_panel/src/recording_panel_ui.rs"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc716fedf64c413311d9506bfb252d74537ef3990098b1c9a529070736b89f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): ideally we should show this loading indicator left of the server name, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_recording_panel/src/recording_panel_ui.rs"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"af204b69e5aed21ed58a8a03f8b2cc9a40215def4f4b08786e70f3f553683742"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): shouldn\u0027t this be done by handle_select_hover_drag_interactions? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_recording_panel/src/recording_panel_ui.rs"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"4435adff0d8ae06c89908d3ac178977d6279ad8b68fa10a413c903d5325e4e70"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-4792): add gamepad support for wasm."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_gamepad/src/web.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"793c6f5a083a6170a4e647dfbd7161b4202e6bc8867950f9ca5d29c8a9b2b840"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(rerun-io/egui_table#50): We should add a \u0060max_default_width\u0060 field to egui_table"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/tests/text_truncation.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f341329fb02b92f930d3e8c76ca5c7a6d054bc94154da83138864659eecc5c8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): we should get this from \u0060dl_uri::DatasetDataUri\u0060 instead of hardcoding \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/datafusion_adapter.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e74f45e0b6e5502e4b4bfd61d7cd8144491e954ccc04919aa16cba3b29c47e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): error handling will need to be improved once we introduce non- \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/datafusion_adapter.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2d5239bad13e8cbe830f316201b149b9df100ca2e1d76fd4dc18d3704b55c4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab, lucasmerlin): this \u0060Mutex\u0060 is only needed because of the \u0060Clone\u0060 bound in egui \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/datafusion_adapter.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fec376fa6ee370ea55f85327664d9dfb72fbd273e284f450ef343fa82d485c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): for now, this is the only way to have the column visibility/order menu \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/datafusion_table_widget.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a6a472ac3d085d9b77ca6e23098b06385df079d7f4dcc1a9cf55b0529f200c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): it can happen that we\u0027re stuck in the state. We should detect it and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/datafusion_table_widget.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"7496ca998b5ce2c54752c65bce4e50009b06c4d32595044d7c0fab63f00ffd74"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): better error handling? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/datafusion_table_widget.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1517143dbb1b06f2d4a33d04beb28e1a71fe25c5256b3fef29307e213f8607"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(lucas): This is a band-aid fix and should be replaced with proper table blueprint \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/datafusion_table_widget.rs"},"region":{"startLine":642}}}],"partialFingerprints":{"codehealthFindingId/v1":"4754848b33efa66aa49c34d8e61c34bd7bebc4906c73671a694b3eb88311b7b1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): for now, we disable filtering on any column with a \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/datafusion_table_widget.rs"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"8121145f629c1030155a30ea4b7ae1ccea846afae11110fe9c20a4513d659a67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): we should find an alternative to using content-hashing to generate cache \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/display_record_batch.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7df6dd485ddff361cdf2d2a48fd860f8d4c958a6888056bd6f8e8bff90b0cc7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas, ab): This is a hack to create a pretend-row-id from the content hash. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/display_record_batch.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d658360494a04e889e984613ac86e0c6dff9458007790cd93e14ca564e9d7b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(lucasmerlin): It would be nice to have this in egui_table, so egui_table could do the work \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/dl_table_utils.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c9a8cd3d5c1e68dfcf1b724d85f498268b62f23975db1735a50d314a54f718"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-4510): loading indication if we\u0027re not ready to draw"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/grid_view.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb2bd2f07052488e355cc69784748cffec8aff8b09f68fee019726dec40d481"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10315): these are sometimes inaccurate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/header_tooltip.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"a681ec70bd68e4eab5ba1b8ba5ad46dea079a592a270b0d0815bd66e379b54cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#11071): use dl_arrow_ui to format the datatype here"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/header_tooltip.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"456b50e5d95753428e9d416fd1f5702e12f71214bc143d15300e8d1477409682"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#11071): use dl_arrow_ui to format the datatype here"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/instance_path_ui.rs"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b7c96929ec0400037dd20c39e954a0fd6751b7091e1fba14fbc04787da54cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#11071): use dl_arrow_ui to format the datatype here"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_chunk_store_ui/src/chunk_ui.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"235c081be3b1cb1bcb1747ad189897efaa672ab997a7ac98b6cd8a787ece2c5a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#11071): use dl_arrow_ui to format the datatype here"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_chunk_store_ui/src/chunk_ui.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d5e2ebbccbe6f48826b18be91406ab673568d85286bdbadc4b46fc2c145d10"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(apache/arrow-rs#8351): use Display once arrow 57 is released"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/header_tooltip.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2105430145b3ab3a46417ef2a2e06a1a056ec709e3f43396ea780ebf71ef899"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): consider adding a timestamp for when the request was initiated. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/requested_object.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"667b92b692ea8f1bd4550bcbe7edeeade05ad151895969c17f0b8ec965944c93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#9836): implement cancellation using another channel (see \u0060make_future_send\u0060)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/requested_object.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"854b8d1db38eeb0cfee21cbff74b06d08513f94c8a2c694966f6166d2816184d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): these should eventually be stored in \u0060TableBlueprint\u0060, but is currently not strictly \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/table_blueprint.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"c017bec9881fd768b92d1a259b91ee51c9647293440d4a274ee41a92beaa964c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(apache/datafusion#19947): Remove arrow_cast when resolved"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/filters/boolean.rs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"349d021625d1b1455bd660e55c8fbeb779535ce06c781d9df0bb16a2f25902a6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): support other containers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/filters/column_filter.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ac0f24e4fa49d3a25c3f80a387e632d4da41360fd10bfd6f2fbf73017ec3873"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): support other containers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/filters/filter_udf.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efc4761bf3bd53f3485cf307cce07314b8238981da685d614e47080f90ba283"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): support other containers \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/filters/filter_udf.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dc5d406d2cb5ffdc54402f95a18b1675d96233cf2fcb36600051dbe6a9c8960"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(emilk/egui#7451): let egui handle that when popup-in-popup is supported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/filters/column_filter_ui.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"d766b52128acbc80f58c74f9e9167447a494c6b97d15d6100ff5f919319563b9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): support other nested types \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/filters/filter.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"791080628f6b0e0882b01b74112623d63e128afb65541c3038c464421ba8e71f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): we probably should do this in two steps: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/filters/filter_udf.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b64b6094bed140032004d046efec4388b825e14c447e5c6190ed39664488fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): float16 support (use \u0060is_floating()\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":"crates/viewer/dl_dataframe_ui/src/filters/numerical.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"035deb73109820aae13d206549e776ce1d2510c9328d4d72a9ddeb377499b040"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): float16 support \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/filters/numerical.rs"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"717c3d0bcf6dbdae38c94346c66f55947202899d3aa7a5a019f60bf405ce0d87"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): support min/max boundary, such that we dont suggest inverted \u0022Between\u0022 timestamp? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/filters/parse_timestamp.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"60276cbee7a858040864dc990d0f22f8a62f37168f392e67573a28087fd8e95b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#3168): this needs to use the index of the keypoint to look up the correct"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/annotation_context_ui.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"0039f9b0e0ceb72d9003d1aea80b6df1ae7d15c01b1edf2f9943280b17f8d294"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): If there\u0027s several class ids we have no idea which one to use. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/annotation_context_ui.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"9146c3c854e16060851893d06155047eac756127785d2030c73dd4927681d841"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): Helper to do this with caching somewhere \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/annotation_context_ui.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"436fe5f3ad985b71de401e2cd38fab27c637581fa7036530db31db9f896a92cd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3670): figure out how to handle missing chunks"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/component_path_ui.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f6f8baaad74358ce480d6b4ea362edaa6850e1b5a148b86ec3f9bcbe57d1d5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3670): figure out how to handle missing chunks"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/instance_path_ui.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"9978e0c8b612904d6c8c92b19e21626d84c1ed99b2389086900564e7a0c4e488"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3670): figure out how to handle missing chunks"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/instance_path_ui.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"247f9a90be4640941bc472c1c66a92226a6e276963611c6fc0579771c7494969"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3670): figure out how to handle missing chunks"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/transform_frames_ui.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1b8905d022885545198785153064544c9cb7fcaea016510206039a5ccfe8ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6661): Move this to component_ui_registry. Separate components could simplify this to the extent that multi/single line is enough?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/component_ui_registry.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"c82fc2f5e1dc4602bb1102fa04f07b506a51ba70be693b4b13d7bf32f69031a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6661): Move this to component_ui_registry. Image preview is a bit hard because row_id and size stuff needs to be known. \u0060ImageBuffer\u0060 needs to be handled as well."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/component_ui_registry.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"79da5254db65ec9cbd1a66db8384f5bec85558e8e7bfcffdc829a4d2fe5f94a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6661): Move this to component_ui_registry. Funky AnnotationContext querying thing. Maybe we can get away with a store querying hack?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/component_ui_registry.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"80ae65b9b5aeb406dec473bcee69dbb0b367e62383bd4f6fd51235f84cb41d43"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Some of these only depend on it for caches. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/component_ui_registry.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9771bafaa231ce3e0949c51a03e0220f0fb744c013a2a3b16d4b14e86a29c3a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): show whether we\u0027re still connected to this data source \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/data_source_ui.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"675f32f6fbd7428962d5a78b5840208f466545c09f9f69e23464df5b8613afc3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): Blueprints don\u0027t have a time yet. But do we even need that? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/data_source_ui.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6cad59e9c967817e5eb5be3a1cfbbc3d0ff2ef82bdbffd9958449ecf55f96fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): standardize this formatting with that in \u0060entity_db_button_ui\u0060 (this is \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/entity_db_ui.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1289eabb02abae5d6cc8f87aadc87b573f7a4bf5232ff7e93911cee562a4b984"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): we should limit the HEIGHT primarily, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/image_ui.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74eced333c91d29045a4b3bee2045fe1a1b1412f1cabf2f2efd02408d07f82e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): we should really support histograms for all types of images \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/image_ui.rs"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b44ce743ff462b40ff5121291452f701b1df1f4c637b907d68bf20888138c7a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#7026): Instances today are too poorly defined:"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/instance_path_ui.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7cba0a0db41df509d7f0f0e35557297deffbbdb09363d1cec66a2874ad9455"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! TODO(andreas): This is not a \u0060data_ui\u0060, can this go somewhere else, shouldn\u0027t be in \u0060dl_data_ui\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":"crates/viewer/dl_data_ui/src/item_ui.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ecf8d6d285893cdf7ac3a84b35d2577f0d073fbb53fcf402841ba98abe8b4f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): This is where we want to go, but we need to figure out how get the [\u0060dl_viewer_context::ViewClass\u0060] from the \u0060ViewId\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":"crates/viewer/dl_data_ui/src/item_ui.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"e937e50732dbcceb100db2ea8c6ada21a6b2ba74e5b6e7c58dabd6c64c9ebd3f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Move elsewhere, this is not directly part of the item_ui. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/item_ui.rs"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab19603e735751ca215dabf07db19d33fd14a178e97b2f6cfe053fa578b64ee0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): How to deal with shift click for selecting ranges? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/item_ui.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"85844a06f964cc98440269faee77b3a299dc92b885ecd125b687815add0f2825"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): give data_ui an alternate \u0022everything on this timeline\u0022 query? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/item_ui.rs"},"region":{"startLine":513}}}],"partialFingerprints":{"codehealthFindingId/v1":"d591ad82c66e68885fc8123b99d37155779e3d6d64ed5df4eeaf3e2fea23bb18"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): per-component stats \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/item_ui.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"b849ce44bf8e9c04d7351eac8a426035f38497b6ab88bd98430721788f3bcf74"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): We should still have an \u0060Activate this Blueprint\u0060 button in the selection panel \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/item_ui.rs"},"region":{"startLine":741}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb624c5d318a163fb2e17a42fe8011be276dbe0c0d59155379132d295a1b0fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#8214): full nested timeline support"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/latest_all_instance_ui.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de0f4df2ccac23ea404e87a3bf46b9341e6643db778c4bf707871618b380dd8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#7594): HDR videos"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/video_ui.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d430657effa8b8e257d773e9657ad05a1469e83107cb4581418796236254ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): actual unique id for video \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/video_ui.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"78f60d15495940d2c4a4f407c912bd1d22589d7b2a709f0f2f9d28ddd8610f4d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): Some time controls would be nice, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/video_ui.rs"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e38c651c836d8eddd9f40cb02fe4ea8f72cdecc57383345a0cd0044d45a6261"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): schedule a repaint just in time for the next frame of video \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/video_ui.rs"},"region":{"startLine":942}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1845fbb1caa9d3e558e59c1661d665e29d6aed06f0ae50e388816040cc59af"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): here we should in principle walk the DataResult tree instead of the entity tree \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_context_menu/src/collapse_expand.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bafebbf7698a9e794230f30e055e9d195fc5296175f002d93f6e1a43af938df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6801): remove mitigation against too narrow context menus"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_context_menu/src/lib.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b9342ccc4416bb1b5a63d6fad6ec5cf350824354628e29f0a9f3bca21c46e7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): return a \u0060ListItem\u0060 to make those context menu nice to look at. This requires \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_context_menu/src/lib.rs"},"region":{"startLine":367}}}],"partialFingerprints":{"codehealthFindingId/v1":"a04a3dda24e9ae19f6964899dbb49c7423458a67f9f02cb6736cd8cfcf16ff62"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Do we want to consider certain reasons as more relevant than others? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_context_menu/src/actions/add_entities_to_new_view.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e03490c5075b8fb6aeb552cc902ba719f80084349af08bd59ae608de2778510"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): in an ideal world, we\u0027d check the fully expanded/collapsed state of the item to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_context_menu/src/actions/collapse_expand_all.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb86be35e394ffec7814fc7f88e512e2c436df2dd8644173615742d65be85f65"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): for DataResult, walk the data result tree 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":"crates/viewer/dl_context_menu/src/actions/collapse_expand_all.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9144b94c44b96fb4b53c34be0e85774d14b252ca576491aa0d0e35ef1b1cd82e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): deduplicate these action on the model of CollapseExpandAllAction \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_context_menu/src/actions/show_hide.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f3e7790c4bb47ccc6ba7173732bc44e6b6090062dd99ac12bd09290f115996e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): this will look like the previous test case, but we eventually would like to have \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/tests/test_all_components_ui.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8d201a63a736fbbfb2db3dc4b95b7e0a23f569acb572b16d64c56900859aba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6661): these components still have special treatment via \u0060DataUi\u0060 and"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/tests/test_all_components_ui.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a4ad2d6ba4cd0a48300a6f5a9512a898dcbdc3a9973a35257c8bdbd1cd1390"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): It would be nice to generalize this utility. However, TestContext current lives in \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/tests/test_all_components_ui.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfba8b4985105c5f1912fab6a799c8f79177546f4fa8c2569c17f7a4f54e704c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): we have the technical limitation right now that we always write out the entire array for edits. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/color.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"4784a8a3a8a440cc8945f76933c76c48f86c4caefdf5b884bb456f718a0fa37a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Editing this would be nice! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/geo_line_string.rs"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"148b3570989816acef9e9221df116f70e88491c111c7c393554b129b8bf2565b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Editing this would be nice! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/line_strip.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fefddc97c8edc43a23f1ae4817c1536048c8dc85682fe3362cdb563522654f2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Editing this would be nice! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/line_strip.rs"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"6042ac1a9c9e92686bdace3d40b01da03d94bb096522e2a59ae53bb060429d98"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#7100): need a ui for editing this!"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/image_format.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7403104397df83e277f7f49396d1ec275f468b4e0a69bc57679e1a44019dcb8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6974): Enums editors trivial and always the same, provide them automatically!"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/lib.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"b195ed5d778859b6f3c3174e9f5b7bb1f2fed22318174ffcba978fee812651d8"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hack to make this field never editable. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/lib.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f016c7c8af63d2ac87344d4adf414b46dc43b2daa6eec57abff27aeffceb3da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Is it really a good idea to always have the full table here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/line_strip.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b3724cf21944390fc50d1fe9f8fe08f8e9944841a0913d5de641fa06635ee8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Is it really a good idea to always have the full table here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/line_strip.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3b82aba01cd53dfc833196c968eeaa2254a9c309d7369bde5fdf4c2f2578c8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): Show marker shape in the selected text \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/marker_shape.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d698a174a7df0df5f26ce89d6385a59df744471112f9105a8746b525581737"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6743): Since overrides are not yet taken into account in the transform hierarchy, editing this value has no effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/pinhole.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd7b9c52eb9e575d3523bb4593338c276761c303241004bef29cb1cb0c79a97"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6743): Since overrides are not yet taken into account in the transform hierarchy, editing this value has no effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/pinhole.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e76e03fd0888e1b51e1e5181c8a0113470ea16f1a52cacb37ef287392fc9220"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Make this generic? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/pinhole.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"756a96625dda38a2320e0dba4fe2a61e8f713f4842a953f716d7dc4c8df85f37"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6743): Don\u0027t allow editing resolution for now since it\u0027s part of the pinhole and thus the transform hierarchy which doesn\u0027t yet support overrides."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/resolution.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e17e938cfde7b3bde8b2cea4c347d8212e7a660417c339ef098efe24af5a16"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#7876): move this to \u0060dl_view_map\u0060 when the crate is no longer behind a Cargo feature."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/zoom_level.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea322a207d476d90d2a1efe909ce7b810da335c64498ee266548cfe73caf2033"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): currently set at 19 because that\u0027s what walkers has as hard-coded limit. In the future, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/zoom_level.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7c793d3e21abaa7c6d484d70b0afaffc02f9e8af4c69f288236fe42e93fcfc5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-4570): Figure out a way to do this using the video decoder."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/variant_uis/redap_thumbnail.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"3175c797f1fcadde727218eb991134d562851cc5dcb943636477fb5ee8c5c207"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): we could do something even smarter here, but for now this is good enough. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/datatype_uis/int_drag.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa9b049189af63be0eccb58f48f9348fe4884f8cf1ab20b87ed830622abe85f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6743): Since overrides are not yet taken into account, editing this value has no effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/datatype_uis/vec.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a509364c39cb836e85e6d68e1c81df4a804025ca9c06f098d013a9b1a58fe38"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6743): Since overrides are not yet taken into account, editing this value has no effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/datatype_uis/vec.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d1d3e73077c864a6b287e476df797232d1216fd9f03663ec12958a3c752b0dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): We should display a warning about this somewhere. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_fallbacks/src/component_fallbacks.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b70ccf7a974e38e568008aeebbac10c6b922a0d16c03ef7e9c904c195695929"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): What about overrides on the image format? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_fallbacks/src/component_fallbacks.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d2f88b13fc92ed249c298f4d2833c29c21a19dc08831640969f8ffa6aea1a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(kpreid): This component type (or the length directly) should be gotten from some kind of \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_fallbacks/src/component_fallbacks.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"dddaf02e7a6ce2b090475d5f5d2c1f06183ba0254a28f6c8fdabb9012e9db9b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): this should be a text edit with auto-complete (like view origin) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_chunk_store_ui/src/chunk_list_mode.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"11d7e01f006c7747145e5a861bbc592d88c94b5efa27c00c8ba695492bf9cc1d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#7282): make sure the output is not dependant on the parent terminal\u0027s width"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_chunk_store_ui/src/chunk_store_ui.rs"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"22d2f707423f9c2b651638677b5640a78827caf971bdb9e2221aa5770a54a26e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#7282): make sure the output is not dependant on the parent terminal\u0027s width"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_chunk_store_ui/src/chunk_ui.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f3373da53b877ecd9a348dc6c6822d40b7801a158dd234bf43c4e7d5a20289e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): make this more generally applicable, in particular for the dataframe view? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_chunk_store_ui/src/sort.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d93b210f3642f911e33a8f8afdc429f93403e4edce7a2d59cd68e840bf99d7a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): this UI is really bad, we need to trash all of this in favor of the new table widget \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_chunk_store_ui/src/sort.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80585740d151bf6a2430f6b633d49434cfe5e0c92326936c85304c5876f1287"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): add containers in the hierarchy (requires work on the container API, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_blueprint_tree/tests/blueprint_tree_tests.rs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dd1e29cbfc4519a05511e4d4edfbd98d3622f1d94d5dfa982655f2d81898c2e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): this is a rather primitive behavior. Ideally we should allow dropping in the last container based \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_blueprint_tree/src/blueprint_tree.rs"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"772441d4bdbf3b3e819dbb51feaf161b198b664aed8303e95d9b15c213595977"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): what are the circumstances for this? Should we warn about it? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_blueprint_tree/src/data.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4361d64686bff4943d0b1241588c325cfb9cb95e930c84d53663bce664b5696"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): what are the circumstances for this? Should we warn about it? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_blueprint_tree/src/data.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc4f89a7a7cc21f20d783b550b32de606916a0400eaba4ea2ed302e9bd60e9ab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): taken from legacy implementation, does it still make sense? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_blueprint_tree/src/data.rs"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"9397049c136abf5798b47a26fce007af430d1eb7007cdd75ab371b9c74c7a376"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(lucas): We should show the nullability here too \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_arrow_ui/src/arrow_node.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50bd36abc6a5159651242ef478024934989caa13b1efdcb5cc053792bfb3c09"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#11071): there is some overlap here with \u0060dl_arrow_util::format\u0060 and \u0060codegen\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_arrow_ui/src/datatype_ui.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a02120c2f977027fae32f349c517f81efb986865b9b7baa8b364589a3d0cf54"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): make configurable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/lib.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f52e24636a04dfd4b1ed92bcad5dfbf208e0c0ea9de22e5d132513d4f363f0e1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): make configurable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_channel/src/lib.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"aca99b929c3069a50609ce669570acb0f4075b6617fc934b22427fb2bb874466"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): have to detect when decoder is playing catch-up and don\u0027t show images that we\u0027re not interested in. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/player/mod.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"eba052fc9d55d44daa2b188f113b19828df2a1e8722ccd8f93831fb9a47ed72d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // (potentially related to:) TODO(#7595): We don\u0027t necessarily have to enqueue full keyframe ranges always."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/player/mod.rs"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13423eadfed61c5cd04a4c4775c65371e7e84932f01fd22532667307d57cc4d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3800): maybe we should count this"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/player/sample_decoder.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d77036fad6e165c0566ae81b0c76f2958dd59d9f5feb2b469efd6e3e49d4022"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(andreas): We don\u0027t have a mechanism for shrinking this bitvec when dropping samples, i.e. it will keep growing. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/demux/mod.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1eb36815dc16362c90109283bf7600e2b472710bb202d747526f47b316e6ea4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): so, av1 bframes are possible with this config, right?! confirm and then maybe come up with a better name. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/demux/mod.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6d9c7831b1c9b5e78f9a7197a8947fa9933b52d0a11c737888496eb7f64db2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): This makes it somewhat unsuitable for various usecases in the viewer. We should probably accumulate the max duration somewhere. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/demux/mod.rs"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0f2df30c4c906e134ed78916f7a73ebcf825d74dfea7d5131fb817b9b7e7f0f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10090): This is only correct because there\u0027s no b-frames on streams right now."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/demux/mod.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c92e7ff9dac857653f6d5a826580de58194bdba4b8973d6104d13643a843a51"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Parse HVC1/HEV1 SPS \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/demux/mp4.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c435dd74a5fe6d45795355cffd1547bde80fbd00c0670a8110fbed6f2e0a11"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#7594): Support HDR video."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/decode/av1.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c0361953980674d1e34b323a3012447bcb06e5575a4bdf01772546c26269b4f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): This still has *significant* overhead for 8k video. Can we take ownership of the data instead without a copy? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/decode/av1.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"2370666da07b22541b6d2cf7f5060800c110e8e22dbe9eaea51616011c9bb2db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): dav1d has a user-data field that isn\u0027t exposed yet. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/decode/av1.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"8857c90b8c4c6507e3c48d8d937fcc9f38abd9035a6fdef7772b8c19379ec30e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Other transfer characteristics may also hint at primaries. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/decode/av1.rs"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08c9a3b027adaf806d8acae94c016e2ec3b0cd093c10dacb3fbed9cf9c9e41b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#7594): 4k/UHD material should probably assume Bt2020?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/decode/av1.rs"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9cef9d2ee774ba29d4fed73c401de84cf5f79fd924dbd4135618be36a1c2ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#7594): HDR support (we\u0027ll probably only care about \u0060BT2020NonConstantLuminance\u0060?)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/decode/av1.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e083dbf8d7f7fc3eb2bc050c5d183d35d0f0b7b7dc2027ddcd3b0b007874bb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(isse): We could potentially cache decoded blobs, but that\u0027s missing some things: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/decode/image_decoder.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e082fde1892c5954a541c5d932d6ae68f9cbff050974f01e2abbca5e82c7923"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //!   * TODO(#7594): ignored, we just pretend everything is 8 bits"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/decode/mod.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"4434c5df72b8e7b1ae8552f2bb3d7579f08129e9528515d7b32f5ba5c928a088"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Color primaries should also apply to RGB data, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/decode/mod.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5aa859d1811737560a78f26980407c9cd343e6b522b11c2f386794c9b9df23"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): we used to do so only if there was a non-flushed error. Are we ignoring this too eagerly? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/decode/webcodecs.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"81da22555920ff1eb4fd719cc6832da6cdc5b679ba2e4d54f87037466a501b17"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#8848): For some h264 videos we need to enqueue more samples. For example videos in"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/decode/webcodecs.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"836d9c68421e50b60925bf974f9c954d2a992f238c09787eb36a80f0476672f9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): This error can have a variety of reasons and is as such redundant to some of the others. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/decode/ffmpeg_cli/ffmpeg.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"f10c5df7f99f024f453ddcab3cc3e71efd3352d072bae877fff33e9dc7c50b40"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): should get SPS also without AVCC from ongoing stream. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/decode/ffmpeg_cli/ffmpeg.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae076117cc4effb0d16324c0600fa50cf0ccb8ce19499f3e8b2fc0e812dced27"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): should we check ahead of time whether this is available? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/decode/ffmpeg_cli/ffmpeg.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc21d4a4a0ee35423d9373815998db4bc7985c1ef2f2d8909fffa934fe11655e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): It seems that FFmpeg 7.0 handles this as I expect, but FFmpeg 7.1 consistently gives me the wrong colors on the Bunny test clip. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/decode/ffmpeg_cli/ffmpeg.rs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"89770a1d97c0ab7ce604fab9e33e67e68adcf94c7951be8a60d189b6446b94fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk); use this instead of the \u0060pixel_format\u0060 argument. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/decode/ffmpeg_cli/ffmpeg.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"a53604f9db6144260b59491fbb317c1f25882ee2c0f10d39db48302f039e4d26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): We see invalid IDR frames (NAL unit 5) on otherwise perfectly fine H265 video material \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/decode/ffmpeg_cli/ffmpeg.rs"},"region":{"startLine":994}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b04affc546098b312d929bbdaddce8956357e0e799b8f113b63cf5d104a2d26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): as of writing, ffmpeg-sidecar doesn\u0027t define a download URL for linux arm. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/decode/ffmpeg_cli/mod.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44e45336af5000cbffb13c6629547faaa53e30de3dbbb5d7b4a0fc5891a2b5d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): consider removing the hash from the \u0060InternedString\u0060 (benchmark!) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_string_interner/src/lib.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e50f61ad4ee4d8b14c01cc09854a16024f20ad85e76e1542373c7109358625f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(gijs, andreas): This would actually be a nice addition to the crate 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":"crates/utils/dl_rvl/src/lib.rs"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"9950d568407d4b055214eee653ee1d4209788581312ef491f59b79556c61a3ba"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): at the moment there\u0027s little value to have anything beyond traces on the client, but \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_perf_telemetry/src/grpc.rs"},"region":{"startLine":861}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e62f8207dedc197e8fa3ef2c5d4f7d6f9154f188cac11c0e6b819703c02ca8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): yet another tier would maybe make sense, with a different stochastic rate. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_memory/src/accounting_allocator.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"023171bdd4945f21f3298f06adcb78ad6247e8dd509151aa88ed2aa3caa08c0a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): this could be faster with \u0060select_nth_unstable\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":"crates/utils/dl_memory/src/allocation_tracker.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb6e7b877993cb88062b8484c53ae6abf3006fe7b7842809ef5aa9f2412c3ad4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): remove once https://github.com/gfx-rs/wgpu/issues/3206 is fixed"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_log/src/lib.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e783d7882eee802a9e1dbbcecfd79592cc2f935d9abf76cd9fdb0c17113d3c5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#8077): should be removed as soon as the upstream issue is resolved"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_log/src/lib.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"811510dce9742942379c82a06aae0de52fa93357a34647b5e10587dcf79b3d77"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): There should be a better way to do this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_log/src/setup.rs"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"df9975b224d512ef5aa0f0b4ff18feff3efd2f795b355bb54a3e6fa46b536a2b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(rust-num/num-traits#315): waiting for https://github.com/rust-num/num-traits/issues/315 to land"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_int/src/unsigned_abs.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9411498d97bb71ef1e20844a58355c165bf2b999ab2d3936cb64f0fdade7fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //! TODO(emilk): move some of this numeric formatting into \u0060emath\u0060 so we can use it in \u0060egui_plot\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":"crates/utils/dl_format/src/lib.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c7d9f26790a5734258b42344f37ba7cf379fa306a39a65d3f221721a683f26a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): nice formatting of scientific notation with thousands separators \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_format/src/lib.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd426ab33e1034793239a6deb3b9a02ee705a7f81b7ba59d01cb83712a8458c6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(rust-lang/rust#31844): This isn\u0027t happening without specialization."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_byte_size/src/primitive_sizes.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"187fec463672d650180752cb9b04dba859c036a944d615b54fead5353bc139e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(rust-lang/rust#31844): \u0060impl\u003CT: bytemuck::Pod\u003E SizeBytesExt for T {}\u0060 would be nice but"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_byte_size/src/primitive_sizes.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4b0360793466acc968a011e302164d56e329b84a890db65a88feec3c08892db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jan): this needs to handle the case where the refresh token expired \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_auth/src/credentials.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"3757d12fb2ee55e13553619f415d19cb6150f3217a3912d5b1296c598b1e0262"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jan): fetch these less often? cache somehow? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_auth/src/provider.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e16a607822fc8ca6f453fd391ca3ab717e7f0b2db4dfa4da00c0a59512b543"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): \u0060std::fs::File::read_exact_at\u0060 performs blocking I/O on the async executor thread. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_async/src/read_at.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"854bb48d8fb608fe19d4f15a676a2eecadb5df80fcdff54c1618970210036cda"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): in an ideal world, a \u0060take\u0060 kernel should merely _slice_ the data and avoid any allocations/copies \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_arrow_util/src/arrays.rs"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"053f76acb979b5b0c09271f3cef00d355c486a6031cc218f8c0df77b41f5443d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): Follow up with cmc on if there\u0027s a different way to do this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_arrow_util/src/arrays.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d4bd2127b3c4b58813342ec93458c926acc61af39b918dbefd11f7cdff112b6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): if the input is mostly nulls we should 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":"crates/utils/dl_arrow_util/src/arrays.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"da21abc24b87ba5d3731d03bbb1f69d63b9ba003bd012fdf8167387967f771d1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): optimize from there; future results should always match this baseline. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_arrow_util/src/arrays.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"496509dc9fde1f7b1dd0012221af29ffcc9b793d61461fd2795094c3650e0baf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): optimize from there; future results should always match this baseline. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_arrow_util/src/arrays.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1b9f296f5a4d2f89b53972a84dae0cc267c9108de80baeed73fedf570c2fa2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): I\u0027m doing this manually because \u0060RecordBatch::with_schema\u0060 just \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_arrow_util/src/batches.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"0756e1631f51b637e5cd1d19ecac52345377eeaeca633d0b366363f8c21844ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6388): Remove this hack once we have stopped using arrow unions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_arrow_util/src/compare.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"75022696442a7c5fb863c3f9b2f7ce1f4b081c217f18f22cd9267f23036aa0f5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#1775): Registering custom formatters should be done from other crates:"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_arrow_util/src/format.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"427e7c2ae74fcb057a6c32e4eb7e5c95472a82b4be6a6735e6fe61411d5c6cc9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#1775): This should be registered dynamically."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_arrow_util/src/format.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a03a2b1708aac8c294b7e6ec7060f88a73a6760c1e6eacaeb15e600cb214d86"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#1775): This should be defined and registered by the \u0060dl_tuid\u0060 crate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_arrow_util/src/format.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db830b775afeb678abda9bd98f41f0d671f5053aed9fb9daa6baacb33f2a243"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(zehiko) add support for other types as 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":"crates/utils/dl_arrow_util/src/test_extensions.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2dab483968abb411430ccd8d502324503399b01b2b3b385eb2ffdc6ac74225"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): it would be nice to be able to configure \u0060connect_timeout_on_flush\u0060 here to speed up this test. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/tests/flush.rs"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e89ec338ad01617926f1725b9c29852ec2ee65ae8586a6ca15ddb97bc725bdca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): Figure out a cleaner way to handle this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/recording_stream.rs"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ab6e3594fd4579da809d8944229d96dbc678f9418940d6a618ea99f6573da1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#5335): shutdown flushing behavior is too brittle."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/recording_stream.rs"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b2428f37bb1380355d8c4c03ae9bb9b91915f7e9ba22e93cc1e8455f5362412"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#5335): shutdown flushing behavior is too brittle."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/recording_stream.rs"},"region":{"startLine":823}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4937609eada5d59d4c4c8f383c263395f58294d38f85649701a4f6cd6058719"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): At some point we might want to make it configurable, though I cannot really \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/recording_stream.rs"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab31db89eab42da89fb0558ffb1f830121dcc432e45f17ce078833d2f28f0d32"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10444): This should go away with more explicit sinks."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/recording_stream.rs"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1fea71194684142ea64bbf04fc0fb4585749d120acd9dc748569b03ae87582"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): Repeating these values is pretty wasteful. Would be nice to have a way of \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/recording_stream.rs"},"region":{"startLine":1833}}}],"partialFingerprints":{"codehealthFindingId/v1":"22daad5606582a1efbaa6ea18c1bd29bc1d058d3956f34a196b59deb72e362dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10444): This should become a lot more straight forward with explicit sinks."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/recording_stream.rs"},"region":{"startLine":2141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9bb87fdedb0006797594341f36c4026839514f7ee75be8da89913bcba4f585c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): Avoid a redundant StoreInfo message. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/recording_stream.rs"},"region":{"startLine":3182}}}],"partialFingerprints":{"codehealthFindingId/v1":"41db1bbe7f9ea22ee9d9f66db37b7bd278a46417bd35879a3d293b4ea181825c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#4019): application-level handshake"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/spawn.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb069e2429c6541434257b949a2a472d4a9610eee6db9067ede9084c1a691449"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jan): remove after we change from \u0060dalaran\u002Bhttp\u0060 to \u0060dalaran-http\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":"crates/top/dl_sdk/src/web_viewer.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf434b5facb23dea0bb24d7e65d8796ff51d76cca1b19fdaf6ccaf75ac0114e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): Make this even more contextualized in the future! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/lenses/sink.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"9536ffc0d43e6cec690032964a7a402d6f8f3ea90831f1863956d0292a7c8d52"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //.store_id(recording_id.clone()) // TODO(andreas): Expose store id. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran_c/src/lib.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"609db961fb474700fb9a5424dc27d4ce1f40757d7eb06c97f0ca8bff9ccf6436"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): It would be a lot better if we had a handle to the web server and could call \u0060block_until_shutdown\u0060 on it. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/clap.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd95c6b653cec2cb4e23ac1cf764a0ea7ebe64f9800204a1488702a216c4af8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(isse): Remove once https://github.com/rust-lang/rust/issues/158686 is fixed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/lib.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"a69cfa04471c3ca31c695678282eb7093d457e2e6cb8032dfd3d82c1e791c3b0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): The Rust/Python APIs deprecated \u0060serve_web\u0060 and instead encourage separate usage of \u0060rec.serve_grpc()\u0060 \u002B \u0060dalaran::serve_web_viewer()\u0060 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":"crates/top/dalaran/src/commands/entrypoint.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"da4055ce78c13a9dbc3f8b07cf25cb0cdebf5adea3ee47e26f9c453d26b38b85"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tokio-rs/tracing#3239): The viewer will crash on exit because of what appears"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/entrypoint.rs"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f442b3cecc43f5e29895187e8a24b11863cbf56dbbcfaed0aa7c4a72a64f1be"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#10068): populate token passed with \u0060--token\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/entrypoint.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdaa369246abb2f9361fb2bd6edb597a0c5aba75a90d9da20fd66429aa4c0baa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): make it easy to set this on eframe 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":"crates/top/dalaran/src/commands/entrypoint.rs"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df827f5c5f43c11fe95f94e81441369f35aa2a65f4ad9ad1e44c362446c48a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3373): find a proper way to detect client disconnect without timing out."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/entrypoint.rs"},"region":{"startLine":1644}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b59d125b72180a9f67b520775c20a2d74e72fd32190c53919583fe62eecc59e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): dedicated module for io utils, especially stdio streaming in and out. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/entrypoint.rs"},"region":{"startLine":1745}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb583f2e8c6c43f256cee1cf40ef07759d67f56fab29e4eb0c7d4f48181b41eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-4073): Re-enable analytics for MCAP commands."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/entrypoint.rs"},"region":{"startLine":2009}}}],"partialFingerprints":{"codehealthFindingId/v1":"597f35b4bdd40e3edf3a46af86e0425b9a0a17e4c8dfc761c7ca8005b3362b22"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-4073): Re-enable analytics for DLR commands."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/entrypoint.rs"},"region":{"startLine":2026}}}],"partialFingerprints":{"codehealthFindingId/v1":"057f860f7c6c2545ac861340e3463924830f8aebf1ed7ce78a870b94b9b39b24"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): Maybe remove call-source all together. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/mod.rs"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d07aa904c6c76c351f8ed4c33eed3629d16fd3ccacc2c98fa24c5c47eef3c5c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10730): if the legacy \u0060StoreId\u0060 migration is removed from \u0060Decoder\u0060, this would break"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/stdio.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e780de436505b553b4f586b08af9a815b0d8a0af71c04fee3e04e99982306549"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10730): if the legacy \u0060StoreId\u0060 migration is removed from \u0060Decoder\u0060, this would break"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/compare.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"106604d5fc2d9fdac533933594b4a4b73979e16f5ab5d4b26e96db4f5688c1e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10730): if the legacy \u0060StoreId\u0060 migration is removed from \u0060Decoder\u0060, this would break"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/migrate.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bdc79f8e1681deb38b20da4206e74f570a2e6863a2ec469aa5b8390edd311b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): For pre-0.25 legacy data with \u0060StoreId\u0060 missing their application id, the migration \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/stdio.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc60df2ade048f0718555b04794e81a2324ac62f1c1b200efe9b1954fdcbd6f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): For pre-0.25 legacy data with \u0060StoreId\u0060 missing their application id, the migration \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/compare.rs"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"b053f202d952a5bb19dff5e6c81b70a9d6b5aa3908b8adf819829cd5a866d742"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): For pre-0.25 legacy data with \u0060StoreId\u0060 missing their application id, the migration \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/migrate.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf63e5ce58a554ef67a3a723b9fa96e54b73bbe6cbd5463f93d72e8824f7f10"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): might want to make this configurable at some point. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/stdio.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab171d6acb8bfd7ef678b49660db45016315f80649460d2752768750994bbcf2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): might want to make this configurable at some point. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/filter.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d02c1a2fca8d2a16d913d350ecf0ef757dbcecb1ac5b47b1a8f551cfafdea6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10862): This currently loads the entire file into memory."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/mcap/mod.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2690a26bd53f525cd9d9f6d54bb6a1eaf1d7a83b9473a0c4cc6fc0e1e032a27"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): encoding options \u0026 version should match the original. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/filter.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a389bf2ac0d711a746dfa0a69a8d3f7f6feecb558623e2ac0906be56e694d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): encoding options \u0026 version should match the original. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/split.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a3ff5ddf237a868306464c48f277769aa6a3fc5d5bdc686b6804ab295a86412"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): encoding options should match the original. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/merge_optimize.rs"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb1a982a1a81823f62d9c1b3f40f0d3df6cb1af23958ae80e1e7acaff51e570"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10343): implement this. Requires changing \u0060ArrowMsg\u0060 to contain the unmigrated record batch"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/print.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"8490e73c809c37174d72882af825b105f314ef91a9d18627becca6725dad2101"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): encoding should match the original (just like in \u0060dlr stats\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":"crates/top/dalaran/src/commands/dlr/route.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e7729570194ba4e2824e565b4d744d4aa62f5506206173c924b89ce15bd051c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): this can be optimized to not keep all the values in memory in the multi-store case. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/route.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7eaf453c211917f05036c804660459d2f28b7b46e3765fd5e18db54d5d94ca"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3809): we should expose a \u0060ChunkStore::split()\u0060 API."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/split.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"54eca87f705b84a42a73aaa26190f177dc76704478958647eecf5d594c1f8dfd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3810): There exists an optimal version of this that uses virtual chunk stores instead of physical"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/split.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"06d7acaff16810707897dd2f924364c34e8bbb53092a02dc9a27dedf10901c5f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3819): Support auto-splitting by size instead of time."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/split.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7da625e544cd8283539893c0b1d280f3ef63b84248e03abf6584afdd51c1ab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): Too many video decoding problems come up if we allow shared recording IDs, and so 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":"crates/top/dalaran/src/commands/dlr/split.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"980dbdeb074075d5a9c42438f95d319555eb74c2d2421a04e7249d4094564b4f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-941): multi-recording DLR files need to go away."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/split.rs"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"008eb4442b0b6177afd58fe90b91dd48c7e639895b470bc1ac7d6bd2865e4628"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-1075): recordings should not contain anything but stateless data."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/split.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff759619d67d33df34c22f8722c8b0953811e608eeca2a9605c6122200910867"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3809): implement this on \u0060ChunkStore\u0060 directly, with a test suite."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/split.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"9238adc34fc09f58a39719f6dc0e10bd21ff5b2674c15d94d6898d7f2eefbb89"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3810): For a virtual store implementation, we\u0027d want this to load no more than 1 chunk at a time."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/split.rs"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc07218dbd0e3f5bede114b9c043a2113ac8afb7db89f698bcfc601734358b1b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): There are certainly opportunities to do better on the bootstrap path, especially \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/split.rs"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7d536d47cb019464af1ee82265246382fef4f3c34c1b1b780a6eec891abf3b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3810): If we were to implement this with a virtual store instead, this would be"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/split.rs"},"region":{"startLine":1007}}}],"partialFingerprints":{"codehealthFindingId/v1":"dead65ccbae464ed6d3fd0850d3fe05f18336c4ec059b1acc677470e0e94bd99"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): It could be worthwhile to implement and use a \u0060Chunk::components_sliced\u0060 here (plural). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/split.rs"},"region":{"startLine":1014}}}],"partialFingerprints":{"codehealthFindingId/v1":"27258aaf886db807dc36f8f91d828ec13c64cbe679f7e417c6cb0035a5ff0c78"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6572): the fact that the Entity Path is only present at the app layer is a serious problem."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/stats.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ebd2ad313c51b6227be40dafdf5ef0b1c56b0a6bf3697b614a060e28f6b8c7f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): shortest and longest range covered per timeline would be welcome addition, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/stats.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41a5a152cbc2724f4aa91e0a8304cab7f212395c53d961619d78edb4da907a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): consider making this mandatory? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/verify.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26876ff49f21eb064586e76edf33f17859e10ed64ea4a8a18d00715643dbad0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(servo/rust-url#706): stop doing this when the bug is fixed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_uri/src/origin.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b774de63996c3b86d1214d1bc996edb17763d20e4f2e15dba30ed5369e1dd14"}},{"ruleId":"D17","level":"warning","message":{"text":"HackComment: // Hacky, but I don\u0027t want to have to memorize ports. \u2014 a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_uri/src/redap_uri.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"100d4acad32fcd39dbe1107a9c60efb8dbdd57ba57f56c0f974d5d9a4f32c311"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): Maybe Cow\u003C\u003E this one if it grows bigger. Or intern descriptors altogether, most likely. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_types_core/src/component_batch.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"70cf464bcda0d0a614d39d949a0f2ccc860202d352d88dcbdfeac567e5743032"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): Maybe Cow\u003C\u003E this one if it grows bigger. Or intern descriptors altogether, most likely. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_types_core/src/component_batch.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0785c3a34516aa77e6d633755aa1e03b067ccb4a26af02c5d4c7deeadebf8e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): This is far from ideal and feels very hackish, but for now the priority is getting \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_types_core/src/component_batch.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d6bcc2433d90c48137dafdd1591b21ad1b76495512f92b61f8329049819937"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): This is far from ideal and feels very hackish, but for now the priority is getting \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_types_core/src/component_descriptor.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f2121d0ffee9e5e08f03e7d800d1d9f670a967f48633895be0a00a344a4cd8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): we really shouldn\u0027t be duplicating these. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_types_core/src/component_descriptor.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2536b854db0b8cf751c0b07bf812b3ce23bef041b4b1018f6eb5e6379bb9f60"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(#1387): Image coordinate space should be configurable."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/lib.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b81e15343a6870bd47b9df393feb10d0cd2fa8b244d880711e828e19f781776"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-2667): Store errors that occur during the graph walk"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_forest.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"159309351751e35a41f065c5f597e3371949eb0a91be5f53724d185e89078456"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-2667): Build out into cycle detection"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_forest.rs"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"a081ab3e75866553271515e4caf102741c4ece0f35cace5c6114cd4b965a11e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-2667): Build out into cycle detection"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_forest.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d6eab91cce6d27318ed7c7e54af52c66205306a714fd6d0a8626b8644f7389"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-2667): Build out into cycle detection"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_forest.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd6675ed455a8cd4bcd1b69741136bf97e668e90021e5bdf64f68e471c0b3c42"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-2667): Build out into cycle detection"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_forest.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0b67d93517495557dc93b147ad93f8e711b2970f05a0202779839df8da79a8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#3849): There\u0027s no way to discover invalid transforms right now (they can be intentional but often aren\u0027t)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_queries.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed6b23131ba0cc34833e8465ed2e8a7dd7597667d03a3f59487d461985911dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#3849): There\u0027s no uniform way to discover invalid transforms right now (they can be intentional but often aren\u0027t)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_queries.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"c01165c885755c05659706755ed5cd013861c49f5b7e35719fea6d6bdffec75c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#2663): This is confusing and should be cleaned up."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_queries.rs"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ed8543e34e005fbad3507abba97da25d95ad6483e76a8c6b534e611e5ce5f20"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): handle removal of static chunks? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_resolution_cache/cache.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abcdeb7c0cfcb7b8ab9882708d16efaffa878c29368a4e2ab3a201a1cadb51b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-4439): rows are allowed to be distributed across several chunks."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_resolution_cache/cached_transform_value.rs"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1391a6aa5f88289e421e9b5542514f18d2f46446f1e9227e2cbffee221179b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //   TODO(RR-4439): this is not yet supported"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_resolution_cache/cached_transform_value.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2e16a507b5c43ecf9f291bdabb5c0a9a50a11c3d3e2795eb0408276c1da10da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //   TODO(RR-4441): we should at least warn if we hit that case. Surprisingly hard since we have to distinguish whether this is a new chunk or just a replacement."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_resolution_cache/cached_transform_value.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2faa98d9547f0d01ccaf9c1432dd496f0f09532723f8d06abb54f0e2f7b62b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //   TODO(RR-4441): we should at least warn if we hit that case. Surprisingly hard since we have to distinguish whether this is a new chunk or just a replacement."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_resolution_cache/cached_transform_value.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e731517e0789e9fa85613a973cff774270e1f25fe2fc1a983cf6a8915898de1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-4439): to support rows distributed across several chunks, we need to invalidate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_resolution_cache/cached_transform_value.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"425e7c5366c6f3c1bec8f4a69a9765b311918ed9dde49b5bfe017593a655e0a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): We\u0027re missing tests for more corner cases involving child frames and (recursive) clears. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_resolution_cache/tests.rs"},"region":{"startLine":2078}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f6779b17fdba2d4d3ba11fe28a5e19debdc6059ed60096b403aa6443aa5b32"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3539): replace this with a range-map, mapping non-overlapping"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_resolution_cache/transforms_for_child_frame_events.rs"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8e73d7dda9a9637462a82d7e8f9aaac03324af6107302989629f30e5e3dd4c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3539): replace this with a range-map, mapping non-overlapping"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_resolution_cache/transforms_for_child_frame_events.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"a194c8ab5122596334a67ce6cef283d55b4a79ff208c675884ea6d9b514bcb6a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#9922): stop ignoring row_id"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/chunk_columns.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"554eb1584f89a80ed7d4bee42fcefa15b90debe31101165b46752eaabc0af928"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#9922): stop ignoring row_id"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/chunk_columns.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"4121ef6d29c9dfa5572c24a7c53a80135e4080ceba560b4ebbd65fa2ef3a0450"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#9977): This should be required in the future."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/chunk_schema.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"08c926c010a4e24f2566044473fd4e42ebff8a9ab04bbfb3c97626ec69506a7c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): this should be renamed Index! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/column_descriptor_ref.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b454bd711fbbc1a70ab8ad8d24780282f497e48c8b593a7216b576dafcc54a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): Should be optional for general sorbet batches 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":"crates/store/dl_sorbet/src/component_column_descriptor.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"008c4ed80a72f08ae784bcff00f4e10c4cf018652179a741b84ef4f197fac28d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#10315): fix this footgun"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/component_column_descriptor.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"1603180ad02240c9e1b88eac793153b2c749424ff2930b8cf50981a7ed358361"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#10315): fix this footgun"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/component_column_descriptor.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8539bb3dc4da087b0f1b751f3166bd77d0af429c1c32076a2a8ca871d658084"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#10315): fix this footgun"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/component_column_descriptor.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c68540825729e997547569a4f638589b2c74807d1c992efa31e6222ac5ea221"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): I picked a sequence here because I have to pick something. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/index_column_descriptor.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"25b002f0d078822c2c86a7b043cead3d610f6879375ca7a750df532d32de9977"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10343): remove this"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/lib.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b94252c45c726a084ab5dcafbc168d238e6af531301cf49447ab5c4bb0ceff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10343): remove this"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/lib.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c003e9df681a602b5c0d9fdd8e27ff27e58d0ee379ee0fb1557aaa5a0b4bd1f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#10315): we need a type safe way to do this gymnastics"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/schema_builder.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a7a982070e3d1956531b57e17f90e8c835e4d9a30a5da875af4121c43cea81"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): This shouldn\u0027t be specific to time, this should be an \u0060IndexColumnSelector\u0060 or smth. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/selectors.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2052ea991e4222f99178e5cd8f4a5ace3461732478bc381690a35004377013"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): this is related but different from \u0060dl_chunk_store::resolve_component_selector()\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":"crates/store/dl_sorbet/src/sorbet_columns.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3f1e91be38c53c6d4d90354ef323b35002c802a5cf884250fadd7b4a5f9771"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-2175): Always include version metadata in redap"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/src/migrations/mod.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"00fb7ca8ffa57fa600a5c5d860d922dae63254483c00743cab593aa7db1860b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): expose this to the CLI \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/entrypoint.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c51f90adc9c3ed61f2603d46e1cfb59a41a6b23760b07ff6875264399abc29"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): now that we systematically check the merged schema upon registration, we could \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/dataset.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c1d7dba6543d33285f31ea7706c4c7c2e5326cad87393fcd2123e00bcae3904"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): we could have fast paths if segments.is_empty() or layers.is_empty() or both. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/dataset.rs"},"region":{"startLine":641}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41366b310b4cfaa7a31d3624182acac575e137426276bb0792ac75d1c0b4fdf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): maybe we could be smart with .dbl and auto-setup a blueprint dataset? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/in_memory_store.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"429ecda425709c93806b4077d7b38701e2d328dc1b17cab8e167b2b945de551e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(#11369)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/in_memory_store.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5c39efe881747e411d3d4cbefa25f64355d50c6632c079d9507a461745a8a3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#11369): this is a hack to have the entries table until we use a proper table-"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/in_memory_store.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"45ad20ecfbe25cf5f45c8f72ac780621a4ec40d7a74e6e05f5b598f29783c8ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tokio-rs/tokio#1529): Positional reads block the reactor; use \u0060std::fs::File\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/resolved_store.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"70bcaadb661cc7aaf9049f07a4c0ebc571c9ff8e44b713e29c7a2d5ca021f4dc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): change this if we ever mutate a layer somehow? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/source.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e7f6733458ed003f2e98f6571a9709c921a6975ad4006872d555e12eb8717f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-5155): Support enumerating OPFS directories for prefix registration."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db8623ff3e31ac5782885bd58299930d32f29dcfcddd25b1d8337771d6e5fa8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-2017): This endpoint is in need of a deep redesign. For now it defaults to"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c60079bea851907cbedf139a908ce28a421fe70e1f9655ba5fdb23dc9420534"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-4979): Filter by properties here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"e566053faa69db3f5e6ccf7c85b84eca6790a99f5b93e813084485fa755cce7a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(RR-2613): we must do a much better job at handling these"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":1458}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8ff38be9f92580dd087185e00784e06ae01436e57c51a3110cc6eaecc760fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): Should some or all of these errors be returned as task error 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":"crates/store/dl_server/src/dalaran_cloud/register_with_dataset.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"421ec8ada5aebb64c34f0a1298eade70bc6a759ab1706595e4598784c68d5aa4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(tokio-rs/tokio#1529): positional reads block the reactor; use \u0060std::fs::File\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/dalaran_cloud/register_with_dataset.rs"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cc72ac226b421cd1e9652082eabe79965a047a0d415e13f069088353574f8f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Expose this in the API? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sdk_types/src/image.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"a068c14022b1ae3660d4da2f45368fcc432977e9c013bda4e42fb8d51b6a0b92"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#5032): Support left-handed coordinate systems."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sdk_types/src/view_coordinates.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c11d79c70025e313ca452ecb8fbac816c2005f22b6c901b24f193fae2abad36"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): This shouldn\u0027t be ColorModel::RGB, but our YUV converter can\u0027t do anything else right now: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sdk_types/src/datatypes/pixel_format_ext.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"10b1a2b054518d35afd371319a499b9ba10090c4932daa04bd2e7afa4e3d4bfe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Expose this in the API separately and document it 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":"crates/store/dl_sdk_types/src/datatypes/pixel_format_ext.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c4e8d20b87559f814979abdc943dcb267b39e87e980f47450640d430b753c9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Y8 isn\u0027t really color, does this even make sense? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sdk_types/src/datatypes/pixel_format_ext.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"940042f8ee92db16c6a65770e9a99e13c85e2b6c07213d1ed091c0b566f1b951"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): come up with some DSL in our flatbuffers definitions so that we can declare these \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sdk_types/src/components/draw_order_ext.rs"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3d0df62cf18856f7617ab0e7e9bc17b8ab21d83c2373cb251b1a523b0331aaa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#2388): come up with some DSL in our flatbuffers definitions so that we can declare these"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sdk_types/src/components/media_type_ext.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4ed33b29a68d52b7f086ffd01d92ffc649f8701516b3dfebba19b5e04a5380"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#4536): These should come for free"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sdk_types/src/components/name_ext.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9691623034d149a4d5a309425e0c02dad8940848df8313ef3b6afd37fb37b2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): re-enable \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sdk_types/src/components/view_coordinates_ext.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"215bdab11adca662b5b6e81d4cbe73840218dcfac7a48e53fa16b002873e6e76"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): Is there a better value to return here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sdk_types/src/components/view_coordinates_ext.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1a2a0908b72b63d7adcfab59bc1dcf931fa471a317692542d9ae920cb6db69b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): Is there a better value to return here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sdk_types/src/components/view_coordinates_ext.rs"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d38444f9de170fa62b3198fd3b692ed711df0247bc98c26586b1f362dc23674"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(#3285): Does *not* preserve data as-is and instead creates half-sizes from the input data."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sdk_types/src/archetypes/boxes2d_ext.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd05a425c79506120da6a7d6359513afcaa1843d85c86a7d93c14252f1d099d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(#3285): Does *not* preserve data as-is and instead creates half-sizes from the input data."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sdk_types/src/archetypes/boxes2d_ext.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae19060c5c53f334f6753fde54d021c1110be306d9dfa2c4e8c3e7c01506ce1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(#3285): Does *not* preserve data as-is and instead creates half-sizes from the input data."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sdk_types/src/archetypes/boxes3d_ext.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4d68288b6ba84ab28dc1e77908183376576d91b001943c4c56f40b50e631f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(#3285): Does *not* preserve data as-is and instead creates half-sizes from the input data."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sdk_types/src/archetypes/boxes3d_ext.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d3c58872420017cfd43cab212d9e4032f4355376062ae36623aaaaea0862b0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(#3285): Does *not* preserve data as-is and instead creates centers and half-sizes from the input data."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sdk_types/src/archetypes/boxes2d_ext.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ec24bb7e7947aac52cfabd08eadd178fd16e5a541ce0ca9e5910fb4b5610db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(#3285): Does *not* preserve data as-is and instead creates centers and half-sizes from the input data."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sdk_types/src/archetypes/boxes3d_ext.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46421e155b509c2ba7b64cfbad0a0d69e139c926d6b86c7929f2505f1a801ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): avoid this annoying conversion \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/tests/common.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"505e2051f7fc929dd86b7ef16c3722dad14877f18018315b2e1c3f3c44485ba6"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): we can always expose \u0060n\u0060 later, if and when it\u0027s useful. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/tests/common.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"089ad99703cf04bc2f7ad7d01fe0ac5b74f2c130d48f2b81752818d6e105ee54"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-2677): when \u0060required_column_names\u0060 contains only the chunk key,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/tests/fetch_chunks.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1bd11c21ee91e2a0f607f7f2adf4eb4d832a993f2c06f660e9fad5697947bcd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-4859): the cloud server returns \u0060Unimplemented\u0060 for \u0060WatchEvents\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/tests/mod.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"5761d4858563ed494249a6214f409365fc1d3683b1502967cc9af37c370650c1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(RR-2613): add more test cases here when they are supported by OSS server"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/tests/query_dataset.rs"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b6e765b27bacd756da4fdae6dde402dab6033d21eb56c39d933241dd07f616"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#11591): add more failure cases"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/tests/query_dataset.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"8169016d1ffe4dd8f44e15faeb875362bc47a2acc540d4075ea48d6657c86fab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(RR-2613): this recording needs fleshing out in order to test more interesting queries."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/tests/query_dataset.rs"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"5419584553fa6579c3f73efb921a93015e77a430c03ff8c908c2582379b6e35a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-2613): we need considerably more use-cases here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/tests/query_dataset.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"8006783617b0716e73cf7131d46c1c593b045f4ea50085cdf54172c70ad7ccc3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(rerun-io/dataplatform#2228) remove the \u0060chunk_ids_to_remove\u0060 parameter"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_tests/src/tests/query_dataset.rs"},"region":{"startLine":508}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b59f2d59e284580a8dbf9afc28e327f47b8ae22ddf169bcf725f9801b70ac1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andrea): Enable gzip support when Hub 0.14.0 or newer is deployed on all stacks. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/analytics_exporter.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb9e73bdf1a8bf8f9f885e89b792f3f3dcf51ac2054ddc6ea38024f3c49c65d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): this should NOT be \u0060Clone\u0060, to discourage callsites from holding on to a client for too \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/connection_client.rs"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e8f5b5cb40cd1c3dab2abdf024c13258dfd7e21430f04739b45666e93151fa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#10188): this should disappear once we have wrapper for all endpoints and the client code"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/connection_client.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ea6e7c7e8092442526006a696a8371b55c953642b6416ad18c236c403182245"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): accept entry name \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/connection_client.rs"},"region":{"startLine":801}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a655faef19a56abb45c8dc297392dd5c48feb4ce0e0c68167cafd64ad1a09e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): accept entry name \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/connection_client.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf92e286b73e951e3d7d45d5259021cf04f8783a30103feb0dc528ce652904c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): is there a way \u2014 and a reason \u2014 to not collect and instead return a stream? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/connection_client.rs"},"region":{"startLine":833}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a886bc7dda1cbc6f3bd2ffb10159dad9e8ec5c4ade38055d04fa3412ec04aad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): in the future, we will probably support my types of tables (parquet on S3, 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":"crates/store/dl_redap_client/src/connection_client.rs"},"region":{"startLine":1398}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d01bb6cc8ce2cd08e6f2c94945046d46045242d16952cdda657222b9b333e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#11016): refactor this to achieve lazy auth retry."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/connection_registry.rs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e390b29f123f996addc72bb705f022920d01428821f8bdafb4b41a14c43d280"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(rerun-io/dataplatform#1069): remove the \u0060FindEntries\u0060 fallback once all servers"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/connection_registry.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"d889bf85646a042d35d880daedff9ee92b8e02fcba40b0f9099214cd9627865c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3480): This will fail to connect to unencrypted IPv6 addresses (e.g. \u0060dalaran\u002Bhttp://[fd00:4b21:6f7a:2022::10]:51234\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/grpc.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2eed9cb7e9feee2ad8650dfa629671d07f3306279f80309cd7025733b1a6e83"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#9430): ideally this should be factored as a nice helper in \u0060re_proto\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/grpc.rs"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"9974de3e4ee4b88a564f80e281e3b96a3776146a77c2fb7f5145125edfbd1298"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): we should compute contiguous runs of the same segment here, and return a \u0060(SegmentId, Vec\u003CChunk\u003E)\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":"crates/store/dl_redap_client/src/grpc.rs"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c447761c34e5a25c4cd0a72e35450a007026dfe985e059e2d52d3b9847517f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-2976): Do not, under any circumstances, try to chain gRPC streams"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/grpc.rs"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"711249b93782df877950f78b005299e62f2b5dac56e4603e7958e054bb0bc0d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3323): FetchChunks should expose a proper bidirectional streaming path on native."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/grpc.rs"},"region":{"startLine":1203}}}],"partialFingerprints":{"codehealthFindingId/v1":"f21bdaa37011a37e17338b5472773f1b342a1aeebbdbc4bd20ed624c16da800f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10229): this looks to be converting back and forth?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/grpc.rs"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"6184be68fa1d42036096bbf96d091b5b38092804ec7ae587f5b5f20f45030197"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(RR-4546): this needs to be on par with the table provider stuff in terms of chunk downloading"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/segment_chunk_provider.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"6758feaf257e47a066d2202c0a8a9c18962539eb1f39e311ae9ef8409e56ed65"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3800): better size estimation. This seems to be over-estimating a lot?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/cache.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"205e0c2d77dc2fdef141328552ec2a57dd3f4253d72a04e382c23cd269af5a6d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3800): this seems to be over-estimating a lot?"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/cache.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"02fd9081acc453b82bb4482d76a8be45c73d576d66d3a046f9c2bdc12d0541da"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): This is horribly stupid and slow and can easily be made faster by adding \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/cache.rs"},"region":{"startLine":547}}}],"partialFingerprints":{"codehealthFindingId/v1":"a09aba06f97c4bd10a27d12172d0d9b8092e20d9656665e1c7253570aceac990"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): Once lineage tracking is in place, make sure that this only reports missing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/latest_all.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"a352825a76a24892150448c42ac498ec79a0722426c49649c9f380382c55b688"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): Once lineage tracking is in place, make sure that this only reports missing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/latest_at.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa7b14b15d23297ee59939be478d409ad8d224fb4bf77ae740344173da02902"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): Once lineage tracking is in place, make sure that this only reports missing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/range.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"a67986909b1cff0c3ab18ebc1e05aa793fc5ea7eb9109c9274c2fc013f953ddc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): Once lineage tracking is in place, make sure that this only reports missing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/query.rs"},"region":{"startLine":708}}}],"partialFingerprints":{"codehealthFindingId/v1":"34716fa571994a1b42598542ce411fd9a1ea5c541877ac31d750ba9b4b9ba2a4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): Once lineage tracking is in place, make sure that this only reports missing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/store.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7149cb668e681463872ebf58d09c6ff2ad031932ddd6f10be786eb63b5a9d1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): consider converting to \u0060Vec\u003CUnitChunkShared\u003E\u0060 right away \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/latest_all.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7727a40513be0ab15b245b36b5eaffb120e423822a3085433d937428629e7a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): have this return a non-Option, since we always have at least one hit \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/latest_all.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"48dea32b7a69331b1e0bf1a751d591b6473bf232251d26f65f4332e32b3852db"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): Maybe at some point we\u0027ll want to introduce a dedicated \u0060DataIndex\u0060 type 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":"crates/store/dl_query/src/latest_at.rs"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"a684c58854892ed884087f266f1d43b53417e8abf786ef01b9ab168cc35c8f2c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Should clear also work if the component is not fully tagged? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/latest_at.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c2d36dd076dc88009152a6a406f741dd84238882259aabc0b03963eaa7f60ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3762): return latest physical chunk, while still reporting missing virtual chunks"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/latest_at.rs"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"276ad1ad084fbf21dc71ef679292d3242a5a327f300fedf7267343f72505f3fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#5974): Because of non-deterministic ordering, parallelism, and most importantly lack"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/latest_at.rs"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"afb15a03b270087cebc90153ca884932a78291030c52b79bebed388dfd47cec1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#7008): avoid unnecessary sorting on the unhappy path"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/src/range.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d3dec85c9113289aeaa6ff023cc31b81e3705fd0237fb19bae326c644556c89"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): This whole business should really be defined elsewhere, but for now this the best 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":"crates/store/dl_query/src/storage_engine.rs"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"317ce5c78c20227bd7c22b4825c5f55ce5c668cb80770338801ef9522e58d0ee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): Add Radius once we have support for it in field_types \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/benches/latest_at.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb2fe3009aa1ac0ea1125b4207c2f763457c36c95d65f3686fbb9b3b4790815b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#10730): delete when removing 0.24 back compat"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_protos/src/lib.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ec68e4007155a2602c6fbdc1ee13bf2d5ff977d5f73664c15cbe75bbdb611b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): move this somewhere else \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_protos/src/lib.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"8edfaed762eb7b6ce6d8dce2540b5543e601074204134f77678b34c31d19cc55"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): not the greatest name I guess... (rename in follow up?) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_protos/src/v1alpha1/dalaran.cloud.v1alpha1.ext.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bbcd75fcc3b17e5a838e9b3d380fab9c14b551916ea3d1915057b13ed64c9c7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(RR-2677): actually, these are also required for now."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_protos/src/v1alpha1/dalaran.cloud.v1alpha1.ext.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"450d347053ff788dc1098fb6ac7243a3c7947e24490badeca1320f6cc213cb78"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(RR-2677): remove these"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_protos/src/v1alpha1/dalaran.cloud.v1alpha1.ext.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af9f7955293c3a7ecdf26011d73ac03e5aa149e9d769396bee6a8f4b16a0cbf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-4853): add register events."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_protos/src/v1alpha1/dalaran.cloud.v1alpha1.ext.rs"},"region":{"startLine":806}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9398d9661b3ca4a787d52b9386082372fda75718c7006afa65ef05a52511eb5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): this should be an actual grpc message, returned by \u0060RegisterWithDataset\u0060 instead of a dataframe \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_protos/src/v1alpha1/dalaran.cloud.v1alpha1.ext.rs"},"region":{"startLine":2048}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07be6fd7363c47f1fe30ed46e7ee91f9911d61bb2263da5cbc310eacd558512"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-5123): Remove once new client -\u003E old server isn\u0027t needed anymore."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_protos/src/v1alpha1/dalaran.common.v1alpha1.ext.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"e436f42d00edbe7615eb6f85fc5e52353a5e657e185d842e7163a9f12161cf6b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-5123): Remove once new client -\u003E old server isn\u0027t needed anymore."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_protos/src/v1alpha1/dalaran.common.v1alpha1.ext.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"881694d3b820e3bdf3b335a23ecaacfd5dfd68daf4436a318dc2147119c8043a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): we should migrate the full \u0060TaskId\u0060 wrapper from \u0060redap_tasks\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":"crates/store/dl_protos/src/v1alpha1/dalaran.common.v1alpha1.ext.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"32a9800b19a3a0f8d6f17c23c5efd47254e96c1ce833031d990b3621e1a80389"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#10730): this is specifically for 0.24 back compat. Switch to \u0060TypeConversionError\u0060 when cleaning up."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_protos/src/v1alpha1/dalaran.common.v1alpha1.ext.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"1540a22e96cb1892a3c59aef5bf1c62c13ad9f6853290d380fa590163a9f3e5d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#10730): drop the recoverable \u0060MissingApplicationId\u0060 path when removing 0.24 back compat"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_protos/src/v1alpha1/dalaran.common.v1alpha1.ext.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2a034896f4d32d2083ebb51f4fceeac2806a9b5c095ef7e9286a55932c0873"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): support this, but that means DevAlpha is not-const \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_protos/src/v1alpha1/dalaran.common.v1alpha1.ext.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb714c68cc1299d0f6bfa85dcc32e64834fda78a355bcf791558a272927ac68c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#10730): clean that up when removing 0.24 back compat"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_protos/src/v1alpha1/dalaran.log_msg.v1alpha1.ext.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b8628fbcafbea456206f33dae8e708867b41a3e46b7fe475a5eb720082dfcc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#10730): clean that up when removing 0.24 back compat"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/transport_to_app.rs"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6a375b9511b9d5bbf466d0c62205e48fc9221d78eeab0efe01edf0b3621696d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#10730): clean that up when removing 0.24 back compat"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/transport_to_app.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1436eed99b219605700d27c315eaf7bb1dcd83843ab41e0d8ababe3d3481b26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#10730): we could reimplement it if/when we remove 0.24 back compat."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_protos/src/v1alpha1/dalaran.log_msg.v1alpha1.ext.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"637db35ac1e9633a00931f8ea712e4879ddd7cabddb5f4ae275d9f020c300988"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10929): remove this once the limit got fixed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mp4_reader/src/asset.rs"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ea0590e6db4da05c75c3e2f4041859dd0940fabb3a554a74f49e38dcd223a07"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10090): emit B-frames directly once \u0060VideoStream\u0060 can model DTS != PTS."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mp4_reader/src/config.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce3a35ed152a06e1c9597aeccd60b1a175df746d677d98c52b2a318b7a2b13c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): Since we have builtin support for CDR and protobuf, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/error.rs"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f0ef5769c27a1990079561a1663bd7feec0a15fb9b8f6851458891e555e168f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10726): big assumption here: image format can technically be different for each image on the topic, e.g. depth and color archetypes could be mixed here!"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/image.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"2402ccfe4c69c3b74d81cfcc1fc1e64b809152f30bcae38ce9ae1ce6a8b014d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10727): Figure out why logging this as \u0060Transform3D.quaternion\u0060 doesn\u0027t work."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/imu.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecbecc05b26b91cd2ec9beec90f16cbdd6b81e18303a9da4ec4f0e2e5531347"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10728): Figure out what to do with the covariance matrices."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/imu.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"823742dc909e2e04be6793762bc91beaf1184a4ea839bfc685b91e0baf553455"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(michael): consider supporting extra fields with length greater than 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":"crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/point_cloud_2.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"06797383d9a61fd7fbfda9cd6bf398412896b5eb9dc617ec21947184aad4ffb4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): It would be nice to never initialize the unnecessary builders \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/point_cloud_2.rs"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76083865d7cd0090f3126bbda582a5e7fc587e7fa983e1a16642a3ff62a002f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10862): Consider abstracting over \u0060Summary\u0060 to allow more convenient / performant indexing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/decoders/mod.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c19212b519b011ea7da6622d560f54effe00d3ef9183ddec012ce5de23e1a26"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10862): If we encounter a message that we can\u0027t parse at all we should emit a warning."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/decoders/mod.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"1712d4289b50eb230ceb3970c0182b8cf0c1875219426a2e3080523a9da06fb1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): Measure and consider caching the grouped fields for all messages. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/decoders/protobuf.rs"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"7856823db5670957c240307410d917c0b814065583592071a6f917150cf6ad8a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): We actually store the data sorted, but \u0060MapBuilder\u0060 does not allow that. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/decoders/protobuf.rs"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1147014a1a9d1ca163a0bdaa1a7112627d2b66d4c2dc33cc871672d2983c564"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6412): probably don\u0027t need this anymore."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/arrow_msg.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8db4542bb7c9a2f3fee29280bb5fb4abdc35379e16445e4b978646a644dfc01"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6412): probably don\u0027t need this anymore."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/batcher.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acd6ae4d7cce59acb796982a4932c4faf955b8a0b4617d3470417f21ed56276"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10343): make this a \u0060dl_sorbet::ChunkBatch\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/arrow_msg.rs"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9a8e60791679e642e65a23d4a7d942c89518cdbf6f635ed579a9fbc27c04fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3718): Entry names should support a broader set of characters."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/entry_name.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"7687d6b37b85743fe31e38efc67447fc45000d2910e60b61edfcfe65c836e91d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#8631): Remove \u0060LogMsg\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/lib.rs"},"region":{"startLine":487}}}],"partialFingerprints":{"codehealthFindingId/v1":"630c7ab91ce226e3611a359cd4644748ac0b946e39c43470c10f298cf0bca987"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6574): the store ID should be in the metadata here so we can remove the layer on top"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/lib.rs"},"region":{"startLine":496}}}],"partialFingerprints":{"codehealthFindingId/v1":"945e635c42fb08c493b4bd271306a31b9565a11b1941f6253a63d79a66c2584c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): Consider using \u0060OnceLock\u0060 here to cache this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/path/entity_path_filter.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"8391ceb0e4aa0ef9a2d02675a5150ccb8ca7ed25de93032d6dceeb393f6c3bb9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Do some error checking here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/path/entity_path_filter.rs"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"32cf093dc3a18b0b921f3d612b0b542f6d93ff0a59592667f7e8bf65e5f44cf5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#5528): This is a very naive implementation of variable substitution."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/path/entity_path_filter.rs"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ab2ec4bd0421d4db51f68e30d9b563fef96c9d2c8a77ca1e22c360647ba937"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#9193): Ideally we\u0027d want to print a warning here, but that"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/path/parse_path.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15ec537de2e855e2a8859cf11f88442eb72860ab0c09591b7de06adca22a3d4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#9534): refactor this mess"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/index/time_int.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"808693572b33175518ba75029689bc14d850e36cc93898d011a084e4b4a70888"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(zehiko) add back timezone support (#9310)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/index/time_type.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9f60e127e5fde66ec246c59784fa300914126bc8e264fb78b224692ad85db8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(zehiko) add back timezone support (#9310)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/index/time_type.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"57cb1abe7c5d7dec9d56b6061ad571ced46de49b43f29f4d340d2c2701987217"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(zehiko) add back timezone support (#9310)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/index/time_type.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b89000963b01fb39ea6ed076956f8748743a0dc9aaf98c1349d7ee94aa6073a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#9310): warn when timezone is missing"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/index/time_type.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf2e90c037dccb0bdbcaa8c6014407a8d5b92c7b062b7251616de875aee1e9a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#10730): this should be entirely suppressed when removing 0.24 back compat"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/app_id_injector.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3343e528a22b410f4a94e93d41875d29f1e3e7dbccde889d871a6820197abeb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): I\u0027d really like a nice centralized way of communicating this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/transport_to_app.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a56f64d0c92d0147ab2f68e9548da9fe93cecbdbcf6084fd744f595c906fc09"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): In the future, we should be able to rely on the \u0060chunk_id\u0060 to be present in the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/transport_to_app.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"f28c50961dd1312abf17294402cd9389f18a641aa7bdb34dbd4e72425ec27233"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10343): Would it make sense to change \u0060dl_types_core::ArrowMsg\u0060 to contain the"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/transport_to_app.rs"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbe95695b7710bd8aa3eb193ed95abd3d801889242b93da237ec932d72dc970c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): it would actually be nicer if we could postpone the migration, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/transport_to_app.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"f514b0deab6d0660bbe050d6eb43b7806e71e7663c9eb70ef9d0e87899522d66"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): can we use the File-oriented APIs in order to re-use the transport buffer as backing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/transport_to_app.rs"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"c536176115e4a495b9088b01a77c74b7341448c916a224370ca49c3a4e80f221"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): I hate not having a \u0060BufWrite\u0060 trait. This is just asking for trouble. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/encoder.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb40f2fda7220ac95bfe287756105041b602d5f071f587aabdb403969ade658"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): the extra heap-alloc and copy could be easily avoided with the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/encoder.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"066a132e8e8a33a589b5d4c65ded4e081f57a35b4733a87ef90bd3a855c0a424"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): the extra heap-alloc and copy could be easily avoided with the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/frames.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d298dc8773965a051a0d928ee5bad656e00ca0ca19884dfd3a6c8fb0c26f49"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): call \u0060.to_transport\u0060 in parallel. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/encoder.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"291fd81de8b40c5d9c81c969a7120a9ed4b0bbcd25a7dff035bb36e5e4963a3e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): the extra heap-allocs and copies could be easily avoided with the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/encoder.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"d22a2d14eada3dac3200135e994cba67901a4e250dd71edfcce0b7ecc3f76bdc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): maybe we should split this into read and write errors. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/errors.rs"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d6290b131ca6204736f891c30983dbbdf45f9605959ed566be35c51938054dd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jan): Remove this at some point, realistically 1-2 releases after 0.23 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/errors.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd4050437bd8bdea5f26cc928e308248f2bca0f05678851662139e1e81a88b0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Can we ensure that a single process doesn\u0027t \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/file_sink.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ecf802e83406bc86dcc2451e05e3791c0575670b0a16a4ff9bf9b06fcf15275"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): Profile this scan without holding a Puffin scope across \u0060.await\u0060 points. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer_reader.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc0e8ba27093752e3b156c77c71a88bd5eaa4c7cf047a6f0b66a4b9a85f98fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): None of these options make sense to have at the global scope and/or in the StreamHeader. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/frames.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7bd6631b61185b2d0ba37fe81790f228b18ab68207cc3ce605be7fda721c0f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dalaran): revisit this when Dalaran\u0027s own minor version approaches 23, at \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/frames.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b04f0c362f394689500b8873c383595b672835a186dfeb00d29ee50369839b4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): It shouldn\u0027t be the job of the StreamFooter to carry checksums for a specific \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/frames.rs"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7cb9a13e58dc3046a4491492de36d31a752d8b080240c4a389b1b0f5af2cb88"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): In a potential future RRF3, we might make the choice of checksum algorithm \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/frames.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4530feb1910a22a97c1d2e606aedb20a96f34da417b5db66158152bc0a2e80"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): technically this should be a sealed trait, but things are complicated enough as is. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/mod.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"fccc54f41e75f4aa22a09c3bc1afb90923f4bc91f99bfb853464aca76ff34978"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): technically this should be a sealed trait, but things are complicated enough as is. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/mod.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3591804129c7fc69f441d16e09347f6f8b1609ee7f3f0398a2b88cefaa264bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): this only makes sense in the context of physical DLR files. We will need to make \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/builders.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b83ada6da942bf9b8330fcf30a42c41c27b5afe6611cb910e4507a16f571697"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): this only makes sense in the context of physical DLR files. We will need to make \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/builders.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf96ae3663c388408a67330846b7a5cda272d29a95a3585c82f6cd56a757a754"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): this only makes sense in the context of physical DLR files. We will need to make \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/builders.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"7711033b7d7aa1084b9a02f8b47c1e3c6aa939d553d83ee8780b886df89c4288"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-5382): confine this offsetting to the chunk scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/hub_dlr_manifest.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d878b9d653a7a7d0c9c64ec968801339ccc837895c350b29d9b983e3554022f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): should we slap a sorbet:version on this? that probably should be part of the sorbet ABI as \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"7af09cafe8cb381dde7564bebdbd48981d4d06ee5f1da6c03f8b53241c479e4c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): very expensive, should be cached somewhere. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"66cddec1568f4c761aaee6c02574e2b7b464284643ae01fe1f07450f3a556c83"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): technically we should follow the usual crazy semantics to decide which \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/raw_dlr_manifest.rs"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81bb7448f983861e3b3f1820150ca3af3d036922e29edefc1cfcd82a79b51de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(#10730): remove this if/when we remove the legacy \u0060StoreId\u0060 migration."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/decoder/state_machine.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab4b1e7950cc174ccbe5bac7f554d577c1004e26c50a63c59b8eeacb3432f1c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): These kinds of peeking shenanigans should never be necessary, need to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/decoder/state_machine.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"382258f691c2a0ea3a34561dfcce31ce325ffa90d121864384a6b4e2b5bcd010"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Conceptually these should go to \u0060dl_data_source\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":"crates/store/dl_log_channel/src/data_source_message.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea90753ad28f0ad1a48de0e08ca715bb6b307463f87158c61296d80b521fefd8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-5073): Remove ui commands from DataSourceMessage"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_channel/src/data_source_message.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4bef50ab6c6242ea2cedbd1cbd88309cccd19871f71921d0a1483f323961640"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#12482): Returning the screenshot to the caller would be more flexible and useful."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_channel/src/data_source_message.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"360ca32e0f4bb9b247a54780f77c6f8890fee3bcc7ceb589d3434a328c53cd98"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3435): Implement indexing into \u0060FixedSizeListArray\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/tests/test_selector_list_array.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"16eda249d81c141f7835b8d91f14b55200b14faea3a74d272e1b9127e1a86236"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): Make a second Pose struct! \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/tests/util.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e1c0730390a1573d8defd8f4a487c9c4172410a5854d8398b1b329570d8e8f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): Let\u0027s take ownership here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/ast.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"2662a7f44be2678fd215d8672f75fef7a02a00b7b479db6a6cbdea336b997e4b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3435): Add indexing into \u0060FixedSizeListArray\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/selector/eval.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"a824cc3ba9dfac508f7fae1aac0b3f1a47a9aa5e88e033bcc8ea066495c36c84"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): Since we don\u0027t keep track that these offsets came from a fixed size \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/selector/eval.rs"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad5df85ac48f985beaee9395765f9e935747438d69c1fe7bf4d42622bd71a64"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3435): FixedSizeListArray errors must be suppressed via \u0060?\u0060, but ListArray should not need it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/selector/eval.rs"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf3665bc2e7c321986afe25e41b6f6b6c150b297811162f713917a9afca085a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): distinguish between float and integers. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/selector/lexer.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb12e4c46d648af6dac9cfe094130c4ed881114f635f9ae4bd07ca7ce6a29e63"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): Add location information to other variants too (tricky because of line breaks). \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/selector/lexer.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ae47512d2e308e83759de9cae94796747260f8aa5ebbeade241622e18c7230"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): improve location support, for lexemes in particular \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/selector/lexer.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64ae354c5a001605a3a95465c2e6d8c11fddd7db1c0ecf3e3fd0b4baf65c7a9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): support quoted strings too \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/selector/lexer.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16108371dfc31c61d02eb28614a6efd443e507611e66483ac92a44a314d4474"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-4178): Right now we still assume that \u0060Selectors\u0060 have to"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/selector/parser.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"449b80e6e40ee19f695a4a35b451535d756a73cf81f3b05e4f1071709c3c9419"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): For now we define \u0060map()\u0060 as an \u0060Expr\u0060 in the tree. The \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/selector/parser.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddf4d62eba0cdaabd0451c06eb323234e8228f3dbb497d71ee6d6ad2ced6695"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3438): Add error location reporting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/src/selector/parser.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"96cc6822ec3d2f65280806ff106f712af7b0f779d57194fdf824a7d7502b0508"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): This is just an example; \u0060string_prefix\u0060 itself should probably be \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/src/runtime.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1eab850fbae02f65ed31d65f788036090121ecb40aaf3932982a0049a81e3b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#11098): these should be part of the \u0060TextLog\u0060 archetype instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/src/semantic/ros2msg/log.rs"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4848e004638992c04090240792237033ccfa872ce107adddf98d9dfb1955de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(isaac): support also \u0060magnetic_field_covariance\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":"crates/store/dl_lenses/src/semantic/ros2msg/magnetic_field.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b71ff791d2c6af945249ca8524fee8576b2b54118a6de62cc7e9b853b858722"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): This should be something like a snippet / backwards-compatibility test, but \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/tests/test_mcap_importer.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9566482f344dd46709ac7e105ed6f2d079992b33ff37649072b19dd3b72c188"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): log these once heuristics (I think?) are fixed \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_archetype.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"079ddd024e085e31f75b7d747876f9b1db1d3a2f7688c62d9f0aff1489436d24"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#4532): \u0060.ply\u0060 importer should support 2D point cloud \u0026 meshes"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_archetype.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"b41044f35dcab2a1163f69b083769ec4c1bcf0f158bbe799fde7028b9cac6532"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#4532): \u0060.ply\u0060 importer should support 2D point cloud \u0026 meshes"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/lib.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"3deced6e3aad3d9de8452efa1023e0fff66d08ebd50e74c97c96d4cf0f108822"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): There are a lot more things than can be done be done when it comes to the semantics \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_directory.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"02134ff55f8f3315dea87c1b4899be009a3ff7543b0037c327c83d7ec7931272"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): This could make sense to implement for e.g. archive formats (zip, tar, \u2026) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_directory.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"559cdc34392108a5997dfc2da9a8681f3ffd541973004bd33edecc0a6e88f52c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#5324): You could imagine a world where plugins can be streamed dlr data via their"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_external.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"27b8ece7934fb270654705bd6a66b819e0701e6b75c4032e23664ed3dac88557"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#4525): \u0060Importer\u0060s should support arbitrary URIs"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/lib.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"61084235849bb7d4ba1b615167e0c8f659d39b6f8c553061e04ef4613f4ae1fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#4527): Web Viewer \u0060?url\u0060 parameter should accept anything our \u0060Importer\u0060s support"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/lib.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8f7b8dc2477fcff13235ae214fe678c249166f096863b1428efccd45849bb1c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#4555): Add catch-all builtin \u0060Importer\u0060 for text files"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/lib.rs"},"region":{"startLine":619}}}],"partialFingerprints":{"codehealthFindingId/v1":"6964b9a86719f4ec91b43c2adfa05bde0c2e69daf5cfa161d54ffd8b6c41a43f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(gijsd): Need a better way to handle this, as this only supports the default. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/lerobot/datasetv2.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a4a2393d00f28dba3a50a5e3dd26e0d754ff45e2f3cdf257fe629320266155"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(gijsd): Need a better way to handle this, as this only supports the default. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/lerobot/datasetv2.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d8beb192b39d06e9a3fb511f4c3bf6c1f5f390f947199d1d78ef4b8a0309e94"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(gijsd): Need a better way to handle this, as this only supports the default. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/lerobot/datasetv3.rs"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"650cc9b0aeff10061f5a45904a21018d74644492aedd7981a186589efd0bf0cb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(gijsd): Do we want to stream in episodes or tasks? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/lerobot/datasetv2.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a2cc6ae0bb1764fc07c1bd910625f189dd294bb7158ee6f03c323641d0077a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(michael): consider hiding collision geometries by default. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_urdf/mod.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6bfb4c08853036549e1a3bf4d29ce0dd31b638e0bdd8d1e1e23ce7278a0edaf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6541): the viewer should respect the \u0060Visible\u0060 component."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_urdf/mod.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"00a0fb39e6f412ddcf5f92639d8ede0a249ef7528d7aea9c32b73108471f5094"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(emilk): create a trait for this, so that one can use this URDF importer \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_urdf/mod.rs"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ddae016e93355c903df1b21ddfce53a4339cea34737c185a7aa1d32026efee"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): support textures \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_urdf/mod.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"e299a8615b5d0a3ecdc88dc539089ffb43d29b0f1a8a899712b12cb8e97a5742"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): is this linear or sRGB? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_urdf/mod.rs"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"f40d6908e84e92a81f6cb242062f550ab643aac24cb318651023da97942357ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3491): We don\u0027t need the fallback logic anymore; use \u0060OutputMode\u0060 instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_mcap/importer.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b60fe1e57fa4f1d05e989b3c91773e12cb4e877b77193b3b687bdf109896cfc1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(michael): this could be implemented as an \u0060dl_mcap\u0060 decoder if the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_mcap/robot_description.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1c7b76d0c905ef8e7787d72f443ce1b2e53b218deb132fcbb5834bf4cfb15f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): the same exists in dl_parquet. Consider reuse? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_hdf5/src/config.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"52bf2856e05427129ac51bb703a67e77a4c7a38eae570aa3bbb8a123720d0ab4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): support compound, enum, array and object-reference types? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_hdf5/src/convert.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcacc7b8acc7c31e6f9befc343e7814825851d5ee04da4bc8103b79ca4e445fe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(RR-5285): derive string estimates from the heap references\u0027 exact lengths"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_hdf5/src/convert.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d6616b486ad8dbf266e791d35719e57c62f76e5befc1b851bcd70c1e539f08a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): these type-based error variants should be replaced by better error with context. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_hdf5/src/error.rs"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb0e500a276f6b08a3cc4fb0fcd833d94509495192b6e87cac4d9d62ec13e93"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): move into \u0060ServerOptions\u0060 after the patch release. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_grpc_server/src/lib.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d861935fedc58f8dea03742999be44a8b5ad319af439b730db79560870f90d8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): move into \u0060ServerOptions\u0060 after the patch release. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_grpc_server/src/lib.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca462607c7197d1e42500b529acc81801b6c248ff4d9f293b9d3e7932c8e7de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): rename \u0060history_limit\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":"crates/store/dl_grpc_server/src/lib.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"326bf075ba4794ae0e46c711a878fbf20f64d6da07e31296423ca723d9e1dc41"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jan): Refactor \u0060serve\u0060/\u0060spawn\u0060 variants into a builder? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_grpc_server/src/lib.rs"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccc4b24d521fdea47f0a7b5d59039104b266e468fe1e15c0624b21533970573"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(rust-lang/rust#130668): When listening on \u0060::\u0060 we want to listen to both ipv6 \u0060::\u0060 and ipv4 \u00600.0.0.0\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_grpc_server/src/lib.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"5130855a266b1c3fe965774c9cbc8eb3925e71f398ac9d20a35f3675277696cc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(#5531): replace this with \u0060ChunkStore\u0060"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_grpc_server/src/lib.rs"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"35feb1cae5965b542e58753d3d7085a3018bdd6350e5614716c4a2f3cdd75d05"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): this could also use a size-based backpressure mechanism. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_grpc_server/src/lib.rs"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37b1eb25948fc21514d32acdd06ba6af840c843e3b780052a748cb552e55bb2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3869): specify size in bytes instead of number of messages"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_grpc_client/src/write.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"75e1ae38f889480dce3dbf2dc089cac26d4b4736795785f318f303fd0f0f49c0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(emilk): move this state to [\u0060ChunkRequests\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":"crates/store/dl_entity_db/src/dlr_manifest_index.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f13916dfaa38c4f0ed4d7070abdf38638a104a94a254cff94b1d5fd6de1e18"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3670): Check that connection is healthy and pick the correct icon to show the user based on that"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/entity_db.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"079ac4192b8cf27d3d1e1b8c2be6c1c4390b979d0c3ebd9552d644dd3d837be2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): chunk.slice_time_selection(time_selection) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/entity_db.rs"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"14423255e2383177f7280a6db04732941002f6c801f0f24a32ad3b0f31f1a257"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): Coupling this with the stored file instead of injecting seems \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/entity_db.rs"},"region":{"startLine":1086}}}],"partialFingerprints":{"codehealthFindingId/v1":"863f1ade3a37d6ff3bddd4a466ef7b70870eb7581b4b473b1bac116ebc065eaf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): maybe we should use a special \u0060Cloned\u0060 data source, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/entity_db.rs"},"region":{"startLine":1116}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f4c6182e9cf9a475f62ef92567bb820c38f81532118787a9f1d0738410e975"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3800): verify size estimation"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/entity_db.rs"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fcaced45a9ab64416cdc4d45b97c57fe91586e404f215391af1d22b5c820b12"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): use first, last, or average over all row ids? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/ingestion_statistics.rs"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"3768b3f18f9502109fc5adfd8484c59d369ef99ddabef15407a5fdfa83e7b30a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): If the blueprint doesn\u0027t exist this probably means we are \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/store_bundle.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"88761bd71a945efc133c2d1ff5c7f27278a55e6ba48d7a3b9b26f79c2d5a9901"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3344): improve this error message"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/dlr_manifest_index/chunk_prioritizer.rs"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2ae7934b2640c34f544e336b4591571e2ef46ea3fc26737c82aac35f6a88607"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): handle incremental ingestion \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/dlr_manifest_index/sorted_temporal_chunks.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"c903b8b8bbeab72ed9868fe9a74c6566e858b4b5024bb62486fdb0bfb14d5929"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3157): ideally \u0060DatasetView\u0060 would let users select components explicitly,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_common.rs"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"940f311390dc546b6e259e665f6bdd3e1e81f54dda901073a94ca79630ad93a0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-4607): This is a temporary fix to minimize the impact of leaking memory"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider.rs"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"218014f9fd933cb3508372b0db00ef2d1a138d0530ccd4b20f51a8a7d9cc6c37"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): deduplicate from SegmentTableProvider \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataset_manifest.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a143972bba4d86e6b6466efac8fc4deb1ace6fb76126f51aac3bb2ac64c7d3b8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): what \u0060GrpcStreamToTable\u0060 attempts to simplify should probably be handled by \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataset_manifest.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc3dd340e680a9052fad07ea427ff73cb06d44ae5c9503c3ee08809627f35d81"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): what \u0060GrpcStreamToTable\u0060 attempts to simplify should probably be handled by \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/segment_table.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f7d84c0a80a5c8dc627996a3290986a661c26449e772a94551cb6c379a5fd4a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(ab): deduplicate from DatasetManifestProvider \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/segment_table.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ade25d58e0bba8e082022f03ab88310a238c6016ea08b04b4cde1ff7b9d8176"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#10781) - support for sending intermediate results/chunks"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eedc88a8436db6892133f8bf3beec9b62467c2e46d23d106d7e73ea737b0bd0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): (no specific order) (should we make issues for these?) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac8ee9d203d05ba2bd6def7701ecec27480fe18923022d3008db264e82efbf2e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): Going through the cache is very useful in a Viewer context, but \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4d5f4ca568c4c9fad1d770880bd4b77b16ef836c22bff60538991cce7eca895"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): That\u0027d be more elegant, but right now there is no way to \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"164cea2272d4ff8518c2f5f7c8752ea8cea7584cc4e8e36a7685f99b61e2e760"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): no point in slicing arrays that are not selected. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":1337}}}],"partialFingerprints":{"codehealthFindingId/v1":"363326004248d30c277df29c1b0c38a7baefa00612333ec252f6137f5139c346"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): It would likely be worth it to allocate all these possible \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":1387}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb3354bbaa14c3350261e20e4a9ff172ae6b2254a93d9306f8c9409eb14cbc1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#9922): verify that using the row:ids from the first chunk always makes sense"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":1395}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2b1cc4b84c8f25b9945b6980ea73ee820099b834488e16efcdc18501087982d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): Because of Arrow\u0027s \u0060ListArray\u0060 limitations, we inline the \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":1496}}}],"partialFingerprints":{"codehealthFindingId/v1":"590fba2f28ef0fa8354e02d2487ffc234fe06c6b7716a9c0af2f9f154c2e7739"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): Still, as always, this can be made faster and smarter at \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"2244f1e879e26d28ba283b5f91371687b7fa62f34d7732c5c62ac3bba66d3f56"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): In the future, it would be nice to make that either configurable, e.g.: \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":1636}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2cae60a7c35dd45b83c16f88e0b441637ded94c0e4b5946c10ee5b23678645"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#9922): verify that using the row:ids from the first chunk"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":1887}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a8c72a00e2d2e9628a10129e51295c331be756d4dbed10d19c571184a541afd"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): at least one basic test for every feature in \u0060QueryExpression\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":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":2567}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0b5b1e992f4b98cc2de9dc73d2171cc9ef174281b8103f20d22e47969e12a87"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): At some point I\u0027d like to stress multi-entity queries too, but that feels less \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":2584}}}],"partialFingerprints":{"codehealthFindingId/v1":"3793721edfe4a63be8529de3b8e03780904384e74d5a1682328a72f056e5aa91"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#7650): Those null values for \u0060MyColor\u0060 on 10 and 20 look completely insane, but then again"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":3301}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d0e204f196068f36261202d1a57ff838912aa3409f377387cbd3b6c4b7cfd58"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): there is a lot of overlap between this and \u0060ViewerOpenUrl\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":"crates/store/dl_data_source/src/data_source.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"f988e191d4f80b886c0a6f70488d58c05844cc8ecd3f7918727dab04bef1ac04"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-5034): Once all loading goes to the internal catalog unconditionally,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_data_source/src/data_source.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9f565af18c3cfcf3379e3897c554c94967fd67e45a5e746da65fca413fc9167"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-4328): we should improve this by exploiting the chunk index, hopefully making it"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/compact.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"5856b33eb03c030c52a067457d6ab0c500e77e45642d91803e171730b72e6eda"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): \u0060LatestAtView\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":"crates/store/dl_chunk_store/src/dataframe.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"11892c0974a5d1ca8684f07c83af4170588bcae4acc0ba2a7aaaf23ca2eaf28c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): we need to be able to build that easily in a command-line context, otherwise it\u0027s just \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/dataframe.rs"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"030eb8a3ef7f73208f1afbc93a26d89651e4e8118763117beee99c0db33096d1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): Ultimately, this shouldn\u0027t be hardcoded to \u0060Timeline\u0060, but to a generic \u0060I: Index\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":"crates/store/dl_chunk_store/src/dataframe.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"10c45248054c955467560e493264816fbcdcce9484daf527893dac86aae0958a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): Ultimately, this shouldn\u0027t be hardcoded to \u0060TimeInt\u0060, but to a generic \u0060I: Index\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":"crates/store/dl_chunk_store/src/dataframe.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f4f5e2ad98109fb14ef2dfdc34515674c2d33c27791b8050dfa24a31f5b6ab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): Ultimately, this shouldn\u0027t be hardcoded to \u0060AbsoluteTimeRange\u0060, but to a generic \u0060I: Index\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":"crates/store/dl_chunk_store/src/dataframe.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0f1bb62085332ac1f90f2c32b6e5814d6ec7a4bb17a03fce05b0837fd2177a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): ideally we\u0027d like this to be the same type as the one used in the blueprint, possibly? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/dataframe.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a17f4cbee6196e50007041f7c79eb2f9bf929b64ca9a540da1e6cbf9777cc977"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): this has to be a selector otherwise this is a horrible UX. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/dataframe.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d51590f623084907904a80557b882aae11ce55acffac93c8dd0ea064b8bbb1c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): multi-pov support \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/dataframe.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f3caf825dd0777846b0a6043d0299ed3c42a920e651e4b12c259ceeb1c5be9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): the selection has to be on the QueryHandle, otherwise it\u0027s hell to use. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/dataframe.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2920f0991e5b8b609511b3b26fc7574133752065df1155cf42e7d8748bc4ece"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#7699) This currently interns every string ever queried which could be wasteful, especially"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/dataframe.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"2511816320317c7043eb0ea0062839d55865d22fcd429f1c38822ce46068617c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(jleibs): More complex functionality might required expanding this to also \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/gc.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"65eaad3604619c453445525442807ab762c31e796a6171f76ecfc9b1c6138377"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): we would very much like that to be iterative or at least paginated in \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/gc.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"463e659e757e4c04b913d2504fe30087ba28275fb8e91a9701035f07c23e1bcc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): Technically, the optimal thing to do would be to recompute \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/gc.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"8899a0295b7b0bc04b753a086de2a2dc8e7898c6ba5e779b9d85de31ab3bb709"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): Technically, the optimal thing to do would be to recompute \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/gc.rs"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf59a41647e3cfbbe8c1372ebccbdd647a252820631f6d4fa6b1650ec5b4c18"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): Technically, the optimal thing to do would be to recompute \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/gc.rs"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5c7792360ee2412e6fc5b5266c069341990374ec6df5829e06ec26516fc4ed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(RR-4503): caching support."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/lazy_store.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"7994043dcf593013f776458313138be53b4fb64c72d0ca05a9701d1f5becaa65"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(ab): move these ^ to a better place. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/properties.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f58cab236135e6b8d9a62b3c6f0565321bea274dae83edb7ac8dc57ec23fec5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(zehiko) we should be able to get static chunks without specifying the timeline \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/properties.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efb3add2333e5da36d460cad37f94be71559331ed1cb6646d9f81267ba91d0b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(RR-2041): clean this when the upstream issue is resolved"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/properties.rs"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a10ee791ffbaa6253ee512373700307b65e61bbd7ccd1f9536a6af3023cfbe"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): speed up the measurement of the slow things \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/stats.rs"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5412b84948d496005928408a72e24887d038345920ba6f5afd80fbe6ecc0cfa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): we should be able to turn on/off merging and splitting independently. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/store.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"940063fd29d951c6a0960c67b0a1bbd5dfde5e603306a2bb161f3ae245d3b3d3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): It could make sense to have time-range-based thresholds in here, since the time \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/store.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"66143b096974088a443f5ecdc41c89df63b0485d786002f9277cf0cf1eaf3346"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): offload the decoding to a background thread. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/store.rs"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"3722f0f62782a4e4b0450cdff79b4a33909b3df1751d29ea5c48894a0575247b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): Can we slim this map down by getting rid of \u0060ComponentIdentifier\u0060-level here? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/store_schema.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"286aa5b901893298282ffbb50be44e5dc1dad014bb97e4c36ab9c272fa2d6dd3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): If we encounter two different data types, we should split the chunk. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/store_schema.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee84166092e79067f61a210e9e9803214a641609d31f583872a491c729b3e1f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): Not sure why I need the extra Box here, RwLock should be \u0060?Sized\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":"crates/store/dl_chunk_store/src/subscribers.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2213e62eb884404fe738bdc95830096b7b0258ac1b19d3e1c1edf9258de3ce"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): send a compacted snapshot to late registerers for bootstrapping \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/subscribers.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"f873ec210753e5d0565d401f9b22fe22cca394a115fd3bed76761b92c4381555"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): might want to parallelize at some point. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/subscribers.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3bda1119b680ee35490fa9dede7c8b69256237b695026e5346b6bc3b62c210"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(RR-4887): we should NEVER delete chunks"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/writes.rs"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf13a30fd0449e6fa29d7deb04ba4ad771a35668218a8f0ebf3ab3fc5054c96a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): We could have more test coverage here, especially regarding thresholds 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":"crates/store/dl_chunk_store/src/writes.rs"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f73f3f3028c40edae0645981b00a5f76ac8167c3d2fb5bda61ae62dadb445b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //TODO(RR-4887): this test should no longer pass with this issue is resolved."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/src/writes.rs"},"region":{"startLine":1674}}}],"partialFingerprints":{"codehealthFindingId/v1":"41bf9ec325c7d24ef09267097fa8e453a55161c4fd18b716316283f0571f76a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): This doesn\u0027t have to take a full descriptor, but all our access methods are using descriptors right now. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/tests/latest_at.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ce01aa5801818cce894f2d2ff75d76c4bcfa0aaeac4f0966f72a7fa38c3998e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): This doesn\u0027t have to take a full descriptor, but all our access methods are using descriptors right now. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/tests/range.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cbb71134e78dc457812ae943e847ef81d28dfeaf5e19951f83870d1330d144d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): That\u0027s the end goal, but it is simply impossible with \u0060ListArray\u0060\u0027s encoding. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/tests/memory_test.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"294e9998a29771829be81217a9ddefd9d57c850c1ad5d514f9170e83283a7b95"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): Add support for burst debouncing. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/batcher.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67af7be12fc34ee3ec2aa792ee95649e7e15eb2db6ed3a496b0569cd0ea5296"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): It would probably be better to have a ticker per entity path. Maybe. At some point. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/batcher.rs"},"region":{"startLine":751}}}],"partialFingerprints":{"codehealthFindingId/v1":"076f5ab82b1fd7ff8115db0add3d47e6f62374492990e0d3d63b3246a97cb927"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): there are lots of performance improvement opportunities in this one, but let\u0027s \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/batcher.rs"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5aee24c86d3be2593174f6e3dba049aedc15d8525b54a5592c03c0cdd6c5f67"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(andreas): Remove this variant, we should let users construct \u0060SerializedComponentColumn\u0060 directly to sharpen semantics. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/chunk.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"80856051dc82f1c6c692a1411c991f6158750f6081a13e4fd732ffd624414330"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(grtlr): This should be revised when implementing caching of mapped chunks. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/chunk.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"db81038b1623a63e9e567a61852e7c9e49a8db727c0f7e7fce51120c74e00f6f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): This needs to be stored in chunk metadata and transported across IPC. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/chunk.rs"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6006b302c37d47559d5baa44bfcd6c2e51357105ab24185d0119075c936c008"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): This needs to be stored in chunk metadata and transported across IPC. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/chunk.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df90f41bc30cc558866dfa83021651247b72a7cc0b5f638dc859581187c3828"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): This needs to be stored in chunk metadata and transported across IPC. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/chunk.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"d857769bcf612a9e3630aaf208d7109206f04b3b3567131fc82672a141a47353"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): This needs to be stored in chunk metadata and transported across IPC. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/chunk.rs"},"region":{"startLine":841}}}],"partialFingerprints":{"codehealthFindingId/v1":"a74cb629369ef6099dc0a8cf157e5ac2dc82a6e318327e8b618c35be22208f47"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): This needs to be stored in chunk metadata and transported across IPC. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/chunk.rs"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c9fb49ae2da950a3473cfdd1657d5d0282307d8592dd89716bad317356db32c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#6819): Remove support for inner nullability."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/chunk.rs"},"region":{"startLine":1891}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfed9b856b50558888ec208edc3a02f159871e198a04b7f78a9d10841c86d19"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: /// TODO(#5305): Note that, while this is much faster than deserializing each row individually,"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/iter.rs"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"e520af05d704aa656e64ba85bd343e2171e92228fa9de9dbcea800dfb1aa3560"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3865): Use arrow\u0027s \u0060ListView\u0060 to avoid cloning data when the chunk requires sorting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/range.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a7b3a61c95353e2ee7e328b9391c6630df4467245d13288bc1b1ece3c87ae4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(RR-3865): Use arrow\u0027s \u0060ListView\u0060 to only shuffle offsets instead of the data itself."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/shuffle.rs"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d2aab9e3bd1609d3b9d6d862314464d814980d4382c0e7084a715338919042"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(cmc): \u0060Timeline\u0060 should really be \u0060Index\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":"crates/store/dl_chunk/src/slice.rs"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"c125d9138157db5560b5d3bf3b74ab685efe2b04ec6c2ae6eca5723833d2e31a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#8744): this is infallible, so we should not return a \u0060Result\u0060 here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/transport.rs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"983df523e8c26e526566e9d45611ee3f3c2891bc80627f54ef8d59a68e30f2a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#8744): this is infallible, so we should not return a \u0060Result\u0060 here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/transport.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"1db07709575552d71bf724516af9a52f9c2e2658043983fa97e532e8fcca6fa2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(#8744): figure out what to do here"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/transport.rs"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35af4532cb824c753b5b1d3640faca9b4ad6d818c2106d08cd6112255727f24"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): consider adding this to \u0060Chunk\u0060 directly, perhaps as a \u0060Vec\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":"crates/store/dl_chunk/src/unit_chunk.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"8200e3a6f69e1ac510d29dc3b9ddb18a86c0744292d807887d6cad5059dae6c2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(emilk): this is infallible, so remove the \u0060Option\u0060 returntype \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/unit_chunk.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61a281afe4d905e67bd9783684f5d73f66ddf339a1343b0b91b610662a55d89"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_chunk\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/store/dl_chunk/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7aad5c34ad8f2b9c595e2321597d3b6650dfce21d6cb3f5fd907fe46f5b125b"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_chunk_store\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/store/dl_chunk_store/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk_store/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4a955bfa4d3c5c3ecde28d96839a2b553815f791efa4ca3bd51164a4cd27be"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_data_source\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/store/dl_data_source/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_data_source/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb388e1350686a6877f012044af20ea4c263a16d20368c20b55fe428fe6c9237"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_dataframe\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/store/dl_dataframe/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a59620f507e73095ef8382a0958dda636f708c4a9282f1392b1d4b01515f85"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_entity_db\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/store/dl_entity_db/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed94af38fc67061b7d4dc89b0174dbca963f0b7ab81782442c909edc0e4e2cb"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_grpc_client\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/store/dl_grpc_client/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_grpc_client/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"01327662a3ce2d04f6c85d2ecb206097ce477f256268a2ab686463a695a308ff"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_grpc_server\u0060 is a binary crate (\u0060src/main.rs\u0060) and neither \u0060crates/store/dl_grpc_server/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_grpc_server/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"baedbd73c003d3ed0993c3527fca5da75f7013d9a9ac4616824e8f4942d6bab5"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_hdf5\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/store/dl_hdf5/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_hdf5/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"791edbb67b054e16fa74e13d361e655f95f7fddeef59ed49474d5137abef3032"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_importer\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/store/dl_importer/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5824169a95906507ac3a634ca49414d3ea94d811e515d9416cb153c6aa59e058"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_lenses\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/store/dl_lenses/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ebee0af2ac4a2aa38fe72c1f089ede70e075b037cafc5a34c3e78adbbde35e"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_lenses_core\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/store/dl_lenses_core/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses_core/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc58533686f80cee3dff89e6cee06305e5c95ba5fd3162c60d7284ee7c244784"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_log_channel\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/store/dl_log_channel/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_channel/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"72950f6a200f23d936cbe2b38d0ce5a9e38e234ccb0b3efcfe959579f6481a71"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_log_encoding\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/store/dl_log_encoding/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"700f45453361ef67032195b99811422b0e58875bac955b72eaf4af0ca231e57b"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_log_types\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/store/dl_log_types/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1905eb5d2077dae63d97c081600da360c2876da66bcd61579fa01b3342857ee8"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_mcap\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/store/dl_mcap/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6352a53c511ef26c0c29304880682309c2c12c6eb18e6bf3c09246b66bb7f47"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_mp4_reader\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/store/dl_mp4_reader/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mp4_reader/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd810b1707e5c34fb884ae41c753b84cdfb507368cabae2bdde7635d36a978d"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_protos\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/store/dl_protos/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_protos/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0803e4d3d4e8c37a01f9f87e85300f61033b0896fa39893c98277a30f7d036cc"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_query\u0060 is a binary crate (\u0060[[bin]]\u0060 in \u0060Cargo.toml\u0060) and neither \u0060crates/store/dl_query/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_query/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb8e28f7ec344e7c6abbf140abbc408c4e5061c3b4b76be798966c1414dddb01"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_redap_client\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/store/dl_redap_client/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2dc9cac43cffe32ef05d9cb4bf09d6fab2d1f1199ee198df178d052f90d598"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_sdk_types\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/store/dl_sdk_types/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sdk_types/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c143b20abc8b12ab8a94b820fb5c76c50f75a1fcd0b42eaacc5f17ca3834b4bf"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_server\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/store/dl_server/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7382e1d3e6b438b0d9a8413ed0240bc29961d9d5f4f6bbfa4a1ce1f6fa4557b"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_sorbet\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/store/dl_sorbet/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sorbet/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c1a734bd9895c71054d7b2b6faa3fd81df0a4206bf31ecb07db925e677f46b"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_tf\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/store/dl_tf/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f8720d9114ecd3f88e5244457dd4348dc8b02ac7dda5882764c41d09c1e060f"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_types_core\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/store/dl_types_core/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_types_core/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24907dad6beb5089fc8c255d0d0aa5de113b654a552cb6701a9e8ff32034ae0e"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_uri\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/store/dl_uri/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_uri/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92093ca99ee4c42dfac364a2d6e3f955de2dfbef87ed91a16571b7dbdc6ae71"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dalaran_c\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/top/dalaran_c/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran_c/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57ce542a3dbf34d5a089e5cd9d78b23a0a5d48cf6030aec68841bf0ae3874591"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_sdk\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/top/dl_sdk/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5e29ce9d1d127f98a978204ecedd1730d1a8a9c82fcdb74e0413a2a9c5a73a0"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_analytics\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/utils/dl_analytics/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_analytics/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e08a60407406d33da5b1b55037a3aa135cfc46edd1da6fc9d181222c45eee423"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_arrow_util\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/utils/dl_arrow_util/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_arrow_util/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"299adc0de18f8f84916feb854df583de0a27309c6d2f99489111366d83408d1e"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_async\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/utils/dl_async/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_async/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a448abdbe300cf1741f5afa77bcd147eb1725cd57a38df8114aec8f56e9df20"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_auth\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/utils/dl_auth/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_auth/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"11976d27b3670c64cdc56229935e5f2ece97b022f04c47d7ac9cd16ce37e0d2c"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_backoff\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/utils/dl_backoff/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_backoff/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8414eae44169331418d5adc91bc9bc7acaedebb11575b0c604318ab1e955eea2"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_byte_size\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/utils/dl_byte_size/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_byte_size/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d572060de98b8303974e8dfdc8158d14173eaf9760994e0017972d4ff551c58"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_byte_size_derive\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/utils/dl_byte_size_derive/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_byte_size_derive/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"715f464987aac96382f89fb0d11d237119b32c7b501fb4b2259d87ecc99b416d"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_capabilities\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/utils/dl_capabilities/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_capabilities/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a8e19049207ada5235963fcc5275e0220219b97f166478f75c309602d71ecde"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_case\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/utils/dl_case/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_case/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"555b92133e4b3b96d4541d1c5db73349382fe5e480e290d93b5e89c64e40d61e"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_crash_handler\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/utils/dl_crash_handler/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_crash_handler/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86bee01354b47a227d646d48a8c35a14b9a6575b25cb4d1949cbf83c142fbdaf"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_error\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/utils/dl_error/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_error/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaea1cac542fe08eaf71ac93e8d8d78534e16287c3992c5a3639c1f581e4032c"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_format\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/utils/dl_format/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_format/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced9d7ca7f863c403260ee802c36d10cbed547822316435ec9f0dcfc22490cc7"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_grpc_headers\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/utils/dl_grpc_headers/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_grpc_headers/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7adf0922b3e8266e36c917f439d9ce05a277aba533acd8429e14ee2ace70299d"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_int\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/utils/dl_int/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_int/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d322afae00026fb40b3c0b2dd23f9e5f2dc192846152f4e87a7078760a573c4"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_log\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/utils/dl_log/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_log/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ce67a035ebd55281961436e00a89ced68664b4f797f42d1c55fbc9f2363010"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_memory\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/utils/dl_memory/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_memory/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bef0273572016dc5032b9afbe26fbb777f179ffb421919733268e91fdc7cc6"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_mutex\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/utils/dl_mutex/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_mutex/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f07bc37be8ae8e8c576b1f1009470f89a072c19eba2e57158fce0322a9a29a"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_rvl\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/utils/dl_rvl/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_rvl/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"864b6aa644f72804a5424e344ea9ce49e8999213d57590441f53f79cdba5efa4"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_span\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/utils/dl_span/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_span/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1548d9cc909db90edcbe14779a22bb61c5b3a55dfac67a6ecfff96ca06671099"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_string_interner\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/utils/dl_string_interner/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_string_interner/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b23191ab25d073797c4237424f434d1b045bcca156daee0ec72820a47948f247"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_test_mocks\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/utils/dl_test_mocks/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_test_mocks/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4050aeef6f4ab96600e7d1fb63ca10764e8d50808b2a2d04d92117fd292f0931"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_tracing\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/utils/dl_tracing/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_tracing/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ccf2db9f1507961667efe70af464fa1ac7f05fdfd58e2449c331de511bf2eac"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_tuid\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/utils/dl_tuid/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_tuid/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"94b888700c6da23187b1fa68b6435e208bd0df9b27db07db15b9ea41b1c9e501"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_video\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/utils/dl_video/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c5738b09d60609ae9806d405a681479d919929acecd9d469c63d1e0d9a9864"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_web\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/utils/dl_web/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_web/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5439a14251eab971f0a0b08b3fae9e8a188cd07bf942f6786fa4a0621199200b"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_arrow_ui\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_arrow_ui/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_arrow_ui/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9eeba2f6acd0d76b8dc5bab9561f7a74d06053aff4653400a26c0d8e0377fce"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_blueprint_tree\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_blueprint_tree/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_blueprint_tree/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"49db75bd9490123a8f983ddd39d35a3883bbcf2641fa3aa26d89c0022cce68f6"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_chunk_store_ui\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_chunk_store_ui/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_chunk_store_ui/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3a24e79d1756c434d8a50f3d39a1a30560f424389e88acf7b57e80641ecd8b"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_component_fallbacks\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_component_fallbacks/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_fallbacks/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f2908fab79d37bc280f0d926577d441f259257b33ca331b8f43e3c6ce046c43"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_component_ui\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_component_ui/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6586540f68467deb4d43bbd74eee1f9e5f5b4f457812a8a165797f22ddfd60df"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_context_menu\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_context_menu/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_context_menu/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de82e8f90bff5ec3c146e672755cd9e714020401239a44b2c7102c03d1579f60"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_data_ui\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_data_ui/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aaef44b195338d372400f1fca1c65df011ce8935da6b9d26e0c8238b11aa017"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_dataframe_ui\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_dataframe_ui/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d2c933c3b097af726add7d7ea1b26a1b75a9dd3121b4861e2418f3226328f3"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_gamepad\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_gamepad/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_gamepad/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e0a799448d381e7f4270176326b53f20d86d969b5c3709a907c636ffdc31867"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_plot\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_plot/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_plot/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7be5b0d25789c005e95a851983e4f5c9f7748b7017e20a5c2e59af07c3e5ef41"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_recording_panel\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_recording_panel/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_recording_panel/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"348fe94c2334ce02938cd23352c7fda3e2e50950269b4d9c0f6dd68007b44214"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_redap_browser\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_redap_browser/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_redap_browser/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"943eb829329ded649afcdae4a32481548f9ae19b472b6a2d63f5e9301f847b4b"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_selection_panel\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_selection_panel/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"019f94e85498e1747ad681f151db565cf7d7c29a5234bbbac6c6c7e55beeb366"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_test_context\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_test_context/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_test_context/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4fc47e4d5116951a3a0ef4cd9171b43b626648c393544bfa27e62a3393325f8"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_test_viewport\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_test_viewport/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_test_viewport/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8c54bdbf4d5cf3daa6bb4d85f6df3b63dcfd5f58dc0dc1212bf297230812d5a"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_time_panel\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_time_panel/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_panel/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"196b2abaec7e10bad116a6a732dd277ddb5192edf588600a1319ebb067e60d48"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_time_ruler\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_time_ruler/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_time_ruler/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c971d693ac53dd186ca2f2c461cb2ce59802823ef143385d968b886d5f32c5f"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_view\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_view/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b83252bc1fa3fd63945e3addd1785b69f9abd403773290eb450dc6b45d21cc7"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_view_bar_chart\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_view_bar_chart/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_bar_chart/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af1af416a870a1ba105b04fcebfda0e352733a80fe0bab5a0ce8248fac39a3c"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_view_dataframe\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_view_dataframe/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_dataframe/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f0ec3d406f11edb94e5df8d6de7937aad093fb280eb64d060003e176cea766"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_view_graph\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_view_graph/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_graph/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8fbbec7d1c805ae7a791aba2814e53ed01a7b71f6cbb4b17c0d1652d3792c13"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_view_map\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_view_map/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_map/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8003e2148ee393249c87efc29ae352b84df41412716c38460228cb48a38e4711"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_view_spatial\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_view_spatial/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0a81a42c1dc09213aa174596e1aeb607e71913ec0c6c25945062adddfec81d"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_view_state_timeline\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_view_state_timeline/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_state_timeline/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a81dc8ed2e16c08b9a7b1822fbff8459995ce63f791391fcfb4656cfdfe9df"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_view_tensor\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_view_tensor/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_tensor/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"955b216b05b2d8423951140be3b14705d71b6a7a1827b0aa62d6144f5cec1c29"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_view_text_document\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_view_text_document/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_text_document/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5713313e12091815359219da803e3232a61b69ba958f858137c2af78779f5c57"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_view_text_log\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_view_text_log/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_text_log/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d00b5abd879900217484c7f0f19464e85c025bf4a9a2e2ddc9438c465d7ff8f"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_view_time_series\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_view_time_series/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfc46e60f7d8c0e56684c947e30ea71238e0b2085140bd19df2b7b98b7a92d2"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_viewer\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_viewer/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc9fa15095061f33aca8d137c03ed0a427a27ee12493b7a46e878207ea5fa23"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_viewer_context\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_viewer_context/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b51acdef5ef80513a5565e4bc64705814e20fd21340df341c5131c00704a383"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_viewport\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_viewport/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95706a7e002eb5a0b2c2f1d6057093b8d672a5a845c4764d70097cc065cc39d"}},{"ruleId":"D19","level":"note","message":{"text":"Documentation: no build, run or usage example: \u0060dl_viewport_blueprint\u0060 is a published crate (\u0060[package]\u0060 without \u0060publish = false\u0060) and neither \u0060crates/viewer/dl_viewport_blueprint/README.md\u0060 nor the documents it links hold a code block or a command. Show the command that builds or runs it, or a usage snippet."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport_blueprint/README.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f58d2bbac9504781f5a01f6e37c9a56186ceeb2de57c190f0cc012b332fba1"}},{"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 \u0060run_wasm/src/main.rs\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"run_wasm/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d85595928753d85f857f57065f0d920343e4309550d816890cd2b9067fd0487"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060do_GET\u0060 spells \u0060GET\u0060 where 78 names in the project spell it \u0060get\u0060: 78 of 80 names in project dalaran-workspace spell the token \u0060get\u0060 (78 of 80; unit: names in project dalaran-workspace containing \u0060get\u0060). Peers: dalaran_pixi_env.get_pixi_project_root (dalaran_pixi_env/src/dalaran_pixi_env/__init__.py:12); dalaran_pixi_env.get_scripts_dir (dalaran_pixi_env/src/dalaran_pixi_env/__init__.py:21); pyo3_config.get_python_config (dalaran_pixi_env/src/dalaran_pixi_env/pyo3_config.py:21); pyo3_config.get_python_executable (dalaran_pixi_env/src/dalaran_pixi_env/pyo3_config.py:90); CatalogClient.get_dataset (dalaran_py/dalaran_sdk/dalaran/catalog/_catalog_client.py:310). Rename to \u0060do_get\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_notebook/src/dalaran_notebook/asset_server.py"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf92e7afa2d41eb95e27b89efb0aa2238972b269565cad0d25b5f283412c6e34"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060_serve_GET\u0060 spells \u0060GET\u0060 where 78 names in the project spell it \u0060get\u0060: 78 of 80 names in project dalaran-workspace spell the token \u0060get\u0060 (78 of 80; unit: names in project dalaran-workspace containing \u0060get\u0060). Peers: dalaran_pixi_env.get_pixi_project_root (dalaran_pixi_env/src/dalaran_pixi_env/__init__.py:12); dalaran_pixi_env.get_scripts_dir (dalaran_pixi_env/src/dalaran_pixi_env/__init__.py:21); pyo3_config.get_python_config (dalaran_pixi_env/src/dalaran_pixi_env/pyo3_config.py:21); pyo3_config.get_python_executable (dalaran_pixi_env/src/dalaran_pixi_env/pyo3_config.py:90); CatalogClient.get_dataset (dalaran_py/dalaran_sdk/dalaran/catalog/_catalog_client.py:310). Rename to \u0060_serve_get\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_notebook/src/dalaran_notebook/asset_server.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c70388957f75268edf52898e9ecf606bb737429237d9a01e0478bf652f026f"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060dalaran_py\u0060 (43601 LoC, 959 module-visible types across 26 directories) overshoots its size bounds. 8 of 111 build unit(s) (Cargo, Python, npm) overshoot their size bounds, lowering Project Cohesion to 8.6/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":"dalaran_py/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef5a3dedec77049ce5d9447034aa7e8018d0391ef81f2e58d50b33d3a896c91"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060crates/viewer/dl_viewer_context\u0060 (22748 LoC, 204 module-visible types across 8 directories) overshoots its size bounds. 8 of 111 build unit(s) (Cargo, Python, npm) overshoot their size bounds, lowering Project Cohesion to 8.6/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":"crates/viewer/dl_viewer_context/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f48bc76ba61d215aeab54067cfb65a48404b363e24c743f30dfd12d7971f3f"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060crates/viewer/dl_renderer\u0060 (21843 LoC, 273 module-visible types across 9 directories) overshoots its size bounds. 8 of 111 build unit(s) (Cargo, Python, npm) overshoot their size bounds, lowering Project Cohesion to 8.6/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":"crates/viewer/dl_renderer/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c70cd69c8bc08c4c268744e57a01ab6d29ad0d75eb7954a9157a409dd69bcf0"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060crates/build/dl_types_builder\u0060 (18062 LoC, 80 module-visible types across 11 directories) overshoots its size bounds. 8 of 111 build unit(s) (Cargo, Python, npm) overshoot their size bounds, lowering Project Cohesion to 8.6/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":"crates/build/dl_types_builder/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7004a7711636501b0e1d09026414876224c6164b6ce1b18921f0891247e12e"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060crates/viewer/dl_view_spatial\u0060 (17523 LoC, 123 module-visible types across 6 directories) overshoots its size bounds. 8 of 111 build unit(s) (Cargo, Python, npm) overshoot their size bounds, lowering Project Cohesion to 8.6/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":"crates/viewer/dl_view_spatial/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"021e848200a3075dea43c602ce3df923c4c31b9a1bcf98574ab0caf9add4a89a"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060crates/viewer/dl_viewer\u0060 (17290 LoC, 101 module-visible types across 11 directories) overshoots its size bounds. 8 of 111 build unit(s) (Cargo, Python, npm) overshoot their size bounds, lowering Project Cohesion to 8.6/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":"crates/viewer/dl_viewer/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1103c71d8ddca82daeac2dcbac82ba89d0cefc0ce57bd759e61e576d96aa16"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060crates/viewer/dl_ui\u0060 (13494 LoC, 129 module-visible types across 5 directories) overshoots its size bounds. 8 of 111 build unit(s) (Cargo, Python, npm) overshoot their size bounds, lowering Project Cohesion to 8.6/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":"crates/viewer/dl_ui/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9037e7a6ed101ec989fe97e4379dc6f527f73a0a803f585da294625ddc3dcca8"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: \u0060docs/snippets\u0060 (10237 LoC, 145 module-visible types across 10 directories) overshoots its size bounds. 8 of 111 build unit(s) (Cargo, Python, npm) overshoot their size bounds, lowering Project Cohesion to 8.6/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":"docs/snippets/Cargo.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93bba145c0796760a4a07dce0205507b0af9f177e97669294febc9b54c3a2170"}},{"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":"ef6c27400d9d9c35496b13d9c1bebccd0d7f7c3804f77d1c0649bd2e74c6a9d5"},"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":"a677ba11631d8534017ce1521927b3d92e33a5119449bfd28bb399fd662bd5d6"},"taxa":[{"id":"CWE-829","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":"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":"85b6b4eed07aa6f2d06eff49b58f508958f03a9ebb804300bf8d374596c8a4a0"},"taxa":[{"id":"CWE-829","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":"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":"cbf837b037fea7e95f10b35f6cc9445054ff97a2327e4b5b8e4d2f7eed913a0a"},"taxa":[{"id":"CWE-829","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":"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":"6ed059458dc0d864f79fffc2c8cd3f09ac2213f256b255ba1e07734350228541"},"taxa":[{"id":"CWE-829","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":"2f853ae8c44e1ee1923cfdc798a129158ce3dbc6ee2eab13aece1eb0a512333d"},"taxa":[{"id":"CWE-345","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":"5210b1397c2474b8a61ee196832d53e8de78790eb92453857be32a250e47051e"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04: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":"95dec2da62a5873ea59228860363d59683f2166cc849df2184c73a067c562097"},"taxa":[{"id":"CWE-611","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"64f43d66faa7a7d83f20f7ada4ca1cdbea1cf0c217a355be4e3f3d48c6685e45"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"dc20e73ccfc3e625a8bb077b7babde74a2de3f176dcbf28c7055c828dbfed6ca"},"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":"f979bd1d1b1c92d64facdabe4328784b2a18b4836bc7571509948eca90bb2783"},"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":"5700cf8ee182fc440abb16030061d2e9976929eb60c880096208a514bc453b10"},"properties":{"dependency":{"package":"zip","version":"8.6.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0367","RUSTSEC-2026-0368","RUSTSEC-2026-0369","RUSTSEC-2026-0429","RUSTSEC-2026-0545","RUSTSEC-2026-0546","RUSTSEC-2026-0547","RUSTSEC-2026-0548"],"severity":"critical","fixedVersion":"9.0.5","relation":"direct","declaredRange":"8.6","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":"c15cbaeb817358b27e20894fdad10087da67d8a66f3c2b915b80f0961cf0d87e"},"properties":{"dependency":{"package":"anyio","version":"4.14.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-4023","PYSEC-2026-4024","PYSEC-2026-4025"],"severity":"critical","fixedVersion":"4.14.2","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":"c0ff3cf2195dd13209fb0a46ccf19c4e067e3e2b7a27d238fba64fdd9ceb21f8"},"properties":{"dependency":{"package":"certifi","version":"2026.4.22","advisory":"[GHSA redacted]","aliases":["PYSEC-2026-4320"],"severity":"critical","fixedVersion":"2026.10.18","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":"df80f1550918ca8c59083780a1ed9c5e9df2e24745b6426c1f00e5c1e07126d1"},"properties":{"dependency":{"package":"pillow","version":"12.3.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-112899","BIT-pillow-2026-112900","BIT-pillow-2026-112901","BIT-pillow-2026-112902","BIT-pillow-2026-114501","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]","[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-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":"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":"4461c22afce22b9ca06a20e5fc761e34b266837aa023c8c1550c9e0940044d98"},"properties":{"dependency":{"package":"anyio","version":"4.13.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]","PYSEC-2026-4024","PYSEC-2026-4025"],"severity":"critical","fixedVersion":"4.14.2","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":"6f38f0aadff936fd0515858c6d8357e6338ac7209e1f83b1ebd7da7d5c73207a"},"properties":{"dependency":{"package":"certifi","version":"2026.5.20","advisory":"[GHSA redacted]","aliases":["PYSEC-2026-4320"],"severity":"critical","fixedVersion":"2026.10.18","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":"e5c38c5a3ec702bf3355a341d6e666d21aeba27c449d0c23f3b3f2f0d0b3d90d"},"properties":{"dependency":{"package":"pillow","version":"12.3.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-112899","BIT-pillow-2026-112900","BIT-pillow-2026-112901","BIT-pillow-2026-112902","BIT-pillow-2026-114501","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]","[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-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":"production","file":"examples/python/droid_semantic_search/embeddings.py","line":29}}}},{"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":"5ed384055dc716a282d5e05d367f817795de1f0324f3b20b12b91701c74092f0"},"properties":{"dependency":{"package":"rmcp","version":"1.8.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0462"],"severity":"high","fixedVersion":"2.0.0","relation":"direct","declaredRange":"1.8","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":"a6f822f3892182147a48571626842abf3656dfd6e0a2f03899d3ddbbadb959dd"},"properties":{"dependency":{"package":"tornado","version":"6.5.5","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]","[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-3387","PYSEC-2026-3388","PYSEC-2026-3389","PYSEC-2026-3928"],"severity":"high","fixedVersion":"6.5.6","relation":"direct","declaredRange":"6.5.5","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":"380e5fcffe457f0b5d67d206bf885bf26acb1dfacdc3bc9b5328bb4697a0299d"},"properties":{"dependency":{"package":"tornado","version":"6.5.5","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]","[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-3387","PYSEC-2026-3388","PYSEC-2026-3389","PYSEC-2026-3928"],"severity":"high","fixedVersion":"6.5.6","relation":"direct","declaredRange":"6.5.5","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":"b8c24ffa251460bb3b766ed40f17705ae83ed107821b27777937830ed5b3644b"},"properties":{"dependency":{"package":"aiohttp","version":"3.14.3","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]","[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-4365","PYSEC-2026-4366","PYSEC-2026-4367","PYSEC-2026-4368","PYSEC-2026-4369","PYSEC-2026-4370","PYSEC-2026-4371"],"severity":"high","fixedVersion":"3.14.4","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":"1c1c4b2cced16981a8b15f25cdd3bc24cfd3f202639f478aa8c755241bb47660"},"properties":{"dependency":{"package":"filelock","version":"3.29.0","advisory":"[GHSA redacted]","aliases":["[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]"],"severity":"high","fixedVersion":"4.2.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":"70bcc8c6597c3712755add1dedd18a124764243aa953d21ecc654b0cf3a30aaf"},"properties":{"dependency":{"package":"fsspec","version":"2025.9.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-4217"],"severity":"high","fixedVersion":"2026.6.0","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":"f6aad8e4d68693a583efd80f7adcff5c42cc984321dd7a64341dffa7c741b89f"},"properties":{"dependency":{"package":"urllib3","version":"2.7.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-4175","PYSEC-2026-4176","PYSEC-2026-4177"],"severity":"high","fixedVersion":"2.8.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":"b4b835887533525587271f88f0be9f9fd520a429994f1314cab0da91abf47255"},"properties":{"dependency":{"package":"filelock","version":"3.29.1","advisory":"[GHSA redacted]","aliases":["[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]"],"severity":"high","fixedVersion":"4.2.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":"dba821de7e570c253f29da77b9092257d85b360ed0c0c8d618af4c4b3bfd1a5b"},"properties":{"dependency":{"package":"fsspec","version":"2026.4.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-4217"],"severity":"high","fixedVersion":"2026.6.0","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":"f3c6c94f4e3eea9039c5c921cce50c257070c1563c84f4a9aabc9dd7b1af27c4"},"properties":{"dependency":{"package":"urllib3","version":"2.7.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-4175","PYSEC-2026-4176","PYSEC-2026-4177"],"severity":"high","fixedVersion":"2.8.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":"fe81535b8aed15cfdef0f81ec7db036526f06969ef7ce8265cd0b65f4c39b853"},"properties":{"dependency":{"package":"brace-expansion","version":"5.0.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"5.0.10","relation":"direct","declaredRange":"^5.0.8","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":"5b921fb95d43b61f40c61ea053fcbe264fb2447f8771c95851e0597cfb6b70d3"},"properties":{"dependency":{"package":"markdown-it","version":"14.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"severity":"high","fixedVersion":"14.3.3","relation":"direct","declaredRange":"^14.1.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":"32c61799ea12afd28b6135da666ec933b4279f8feffe94ac81501e920b038c11"},"properties":{"dependency":{"package":"arrow-data","version":"58.3.0","advisory":"RUSTSEC-2026-0442","aliases":["[CVE redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"58.4.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":"09aadcc6f21d12b1dc09249844a2aae646dbfe24d2ce9815fa31408b55cf97c8"},"properties":{"dependency":{"package":"chrono","version":"0.4.45","advisory":"RUSTSEC-2026-0543","severity":"medium","relation":"direct","declaredRange":"0.4.45","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":"f938cc11f85764fce30b1f82bc362efb62f4166d0359677f658198be78daac0e"},"properties":{"dependency":{"package":"chrono-tz","version":"0.10.4","advisory":"RUSTSEC-2026-0555","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":"80b5c22beae306eb623d7a60ec13361ab89285e1cc30fcf5b8daa2e87ffb5c69"},"properties":{"dependency":{"package":"h2","version":"0.4.15","advisory":"RUSTSEC-2026-0258","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"0.4.16","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2e106c4a37c534c9e32845aef2971e66e913ae5bf8b36d4d5379f89664bfac34"},"properties":{"dependency":{"package":"humantime","version":"2.3.0","advisory":"RUSTSEC-2026-0542","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":"422864efbc32ee020d94634a443edac9d818b90faf02ac96d91c4d66ffa4da37"},"properties":{"dependency":{"package":"lru","version":"0.18.0","advisory":"RUSTSEC-2026-0253","severity":"medium","fixedVersion":"0.18.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":"64363d74ce1f052fae524dc374bd082dc62972fb05982f1a96c21eb7c322e135"},"properties":{"dependency":{"package":"pulldown-cmark","version":"0.13.0","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":"ffba3a9076a73cf66b6daacb5914c478fbdc74d1383d8d2e4003b6bf3aa7b43d"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.16","advisory":"RUSTSEC-2026-0338","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0339","RUSTSEC-2026-0340","RUSTSEC-2026-0341","RUSTSEC-2026-0342","RUSTSEC-2026-0523","RUSTSEC-2026-0524"],"severity":"medium","fixedVersion":"0.11.18","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"28f0bc6d34596072b24d37b19b745b7394ed4ce99a53e032439b262379e02dc1"},"properties":{"dependency":{"package":"quinn-udp","version":"0.5.15","advisory":"RUSTSEC-2026-0538","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"0.5.16","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9cf74773a6e34d2f2cd5f4cc024a1a57cb07e5917cf84c703df779cadb57013"},"properties":{"dependency":{"package":"rustix","version":"1.1.4","advisory":"RUSTSEC-2026-0486","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"1.1.6","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7481fb93c86b503a82a3e06a3172c7e27c5da26b8a178702a1e8028944c7596"},"properties":{"dependency":{"package":"rustls","version":"0.23.43","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0285","RUSTSEC-2026-0346","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"severity":"medium","fixedVersion":"0.23.45","relation":"direct","declaredRange":"0.23.43","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7ec937081c3ad6882e9c07735996d40cd6d5332ac535d70bb5252c6040e1f211"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.13","advisory":"RUSTSEC-2026-0382","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0383"],"severity":"medium","fixedVersion":"0.103.16","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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":"c64e30c28e3c0e2ac4c865fc1656b78d3404e0bf0484e55f9176b7c5f283f360"},"properties":{"dependency":{"package":"tokio","version":"1.53.1","advisory":"RUSTSEC-2026-0386","severity":"medium","fixedVersion":"1.53.3","relation":"direct","declaredRange":"1.53","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":"1be0220e1fa221ea274d30abdd6b4e473172e558c80e87aecee355dd31489ca8"},"properties":{"dependency":{"package":"webbrowser","version":"1.2.1","advisory":"RUSTSEC-2026-0257","aliases":["[GHSA redacted]"],"severity":"medium","fixedVersion":"1.2.2","relation":"direct","declaredRange":"1.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":"232458f1e861a473d11b103db83010acd3c76ee2f5eb5b53069ae6f2eda9586f"},"properties":{"dependency":{"package":"webpki-roots","version":"1.0.9","advisory":"RUSTSEC-2026-0381","aliases":["BIT-golang-2026-111943","[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"severity":"medium","fixedVersion":"1.0.10","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7f6329e2b29fe1ee1dd724766af980b151618490b720201bbdc1839704210c3e"},"properties":{"dependency":{"package":"zbus_names","version":"4.2.0","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":"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":"06e8dc8c07565b965cad3fead890e0d682e96e4f994ab4a0654e3f10afe7962d"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0395","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"414bb4a49ee404ddc9dbe92931374dee643d4d3104e067391ed93041a77ff631"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0396","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d67834474e5564706ab5d6117a7537fa7ddd9f89e1070ff0f40846a68262b203"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0397","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"64bc44f41a35cd29a5d01a7b192ce2cc5f1d458c15d9df1d5239ebb5b7c6fd43"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0399","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a79bcf37fda3b3cfb40243fa81b1818f80a0fe095c267b68e3c7eee6f042ddc9"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0400","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"21df614167acad094349de8aa7cfc685e485f636d67b1ded35b43230df65a136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0401","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fd61c6a1a6d23109e3da0a091cdbb2ecd3102dd1235e0548e2d8ffd7db2a7005"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0402","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a910032c7367726c7f26107809b36a5b0ab01a6e3af6f2b0cf67b659ecca9e49"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0404","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d11388e41908d6112e7f61d01d0c0d9062830b07945356073c8069de5b88d627"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0405","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dbb5f2efe8d9cca6344840981b65d21b774960589fc9976e6690dc84fce97102"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0406","severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d7870b77ea4843334d11fffa265d6d0542e94eec7f4c8e852762d55c28578136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.2.4","advisory":"RUSTSEC-2026-0398","aliases":["RUSTSEC-2026-0403"],"severity":"medium","fixedVersion":"7.4.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"84f9b61ffb7d87f7a0ea344424bcbd7389e2ed41eb01432b04fba9f732cd312c"},"properties":{"dependency":{"package":"zstd-sys","version":"2.0.16\u002Bzstd.1.5.7","advisory":"RUSTSEC-2026-0410","severity":"medium","fixedVersion":"2.1.2","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"77d4d5d4357ce0a5ade8f6f76c84914f1a2c80f9fe7358d9854254b760de650a"},"properties":{"dependency":{"package":"zvariant","version":"5.7.0","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.7.0","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":"03c83e015408a5aa0d224dc2e13be14d6a9b0a8d391e5b40508b4427c5c6cbd6"},"properties":{"dependency":{"package":"datasets","version":"4.8.5","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-3716"],"severity":"medium","fixedVersion":"5.0.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":"004dc060077a8518d27ab80c781f97cda228a3647e50a9e830853ab80b181504"},"properties":{"dependency":{"package":"multidict","version":"6.7.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-4244"],"severity":"medium","fixedVersion":"6.9.1","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"135ee98d46758d08886269cbb08312ae90d57996f5cb2b1cedecaa84cb93a717"},"properties":{"dependency":{"package":"opentelemetry-api","version":"1.41.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]"],"severity":"medium","fixedVersion":"1.45.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":"4f3d57b1b4ad6b1185c43f68dbf41a9a4df5c3e63e0f0e29563fe92287d5843b"},"properties":{"dependency":{"package":"setuptools","version":"80.10.2","advisory":"[GHSA redacted]","aliases":["BIT-setuptools-2026-59890","[CVE redacted]","[GHSA redacted]","PYSEC-2026-3447"],"severity":"medium","fixedVersion":"83.0.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":"6fa20aac28e830925713f3406635bf1dd399a29c2b40302cf9f71b2a4ab105bc"},"properties":{"dependency":{"package":"h2","version":"4.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-3628"],"severity":"medium","fixedVersion":"4.4.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":"80cecb8b4cefebd91787e9dc4bb3389a7b5927c28e5c6d3f4dc6bb6cd48cc5fb"},"properties":{"dependency":{"package":"setuptools","version":"81.0.0","advisory":"[GHSA redacted]","aliases":["BIT-setuptools-2026-59890","[CVE redacted]","[GHSA redacted]","PYSEC-2026-3447"],"severity":"medium","fixedVersion":"83.0.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":"aa7a0adea6f95fe99038fafb4124dded6b22e3f0242911028b93a29b9ca1ae3d"},"properties":{"dependency":{"package":"minimatch","version":"10.2.6","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"severity":"medium","fixedVersion":"11.0.1","relation":"transitive","reachability":{"kind":"not-imported"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"abde061125bae90d6cd9bce5948ee5dce288feceed5548d13f1e4a7a51c6b9c9"},"properties":{"dependency":{"package":"torch","version":"2.11.0","advisory":"[GHSA redacted]","aliases":["BIT-pytorch-2025-3000","[CVE redacted]","PYSEC-2025-194"],"severity":"low","fixedVersion":"2.13.0","relation":"transitive","reachability":{"kind":"production","file":"examples/python/dataloader/train.py","line":25}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4975822701b3b96654c82dada9bad969e348a6adefa52cd3bba1b6cfd71c3bb7"},"properties":{"dependency":{"package":"bincode","version":"1.3.3","advisory":"RUSTSEC-2025-0141","severity":"info","relation":"direct","declaredRange":"1.3","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bf9b3890cba73cd3c5d5270d1976bd1bae94596a1c510482b94fe9367ef871f2"},"properties":{"dependency":{"package":"memmap2","version":"0.5.10","advisory":"RUSTSEC-2026-0186","severity":"info","fixedVersion":"0.9.11","relation":"separate-copy","declaredRange":"0.9.11","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5922a5beeab5ac077ffb485a783ad545036e79b56239f83da38f3fb84336b113"},"properties":{"dependency":{"package":"paste","version":"1.0.15","advisory":"RUSTSEC-2024-0436","severity":"info","relation":"direct","declaredRange":"1.0","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"423f274256610b856f3942a60913dc49a565101cee85efcf47763acdd9238028"},"properties":{"dependency":{"package":"pyo3","version":"0.28.3","advisory":"[GHSA redacted]","aliases":["[GHSA redacted]","RUSTSEC-2026-0176","RUSTSEC-2026-0177"],"severity":"info","fixedVersion":"0.29.0","relation":"direct","declaredRange":"0.28.3","reachability":{"kind":"unknown"}}}},{"ruleId":"D30","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5585c48a8c4ed670247ebaa40a533d385248c4e49079fee700e7b93cbab137a9"},"properties":{"dependency":{"package":"quick-xml","version":"0.36.2","advisory":"RUSTSEC-2026-0194","aliases":["RUSTSEC-2026-0195"],"severity":"info","fixedVersion":"0.41.0","relation":"transitive","reachability":{"kind":"unknown"}}}},{"ruleId":"D31","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e36da30f7e376da994ef6acb7f3c6d06147825d2ebe00941010f409951002926"}},{"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":"2a7f9b9b8e31b4e575712783d8db6d50f57e6a944aa60167c08a018904e34a49"}},{"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":"dfb271b60b3b938bd1ab57fb2a2a0c0025499317792edf477c74446a88be17e2"},"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":"453eab0e2445f315a66f8efd65a66c5d245e78e9bb10cc5cb24629c2bd43c9a4"}},{"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":"35e779bf619b6ec3ce5729b2fbc55cfb423aa31d6dcf3571a8bb3bd337056bc0"},"taxa":[{"id":"CWE-426","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-693","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"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":"crates/viewer/dl_renderer/src/file_resolver.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2765b33b3b26083d2851b08e07c7834111671f5cc9342d595ef3468c57bcb12c"}},{"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":"crates/store/dl_log_encoding/src/dlr/decoder/iterator.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c265f38da6ba26673317bdc6e8dfb4d04e40dbe2890172943267d982467241"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 39 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: crates/store/dl_types_core/src/as_components.rs, scripts/generate_view_coordinate_defs.py, dalaran_py/dalaran_sdk/dalaran/error_utils.py, crates/store/dl_query/src/storage_engine.rs, crates/store/dl_log_types/src/vec_deque_ext.rs, dalaran_py/dalaran_sdk/dalaran/datatypes/tensor_data_ext.py, crates/store/dl_sdk_types/src/datatypes/blob_ext.rs, dalaran_py/dalaran_sdk/dalaran/blueprint/containers.py (and 31 more) (41 orphaned of 1170 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; 1170 of the 1713 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":"crates/store/dl_types_core/src/as_components.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a4c1ab52442ab2c9c1c157c2f3841b74858044d87f9240aff482ca135a28db"}},{"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":"scripts/generate_view_coordinate_defs.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba8e033a9adfbb4c3240fee9770de5c0a558010d514e8790420c605843cbed1"}},{"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":"dalaran_py/dalaran_sdk/dalaran/error_utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da71f66e3488ecd64cd70104409de5b36ac9fbcd2ec4be40fdc306de51914d54"}},{"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":"crates/store/dl_query/src/storage_engine.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29f23146af455b420e59526d8a630e4743af43e05e953fd4b9650b3242c2e45"}},{"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":"crates/store/dl_log_types/src/vec_deque_ext.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f534430d6f25461364e1669de86bd8825981c1a3ccca0b064737c55674cd38b"}},{"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":"dalaran_py/dalaran_sdk/dalaran/datatypes/tensor_data_ext.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebe65fce3e8b624781138d817ccfcfc6c3a86e514027bdbdd6a4b81feb78a30f"}},{"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":"crates/store/dl_sdk_types/src/datatypes/blob_ext.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eabf5b50965d84a3b8e2d4ff89c5333ec51f2b124e76492d670ed76388e1def5"}},{"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":"dalaran_py/dalaran_sdk/dalaran/blueprint/containers.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb8913e0d65ae5fe471e7934451cba59809b1437b98a6670e84983a347df2039"}},{"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":"dalaran_py/dalaran_sdk/dalaran/datatypes/class_description_ext.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4086506aa3359fe833605e4a5a7b476960684d341dcb14431d1b928bc3e825"}},{"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":"dalaran_py/dalaran_sdk/dalaran/datatypes/rgba32_ext.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"818a1574193da8514cc39579cc57e4e47a440404354809f315b26e0c862ed84f"}},{"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":"crates/top/dl_sdk/src/blueprint/panel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd9775227b6620b6a7b98a286e3e115ec735037187ef05e388ac2bf7f53d2b20"}},{"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":"dalaran_pixi_env/src/dalaran_pixi_env/pyo3_config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"738d4160074bbf33af7f185aa15d5414ca022f47a70a59b4780257274f64b939"}},{"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":"scripts/fetch_crashes.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a151e6acc20f45a2b6fe4c1d699d0e566f6965413da9b5f2f2f332762211df7c"}},{"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":"crates/store/dl_sdk_types/src/datatypes/image_format_ext.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d05ce45bac193ce2e62e04e866cdb53bee21c6d3f4bd3e48bf03ec68673c892"}},{"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":"dalaran_pixi_env/src/dalaran_pixi_env/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20203b193fe7e2d12aec56426edd419b6b8d988c51b1660c46b2c922688ed8b6"}},{"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":"crates/viewer/dl_renderer/src/file_system.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"521e892bb8333214d7ae145dcf0a52dce4ce47a770f6a254a1ef193aa1cb0f50"}},{"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":"dalaran_py/dalaran_sdk/dalaran/_script_helpers.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dcfba9ee9ef90b7ee3c130763cd63c80ad393556e721c1c66944be5713ce8e8"}},{"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":"crates/store/dl_sdk_types/src/view_coordinates.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d6a520682c7387c56cde21e4c65ef5878e06026391b9a1d32a895f199990107"}},{"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":"crates/top/dalaran/src/log_integration.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c0055a09a9e4c37ecc2ec1de5cf5744b44075f1d2c6f4c9743b4668262d1bc"}},{"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":"crates/top/dalaran/src/demo_util.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40e10d4c16beface83be6785b282731a3fd72325767212cce51ff81120e4c145"}},{"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":"crates/store/dl_importer/src/importer_directory.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a291ff7eade367807ad81c5b644a4ccf60342aa7a48e0e28739e31e46ffd7fc"}},{"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":"crates/utils/dl_perf_telemetry/src/metrics_server.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"de88ee87897b084a35fd890f3d3e029b5dc98bb9ad4c7bbf905c8d2a0d012bb7"}},{"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":"crates/store/dl_sdk_types/src/archetypes/capsules3d_ext.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7456aa70e6938abad06417451dd117babf86c0b1717547b7fb3ba8a8bf2833bd"}},{"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":"crates/utils/dl_analytics/src/native/config.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b51b69802bf89e58f5c97d80b815f42a242a95a01ceeb31bac981c6422ab3ca8"}},{"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":"crates/store/dl_query/src/cache_stats.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6b293a9b6a4b57cc651d421560dea520c77f95e58fb77ad84da8857815b4db"}},{"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":"scripts/ci/uv_install_wheel.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c9cb6768aada568fa1be7a67cdb3e3bd343be098119f480402152a2a4dc3822"}},{"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":"dalaran_py/dalaran_sdk/dalaran/archetypes/ellipsoids3d_ext.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e17f6dac7fff812cc085dd654cc25a40e64f3a022efe76ff2deae08ad9a8e84"}},{"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":"crates/store/dl_sdk_types/src/datatypes/vec3d_ext.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00e013c8efa4d03bcaf02e034ac7cf56c861e97b31113beb1a9937db79da363e"}},{"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":"crates/store/dl_entity_db/src/versioned_instance_path.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae10a134baffd00c7f5b25dccb9f36abde9db9fa615f443ec6188a1bb77c0f5"}},{"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":"run_wasm/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"be8b6617d111e8b674fcd20a86b939ddefb30577245b66cc747fe1974d72a5d4"}},{"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":"crates/store/dl_sdk_types/src/datatypes/vec4d_ext.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1f38e37888b9a6a2f60f89ba238dc85e7fe0beeb2c35bd18453dd58c3973bae"}},{"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":"dalaran_py/dalaran_sdk/dalaran/archetypes/capsules3d_ext.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bddd9af4d2cf5b83350b9c3e7458cb2c16a8dda1e5ff973fa922cfee3195193"}},{"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":"dalaran_py/dalaran_sdk/dalaran/archetypes/points2d_ext.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca153d134821456a9a68abe44e6649ec0fce99ca0941f96e35075f284d6dec8"}},{"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":"dalaran_py/dalaran_sdk/dalaran/_color_conversion.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"29481f985a4feff4063f2323868434b0bbdb44289de8f2eb4c63f4217b984fa6"}},{"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":"scripts/ci/fetch_artifact.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc7ae6be17c15e0a06a0a6ef28b6ef1da0cf602e51808002ae2c571cdfc6e492"}},{"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":"dalaran_py/dalaran_sdk/dalaran/archetypes/points3d_ext.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b770d3edc2f6b45cd4cb6c075f4f879eb8bd40941e9add889ccba4226694bb6"}},{"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":"crates/store/dl_sdk_types/src/datatypes/vec2d_ext.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"711ab2a64933711cfe650cb8969c63f00b64aa5510c8d313f5cea20eafc23b90"}},{"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":"crates/store/dl_log_types/src/instance.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1faf1b9cba06f0306664ac1795131d5edfaca6865392d4795dc25bd7ab5f9390"}},{"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":"crates/store/dl_sdk_types/src/datatypes/uvec4d_ext.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb7ae54300cc73cb39a5900e96889aa8e3e3eff153d85d956af5db44fd1f988"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: __init__.py \u2194 widget.ts: \u0060dalaran_notebook/src/dalaran_notebook/__init__.py\u0060 and \u0060dalaran_notebook/src/js/widget.ts\u0060 change together 87% of the time (13 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u0060beaee9c6\u0060 Expose theme setting on web-viewer notebook (at that commit the files were still \u0060rerun_notebook/src/rerun_notebook/__init__.py\u0060 and \u0060rerun_notebook/src/js/widget.ts\u0060); \u006099ffdbe8\u0060 Auth for Jupyter Notebooks (#11855) (at that commit the files were still \u0060rerun_notebook/src/rerun_notebook/__init__.py\u0060 and \u0060rerun_notebook/src/js/widget.ts\u0060); \u0060889d9fe7\u0060 Upload notebook assets to \u0060{version}/notebook/{file}\u0060 (#10722) (at that commit the files were still \u0060rerun_notebook/src/rerun_notebook/__init__.py\u0060 and \u0060rerun_notebook/src/js/widget.ts\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_notebook/src/dalaran_notebook/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0b66c9d3578fa51282aecbcc20f6bb4df59df49897595eb72f0f987c1abcd14"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: gltf.rs \u2194 obj.rs: \u0060crates/viewer/dl_renderer/src/importer/gltf.rs\u0060 and \u0060crates/viewer/dl_renderer/src/importer/obj.rs\u0060 change together 87% of the time (13 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u00603e26be7f\u0060 Ignore NaN/Inf values for bounding box calculations used in 3d eye ca\u2026 (at that commit the files were still \u0060crates/viewer/re_renderer/src/importer/gltf.rs\u0060 and \u0060crates/viewer/re_renderer/src/importer/obj.rs\u0060); \u00608382f149\u0060 Fix bounding box calculation for GLB/GLTF \u0026 DAE meshes (at that commit the files were still \u0060crates/viewer/re_renderer/src/importer/gltf.rs\u0060 and \u0060crates/viewer/re_renderer/src/importer/obj.rs\u0060); \u00601c02564c\u0060 Don\u0027t keep around additional cpu copy of loaded mesh files (#7824) (at that commit the files were still \u0060crates/viewer/re_renderer/src/importer/gltf.rs\u0060 and \u0060crates/viewer/re_renderer/src/importer/obj.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/importer/gltf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"855cf0828ea25a1c2846d1af9b513f7f9ab511bc8514aa651015c6bcab399a1e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: line_visualizer_system.rs \u2194 point_visualizer_system.rs: \u0060crates/viewer/dl_view_time_series/src/line_visualizer_system.rs\u0060 and \u0060crates/viewer/dl_view_time_series/src/point_visualizer_system.rs\u0060 change together 82% of the time (51 of the 62 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 51 shared commits counted here, the most recent 3 are \u00608c8e96b6\u0060 Time series: warn when scalar series count changes (#12802) (at that commit the files were still \u0060crates/viewer/re_view_time_series/src/line_visualizer_system.rs\u0060 and \u0060crates/viewer/re_view_time_series/src/point_visualizer_system.rs\u0060); \u00607d6aeef7\u0060 Skip empty visualizers (at that commit the files were still \u0060crates/viewer/re_view_time_series/src/line_visualizer_system.rs\u0060 and \u0060crates/viewer/re_view_time_series/src/point_visualizer_system.rs\u0060); \u0060ab4b97bf\u0060 Fix time series ui-id issues when showing the same blueprint multiple\u2026 (at that commit the files were still \u0060crates/viewer/re_view_time_series/src/line_visualizer_system.rs\u0060 and \u0060crates/viewer/re_view_time_series/src/point_visualizer_system.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/line_visualizer_system.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2932a856c10b0207f654a963507311c6d3b91b4935d2a896f67a2408d3349f81"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: obj.rs \u2194 mesh_renderer.rs: \u0060crates/viewer/dl_renderer/src/importer/obj.rs\u0060 and \u0060crates/viewer/dl_renderer/src/renderer/mesh_renderer.rs\u0060 change together 80% of the time (12 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 12 shared commits counted here, the most recent 3 are \u00603e26be7f\u0060 Ignore NaN/Inf values for bounding box calculations used in 3d eye ca\u2026 (at that commit the files were still \u0060crates/viewer/re_renderer/src/importer/obj.rs\u0060 and \u0060crates/viewer/re_renderer/src/renderer/mesh_renderer.rs\u0060); \u00601c02564c\u0060 Don\u0027t keep around additional cpu copy of loaded mesh files (#7824) (at that commit the files were still \u0060crates/viewer/re_renderer/src/importer/obj.rs\u0060 and \u0060crates/viewer/re_renderer/src/renderer/mesh_renderer.rs\u0060); \u0060514ed624\u0060 Remove old \u0060MeshManager\u0060 (#7531) (at that commit the files were still \u0060crates/viewer/re_renderer/src/importer/obj.rs\u0060 and \u0060crates/viewer/re_renderer/src/renderer/mesh_renderer.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/importer/obj.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6dc6d3486c06929334e8e242ad8d8dbdedee484c5e18032dc96532ea8ff8eda"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: imu.rs \u2194 point_cloud_2.rs: \u0060crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/imu.rs\u0060 and \u0060crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/point_cloud_2.rs\u0060 change together 80% of the time (8 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060e44b1750\u0060 Parse \u0060frame_id\u0060 fields of ROS 2 MCAP messages as \u0060CoordinateFrame\u0060 (\u2026 (at that commit the files were still \u0060crates/store/re_mcap/src/parsers/ros2msg/sensor_msgs/imu.rs\u0060 and \u0060crates/store/re_mcap/src/parsers/ros2msg/sensor_msgs/point_cloud_2.rs\u0060); \u0060f47dab6b\u0060 Group non-Unix epoch ROS 2 messages on a shared timeline (#11218) (at that commit the files were still \u0060crates/utils/re_mcap/src/parsers/ros2msg/sensor_msgs/imu.rs\u0060 and \u0060crates/utils/re_mcap/src/parsers/ros2msg/sensor_msgs/point_cloud_2.rs\u0060); \u00605b273ad6\u0060 Implement fallback mode for raw MCAP layer (#11136) (at that commit the files were still \u0060crates/utils/re_mcap/src/parsers/ros2msg/sensor_msgs/imu.rs\u0060 and \u0060crates/utils/re_mcap/src/parsers/ros2msg/sensor_msgs/point_cloud_2.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/imu.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63966bbc33fbc573bd674880615b8577b1d9d4b4d2fce3acc57f264f644b9423"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: assets3d.rs \u2194 meshes.rs: \u0060crates/viewer/dl_view_spatial/src/visualizers/assets3d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/meshes.rs\u0060 change together 71% of the time (12 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency 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 12 shared commits counted here, the most recent 3 are \u0060d995b273\u0060 Lazily convert to string (at that commit the files were still \u0060crates/viewer/re_view_spatial/src/visualizers/assets3d.rs\u0060 and \u0060crates/viewer/re_view_spatial/src/visualizers/meshes.rs\u0060); \u0060a830fa0a\u0060 Always access \u0060caches\u0060 through \u0060store_context\u0060 (#9030) (at that commit the files were still \u0060crates/viewer/re_view_spatial/src/visualizers/assets3d.rs\u0060 and \u0060crates/viewer/re_view_spatial/src/visualizers/meshes.rs\u0060); \u00601c02564c\u0060 Don\u0027t keep around additional cpu copy of loaded mesh files (#7824) (at that commit the files were still \u0060crates/viewer/re_space_view_spatial/src/visualizers/assets3d.rs\u0060 and \u0060crates/viewer/re_space_view_spatial/src/visualizers/meshes.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/assets3d.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab24f78082b787a522f1c6eaa5ffeaebbf70c9118700d57999628a23ac1af74"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: widget.ts \u2194 notebook.py: \u0060dalaran_notebook/src/js/widget.ts\u0060 and \u0060dalaran_py/dalaran_sdk/dalaran/notebook.py\u0060 change together 67% of the time (10 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u0060beaee9c6\u0060 Expose theme setting on web-viewer notebook (at that commit the files were still \u0060rerun_notebook/src/js/widget.ts\u0060 and \u0060rerun_py/rerun_sdk/rerun/notebook.py\u0060); \u006099ffdbe8\u0060 Auth for Jupyter Notebooks (#11855) (at that commit the files were still \u0060rerun_notebook/src/js/widget.ts\u0060 and \u0060rerun_py/rerun_sdk/rerun/notebook.py\u0060); \u006032322c92\u0060 Add \u0060open_url\u0060/\u0060close_url\u0060 notebook APIs (#10602) (at that commit the files were still \u0060rerun_notebook/src/js/widget.ts\u0060 and \u0060rerun_py/rerun_sdk/rerun/notebook.py\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_notebook/src/js/widget.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8c6ec6db960311d58284feb45490981720eafe64090f8471c4bab5761b8c8c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: view_2d.rs \u2194 view_3d.rs: \u0060crates/viewer/dl_view_spatial/src/view_2d.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/view_3d.rs\u0060 change together 60% of the time (30 of the 50 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 30 shared commits counted here, the most recent 3 are \u00605797b85e\u0060 Add \u0060SpatialInformation\u0060 blueprint controls to 2D view (at that commit the files were still \u0060crates/viewer/re_view_spatial/src/view_2d.rs\u0060 and \u0060crates/viewer/re_view_spatial/src/view_3d.rs\u0060); \u0060093a677e\u0060 Skip heuristic exclusions if transform frame ids have been logged (#1\u2026 (at that commit the files were still \u0060crates/viewer/re_view_spatial/src/view_2d.rs\u0060 and \u0060crates/viewer/re_view_spatial/src/view_3d.rs\u0060); \u00602e71c003\u0060 Add exclusions for 2d visualizables in 3d and vice-versa (#12087) (at that commit the files were still \u0060crates/viewer/re_view_spatial/src/view_2d.rs\u0060 and \u0060crates/viewer/re_view_spatial/src/view_3d.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/view_2d.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"78ffed51f407371309d1e4ec2ffebedd2d9d7d84b129b1a4c1c0c2a6f498a24d"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: loading.rs \u2194 store_hub.rs: \u0060crates/viewer/dl_viewer/src/loading.rs\u0060 and \u0060crates/viewer/dl_viewer_context/src/store_hub.rs\u0060 change together 60% of the time (6 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 6 shared commits counted here, the most recent 3 are \u0060f26336ef\u0060 Removing all calls to \u0060StoreBundle::entry\u0060 apart from \u0060entity_db_entry\u0060 (at that commit the files were still \u0060crates/viewer/re_viewer/src/loading.rs\u0060 and \u0060crates/viewer/re_viewer_context/src/store_hub.rs\u0060); \u0060f5f80f98\u0060 Move \u0060StoreBundle\u0060 from \u0060re_viewer_context\u0060 to \u0060re_entity_db\u0060 (#9971) (at that commit the files were still \u0060crates/viewer/re_viewer/src/loading.rs\u0060 and \u0060crates/viewer/re_viewer_context/src/store_hub.rs\u0060); \u0060ef0a3e8b\u0060 Move \u0060store_bundle\u0060 to \u0060re_viewer_context\u0060 (#9407) (at that commit the files were still \u0060crates/viewer/re_viewer/src/loading.rs\u0060 and \u0060crates/viewer/re_viewer_context/src/store_hub.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/loading.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a11830919342c87ed65428ef3610f52479f3a9f1c4525fcd349e1403326257bb"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: importer.rs \u2194 decode.rs: \u0060crates/store/dl_importer/src/importer_mcap/importer.rs\u0060 and \u0060crates/store/dl_mcap/src/parsers/decode.rs\u0060 change together 60% of the time (6 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 6 shared commits counted here, the most recent 3 are \u006016808be2\u0060 Introduce MCAP layers and \u0060rerun mcap\u0060 CLI tools (#10856) (at that commit the files were still \u0060crates/store/re_data_loader/src/loader_mcap.rs\u0060 and \u0060crates/store/re_data_loader/src/mcap/decode.rs\u0060); \u006090072252\u0060 Add profile scopes to mcap loader (#10859) (at that commit the files were still \u0060crates/store/re_data_loader/src/loader_mcap.rs\u0060 and \u0060crates/store/re_data_loader/src/mcap/decode.rs\u0060); \u006015f12097\u0060 Low-level Arrow conversion of \u0060protobuf\u0060-encoded MCAP messages (#10791) (at that commit the files were still \u0060crates/store/re_data_loader/src/loader_mcap.rs\u0060 and \u0060crates/store/re_data_loader/src/mcap/decode.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_mcap/importer.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e12631bb4f2c2f2f7027a73669ab5f97f04a74dbb954d346fd4948811fce2689"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: selection_panel.rs \u2194 view_highlights.rs: \u0060crates/viewer/dl_selection_panel/src/selection_panel.rs\u0060 and \u0060crates/viewer/dl_viewport/src/view_highlights.rs\u0060 change together 58% of the time (7 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u00609f04b354\u0060 Add an explicit \u0060DataResult\u0060 variant to \u0060re_viewport_context::Item\u0060 (\u2026 (at that commit the files were still \u0060crates/re_viewer/src/ui/selection_panel.rs\u0060 and \u0060crates/re_viewport/src/space_view_highlights.rs\u0060); \u00604dc09f1f\u0060 Remove groups from blueprint (#5326) (at that commit the files were still \u0060crates/re_viewer/src/ui/selection_panel.rs\u0060 and \u0060crates/re_viewport/src/space_view_highlights.rs\u0060); \u006048f64a73\u0060 Click a recording to select it (#4761) (at that commit the files were still \u0060crates/re_viewer/src/ui/selection_panel.rs\u0060 and \u0060crates/re_viewport/src/space_view_highlights.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/selection_panel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a017ad4e4fc1af8a8e034aac1d0eb6610ad0dd5e13cce5e86858153a11d8710a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: segment_table.rs \u2194 table_entry_provider.rs: \u0060crates/store/dl_datafusion/src/segment_table.rs\u0060 and \u0060crates/store/dl_datafusion/src/table_entry_provider.rs\u0060 change together 57% of the time (8 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060be131708\u0060 dataplatform api: use entry headers everywhere (at that commit the files were still \u0060crates/store/re_datafusion/src/segment_table.rs\u0060 and \u0060crates/store/re_datafusion/src/table_entry_provider.rs\u0060); \u0060120219a8\u0060 Clean-up of the partition table datafusion table provider (#11434) (at that commit the files were still \u0060crates/store/re_datafusion/src/partition_table.rs\u0060 and \u0060crates/store/re_datafusion/src/table_entry_provider.rs\u0060); \u0060124fbc50\u0060 Introduce \u0060ConnectionClient\u0060, an ergonomic wrapper over the frontend \u2026 (at that commit the files were still \u0060crates/store/re_datafusion/src/partition_table.rs\u0060 and \u0060crates/store/re_datafusion/src/table_entry_provider.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/segment_table.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7acb087c580f15f2e4c97fe3ed6668b85e9bcd10d26247db833ce6f7ad0834"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: dlr_manifest_index.rs \u2194 prefetch_chunks.rs: \u0060crates/store/dl_entity_db/src/dlr_manifest_index.rs\u0060 and \u0060crates/viewer/dl_viewer/src/prefetch_chunks.rs\u0060 change together 55% of the time (11 of the 20 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 11 shared commits counted here, the most recent 3 are \u00607c0680e5\u0060 By default, fetch similar chunks 30 seconds of playtime forward (at that commit the files were still \u0060crates/store/re_entity_db/src/rrd_manifest_index.rs\u0060 and \u0060crates/viewer/re_viewer/src/prefetch_chunks.rs\u0060); \u0060b509f91d\u0060 By default, only prefetched what is visible (at that commit the files were still \u0060crates/store/re_entity_db/src/rrd_manifest_index.rs\u0060 and \u0060crates/viewer/re_viewer/src/prefetch_chunks.rs\u0060); \u006078dbaf3c\u0060 Better fetching of multiple recordings (at that commit the files were still \u0060crates/store/re_entity_db/src/rrd_manifest_index.rs\u0060 and \u0060crates/viewer/re_viewer/src/prefetch_chunks.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/dlr_manifest_index.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"913fcfc05197577c65bc0a33a282a8e64c91ccb6003514a572435de5cedcfd10"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: image_decode_cache.rs \u2194 video_asset_cache.rs: \u0060crates/viewer/dl_viewer_context/src/cache/image_decode_cache.rs\u0060 and \u0060crates/viewer/dl_viewer_context/src/cache/video_asset_cache.rs\u0060 change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00603149d364\u0060 Add \u0060pixi run rerun-fast\u0060 for faster compile times using cranelift (at that commit the files were still \u0060crates/viewer/re_viewer_context/src/cache/image_decode_cache.rs\u0060 and \u0060crates/viewer/re_viewer_context/src/cache/video_asset_cache.rs\u0060); \u006095a4b5ea\u0060 Help out \u0060\u002Bnightly\u0060 type checker by specifying trait bounds (#12432) (at that commit the files were still \u0060crates/viewer/re_viewer_context/src/cache/image_decode_cache.rs\u0060 and \u0060crates/viewer/re_viewer_context/src/cache/video_asset_cache.rs\u0060); \u0060b461f398\u0060 Fix videos re-decoding on some ui interactions (#10420) (at that commit the files were still \u0060crates/viewer/re_viewer_context/src/cache/image_decode_cache.rs\u0060 and \u0060crates/viewer/re_viewer_context/src/cache/video_asset_cache.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/image_decode_cache.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad5822377b967f8ccf6ea477d4997595ead9d4a688c77f741d8d4e798e45412"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: selection_panel.rs \u2194 add_view_or_container_modal.rs: \u0060crates/viewer/dl_selection_panel/src/selection_panel.rs\u0060 and \u0060crates/viewer/dl_viewport_blueprint/src/ui/add_view_or_container_modal.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 \u0060a4f0e721\u0060 Move blueprint tree UI to new \u0060re_blueprint_tree\u0060 crate (#6427) (at that commit the files were still \u0060crates/re_viewer/src/ui/selection_panel.rs\u0060 and \u0060crates/re_viewport_blueprint/src/ui/add_space_view_or_container_modal.rs\u0060); \u006076fd4cbe\u0060 Allow setting custom names to container (#5626) (at that commit the files were still \u0060crates/re_viewer/src/ui/selection_panel.rs\u0060 and \u0060crates/re_viewport/src/add_space_view_or_container_modal.rs\u0060); \u0060ce407eb3\u0060 Introduce basic support for $origin substitution in EntityPathFilter \u2026 (at that commit the files were still \u0060crates/re_viewer/src/ui/selection_panel.rs\u0060 and \u0060crates/re_viewport/src/add_space_view_or_container_modal.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/selection_panel.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55545503376860cbbf3f58dc94556586f2055c5b0eac9eb0f4a7cc9df8b089de"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: viewport_ui.rs \u2194 add_view_or_container_modal.rs: \u0060crates/viewer/dl_viewport/src/viewport_ui.rs\u0060 and \u0060crates/viewer/dl_viewport_blueprint/src/ui/add_view_or_container_modal.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 \u006055b389f4\u0060 Refactor in preparation for supporting light mode (#9961) (at that commit the files were still \u0060crates/viewer/re_viewport/src/viewport_ui.rs\u0060 and \u0060crates/viewer/re_viewport_blueprint/src/ui/add_view_or_container_modal.rs\u0060); \u0060a4f0e721\u0060 Move blueprint tree UI to new \u0060re_blueprint_tree\u0060 crate (#6427) (at that commit the files were still \u0060crates/re_viewport/src/viewport.rs\u0060 and \u0060crates/re_viewport_blueprint/src/ui/add_space_view_or_container_modal.rs\u0060); \u006076fd4cbe\u0060 Allow setting custom names to container (#5626) (at that commit the files were still \u0060crates/re_viewport/src/viewport.rs\u0060 and \u0060crates/re_viewport/src/add_space_view_or_container_modal.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport/src/viewport_ui.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b14ed8b8a4aba15b283fb4cf5e5eae1ac70ee96bae3129311cf8f935cedb83c8"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: component_path_ui.rs \u2194 instance_path_ui.rs: \u0060crates/viewer/dl_data_ui/src/component_path_ui.rs\u0060 and \u0060crates/viewer/dl_data_ui/src/instance_path_ui.rs\u0060 change together 50% of the time (13 of the 26 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u0060474dbe8a\u0060 Selection panel: show all values at the latest time stamp (at that commit the files were still \u0060crates/viewer/re_data_ui/src/component_path_ui.rs\u0060 and \u0060crates/viewer/re_data_ui/src/instance_path_ui.rs\u0060); \u0060e462d01c\u0060 Show reason for loading indicators on hover in debug mode (at that commit the files were still \u0060crates/viewer/re_data_ui/src/component_path_ui.rs\u0060 and \u0060crates/viewer/re_data_ui/src/instance_path_ui.rs\u0060); \u0060a2b5ab84\u0060 Improve error messages for Tensor and Text Document views (#8155) (at that commit the files were still \u0060crates/viewer/re_data_ui/src/component_path.rs\u0060 and \u0060crates/viewer/re_data_ui/src/instance_path.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/component_path_ui.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c658b506de51f23afb1cdf10aaa6fa2991fbde6a853ac43dac20cb80d6c8c5e"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: depth_images.rs \u2194 images.rs: \u0060crates/viewer/dl_view_spatial/src/visualizers/depth_images.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/visualizers/images.rs\u0060 change together 50% of the time (7 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 7 shared commits counted here, the most recent 3 are \u006019b2c79a\u0060 Make more visualizer errors point to specific components that are in \u2026 (at that commit the files were still \u0060crates/viewer/re_view_spatial/src/visualizers/depth_images.rs\u0060 and \u0060crates/viewer/re_view_spatial/src/visualizers/images.rs\u0060); \u0060c8d169b2\u0060 Fix missing error when drawing depth image for point cloud without pi\u2026 (at that commit the files were still \u0060crates/viewer/re_view_spatial/src/visualizers/depth_images.rs\u0060 and \u0060crates/viewer/re_view_spatial/src/visualizers/images.rs\u0060); \u00601d1eb78b\u0060 Prepare video visualizer for upcoming stream visualizer  (#10125) (at that commit the files were still \u0060crates/viewer/re_view_spatial/src/visualizers/depth_images.rs\u0060 and \u0060crates/viewer/re_view_spatial/src/visualizers/images.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/depth_images.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77b855dcb2b38ccc55726b7384741170a9cd2ef6d82db09f0afd6337a345499"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: frame_id_registry.rs \u2194 transform_tree_context.rs: \u0060crates/store/dl_tf/src/frame_id_registry.rs\u0060 and \u0060crates/viewer/dl_view_spatial/src/contexts/transform_tree_context.rs\u0060 change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency \u2014 the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE \u2014 the registration is the link, and it is meant not to be an import \u2014 and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are \u00605bf9c4a6\u0060 Clearer behavior for \u0060CoordinateFrame(\u0022\u0022)\u0060 (at that commit the files were still \u0060crates/store/re_tf/src/frame_id_registry.rs\u0060 and \u0060crates/viewer/re_view_spatial/src/contexts/transform_tree_context.rs\u0060); \u00606589388d\u0060 Use full recording schema in manifest ingestion (at that commit the files were still \u0060crates/store/re_tf/src/frame_id_registry.rs\u0060 and \u0060crates/viewer/re_view_spatial/src/contexts/transform_tree_context.rs\u0060); \u00605072951e\u0060 Show \u0060TransformAxes3D\u0060 for out-of-hierarchy \u0060Transform\u0060s (#12262) (at that commit the files were still \u0060crates/store/re_tf/src/frame_id_registry.rs\u0060 and \u0060crates/viewer/re_view_spatial/src/contexts/transform_tree_context.rs\u0060) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/frame_id_registry.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63b4e91286da05cfbb4e581a004894e5aa273ab012771afb0d98956636998a3d"}},{"ruleId":"D44","level":"warning","message":{"text":"End-of-life runtime: Rust 1.95: rust-toolchain declares Rust 1.95 as this project\u0027s toolchain file, and Rust 1.95, superseded by 1.96 on 2026-05-28 (the Rust project patches only the current stable). An unsupported runtime receives no security patches, so every vulnerability disclosed in it since 2026-05-28 is present and unfixable without moving off it. This is a migration rather than an upgrade: there is no newer release of a runtime that has ended."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"rust-toolchain"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dde701f9c40b0b8cb202babf3f8d8da48dda44162595030f1b0a8f7d57710684"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_web_viewer_server/web_viewer/index.html"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"00d896fac625f0489dd18a70e00bcb6c8be2f4d424ab8b5895c8b4827c1bdb7a"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. This document\u0027s body is only the mount point \u003Cdiv\u003E, so there is no content here to wrap \u2014 render the \u003Cmain\u003E from the component mounted into it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_web_viewer_server/web_viewer/index.html"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e85e33cb7c784326af2b88f2160f3c09c8662b4e8d6149a825fb6795ecf7f32"}},{"ruleId":"AC3","level":"error","message":{"text":"Viewport restricts zoom: user-scalable=no/0 or a maximum-scale below 2 stops low-vision users zooming to 200%. Remove the zoom restriction from the viewport meta."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_web_viewer_server/web_viewer/index.html"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ec17c8625e5dc8c986d42c3eee99b149d2cdeec74ff7cc61b3c77446f721ac"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u003Cdiv\u003E moves \u2014 its inline style sets \u0060transition: width 0.2s\u0060 \u2014 and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_js/web-viewer/index.ts"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"37380e652be81376e6e6e370ae013dd830e54e184e90bdcc7e6028fa5262c217"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.1:1): \u0060.sm-dox ul a:hover, .sm-dox ul a:active, .sm-dox ul a:focus\u0060 sets color: #1C1D1F on background-color: #1982d2 \u2014 4.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css"},"region":{"startLine":493}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f4e1251b9446626413fb0820941838ae35523b4ec903bbefd07dc901ca19ff"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.1:1): \u0060.sm-dox a:hover, .sm-dox a:active, .tablist li a:hover\u0060 sets color: #1C1D1F on background-color: #1982d2 \u2014 4.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css"},"region":{"startLine":515}}}],"partialFingerprints":{"codehealthFindingId/v1":"861498a3f2725f60a3cf77b01f1a628329f036dfc543a80b741384a5bde21621"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.1:1): \u0060#MSearchSelectWindow a.SelectItem:hover\u0060 sets color: #1C1D1F on background-color: #1982d2 \u2014 4.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css"},"region":{"startLine":713}}}],"partialFingerprints":{"codehealthFindingId/v1":"35eabfe49e353c2e23c6d6f8696284b19989395df5a527c24e447d73e914c902"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.dalaran-notebook-loading__spinner\u0060 moves (\u0060animation: dalaran-notebook-spin 0.8s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/dalaran_sdk/dalaran/_loading_widget.css"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc13b6dedc5bdd30e8105be0a1bb6b649cf5aeebfa3eba409c2c09e89bb07b51"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.sm-dox ul\u0060 moves (\u0060animation: ease-out 150ms slideInMenu\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3587ca0d50ef6ebb38d8463dbec29179f14fb01c6c10c0d7091e8cd31745103"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060#MSearchResultsWindow\u0060 moves (\u0060animation: ease-out 280ms slideInSearchResults\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e0c718eff48757c780cb0ad9aec674bdb0a88d9baa60f85235cb233117ef27"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060#MSearchResultsWindow\u0060 moves (\u0060animation: ease-out 280ms slideInSearchResultsMobile\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"8856c71790de6ac6940acac9445758830e53812ba948e5329e9b910d19372826"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060div.contents .toc.interactive \u003E h3::before\u0060 moves (\u0060transition: transform 0.25s ease-out\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css"},"region":{"startLine":1177}}}],"partialFingerprints":{"codehealthFindingId/v1":"240d0d07216190aea2671b3adb29150d840c83757c980fa2aa7306f48a3bb143"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060div.contents .toc.interactive.open\u0060 moves (\u0060transition: max-height 0.2s ease-in-out\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css"},"region":{"startLine":1187}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7fa2ec061928497845f8af8504c16a478cc1e5b5c68d7a60bbf75179bb3bf52"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060table.memberdecls img[src=\u0022closed.png\u0022]\u0060 moves (\u0060transition: transform 0.25s ease-out\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css"},"region":{"startLine":1869}}}],"partialFingerprints":{"codehealthFindingId/v1":"379e1d18d0f5ba02a8665438b69f1831d88591eae71280459f903e5c72bf592f"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060table.memberdecls tr[style=\u0022display: table-row \u0022]\u0060 moves (\u0060animation: fade .5s\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css"},"region":{"startLine":1948}}}],"partialFingerprints":{"codehealthFindingId/v1":"6586aa46ad73ca5ffedeab265bdc8c2aedc9e811611ba90f904bb66bde3eb87a"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060doxygen-awesome-dark-mode-toggle \u003E svg\u0060 moves (\u0060transition: transform .1s ease-in-out\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_cpp/docs/doxygen-awesome/doxygen-awesome.css"},"region":{"startLine":2347}}}],"partialFingerprints":{"codehealthFindingId/v1":"75af6cb3ee86114186a91b3012f6945de782725fda3489cecbf5e16d10dc12cb"}},{"ruleId":"AX9","level":"error","message":{"text":"Query writes persistent state on the read path: StoreHub.load_blueprint_store: \u0060StoreHub.load_blueprint_store\u0060 is a read-named query yet it performs a durable write on the read path (a persist to a store/repository). A query must stay side-effect-free so reads are safe to retry, cache, and route to a read replica; move the write into a command."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/store_hub.rs"},"region":{"startLine":1348}}}],"partialFingerprints":{"codehealthFindingId/v1":"7824aee4f3facccf867947e7806a3c33f22f3345fc90a176df38824e0752f65e"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: common.collect_snippets_for_api_docs calls \u0060std::fs::read_to_string\u0060: \u0060common.collect_snippets_for_api_docs\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/common.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"5008a31be8490e8d126659070ed90a6d350ed2043138b34be0f8e3dfff4c63d9"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: cpu_worker.chunk_store_cpu_worker_thread calls \u0060recv\u0060: \u0060cpu_worker.chunk_store_cpu_worker_thread\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060recv\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"79ae621b4a4e710e9506fd968040e1bcd41d6a7333d3a6f18369fa7714c984df"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: DataframeSegmentStream.poll_next calls \u0060block_on\u0060: \u0060DataframeSegmentStream.poll_next\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060block_on\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"63cf093035d271a61985b229226b59ab10c762fc9d319ec16a3b8f8a8d91edbc"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: FileSink.with_options calls \u0060File::create\u0060: \u0060FileSink.with_options\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::create\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/file_sink.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b69b6cb7735aeb3067af40c53fb5a43142a1d4980090d3596e281feef3f09d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: register_with_dataset.load_store_ids calls \u0060File::open\u0060: \u0060register_with_dataset.load_store_ids\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/dalaran_cloud/register_with_dataset.rs"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"9106f6348ff7f2b90fe52f7b742c1ae2571ef03ffbbd5e3779713bdda33b2c0d"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ResolvedStore.load_dlr_file calls \u0060File::open\u0060: \u0060ResolvedStore.load_dlr_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/resolved_store.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2304d0c615c9e4f3725a77efe071719cf153a7ab436577262cb5f4c989b139b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: ResolvedStore.load_dlr_file calls \u0060File::open\u0060: \u0060ResolvedStore.load_dlr_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/resolved_store.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b92acd1c85a420203cb499bd68de82a039fda76a13ad23db14b61c3475b506"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: resolved_store.write_dlr calls \u0060File::create\u0060: \u0060resolved_store.write_dlr\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::create\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/resolved_store.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"016b9216c687dff172b54b5346dd5b4b5ca37bf4b5556d5414c292be37dac9f4"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: resolved_store.enumerate_and_load_agree_on_store_ids calls \u0060File::open\u0060: \u0060resolved_store.enumerate_and_load_agree_on_store_ids\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/resolved_store.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f3a48f8d88a17482218aa7a3af102e432441598a6534b90ac1459b62a99307"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: source.write_dlr calls \u0060File::create\u0060: \u0060source.write_dlr\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::create\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/source.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"119e01849f8a3940f431052b5c0612be05988728e6e90e1661dd79cd51b765ab"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: source.dlr_manifest_lazy_and_eager_produce_equivalent_output calls \u0060File::open\u0060: \u0060source.dlr_manifest_lazy_and_eager_produce_equivalent_output\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/source.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e89d0a36cc126e96be9d96e0250eaa94e6759362cf56f85cb3f55e96756b6f8"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: source.dlr_manifest_lazy_and_eager_produce_equivalent_output calls \u0060File::open\u0060: \u0060source.dlr_manifest_lazy_and_eager_produce_equivalent_output\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/source.rs"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a02bbb85be6f0b0d86309b30a1858d92d6af6beb790c7c0bd4742dda4a2a4b6"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: compare.load_chunks calls \u0060File::open\u0060: \u0060compare.load_chunks\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/compare.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"210a28f23b495b18cdae53f5e002731aaadd55ceaf53cbc9203cfe5de17c2446"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Config.load calls \u0060File::open\u0060: \u0060Config.load\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_analytics/src/native/config.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"0726c270a6f61080ab90be5ae839d5231e237bdb7969acd1b1d7bbb266eecf15"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: Pipeline.new calls \u0060std::fs::create_dir_all\u0060: \u0060Pipeline.new\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::create_dir_all\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_analytics/src/native/pipeline.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7092ba6c151d90c61da7e6fe98aa647b63d92bd435a7c6b09a9154ab0e1a755"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: cli.login calls \u0060thread::sleep\u0060: \u0060cli.login\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060thread::sleep\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_auth/src/cli.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"2abd2db3d34dcd37227e744bf56c66ddd0b9dd44ab82fa461c3fa496b953d918"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: storage.load calls \u0060std::fs::read_to_string\u0060: \u0060storage.load\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read_to_string\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_auth/src/oauth/storage.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f1d81523be36bd50828b1f98ad0c641d718ee39fd0ce5dd6899670d9a690878"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: storage.clear calls \u0060std::fs::remove_file\u0060: \u0060storage.clear\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::remove_file\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_auth/src/oauth/storage.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbf2cdf0257d5cccdab74326e7083f679be46e8da0090223580a8f4d8ab2cd73"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: add_data_source.register_local_file calls \u0060File::open\u0060: \u0060add_data_source.register_local_file\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/add_data_source.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"879e2847b02d1e95bb29ad102ccb673ee9a0b5a7be69a1e4a261d8addbdc8150"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: wsl.is_wsl calls \u0060std::fs::read\u0060: \u0060wsl.is_wsl\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/viewer_analytics/wsl.rs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"7adf423f2075af1dde0f7661b6c03791c26fa5bb6c0e54152d6cff3370184aab"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: WebViewerData.from_archive calls \u0060File::open\u0060: \u0060WebViewerData.from_archive\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_web_viewer_server/src/lib.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39ac719e0e5965d2d74522bb35d7a79ede5ed46ff9d8e6943876c4dc9c02e47"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: trailing_data.read_zip_from_exe calls \u0060File::open\u0060: \u0060trailing_data.read_zip_from_exe\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_web_viewer_server/src/trailing_data.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"18b23b4a6a6f124e0925410f56fd1e5cd2de876f2fb824e25475b24a5552340c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: PyRrdReaderInternal.store calls \u0060File::open\u0060: \u0060PyRrdReaderInternal.store\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060File::open\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/chunk_stream/dlr_reader.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c6108f977bad69d77d40730d0b0ef16c77a15eef31dbb42221990b698153815"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: python_bridge.init_perf_telemetry calls \u0060block_on\u0060: \u0060python_bridge.init_perf_telemetry\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060block_on\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/python_bridge.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c5081e93dd09060070ac1d74078417acc70b833f5f221ffa4e0189d641607c"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: python_bridge.check_for_dlr_footer calls \u0060std::fs::read\u0060: \u0060python_bridge.check_for_dlr_footer\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060std::fs::read\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/python_bridge.rs"},"region":{"startLine":2864}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ff9ce6778eed9d5ccfe2d2a5be2a3bb1368d5ab024b8898339fc88a7ff9b1b"}},{"ruleId":"ED1","level":"error","message":{"text":"Blocking call on the event loop: utils.wait_for_future calls \u0060block_on\u0060: \u0060utils.wait_for_future\u0060 runs on the async event loop (it is async, an actor or framework handler, a hand-written \u0060poll\u0060, or called from one) and makes the blocking call \u0060block_on\u0060: while it blocks, the loop\u0027s worker thread serves nothing else, so every task, message and request scheduled on it waits \u2014 and a blocking wait on a future that needs that worker can deadlock. Use the awaited twin (\u0060tokio::time::sleep(..).await\u0060, \u0060tokio::fs\u0060, an async channel/client), or move the work off the loop with \u0060tokio::task::spawn_blocking\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/utils.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b744cc474af2fce89f78aadb97c96bd27c039776927a94ea54662b79231777"}},{"ruleId":"ED4","level":"error","message":{"text":"Dual write (no outbox): merge_optimize$module.merge_and_compact: \u0060merge_optimize$module.merge_and_compact\u0060 performs two independent DURABLE writes \u2014 a durable state write (\u0060entity_db.store_kind\u0060, :555) and a second independent durable store write \u2014 in one command path with no shared transaction or outbox. A crash between the two leaves the stores diverged (one write committed, the other lost) or emits a phantom record. Wrap both in one transaction, or record the second write in the same store and dispatch it afterwards (a transactional outbox)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/merge_optimize.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"61c7408e78ff60188ef0db32c7204b68de0296b3afe13dec9bf0abf046633ceb"}},{"ruleId":"ED4","level":"error","message":{"text":"Dual write (no outbox): recording$module.check_recording: \u0060recording$module.check_recording\u0060 performs two independent DURABLE writes \u2014 a durable state write (\u0060store_ids.insert\u0060, :131) and a second independent durable store write \u2014 in one command path with no shared transaction or outbox. A crash between the two leaves the stores diverged (one write committed, the other lost) or emits a phantom record. Wrap both in one transaction, or record the second write in the same store and dispatch it afterwards (a transactional outbox)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/doctor/recording.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1ceada426dde9d4598a6d03283b291b7018ff765b02edda3a8c02353e2f0a3"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 panics or fails with a \u0022not implemented\u0022 message: \u0060do_maintenance\u0060\u0027s whole body panics or returns an error whose message says it isn\u0027t finished \u2014 generated scaffolding that was never completed. Implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"238712cd3ec98ca206044083c8a4c05143ce199f11a6c16d367007bdd564878f"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 panics or fails with a \u0022not implemented\u0022 message: \u0060do_global_maintenance\u0060\u0027s whole body panics or returns an error whose message says it isn\u0027t finished \u2014 generated scaffolding that was never completed. Implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":2074}}}],"partialFingerprints":{"codehealthFindingId/v1":"641d7e573de95f8db204bd68974f52e5a5543de86b783db1015da26df9251264"}},{"ruleId":"GD1","level":"warning","message":{"text":"Unfinished stub \u2014 panics or fails with a \u0022not implemented\u0022 message: \u0060create_table_entry\u0060\u0027s whole body panics or returns an error whose message says it isn\u0027t finished \u2014 generated scaffolding that was never completed. Implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/table.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"9016e3d3cf2d786ddd85665521d4049494c306fb5b3fd23330cb9b15b8659a58"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060new\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":"crates/build/dl_types_builder/src/codegen/cpp/mod.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc41d13459cbf2bc5bb32e411d7d2ac6fe9a8c7fae6b8a9ebd07a60a1ba7ec62"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060quoted_arrow_primitive_type\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":"crates/build/dl_types_builder/src/codegen/rust/arrow.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a4f0db126ba49fa8679cb9857c2b41fefe2d79e9805dfced7193c63d92cb0c9"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060quote_arrow_deserializer\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":"crates/build/dl_types_builder/src/codegen/rust/deserializer.rs"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d9bbd32373b618d4f53f1652352c91793f186ed1eb30ce3c27ed917e4a582c"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060quote_arrow_field_deserializer\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":"crates/build/dl_types_builder/src/codegen/rust/deserializer.rs"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"29602c97a787d727d93ce3a85587157d385462a9d93b3a26632e95dbd5491107"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060quote_arrow_deserializer_buffer_slice\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":"crates/build/dl_types_builder/src/codegen/rust/deserializer.rs"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4e2603afcfbbeed147010de2b192432fd6263583f30d13ca11c9b022934681"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060quote_arrow_field_deserializer_buffer_slice\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":"crates/build/dl_types_builder/src/codegen/rust/deserializer.rs"},"region":{"startLine":1195}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b5ca23f56910fb7c904048d755d7747599845c1f1c9bef8711380d76e42752"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060quote_buffer_slice_element_type\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":"crates/build/dl_types_builder/src/codegen/rust/deserializer.rs"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"c635f59622aa8287b3c76e7558e6989d5b0420f07b6d93303747739549efa6cf"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060quote_arrow_serializer\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":"crates/build/dl_types_builder/src/codegen/rust/serializer.rs"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb660f94696e5ba4066d60b842ee2b35fa165f158138dbf2988736411c89cc78"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060quote_arrow_field_serializer\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":"crates/build/dl_types_builder/src/codegen/rust/serializer.rs"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c56f52def93807a78c3bcfe1ee341356c0ee3d73220f615265e9daa6aa50a42"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060type_from_raw_type\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":"crates/build/dl_types_builder/src/objects/from_fbs.rs"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb4b38426b3301af099dba97fb679769e13755458f5bf9c85378f4ef4efcd7c"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060eval\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":"crates/store/dl_lenses_core/src/selector/eval.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"844e8c9392341a91eda5247fe132521180dc7e36def66323410fef5f28f45c19"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060eval\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":"crates/store/dl_lenses_core/src/selector/eval.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"42cd26a9dd4f9210cad9a72a4e35b755f89928a778471467b4f997dbf59f921a"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060query_dataset\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":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c13afb2bce1de0e831eab462e350683ded4503799bf71c73c6223fd5194601e"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 panics or fails with a \u0022not implemented\u0022 message: \u0060do_maintenance\u0060\u0027s whole body panics or returns an error whose message says it isn\u0027t finished \u2014 a not-implemented stub in ordinary clothes. Implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":2065}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d81ddbc028c4a228b11997795ad7b4cc3a4ca05f4a4e566eaa72348444b1976"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 panics or fails with a \u0022not implemented\u0022 message: \u0060do_global_maintenance\u0060\u0027s whole body panics or returns an error whose message says it isn\u0027t finished \u2014 a not-implemented stub in ordinary clothes. Implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":2074}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe4be13670bb495cf22586d70b144e0dd8dd149bad6473473eac8a2b44d31c64"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished stub \u2014 panics or fails with a \u0022not implemented\u0022 message: \u0060create_table_entry\u0060\u0027s whole body panics or returns an error whose message says it isn\u0027t finished \u2014 a not-implemented stub in ordinary clothes. Implement it or remove it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/table.rs"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f32ab4adf268fbf467307deaf1c194d587c8724986694cd7f6cd33468edc3f"}},{"ruleId":"IC1","level":"warning","message":{"text":"Unfinished branch \u2014 a todo!() / unimplemented!() arm in a real function: \u0060run\u0060 does real work, but one of its branches is \u0060panic!\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":"crates/top/dalaran/src/commands/dlr/print.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"588708e1aa40748b0ad78e67eb6ab4c4ad5b18f4dbf0092505d203d4cd017bea"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060print_property\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":"crates/top/dalaran/src/commands/mcap/info.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c3f0756a1aa7f08253206dd4b5b71d284b0ed96b1f49924c2ecee9593c7cd0c"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060print_details\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":"crates/utils/dl_analytics/src/cli.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"78af0bd79249919f6f71a000d3fc7c1f95e8b701216ffe00727e196192d24272"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060set_event_waker\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":"crates/viewer/dl_gamepad/src/web.rs"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"fae9c55376a8bb49c375e28291b62c3573d566522b5b3a20e1fa6bb3ba1223cc"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060navigation_from_active_gamepad\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":"crates/viewer/dl_gamepad/src/web.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"397129f82142faf36cf45a3ae9627d3936125be3c192f7fd08748a0d383c1224"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060collect\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":"crates/viewer/dl_renderer/src/file_server.rs"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"fef1e57302fd4433d49ea3bda910589a3b71d14aed2b0f0e3986c3dfbf0e8b34"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060setup_table_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":"crates/viewer/dl_ui/src/design_tokens.rs"},"region":{"startLine":946}}}],"partialFingerprints":{"codehealthFindingId/v1":"6794655ad77558837eac0a45948b50e7bfd885e4b207e43aa466400997c6abf0"}},{"ruleId":"IC1","level":"warning","message":{"text":"Hollow method \u2014 returns a constant without doing the work: \u0060build_table_container_end\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":"dalaran_py/src/catalog/dataframe_rendering.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"3152f57208c72be78e3695a50a5eb45982ba4f1e5ac7b198fcebbf92ebf2da5c"}},{"ruleId":"IC1","level":"warning","message":{"text":"Empty method body \u2014 does nothing with its inputs: \u0060log_tracing_session_started\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":"dalaran_py/src/tracing_session.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"26660ea2386dbf2e6678304d33fcf48a284a9b596fd8459012a37a1b488a8d8c"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P1","level":"warning","message":{"text":"No CI pipeline: No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, \u2026) \u2014 changes aren\u0027t gated by an automated build/test."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"44f01af96e50474fba2df84d95ddf4f7e1d34c29c307830b9efc9057daa6b670"}},{"ruleId":"P2","level":"note","message":{"text":"Logging is not universal: Only 57/65 runnable modules use logging (modules with no entry point or server are excluded \u2014 they are libraries a runnable module hosts). Silent: \u0060crates/build/dl_dev_tools\u0060, \u0060crates/build/dl_web_tests\u0060, \u0060crates/store/dl_query\u0060, \u0060crates/top/dalaran-cli\u0060, \u0060crates/utils/dl_test_mocks\u0060 and 3 more."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"91a94e21d6d4d0e6a2003f94505b0b02b157176f0b24c4820f3f82b4447a97fe"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060dalaran_js/package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_js/package.json"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9fc58fd9405445e7815842ac56ba8ed4fc7c106e0b5534aea1436058ad9067f"}},{"ruleId":"PF3","level":"warning","message":{"text":"Sync-over-async blocking: \u0060login\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":"crates/utils/dl_auth/src/cli.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"956aab6003fc845dfc626472d84fea494ea7b4d6e2060534fb621ba454bf624c"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 3 typed \u00B7 9 plain JS \u2014 the untyped files are crates/viewer/dl_web_viewer_server/web_viewer/sw.js, dalaran_js/scripts/common.mjs, dalaran_js/scripts/docs.mjs, dalaran_js/scripts/publish.mjs, dalaran_js/scripts/serve-docs.mjs, dalaran_js/scripts/version.mjs (\u002B3 more). 0 production file(s) opt out entirely with @ts-nocheck \u00B7 3 @ts-ignore suppression(s)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): dalaran_js/web-viewer/index.ts:768 \u00B7 dalaran_js/web-viewer/index.ts:791 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_js/web-viewer/index.ts"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9f34cf8e55bcaa3ca48c7402f12eea2e1ef615b98abe3a8b6c4c943ff26e182"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): dalaran_js/web-viewer/index.ts:899 \u00B7 dalaran_js/web-viewer/index.ts:914 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_js/web-viewer/index.ts"},"region":{"startLine":899}}}],"partialFingerprints":{"codehealthFindingId/v1":"1df5eea8490a080493ace697a9ef54aa48190016c6c34049336a517fe2c94b3a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): dalaran_js/web-viewer/index.ts:688 \u00B7 dalaran_js/web-viewer/index.ts:710 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_js/web-viewer/index.ts"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"43901fd0093e381ed210be8503e34ec399673a7371b88eefbd2e59a2254775cc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function start (cyclomatic 14, cognitive 13): start has cyclomatic complexity 14 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_js/web-viewer/index.ts"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"14ae9bfce5fe7b0088f239fc86579bf0246fc0f8dbb577ffe4022c0bf27b2ea2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function on_custom_message (cyclomatic 14, cognitive 9): on_custom_message has cyclomatic complexity 14 and cognitive complexity 9; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_notebook/src/js/widget.ts"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc65ad998751482fef68e32fc84b64dfb6fc201dec7a6709e90d19b138d6059f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (top-level) (cyclomatic 11, cognitive 21): (top-level) has cyclomatic complexity 11 and cognitive complexity 21; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_js/scripts/version.mjs"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"9accf1ca239c76355272021d72072b148c802e5e127dc57f4584c3f2c3853e95"}},{"ruleId":"R3","level":"warning","message":{"text":"dalaran_js/web-viewer/index.ts: 1170 lines of code: dalaran_js/web-viewer/index.ts has 1170 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_js/web-viewer/index.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25076becd77052aa4b0dffff9a99733c077d622e40fff6ee2d8377d7f575f17c"}},{"ruleId":"R6","level":"warning","message":{"text":"No test or lint script: test \u2717 \u00B7 lint \u2717 \u00B7 typecheck \u2713 \u2014 read from this repository\u0027s package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: \u0060test\u0060 for the suite, \u0060lint\u0060 or \u0060prettier\u0060 for linting, \u0060typecheck\u0060/\u0060type-check\u0060/\u0060tsc\u0060 for type checking. \u2717 therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline \u2014 a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A \u2713 means the wiring is DECLARED \u2014 a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cc320bfcb25580c14169043586a3ddd9570d8bf0b4c844452a5deb0ff234a119"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private field \u0027#id\u0027: Nothing in its class reads or assigns this private field (for a constructor parameter property: it is stored and never read), and no string key or test reaches it by name. Remove it, or use it where it was meant to take effect."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_js/web-viewer/index.ts"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7167f3b6311d37b33df0a51d3dbb3271dfbb0fd2600e628d01a9e5def505c4"}},{"ruleId":"R7","level":"note","message":{"text":"Unused private method \u0027_on_raw_event\u0027: Nothing in its class calls or references this private method \u2014 no member access, no string key, no decorator, and no test reaches it by name. A private member cannot be called from outside its class, so this is the whole search: remove it, or call it where it was meant to be used."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_js/web-viewer/index.ts"},"region":{"startLine":647}}}],"partialFingerprints":{"codehealthFindingId/v1":"d04501af628d7ec770fb4b1a9e108a0e562ee44a97caef00892833eb0722d084"}},{"ruleId":"R7","level":"note","message":{"text":"Unused module-local declaration \u0027error\u0027: This top-level declaration is not exported and its name occurs nowhere else in its module \u2014 not called, read, typed against, re-exported or named by a string. Nothing outside the module can reach a non-exported binding, so this is the whole search: remove it, or use it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_notebook/build.mjs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"d18cd62362633313922c611b5ae4f4a9de402292bff5e032f07a9e1ea2376462"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027dts-buddy\u0027: Declared in dalaran_js/web-viewer/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_js/web-viewer/package.json"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f55ce017f7715cae35f0b3b35810a6bcb58f37aaf9a17d4a2fbfe009b117443"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027typedoc-github-theme\u0027: Declared in dalaran_js/web-viewer/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_js/web-viewer/package.json"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"13a2e3a2cfb31fb73b2fd839b761010c7cf5b82304cb155caf2afc7bf93d77da"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027typedoc-github-theme\u0027: Declared in dalaran_js/web-viewer-react/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_js/web-viewer-react/package.json"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e7d2b48283f4e390c1767e747824bd637ecf250d1c1a167385ad06d304ba9c"}},{"ruleId":"S1","level":"warning","message":{"text":"Third-party script without Subresource Integrity: \u0060https://cdn.jsdelivr.net/npm/chart.js@4.4.0/dist/chart.umd.min.js\u0060 is executed by this page with no Subresource Integrity. Whoever can answer that request \u2014 the CDN, anyone who compromises it, anyone on the network path \u2014 runs arbitrary script in this page\u0027s origin, with its session."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/ci/templates/benchmark.html"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba705ecbec6f6c5c8aa1c56ce8d29ea3eeecc8237839075dba98d89ad4656b1"}},{"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":"crates/utils/dl_auth/src/cli.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2e3903524a03dd6d3013899c3bc4f7ebf31522053cd8b61ec4429df443c39a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060class_ids is None and keypoint_ids is not None\u0060 appears character-identically in 2 files \u2014 dalaran_py/dalaran_sdk/dalaran/archetypes/points2d_ext.py, dalaran_py/dalaran_sdk/dalaran/archetypes/points3d_ext.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":"dalaran_py/dalaran_sdk/dalaran/archetypes/points2d_ext.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"35b25c7209ec3307c9a2c0075d9d4e38091f28337b3411b59aa0157bad9c4ba7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fnmatchcase(normalized, pattern) or fnmatchcase(normalized, \u0022/\u0022 \u002B pattern.strip(\u0022/\u0022))\u0060 appears character-identically in 2 files \u2014 dalaran_py/dalaran_sdk/dalaran/ros2/msg_map.py, dalaran_py/dalaran_sdk/dalaran/ros2/naming.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":"dalaran_py/dalaran_sdk/dalaran/ros2/msg_map.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78432c8d0003f968e4666b8b86bfc26489212b375a9d340f1ade49c55fb9e34"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(data[0], Sequence) and len(data[0]) \u003E 0 and isinstance(data[0][0], numbers.Number)\u0060 appears character-identically in 3 files \u2014 dalaran_py/dalaran_sdk/dalaran/components/geo_line_string_ext.py, dalaran_py/dalaran_sdk/dalaran/components/line_strip2d_ext.py, dalaran_py/dalaran_sdk/dalaran/components/line_strip3d_ext.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":"dalaran_py/dalaran_sdk/dalaran/components/geo_line_string_ext.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"90041ee9f6f3b34dbdb1a49d11478f21a49a89ca978d72a7988975a80b61d3e4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(data[0], np.ndarray) and data[0].shape == (2,)\u0060 appears character-identically in 2 files \u2014 dalaran_py/dalaran_sdk/dalaran/components/geo_line_string_ext.py, dalaran_py/dalaran_sdk/dalaran/components/line_strip2d_ext.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":"dalaran_py/dalaran_sdk/dalaran/components/geo_line_string_ext.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee97ef26497f990855b393a170932b64353142d4014e79c66f547b3a44c4b8c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!node_info.is_leaf \u0026\u0026 !entity_tree.path.is_root()\u0060 appears character-identically in 2 files \u2014 crates/viewer/dl_selection_panel/src/view_entity_picker.rs, crates/viewer/dl_time_panel/src/streams_tree_data.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/view_entity_picker.rs"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"a633d36f03b3cc47a8d98f07f1c5c7645f998ad38c4b85639e047b158d4dff75"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!series.visible || series.points.is_empty()\u0060 appears character-identically in 3 files \u2014 crates/viewer/dl_view_time_series/src/line_visualizer_system.rs, crates/viewer/dl_view_time_series/src/point_visualizer_system.rs, crates/viewer/dl_view_time_series/src/view_class.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/line_visualizer_system.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c488b3f4189301a166b7b59730ec5339d7b80a04094e9daff1b0231545a70be"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!warned \u0026\u0026 BLOCKED_WARNING_THRESHOLD \u003C start.elapsed()\u0060 appears character-identically in 2 files \u2014 crates/utils/dl_quota_channel/src/async_broadcast_channel.rs, crates/utils/dl_quota_channel/src/sync/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":"crates/utils/dl_quota_channel/src/async_broadcast_channel.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93d80ee8518002bb92dd7cda3b78ce90e2f22bd42f6f4bb1f63139209dbd981"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060all_scalar_chunks.chunks.first() \u0026\u0026 chunk.is_static()\u0060 appears character-identically in 2 files \u2014 crates/viewer/dl_view_time_series/src/line_visualizer_system.rs, crates/viewer/dl_view_time_series/src/point_visualizer_system.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/line_visualizer_system.rs"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba336854da0f2141ff5721d7874ba77c49912dacca7aa825e84d3fe156314cb9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060any_missing_chunks \u0026\u0026 ctx.db.can_fetch_chunks_from_redap()\u0060 appears character-identically in 2 files \u2014 crates/viewer/dl_data_ui/src/component_path_ui.rs, crates/viewer/dl_data_ui/src/instance_path_ui.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_data_ui/src/component_path_ui.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"2498ccd5a58bb8fe4e0de2a27c1138b6facb8be693b334bc1ab2e89bd1daec37"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060cfg!(feature = \u0022perf_telemetry\u0022) \u0026\u0026 dl_log::env_var_is_truthy(\u0022TELEMETRY_ENABLED\u0022)\u0060 appears character-identically in 2 files \u2014 crates/top/dalaran/src/commands/entrypoint.rs, dalaran_py/src/python_bridge.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/entrypoint.rs"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df9bec61b637e9ae9e9f5234f36634c7af6d161a6d17257b60c547e4baad65e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060chunk.is_sync \u0026\u0026 !state.previous_frame_was_idr\u0060 appears character-identically in 2 files \u2014 crates/utils/dl_video/src/h264.rs, crates/utils/dl_video/src/h265.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/h264.rs"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"4033fc925f2fe4a61edfddd5c217640c8b37801e63ab3b41d89608f8880175dd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060resolution_in_pixel[0] == 0 || resolution_in_pixel[1] == 0\u0060 appears character-identically in 3 files \u2014 crates/viewer/dl_view_spatial/src/ui_3d.rs, crates/viewer/dl_view_time_series/src/view_class.rs, crates/viewer/dl_viewer_context/src/gpu_bridge/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":"crates/viewer/dl_view_spatial/src/ui_3d.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9c3d13282e5976029deaf1dff5e869c6f94c69eaf8a0d83bc854bd78fc9d306"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060self.0.is_nan() \u0026\u0026 other.0.is_nan() || self.0 == other.0\u0060 appears character-identically in 2 files \u2014 crates/store/dl_sdk_types/src/components/draw_order_ext.rs, crates/viewer/dl_renderer/src/size.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_sdk_types/src/components/draw_order_ext.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a954e8a9edbafce061a4a6bff844497a137d7dd227edba168dc130ba0f4753"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060suspicious_length.is_finite() \u0026\u0026 suspicious_length \u003E 0.0\u0060 appears character-identically in 2 files \u2014 crates/viewer/dl_view_spatial/src/visualizers/capsules3d.rs, crates/viewer/dl_view_spatial/src/visualizers/cylinders3d.rs. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/capsules3d.rs"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fd56d935bad75fca5927b94172e75edb271d57f42d8b99e736f28ec7e2cf599"}},{"ruleId":"X12","level":"warning","message":{"text":"Branch is unreachable \u2014 its condition is a constant: The condition is the literal \u0060false\u0060, so this body never runs. The branch can never run. If it is a switch, make it a \u0060const\u0060 or a \u0060#[cfg(\u2026)]\u0060 so the intent is stated; otherwise delete the dead branch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_web_viewer_server/src/lib.rs"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"f06dfd6b6bb67310e06046f78f1c116ab46af0b978d21fe51cc7f4f79d9ca6ac"}},{"ruleId":"X12","level":"warning","message":{"text":"Statement is unreachable \u2014 control never gets past the statement before it: \u0060let mut caches = { dl_tracing::profile_wait !(\u0022master-cache-write-lock\u0022); sel\u2026\u0060 follows \u0060{ return cache; }\u0060 (line 157) in the same block, and control never passes that statement \u2014 it returns, breaks, continues, panics, exits or calls a function that never returns. This code cannot run for any input; rustc warns \u0060unreachable_code\u0060 on it. Delete it, or move it before the statement that leaves if it was meant to run."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/memoizers.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"dab7db9132f044902f0c57e52135e965a8215889fc06157436d2f2dbfa62f1cb"}},{"ruleId":"X12","level":"warning","message":{"text":"Branch is unreachable \u2014 its condition is a constant: The condition is the literal \u0060false\u0060, so this body never runs. The branch can never run. If it is a switch, make it a \u0060const\u0060 or a \u0060#[cfg(\u2026)]\u0060 so the intent is stated; otherwise delete the dead branch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/dev_panel/mod.rs"},"region":{"startLine":596}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f76405d26f38e859860957cbf3516a2e3e640e2bda3831c23f23dcc9c007880"}},{"ruleId":"X12","level":"warning","message":{"text":"Branch is unreachable \u2014 its condition is a constant: The condition is the literal \u0060false\u0060, so this body never runs. The branch can never run. If it is a switch, make it a \u0060const\u0060 or a \u0060#[cfg(\u2026)]\u0060 so the intent is stated; otherwise delete the dead branch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_tensor/src/tensor_dimension_mapper.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"765c3c852defee83b311d8b8b91d8609f8a93be8116576f405e512f585d0dc31"}},{"ruleId":"X12","level":"warning","message":{"text":"Branch is unreachable \u2014 its condition is a constant: The condition is the literal \u0060false\u0060, so this body never runs. The branch can never run. If it is a switch, make it a \u0060const\u0060 or a \u0060#[cfg(\u2026)]\u0060 so the intent is stated; otherwise delete the dead branch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_dataframe/src/view_query/ui.rs"},"region":{"startLine":409}}}],"partialFingerprints":{"codehealthFindingId/v1":"e96172e4a22500c24007183bdac6da3fb0b5dec7f0500a798155edadf88fc23e"}},{"ruleId":"X12","level":"warning","message":{"text":"Branch is unreachable \u2014 its condition is a constant: The \u0060if\u0060 on line 109 tests the literal \u0060true\u0060, so control always takes it and this \u0060else\u0060 never runs. The branch can never run. If it is a switch, make it a \u0060const\u0060 or a \u0060#[cfg(\u2026)]\u0060 so the intent is stated; otherwise delete the dead branch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/list_item/property_content.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5d8fed0a803f46e306bc7aacf2df41838ae663fc5d53c969847ae229a5b984"}},{"ruleId":"X12","level":"warning","message":{"text":"Branch is unreachable \u2014 its condition is a constant: The \u0060if\u0060 on line 137 tests the literal \u0060true\u0060, so control always takes it and this \u0060else\u0060 never runs. The branch can never run. If it is a switch, make it a \u0060const\u0060 or a \u0060#[cfg(\u2026)]\u0060 so the intent is stated; otherwise delete the dead branch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/allocator/cpu_write_gpu_read_belt.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"f57b81777184378ae8adf4edc72c5b6eeeb0817a0913dc7d96ee7fb6b63d9a87"}},{"ruleId":"X12","level":"warning","message":{"text":"Branch is unreachable \u2014 its condition is a constant: The condition is the literal \u0060false\u0060, so this body never runs. The branch can never run. If it is a switch, make it a \u0060const\u0060 or a \u0060#[cfg(\u2026)]\u0060 so the intent is stated; otherwise delete the dead branch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/demux/mp4.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e5c31c87aa7eb09e19b52156b3a2690335ecc9d08f243e9f1250167fa9fcc1d"}},{"ruleId":"X12","level":"warning","message":{"text":"Branch is unreachable \u2014 its condition is a constant: The condition is the literal \u0060false\u0060, so this body never runs. The branch can never run. If it is a switch, make it a \u0060const\u0060 or a \u0060#[cfg(\u2026)]\u0060 so the intent is stated; otherwise delete the dead branch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/decode/ffmpeg_cli/ffmpeg.rs"},"region":{"startLine":479}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58f40a91be01cab5524553fdea6c36b73eb112f686c50d2145ab96398620d20"}},{"ruleId":"X12","level":"warning","message":{"text":"Branch is unreachable \u2014 its condition is a constant: The condition is the literal \u0060false\u0060, so this body never runs. The branch can never run. If it is a switch, make it a \u0060const\u0060 or a \u0060#[cfg(\u2026)]\u0060 so the intent is stated; otherwise delete the dead branch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/grpc.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"853533869d926707757fe1f61510046e7502216e3036516434aa1b9fd2a41bb4"}},{"ruleId":"X12","level":"warning","message":{"text":"Branch is unreachable \u2014 its condition is a constant: The condition is the literal \u0060false\u0060, so this body never runs. The branch can never run. If it is a switch, make it a \u0060const\u0060 or a \u0060#[cfg(\u2026)]\u0060 so the intent is stated; otherwise delete the dead branch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/decoder/state_machine.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d7a4c29af2e2d38a4d60e3bcf83ee93d40861e03aefc86b08582ecacc9b39db"}},{"ruleId":"X12","level":"warning","message":{"text":"Branch is unreachable \u2014 its condition is a constant: The condition is the literal \u0060false\u0060, so this body never runs. The branch can never run. If it is a switch, make it a \u0060const\u0060 or a \u0060#[cfg(\u2026)]\u0060 so the intent is stated; otherwise delete the dead branch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/importer_urdf/mod.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39fb8655a38993608e1a2427073d6120a4ad6d7ec9ceff5f684c4f54c52b870"}},{"ruleId":"X12","level":"warning","message":{"text":"Branch is unreachable \u2014 its condition is a constant: The condition is the literal \u0060false\u0060, so this body never runs. The branch can never run. If it is a switch, make it a \u0060const\u0060 or a \u0060#[cfg(\u2026)]\u0060 so the intent is stated; otherwise delete the dead branch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_grpc_client/src/write_table.rs"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ee1968209b12aac22cc7352cf4075b16a4f7b6f3e92c8e6ddeeef22e362937"}},{"ruleId":"X12","level":"warning","message":{"text":"Statement is unreachable \u2014 control never gets past the statement before it: \u0060None\u0060 follows \u0060{ * idx = if let Some(idx) = if before { current_idx.checked_sub(1) } else { \u2026\u0060 (line 1051) in the same block, and control never passes that statement \u2014 it returns, breaks, continues, panics, exits or calls a function that never returns. This code cannot run for any input; rustc warns \u0060unreachable_code\u0060 on it. Delete it, or move it before the statement that leaves if it was meant to run."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/dlr_manifest_index/chunk_prioritizer.rs"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e75613d82fb1863c5be6f34bcd01231d82bc8078d93e11b08232c1d2dbf5b71"}},{"ruleId":"X12","level":"warning","message":{"text":"Branch is unreachable \u2014 its condition is a constant: The condition is the literal \u0060false\u0060, so this body never runs. The branch can never run. If it is a switch, make it a \u0060const\u0060 or a \u0060#[cfg(\u2026)]\u0060 so the intent is stated; otherwise delete the dead branch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/objects/from_fbs.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"13fd31d9837525883bc06e9c8da82b493b1443aa90b9b1acff260bbb3545885a"}},{"ruleId":"X12","level":"warning","message":{"text":"Branch is unreachable \u2014 its condition is a constant: The \u0060if\u0060 on line 115 tests the literal \u0060true\u0060, so control always takes it and this \u0060else\u0060 never runs. The branch can never run. If it is a switch, make it a \u0060const\u0060 or a \u0060#[cfg(\u2026)]\u0060 so the intent is stated; otherwise delete the dead branch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/reflection.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"6707d6b434ffdea9190ce0e05434d29eec9dfae4574d91ace1132df011fda1b9"}},{"ruleId":"X12","level":"warning","message":{"text":"Branch is unreachable \u2014 its condition is a constant: The condition is the literal \u0060false\u0060, so this body never runs. The branch can never run. If it is a switch, make it a \u0060const\u0060 or a \u0060#[cfg(\u2026)]\u0060 so the intent is stated; otherwise delete the dead branch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/reflection.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d3264c232f2aa8a981d37475621db78f116a29bafb8456783fe8b28a4e7cece"}},{"ruleId":"X12","level":"warning","message":{"text":"Branch is unreachable \u2014 its condition is a constant: The condition is the literal \u0060false\u0060, so this body never runs. The branch can never run. If it is a switch, make it a \u0060const\u0060 or a \u0060#[cfg(\u2026)]\u0060 so the intent is stated; otherwise delete the dead branch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":2314}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c97996fd0ff4c7050f7ce91960351db709ce41e5f8e86ec6d5c8045cea1ce9"}},{"ruleId":"X12","level":"warning","message":{"text":"Branch is unreachable \u2014 its condition is a constant: The condition is the literal \u0060false\u0060, so this body never runs. The branch can never run. If it is a switch, make it a \u0060const\u0060 or a \u0060#[cfg(\u2026)]\u0060 so the intent is stated; otherwise delete the dead branch."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/docs/website.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"faf2821cecf37551b53bb43da1f8926acb5cff418e4c5fca42b78948b0093c52"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060compile\u0060 is public, takes a document from its caller (line 28) and hands it to \u0060compile_inner\u0060, which recurses at line 249 through \u0060compile_split_branch\u0060, \u0060compile_merged\u0060 and back with a piece of the document (and at line 252, line 356, line 404) \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 \u0060compile_inner\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/chunk_stream/engine.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"745b4775d1c10ad740acd799cc2906a25d5dff631c9a89cd48dfa4e4d5bf317f"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060tokens\u0060 is public and takes a \u0060AppContext\u0060 as its receiver from its caller, and it calls itself at line 168 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 \u0060tokens\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/app_context.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"a442904acc26916a4175d43e3f478cb2a38567239e74b784b76949fc8a45840c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060tokens\u0060 is public and takes a \u0060ViewerContext\u0060 as its receiver from its caller, and it 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 \u0060tokens\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/viewer_context.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e628494dcf86975ed86dc7ab7694d902f9e8352509ba78a2f2a26c1f8cda8068"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060render_mode\u0060 is public and takes a \u0060ViewerContext\u0060 as its receiver from its caller, and it calls itself at line 96 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 \u0060render_mode\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/viewer_context.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f3542225f9e5723faf1fdd3422aa2d09fb72fb7419f7add22e4a4fc5195f98"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060store_hub\u0060 is public and takes a \u0060ViewerContext\u0060 as its receiver from its caller, and it calls itself at line 111 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 \u0060store_hub\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/viewer_context.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"445582b141c5f8f7bd184017d3a91dd4363b4e82479b471280b286389d7fcf98"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060store_bundle\u0060 is public and takes a \u0060ViewerContext\u0060 as its receiver from its caller, and it calls itself at line 116 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 \u0060store_bundle\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/viewer_context.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"61e3a6b9d66bdb21ae3316714f254fcec81ec208803e8dcf043dd7cf466741bc"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060table_stores\u0060 is public and takes a \u0060ViewerContext\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 \u0060table_stores\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/viewer_context.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"528e0444305440389ed2624e08ba2c85aa22b2c8f3c894d5fa78fa26c48fd834"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060store_id\u0060 is public and takes a \u0060ViewerContext\u0060 as its receiver from its caller, and it calls itself at line 190 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 \u0060store_id\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/viewer_context.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"746dc8d713eb08c8ca6879c4536f1057c6e73442847dba3cab377effc6969bbb"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060selection\u0060 is public and takes a \u0060ViewerContext\u0060 as its receiver from its caller, and it calls itself at line 195 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 \u0060selection\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/viewer_context.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19ace8f0579d21fd8ee98070fdac15ec6ecf6c14bd1c84d281a420d69c4d00e"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060is_selected_or_loading\u0060 is public and takes a \u0060ViewerContext\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 \u0060is_selected_or_loading\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/viewer_context.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbbe81de23850dcc414dab5245062f32d283decb563656499246fc9a4941a16"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060hovered\u0060 is public and takes a \u0060ViewerContext\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 \u0060hovered\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/viewer_context.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0cd383e2dfbb3794981454473f6edd413baa18de7ceee4dfacebf80f10c2ac0"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060selection_state\u0060 is public and takes a \u0060ViewerContext\u0060 as its receiver from its caller, and it calls itself at line 209 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 \u0060selection_state\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/viewer_context.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a6f35d0de9fd22df1d31b478df16c0663ffedd56d75871dec007a82500ed0e4"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060active_redap_entry\u0060 is public and takes a \u0060ViewerContext\u0060 as its receiver from its caller, and it calls itself at line 214 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060active_redap_entry\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/viewer_context.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"428f7fcb47e71b96c3893f247bbeb3894b5ce118c0b927b14c3fb954ea03cfc4"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060active_table_id\u0060 is public and takes a \u0060ViewerContext\u0060 as its receiver from its caller, and it calls itself at line 219 with a piece of the document \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060active_table_id\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/viewer_context.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c8cf5c2b02e3dee9ed118763b04d4d5d158b3707e876647d5f98dc50a9bb227"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060focused_item\u0060 is public and takes a \u0060ViewerContext\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 \u0060focused_item\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/viewer_context.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"781642277fd49257b0ac93929c11f3ab9da0e48ed253207cd819f0fffc4f8564"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060drag_and_drop_manager\u0060 is public and takes a \u0060ViewerContext\u0060 as its receiver from its caller, and it calls itself at line 229 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 \u0060drag_and_drop_manager\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/viewer_context.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c3e069a61bcb940a3adfdb007247e681e4ca79a2eb83bc6599cbd4124cceaa5"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060current_query\u0060 is public and takes a \u0060ViewerContext\u0060 as its receiver from its caller, and it calls itself at line 234 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 \u0060current_query\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/viewer_context.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7fc78cac799cec6cbb70e8e11b175ac968ad4a316f38e120c880cdce3e38491"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060handle_select_hover_drag_interactions\u0060 is public and takes a \u0060ViewerContext\u0060 as its receiver from its caller, and it calls itself at line 261 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 \u0060handle_select_hover_drag_interactions\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/viewer_context.rs"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"70297a23dce2c183e8d75eadc40117fe08d75cc067c9c1eb393c63dfb1a633eb"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060handle_select_focus_sync\u0060 is public and takes a \u0060ViewerContext\u0060 as its receiver from its caller, and it calls itself at line 274 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 \u0060handle_select_focus_sync\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/viewer_context.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"425daf7ebff7512ae0a967cf6dab8ad8a83018e0c2cc4c3cfdb77e2805406019"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060revert_to_default_route\u0060 is public and takes a \u0060ViewerContext\u0060 as its receiver from its caller, and it calls itself at line 286 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 \u0060revert_to_default_route\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/viewer_context.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb0051129c6d384c48a39032fd51b3c6c539a91aab2062bac8fbc96b7e578c7b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060display_name\u0060 is public and takes a \u0060ViewClassRegistry\u0060 as its receiver from its caller, and it calls itself at line 408 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 \u0060display_name\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/view/view_class_registry.rs"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a9e5967e9b877853d2326409fcf44c711180e20a90729161a9e1b72fb7507a8"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060hash\u0060 is public and takes a \u0060WgpuCoreWrappedContextError\u0060 as its receiver from its caller, and it calls itself at line 184 with a piece of the document (and at line 185) \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 \u0060hash\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/error_handling/wgpu_core_error.rs"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7ee6671d2a5fa099c8556752df5e263e6e5e6a86824efb8197310d65cd7fd37"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060eq\u0060 is public and takes a \u0060WgpuCoreWrappedContextError\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 \u0060eq\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/error_handling/wgpu_core_error.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a9f1f70e840c3f04b7dd695ff8b872671c456bb38ea3f13850ddb45dd1b599"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060visit\u0060 is public and takes a \u0060ContentsData\u0060 as its receiver from its caller, and it calls itself at line 86 with a piece of the document (and at line 87, line 166) \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":"crates/viewer/dl_blueprint_tree/src/data.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"128f768b4187c43973d824db8965164d85d481708773d5d7304ff105a9e85901"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060subscribe\u0060 is public and takes a \u0060Sender\u0060 as its receiver from its caller, and it calls itself at line 268 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 \u0060subscribe\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_quota_channel/src/async_broadcast_channel.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"696817ef98d718c7974aff35c21196c0cf06a6d99bdfe89778359a391c88f384"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060recv\u0060 is public and takes a \u0060Receiver\u0060 as its receiver from its caller, and it calls itself at line 349 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 \u0060recv\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_quota_channel/src/async_broadcast_channel.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"b603c6968c5ce120cca07d22d913ff1bce8e1833af1b7fe4c7acfa7876294442"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060clone\u0060 is public and takes a \u0060Sender\u0060 as its receiver from its caller, and it calls itself at line 18 with a piece of the document (and at line 19) \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":"crates/utils/dl_quota_channel/src/async_mpsc_channel.rs"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bddb5195b001bb531fa0fe5ca78e3c1fcb60786e7a7e4656e1dc73856f5608a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060send\u0060 is public and takes a \u0060Sender\u0060 as its receiver from its caller, and it calls itself at line 33 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 \u0060send\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_quota_channel/src/async_mpsc_channel.rs"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"90550065d542bf476a764a06753b1a0206c708a4ca0706f55e7b90c8df59fe0b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060try_send\u0060 is public and takes a \u0060Sender\u0060 as its receiver from its caller, and it calls itself at line 68 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_send\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_quota_channel/src/async_mpsc_channel.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4fbf4ff088e6008a7409d32f0b38abe10b647d683f646fe743b063aedab726d"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060recv\u0060 is public and takes a \u0060Receiver\u0060 as its receiver from its caller, and it calls itself at line 82 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 \u0060recv\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_quota_channel/src/async_mpsc_channel.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"aea4c5e7769d1c8f14d85eeee1654683d0968e5df3beb44d90132aed66290316"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060clone\u0060 is public and takes a \u0060Sender\u0060 as its receiver from its caller, and it calls itself at line 71 with a piece of the document (and at line 313) \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":"crates/utils/dl_quota_channel/src/sync/mod.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"5faac46e3349223829218821ec7770dc6402130a65bd48f24e229635be24de51"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060is_empty\u0060 is public and takes a \u0060Sender\u0060 as its receiver from its caller, and it calls itself at line 275 with a piece of the document (and at line 367) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060is_empty\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_quota_channel/src/sync/mod.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ed64daa34e6ccf1d3545fcb397d89ebe2c75b46bb61d65cb4613ed116c6c97"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060len\u0060 is public and takes a \u0060Sender\u0060 as its receiver from its caller, and it calls itself at line 281 with a piece of the document (and at line 373) \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 \u0060len\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_quota_channel/src/sync/mod.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c2431e6ba782176bf7f371a7fabf6e210f0b80c551fe8dff5d99b39cf86b18"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060recv\u0060 is public and takes a \u0060Receiver\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 \u0060recv\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_quota_channel/src/sync/mod.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b729a35c155bc1bb3de1806dc879ecbbbc4b4132262ce94cb656a11454a099"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060recv_timeout\u0060 is public and takes a \u0060Receiver\u0060 as its receiver from its caller, and it calls itself at line 346 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 \u0060recv_timeout\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_quota_channel/src/sync/mod.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"e03b956b8800c9f5118c5ab7fb71accad3b92b3b5efb6206725a16596ddaa844"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060try_recv\u0060 is public and takes a \u0060Receiver\u0060 as its receiver from its caller, and it calls itself at line 353 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_recv\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_quota_channel/src/sync/mod.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef5db153f51b4898de152c63e83f454dda92df13218b41da5a0d1f7e7034f648"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060recv\u0060 is public and takes a \u0060Select\u0060 as its receiver from its caller, and it calls itself at line 137 with a piece of the document (and at line 202) \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 \u0060recv\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_quota_channel/src/sync/select.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cbbe82bcc302dec837d1fe7ae1aa290e5ce6a7b80091a1177eab185a4c29b53"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060select\u0060 is public and takes a \u0060Select\u0060 as its receiver from its caller, and it calls itself at line 148 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 \u0060select\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_quota_channel/src/sync/select.rs"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c293da052a0ae2703a4863c35a2c22bce2d30ddd630357fa616ea4ad175127"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060try_select\u0060 is public and takes a \u0060Select\u0060 as its receiver from its caller, and it calls itself at line 157 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_select\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_quota_channel/src/sync/select.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac12d2ca10b1e2b705b20f7030fd1d182c011ab250ae32c43b2cb980b32165c4"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060select_timeout\u0060 is public and takes a \u0060Select\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 \u0060select_timeout\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_quota_channel/src/sync/select.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"df653f91e6589d4de8f757395cdebd1a4bf299f96920421660917d13908aed0b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060index\u0060 is public and takes a \u0060SelectedOperation\u0060 as its receiver from its caller, and it calls itself at line 195 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 \u0060index\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_quota_channel/src/sync/select.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba31044f34e660558a06336317219da2918642b632c1fc28bf58f974d8a4797"}},{"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 59 with a piece of the document (and at line 64, line 67, line 71) \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":"crates/utils/dl_mutex/src/lib.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"031f3ffa212260781c3277be0c2e1aa4e820283f95916246704cbab2dd823dcb"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060heap_size_bytes\u0060 is public and takes a \u0060Mutex\u0060 as its receiver from its caller, and it calls itself at line 26 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 \u0060heap_size_bytes\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_mutex/src/lib.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f47bce48b04ec0a4ca766ce09a408a1a3a7d5ad16f41754e9423257de28ed8"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060get_mut\u0060 is public and takes a \u0060Mutex\u0060 as its receiver from its caller, and it calls itself at line 81 with a piece of the document (and at line 231) \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_mut\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_mutex/src/lib.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b385f08702e3a0fa89609b160f9098757b098ea7389644f363958d81bba4e48"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060read\u0060 is public and takes a \u0060RwLock\u0060 as its receiver from its caller, and it calls itself at line 160 with a piece of the document (and at line 163) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060read\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_mutex/src/lib.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff105e5b324d2c5979db843ec6daff7847692e096387ec2aef6f4e9cb4b729e2"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060read_upgradable\u0060 is public and takes a \u0060RwLock\u0060 as its receiver from its caller, and it recurses at line 186 through \u0060upgradable_read\u0060 and back with a piece of the document (and at line 189, line 201) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060read_upgradable\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_mutex/src/lib.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"28da87f4614068a1e7548f85cd02680b42643d6adb42eac7bbf8dcde9d3b5249"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060write\u0060 is public and takes a \u0060RwLock\u0060 as its receiver from its caller, and it calls itself at line 218 with a piece of the document (and at line 221) \u2014 and nowhere in the walk is a depth or nesting counter compared with a bound. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. When a Rust thread runs out of stack it is not unwound: the runtime reports the overflow and aborts the process, so \u0060catch_unwind\u0060 does not stop it and every other request the process serves dies with it (spawned threads, a Tokio worker included, get 2 MiB by default). serde_json and serde_yaml stop parsing at 128 levels only on their default path; a value from \u0060disable_recursion_limit\u0060, from another format or parser, or built in code carries whatever nesting it was given. Thread a depth argument through \u0060write\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_mutex/src/lib.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1691916218a11a97cbed72dddf6a0163de32543317ef2cf55d84ecf1b8b71f7"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060clone\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 \u0060clone\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_mutex/src/lib.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c97d4e32d0bb8df136a54bf9a88e337d905fa0c4e2b47b0f2071fe24346d52b"}},{"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 248 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":"crates/utils/dl_mutex/src/lib.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b61e2590883661f49ccfe77a28deb4e4e586403d1533b7584d5d80838b0d1c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060hash\u0060 is public and takes a \u0060Backtrace\u0060 as its receiver from its caller, and it calls itself at line 20 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 \u0060hash\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_memory/src/backtrace_native.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"923c1a932020b5fced1e7dae5ca1c0a3bc55483a86ca721c40f51cbe4b29e3ce"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060size_bytes\u0060 is public and takes a \u0060NamedMemUsageTree\u0060 as its receiver from its caller, and it calls itself at line 55 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 \u0060size_bytes\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_byte_size/src/mem_usage_tree.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"a850020d0d547dc79ad6fd8e39ce67018cc87af487a49ff42c7960afbf2f2ae3"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060blueprint_path\u0060 is public and takes a \u0060ContainerLike\u0060 as its receiver from its caller, and it calls itself at line 96 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 \u0060blueprint_path\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/blueprint/container.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15489968fa4dfe529133a63060ae7b5abe0f5e99371db77c7f22a0544edada6"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060log_to_stream\u0060 is public and takes a \u0060ContainerLike\u0060 as its receiver from its caller, and it recurses at line 106 through \u0060log_container\u0060 and back with a piece of the document (and at line 107, line 108, line 109, line 110, line 121) \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 \u0060log_to_stream\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/blueprint/container.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc0574d1adcb0d15f526bfd748fbf5cb3bcd3d19064075938d00f5e87dfdcff"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060writer\u0060 (line 1701) 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":"crates/viewer/dl_viewer/src/app/mod.rs"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f80ba5a0be70cf11b26cccb0252d8925c45ff65891e84ae19a8e44c285e532"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060frame\u0060 (line 68) is a transaction this function owns and never releases: no \u0060commit()\u0060 (or a deliberate \u0060rollback()\u0060) on any path, and it is not handed on. Rust drops it at the end of the scope, and a transaction that is dropped rolls back, so every write made through it is silently undone. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/visualizer_ui.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b3316c593e00c6f1fc23608addf9e74cefe6258dcde63346f68c9f4b2f1f692"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060table_state\u0060 (line 401) is a \u0060DataFusionAdapter\u0060 released by \u0060update_query()\u0060 only on the path that reaches line 504; the \u0060return\u0060 on line 438 leaves before that with a success value, and on that path \u0060DataFusionAdapter\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it before that \u0060return\u0060 too (or return an error there, if the early exit is a failure)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/datafusion_table_widget.rs"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"841fe59997704a5e4c3586a33d238bee33de65b2eb8df282ba2a4391cf7e6c83"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060selection\u0060 (line 1160) is a \u0060TableSelectionState\u0060 this function owns and never releases: no \u0060store()\u0060 on any path, and it is not handed on. Rust drops it at the end of the scope, and \u0060TableSelectionState\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/datafusion_table_widget.rs"},"region":{"startLine":1160}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c2091e59dcdddd2d03794659c55da11f1864d3f3ab9204e35a5341472cce1a5"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060viewport\u0060 (line 72) is a \u0060ViewportBlueprint\u0060 this function owns and never releases: no \u0060save_to_blueprint_store()\u0060 on any path, and it is not handed on. Rust drops it at the end of the scope, and \u0060ViewportBlueprint\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_dataframe_ui/src/preview_renderer.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af185cf1b74fab7e73bd2c0f018b5e58f1313149b1919a1a48a125015eb1542"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060data_type_ui\u0060 (line 76) is a \u0060DataTypeUi\u0060 this function owns and never releases: no \u0060list_item_ui()\u0060 on any path, and it is not handed on. Rust drops it at the end of the scope, and \u0060DataTypeUi\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_arrow_ui/src/arrow_node.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7c4c8ff934d7de1a868683dae1456eecd383e8c8ee697f7bf75ecfbbbcbb0e"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060data_type_ui\u0060 (line 130) is a \u0060DataTypeUi\u0060 this function owns and never releases: no \u0060list_item_ui()\u0060 on any path, and it is not handed on. Rust drops it at the end of the scope, and \u0060DataTypeUi\u0060 has no \u0060Drop\u0060, so what it holds is only completed by that call and is lost without it. Release it where the work ends."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_arrow_ui/src/datatype_ui.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28b2aff3f6c3464e6862357d08cf313c236a56fe44b6f32115036fb6833dc35"}},{"ruleId":"X18","level":"warning","message":{"text":"Owned value\u0027s release suppressed and never restored: \u0060std::mem::forget(stream)\u0060 (line 62) takes \u0060stream\u0060 out of Rust\u0027s ownership: its \u0060Drop\u0060 never runs, so whatever it holds \u2014 a descriptor, a socket, a buffer, a lock \u2014 is never given back, and nothing can give it back later because the value is gone. Let it drop (or call its explicit close) where its work ends; if the handle must outlive this function, turn it into a raw handle with \u0060into_raw\u0060/\u0060into_raw_fd\u0060 and reclaim it with the matching \u0060from_raw\u0060 when the owner is done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/global.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74b2d2226f5ea6ef0276489c7504003878b1bf89a852bd8d645ec3e0acd46cc"}},{"ruleId":"X18","level":"warning","message":{"text":"Owned value\u0027s release suppressed and never restored: \u0060std::mem::forget(global.write().take())\u0060 (line 265) takes \u0060global.write().take()\u0060 out of Rust\u0027s ownership: its \u0060Drop\u0060 never runs, so whatever it holds \u2014 a descriptor, a socket, a buffer, a lock \u2014 is never given back, and nothing can give it back later because the value is gone. Let it drop (or call its explicit close) where its work ends; if the handle must outlive this function, turn it into a raw handle with \u0060into_raw\u0060/\u0060into_raw_fd\u0060 and reclaim it with the matching \u0060from_raw\u0060 when the owner is done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/global.rs"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"7716447b544c666059d207d1ea8e447d224b3fe567241dcbd97d6ff9b019ce29"}},{"ruleId":"X18","level":"warning","message":{"text":"Owned value\u0027s release suppressed and never restored: \u0060std::mem::forget(cell.take())\u0060 (line 269) takes \u0060cell.take()\u0060 out of Rust\u0027s ownership: its \u0060Drop\u0060 never runs, so whatever it holds \u2014 a descriptor, a socket, a buffer, a lock \u2014 is never given back, and nothing can give it back later because the value is gone. Let it drop (or call its explicit close) where its work ends; if the handle must outlive this function, turn it into a raw handle with \u0060into_raw\u0060/\u0060into_raw_fd\u0060 and reclaim it with the matching \u0060from_raw\u0060 when the owner is done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/global.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c97ec565092c6e420fb3fa7d392b279a4a97fe655ccc1abbfc63f6a80f0cc4"}},{"ruleId":"X18","level":"warning","message":{"text":"Owned value\u0027s release suppressed and never restored: \u0060std::mem::forget(global.write().take())\u0060 (line 275) takes \u0060global.write().take()\u0060 out of Rust\u0027s ownership: its \u0060Drop\u0060 never runs, so whatever it holds \u2014 a descriptor, a socket, a buffer, a lock \u2014 is never given back, and nothing can give it back later because the value is gone. Let it drop (or call its explicit close) where its work ends; if the handle must outlive this function, turn it into a raw handle with \u0060into_raw\u0060/\u0060into_raw_fd\u0060 and reclaim it with the matching \u0060from_raw\u0060 when the owner is done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/global.rs"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd83cf89efa27be955bdb00ac75e3ec8846e4df61e1352fca9088e9cb318182a"}},{"ruleId":"X18","level":"warning","message":{"text":"Owned value\u0027s release suppressed and never restored: \u0060std::mem::forget(cell.take())\u0060 (line 279) takes \u0060cell.take()\u0060 out of Rust\u0027s ownership: its \u0060Drop\u0060 never runs, so whatever it holds \u2014 a descriptor, a socket, a buffer, a lock \u2014 is never given back, and nothing can give it back later because the value is gone. Let it drop (or call its explicit close) where its work ends; if the handle must outlive this function, turn it into a raw handle with \u0060into_raw\u0060/\u0060into_raw_fd\u0060 and reclaim it with the matching \u0060from_raw\u0060 when the owner is done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/global.rs"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f77510ccec72e7e389305149d37d197497a165a80482f3eaab82f2747fecbb"}},{"ruleId":"X18","level":"warning","message":{"text":"Raw handle taken from an owned value and never reclaimed: \u0060part.into_raw()\u0060 (line 1407) 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 \u0060dl_sdk\u0060 from a raw pointer (\u0060dl_sdk::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":"crates/top/dalaran_c/src/lib.rs"},"region":{"startLine":1407}}}],"partialFingerprints":{"codehealthFindingId/v1":"bafc28012865748a8ee2a4cdb4a823156545e85ffc093af651363e88c11dd45a"}},{"ruleId":"X18","level":"warning","message":{"text":"Explicit release owed and not made on every path: \u0060buffered_writer\u0060 (line 152) 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":"crates/top/dalaran/src/commands/dlr/migrate.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"843f189528de141e94c6712749979cfc158df5b9de8ef2bc9525e3896d6a5067"}},{"ruleId":"X18","level":"warning","message":{"text":"Raw handle taken from an owned value and never reclaimed: \u0060hub.into_raw()\u0060 (line 287) 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 \u0060dl_log_encoding\u0060 from a raw pointer (\u0060dl_log_encoding::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":"crates/store/dl_redap_client/src/connection_client.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d723b78c7770f97791226f28811b95a8bec56ad292e03da8e7501e52dcbf9b8"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 0/3 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: url_exists: \u0060url_exists\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_notebook/src/dalaran_notebook/error_widget.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1440224ec4a9fe99f0a2806e8881a655ad024501c99c474466f2988f2852c0fe"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetch_viewer_wasm: \u0060fetch_viewer_wasm\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_js/web-viewer/index.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"d598c3bf178f4209e249f6eab36301e3a0de647f79fc4b4af070568d914d66d0"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: isPublished: \u0060isPublished\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_js/scripts/common.mjs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c2b20411b5db3ec818494c78245fd149dbc66d672bdc3b779105978466d2a9"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060tracing::debug!\u0060 at line 522 is called with an argument built by \u0060chunk_sizes.iter().sum::\u003Cu64\u003E()\u0060 (line 525), whose cost grows with the collection it walks. Rust evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because tracing::debug! is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060log_enabled!\u0060/\u0060tracing::enabled!\u0060 test, no debug flag, no \u0060cfg(debug_assertions)\u0060, and the work is in the argument itself, not deferred into a field the subscriber formats or a closure the formatter calls."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider/io_loop.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"616ebcff75a3b6e876a1a57cd61645fc9d2287e96e25c5ae614d9de69317a994"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060SphinxObjectInv.project\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":"crates/build/dl_dev_tools/src/build_search_index/ingest/python.rs"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd0586b9d8b3164543274f2c0ce9733c80e177a54c345d184d67135214654e9"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060DalaranArgs.spawn\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":"crates/top/dalaran/src/clap.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced465f5313cb4ec638b6a459a945299b131e8ef2e55a86c2c3dcacdc07c60c4"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060CompactCommand._ignored\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":"crates/top/dalaran/src/commands/dlr/merge_optimize.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"830a77c3e10b655b4ee9777e63fbc44d2e8e508976f5790ae088c25f809f533c"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060User.email_verified\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":"crates/utils/dl_auth/src/oauth/api.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"8615815026cb966c8dbb0eb43358c7ec31999df5713df0040f3627c93fbc5d49"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060User.profile_picture_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":"crates/utils/dl_auth/src/oauth/api.rs"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaf0b036a3dc4889dacbaec9e163236d1e8b3686d5b8b0e8df8436a859d4a0e4"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060User.first_name\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":"crates/utils/dl_auth/src/oauth/api.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"59921613b6fa6bcf0c24478838dcbb3765beab1a17715643a886c54dea35da31"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060User.last_name\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":"crates/utils/dl_auth/src/oauth/api.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ad436bd8a7835a97e260544dde6432910a1b9bf0c82ecf695bb191c0e72fb8f"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060User.last_sign_in_at\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":"crates/utils/dl_auth/src/oauth/api.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9a3728011d56181a08124080fb3817acfbf74e22ed265b3a1c8d661be663ff"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060User.external_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":"crates/utils/dl_auth/src/oauth/api.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f0ac090a59575f52b48e16f88ff32ccda02088f237850481b45f9e328ac279"}},{"ruleId":"X25","level":"warning","message":{"text":"Configuration option is read nowhere: \u0060GetDeviceAuthUrlResponse.expires_in\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":"crates/utils/dl_auth/src/oauth/api.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b116384df17fb18cd15d0ba294be97684e93e08a21d32e1c40563a7db5c8e00"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warning\u0060 at line 248 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":"dalaran_notebook/src/dalaran_notebook/__init__.py"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"f245f40598240d2efbd803f9524d4ebda8aa96502d131e03132740ec71ff155c"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 153 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":"dalaran_py/src/trace_context.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"a975b380ece790540088b406de657774dd158b1fffeb600cd49d3f52aa9a1d44"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 164 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":"dalaran_py/src/trace_context.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e7afec70d6893b2e7f785d047d23a510de396fdef9d6797aca1433cffcf89be"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\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: \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":"dalaran_py/src/tracing_session.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d4f0eef786bf445b8be377e9b83c292b2cb39f3edeba544d4c624537a2cd25e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 272 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":"dalaran_py/src/catalog/connection_handle.rs"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"808ce1042a3a40da0b74cdbd8fdb5321ea4dc71f32706c962c77f6eb6efb3693"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 48 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":"crates/utils/dl_perf_telemetry/src/metrics_server.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b54bd951c3eb82e77609e5a469739048ecd17348e6a73da6ee07f705f70e7513"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 52 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":"crates/utils/dl_perf_telemetry/src/metrics_server.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5bd6afd488a8630a7ead9d0abe30099f96056e1e8ccd9fd21c66e298fb8b20"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\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: \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":"crates/utils/dl_perf_telemetry/src/metrics_server.rs"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f47208f3bbcedb83da23538791c38ba70dfc2ba782d123802a79db6dc9d8e4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 97 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":"crates/utils/dl_perf_telemetry/src/metrics_server.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d82414a782ce00e40a88962641d7e99f10e9a24306c6c1599e37c4ea565eee"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 183 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":"crates/utils/dl_perf_telemetry/src/telemetry.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"66b25aaea2cb528735261320cb001ca2b6e8ca5dd5d7326989bc6d5ee1c96883"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060warn!\u0060 at line 281 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":"crates/utils/dl_perf_telemetry/src/telemetry.rs"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfe75517655ffd2714fc2a496b53df10d1e20ea61953248fb707fe8abfecf79d"}},{"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":"crates/utils/dl_perf_telemetry/src/tracestate.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea337e0ae7a1177b6b1ed616612331244654300d4304b35a70104c39240451ee"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 331 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":"crates/utils/dl_perf_telemetry/src/tracing_session.rs"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"77014c6b7ee3002b42f3b861c6bcc9c1a80f7ace88a22ee1c837ee01c4d36a67"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 112 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":"crates/store/dl_server/src/server.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"78754ad75a9dd0dde6ff88dc752dd1775bd788e1dd075a3f3c5bb34c87abbd0e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 120 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":"crates/store/dl_server/src/server.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"0775e2bd32630dcddeb00d6d50cb47827e5eaaf9cd9bbe99f23a5b70e51e4c8e"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060error!\u0060 at line 179 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":"crates/store/dl_server/src/server.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2a11e4599be14018bd771dade0b26d81881f4b3d377f2b1e1770aae38d500a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 295 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":"crates/store/dl_redap_client/src/lib.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"17d03d3006b0d18ec12cc03ee1ba9b453a996fd85f2ead2c907fe08d188a5022"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 306 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":"crates/store/dl_redap_client/src/lib.rs"},"region":{"startLine":306}}}],"partialFingerprints":{"codehealthFindingId/v1":"9261531c7da544e2fefbd8197cf3e6f2bae4631043a7ea6990e5e6ce2e404d6a"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060trace!\u0060 at line 314 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":"crates/store/dl_redap_client/src/lib.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eda1b24ca88879472c0fcaee7153a15a8c659a7bd067a6d449766289e8e13a2"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 325 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":"crates/store/dl_redap_client/src/lib.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3eea6dc35052b01e397332525b12ae091b8b71779293e7df03b112cfad5c5d5"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 457 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":"crates/store/dl_datafusion/src/dataframe_query_provider/io_loop.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb73a76070bccdefe73e7d95784b6c137f9cc5ca568878b658e1fcd8ceec90c4"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060debug!\u0060 at line 522 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":"crates/store/dl_datafusion/src/dataframe_query_provider/io_loop.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"363f54da0095294b45b823f3d6b5678c561302726f6091ea71dc15a44059459e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(\u0022cargo_run_wasm\u0022.into()).spawn(||{cargo_run_wasm::run_wasm_cli_with_css(CSS);})\u0060 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":"run_wasm/src/main.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6b3fde7baabcb863286de1f0627a9b668cb5837f7eb27b7f6cb02fe1757b00b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060thread.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 \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":"run_wasm/src/main.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2261e64992c0cdc65e4740cadd04ed37522c987803c9033ba23e1fd748ae9a0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dl_build_tools::get_and_track_env_var(\u0022CARGO_MANIFEST_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":"docs/snippets/build.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dd66f1d710ecf5327efc5c8b31f88b006d17fef585bba4235959dcc752a46ad"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::read_dir(\u0026all_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 \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/snippets/build.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5f31649858259f13cab38cd426a6b0c4e5e0970c4844d64b68d8bc5046ef4d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::read_dir(subdir.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 \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/snippets/build.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6864a5495711e6d3e669f6e8adb49a58107f710cdde52d2cf7176ca7e8e013ae"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_stem()\u0060 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/snippets/build.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e7301a73af6c5a3b4d4b9feebabe685d61aed93144db2853f2ffbed27900ed2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_stem().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 \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/snippets/build.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"e764cc951818ede08e8ea3b8c0f392c6862ff8f990fe9dc18309f4fb9accca28"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::read_to_string(\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 \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/snippets/build.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04c88cfc46fb01f408939d941fd11cb780bef543ee5a54da546e876a606a209"}},{"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 \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/snippets/build.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e2e7e24f1c045f6b574c8493f4756fe9b2eb77ed48bf7f3303579b10f5776c5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dl_build_tools::write_file_if_necessary(target_path,contents.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":"docs/snippets/build.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5cf9c9c2fca42d22660bdb226c2b30323609cff47763c0592d77c6bd9361bec"}},{"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 \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/snippets/build.rs"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"abd6dc2d5b83d2485df65010c1ceb2f3b9f47184f8e70bf4a4de80290d296935"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::copy(\u0026path,\u0026target_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 \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/snippets/build.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"82722b800c0228f0f875f1f24db26885d0ec0f794f838c42f5a352158597e730"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dl_build_tools::rustfmt_str(\u0026source)\u0060 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":"docs/snippets/build.rs"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1ad7647f2dde5b4b05cc9334550cc7d23ff61a203094b9bf4cb70adf8553ff2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dl_build_tools::write_file_if_necessary(snippets_path.join(\u0022mod.rs\u0022),source.as_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 \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/snippets/build.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"781a98cb11a18fe45517ba2b5ce16cc0e9497734ed750c3d0b82e872e5e6a0e1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(sink as\u0026dyn std::any::Any).downcast_ref::\u003Cdalaran::sink::GrpcSink\u003E()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060main\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/snippets/all/howto/check_connection_status.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3568af80a0120d206e8c24848f379f8bfd3a15fb05009ac1c9b745842f788e7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stops.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 \u0060colormap\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/snippets/all/howto/dual_color_point_cloud.rs"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"3459f628bc0317085f0b47d5fa78dfe2ce8b14aefbf6d11f856fac8bf5e4ff0a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rec.flush_blocking()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060check_tags\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/snippets/all/descriptors/descr_builtin_archetype.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8efb525e42805b58bc34f081f37bc91ccae584e63848cc159da385c53eedaab7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::File::open(\u0026path_to_dlr)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060check_tags\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/snippets/all/descriptors/descr_builtin_archetype.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbfb7d323ea6a408cea3141b63fd709ff8b9a0909bace21cb6791c248bf4164d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ChunkStore::from_dlr_reader(\u0026ChunkStoreConfig::ALL_DISABLED,\u0026mut dlr_file,)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060check_tags\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/snippets/all/descriptors/descr_builtin_archetype.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"191e31db0d278828a62ac1e6af45f955d61d3e6f83c58a2b460701a907cfa1d5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stores.into_values().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 \u0060check_tags\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/snippets/all/descriptors/descr_builtin_archetype.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"5840f124679fce42c826241088c572fdf6502c11ef3f2aad46123f96b785cdb6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rec.flush_blocking()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060check_tags\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/snippets/all/descriptors/descr_builtin_component.rs"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"6de5a017fb11e1632f54522a47ebb1239bbae37aaf40c59b31b3ca54f44921f0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::File::open(\u0026path_to_dlr)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060check_tags\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/snippets/all/descriptors/descr_builtin_component.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6b64b93215af7fcc74f5ae2749290abc391e68caa2209d798e1b6eb7014a5f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ChunkStore::from_dlr_reader(\u0026ChunkStoreConfig::ALL_DISABLED,\u0026mut dlr_file,)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060check_tags\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/snippets/all/descriptors/descr_builtin_component.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"170b76b877bf917c36f10c64c86d47b01034608a3210ef19d1ae68005596ad53"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stores.into_values().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 \u0060check_tags\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/snippets/all/descriptors/descr_builtin_component.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"222ea87f96ac61097511df71d617afd76a7980c851ba1713a8ad2418e3bb291d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chunks.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 \u0060check_tags\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/snippets/all/descriptors/descr_builtin_component.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a43def3a75a7b2484d9998c39d09bc4c2cd644bc8454557055cba0a9338f8280"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rec.flush_blocking()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060check_tags\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/snippets/all/descriptors/descr_custom_archetype.rs"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"387748d7867448548ce57bc835768a752360233e5c8fabe0f513cd530511c281"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::File::open(\u0026path_to_dlr)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060check_tags\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/snippets/all/descriptors/descr_custom_archetype.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a20cfff13e85fd71acc16522fef9a49614f1a4a04405027aa850ebe5ed6c79"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ChunkStore::from_dlr_reader(\u0026ChunkStoreConfig::ALL_DISABLED,\u0026mut dlr_file,)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060check_tags\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/snippets/all/descriptors/descr_custom_archetype.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c4e83080256f24ea63f5638eb1fa53190ec2315d5ff3f810f325aa82bdb0ef3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stores.into_values().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 \u0060check_tags\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/snippets/all/descriptors/descr_custom_archetype.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e50e3be16bfbc0c0bee413b1ae2ebb545f367807e7201335abe8fb41aa9f22"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chunks.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 \u0060check_tags\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/snippets/all/descriptors/descr_custom_archetype.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2d01f793103ebed74594b6d001712dae6bf101d3d474ca8c767b15a0168956"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rec.flush_blocking()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060check_tags\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/snippets/all/descriptors/descr_custom_component.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"49455de24c6534b0041ed7e9e7b8fde522c6728b54ff9d3f5c4a8ec469f293b3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::File::open(\u0026path_to_dlr)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060check_tags\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/snippets/all/descriptors/descr_custom_component.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"bad553194a6cbe99e561d03714b02edf0d30ff4280c9e636edc8c9c234b5cb6b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ChunkStore::from_dlr_reader(\u0026ChunkStoreConfig::ALL_DISABLED,\u0026mut dlr_file,)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060check_tags\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/snippets/all/descriptors/descr_custom_component.rs"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe57a425eca917cc10882859d9a7703fe4b03f9d32bfd7330dc3b12bc5e7eb3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stores.into_values().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 \u0060check_tags\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/snippets/all/descriptors/descr_custom_component.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab39f784f3dcb6ebd76780136864cb6723d8fa16dc8c5abd250a7b0edee1694a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chunks.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 \u0060check_tags\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \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/snippets/all/descriptors/descr_custom_component.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"6003a27b0383b8b23eac76753e85bc317646822548e3ea2404635ab95e6ff513"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::current_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":"dalaran_py/build.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6f4d06604c9c2d2e5a9ed018c1e53bbcbc85861fe930f215edeb87c7376f97b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::current_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":"dalaran_py/build.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c6378c5d7149c6d2fbe75291a6e384d07e8e1e2b747426b86b6896e4a7491c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::current_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":"dalaran_py/build.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"08feaba9476c83fa3befea9d08beb9ff2eb9f1c4dff67dd67c0e0f3600d37ac0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dl_perf_telemetry::Telemetry::init_with_session_id_reader(args,dl_perf_telemetry::TelemetryDropBehavior::Shutdown,||{pyo3::Python::attach(crate::tracing_session::current_dalaran_session_id_from_contextvar,)},)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060init_perf_telemetry\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/python_bridge.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ef2ae16d58f1f56cd64259b705a1449cf8500c3ab340e3962de455460a2613f"}},{"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.expect()\u0060 in \u0060get_tokio_runtime\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/utils.rs"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab14851cc99d92976f6d80f3e633302891d9c4791d0dd1bf2ec25b985f2b079c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cache.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 \u0060ensure_cached_stores\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/chunk_stream/dlr_reader.rs"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd22e3150e115606b549880bfc062debbdabed6db7f4a23a5fa1f4c209995e84"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(\u0022chunk-split-router\u0022.into()).spawn(move||{let mut stream=upstream;let mut match_alive=true;let mut nomatch_alive=true;loop{match stream.next(){Ok(Some(chunk))=\u003E{let(matching,complement)=filter.split(chunk);if match_alive\u0026\u0026let Some(m)=matching\u0026\u0026dl_quota_channel::send_crossbeam(\u0026tx_match,Ok(m)).is_err(){match_alive=false;}if nomatch_alive\u0026\u0026let Some(c)=complement\u0026\u0026dl_quota_channel::send_crossbeam(\u0026tx_nomatch,Ok(c)).is_err(){nomatch_alive=false;}if!match_alive\u0026\u0026!nomatch_alive{break;}}Ok(None)=\u003Ebreak,Err(err)=\u003E{if match_alive{dl_quota_channel::send_crossbeam(\u0026tx_match,Err(err.clone())).ok();}if nomatch_alive{dl_quota_channel::send_crossbeam(\u0026tx_nomatch,Err(err)).ok();}break;}}}})\u0060 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_split_receiver\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/chunk_stream/engine.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe4b72ad782fdd02316b47c1fd9305196f8e07c21bf92223438b969a1dba896"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.split_channels.get_mut(\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 \u0060take_split_receiver\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/chunk_stream/engine.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"28afd844d368272ae2cf533cd71766e685b4855d08583274bed5c479bc4e3c64"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060channels.rx_match.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_split_receiver\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/chunk_stream/engine.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"31566c513a4fa8d06b4b38024b459d3c95908762cfc2f26edc9fdb018e864be9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060channels.rx_nomatch.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_split_receiver\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/chunk_stream/engine.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"17a58a0466a4c61ca54e6edc4d50e2dd751570ad82564e354bebfa55afeac178"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(\u0022chunk-merge-source\u0022.into()).spawn(move||{let mut stream=upstream;loop{match stream.next(){Ok(Some(chunk))=\u003E{if dl_quota_channel::send_crossbeam(\u0026tx,Ok(chunk)).is_err(){break;}}Ok(None)=\u003Ebreak,Err(err)=\u003E{dl_quota_channel::send_crossbeam(\u0026tx,Err(err)).ok();break;}}}})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060compile_merged\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/chunk_stream/engine.rs"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"368157f2766fd790819b2a5a6b72a5b70c49d31c019d6601378ce979c72e30e9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(\u0022hdf5-chunk-source\u0022.into()).spawn(move||{match dl_hdf5::load_hdf5(\u0026path,\u0026config){Ok(iter)=\u003E{for chunk_result in iter{let msg=match chunk_result{Ok(chunk)=\u003EOk(Arc::new(chunk)),Err(err)=\u003EErr(ChunkPipelineError::Hdf5{reason:err.to_string(),}),};if dl_quota_channel::send_crossbeam(\u0026tx,msg).is_err(){break;}}}Err(err)=\u003E{dl_quota_channel::send_crossbeam(\u0026tx,Err(ChunkPipelineError::Hdf5{reason:err.to_string(),}),).ok();}}})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060create\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/chunk_stream/hdf5_reader.rs"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4babfc86d21f5b7937d4c2a5335130e9ce5ecb821c19f3acadc8cda25deb13"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(\u0022mcap-chunk-source\u0022.into()).spawn(move||{let result=loader.emit_chunks(\u0026mcap_file,timeline_type,timestamp_offset_ns,\u0026|chunk|{dl_quota_channel::send_crossbeam(\u0026tx,Ok(Arc::new(chunk))).ok();});if let Err(err)=result{dl_quota_channel::send_crossbeam(\u0026tx,Err(ChunkPipelineError::Mcap{reason:err.to_string(),}),).ok();}})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060create\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/chunk_stream/mcap_reader.rs"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1807d6944c1420523c2a995e1dc5a189d7ebf60eb440b63dac837bf78e5b6cb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(\u0022mp4-chunk-source\u0022.into()).spawn(move||{match dl_mp4_reader::load_mp4(\u0026path,\u0026config,\u0026entity_path){Ok(iter)=\u003E{for chunk_result in iter{let msg=match chunk_result{Ok(chunk)=\u003EOk(Arc::new(chunk)),Err(err)=\u003EErr(ChunkPipelineError::Mp4{reason:err.to_string(),}),};if dl_quota_channel::send_crossbeam(\u0026tx,msg).is_err(){break;}}}Err(err)=\u003E{dl_quota_channel::send_crossbeam(\u0026tx,Err(ChunkPipelineError::Mp4{reason:err.to_string(),}),).ok();}}})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060create\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/chunk_stream/mp4_reader.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f242861395ffa2ff76b444765fb0937cbd809d94455f9d73503d97583b8e12"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(\u0022parquet-chunk-source\u0022.into()).spawn(move||{match dl_parquet::load_parquet(\u0026path,\u0026config,\u0026prefix){Ok(iter)=\u003E{for chunk_result in iter{let msg=match chunk_result{Ok(chunk)=\u003EOk(Arc::new(chunk)),Err(err)=\u003EErr(ChunkPipelineError::Parquet{reason:err.to_string(),}),};if dl_quota_channel::send_crossbeam(\u0026tx,msg).is_err(){break;}}}Err(err)=\u003E{dl_quota_channel::send_crossbeam(\u0026tx,Err(ChunkPipelineError::Parquet{reason:err.to_string(),}),).ok();}}})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060create\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/chunk_stream/parquet_reader.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9cd70a2463fdff9fa7e7021e6d572d0779af8dac299796129c278e0b852ceb5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(\u0022urdf-chunk-source\u0022.into()).spawn(move||{let result=tree.emit(\u0026mut|chunk|{dl_quota_channel::send_crossbeam(\u0026tx,Ok(Arc::new(chunk))).ok();},\u0026TimePoint::default(),include_joint_transforms,);if let Err(err)=result{dl_quota_channel::send_crossbeam(\u0026tx,Err(ChunkPipelineError::Urdf{reason:format!(\u0022Failed to stream URDF: {err}\u0022),}),).ok();}})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060create\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/chunk_stream/urdf_tree_stream.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0488b02d9ea4290e4307eca8a8b5b28dcdefd0ca61a29d6f80e6ee153ece9e3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060url.path_segments_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 \u0060create_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":"dalaran_py/src/catalog/catalog_client.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b5b58dbcd96c90e6b42339c4e6222dfe31802f9cb00dedb1176725f0a883aa7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chrono::DateTime::from_timestamp(ts.as_second(),ts.subsec_nanosecond()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 \u0060created_at\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/catalog/entry.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fec098dfdcd931ae8f541bb789277f1c1d9281a2a49a2370d4de0e13a01a94d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chrono::DateTime::from_timestamp(ts.as_second(),ts.subsec_nanosecond()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 \u0060updated_at\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"dalaran_py/src/catalog/entry.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"a83bd6e4474d9fef10ed6f0ecb08a54a05af4c81daeb421678351a551346459a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tiny_http::Header::from_str(\u0026format!(\u0022Content-Type: {mime}\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 \u0060send_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":"crates/viewer/dl_web_viewer_server/src/lib.rs"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1ad2962fc153cd068ff00cea9efe2216143b2b471565c6cefba9e57d7b46339"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060TRAILER_LEN.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 \u0060read_zip_from_exe\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_web_viewer_server/src/trailing_data.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bbf4774a44e49c138d4b6aad88d9917c626b08c36065e770f914457e466adb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060trailer[..OFFSET_LEN].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 \u0060read_zip_from_exe\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_web_viewer_server/src/trailing_data.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcaa0f4f40f5bbdc9dd38daabc82ecaab5a58f10c54de173b85347902f7d095"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060context_system_once_per_frame_results.get(name)\u0060 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_view_systems\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewport/src/system_execution.rs"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b018b1abe5429f9ab5ce092023076e02687f8137d0ec31f20f274d7c504d8d04"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Vec1::try_from_vec(url_parameters.iter().map(|url|url.sharable_url(None)).collect::\u003Canyhow::Result\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.expect()\u0060 in \u0060sharable_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":"crates/viewer/dl_viewer_context/src/open_url.rs"},"region":{"startLine":486}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3b4f719c898166985e5619ef667cea7edafa85f78c13893f275d72b6e049b8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.store_bundle.get(store_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_chunk_for_tests\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/store_hub.rs"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c59e89bd76b2017310691e9d16674d788fc75e341ba5bdacce819ed4ee23dbc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Vec1::try_from_vec(existing.iter().cloned().unique().collect())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060extend_mappings_unique\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/view/view_class.rs"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"31bb3a2429ee959a5b4c9e9c10101b2fac36b4be022b66ddab04d1f4db17acc0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(cache as\u0026mut dyn std::any::Any).downcast_mut::\u003CC\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 \u0060entry\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/memoizers.rs"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"4296c37c0fb6a105da0fcf261c06e728dbe91480f56ea72369d1d06fcb22a3b4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(cache as\u0026dyn std::any::Any).downcast_ref::\u003CC\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 \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":"crates/viewer/dl_viewer_context/src/cache/memoizers.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17d843f496e2e85755270a7454117fdff9220e6749739043ab985fd585eec93"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(cache.as_ref()as\u0026dyn std::any::Any).downcast_ref::\u003CC\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 \u0060read_or_compute\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/memoizers.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"50de4b5f85f1f186d645d13351117bc64765439431c371d2d2bb60efbfe6d836"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(cache.as_mut()as\u0026mut dyn std::any::Any).downcast_mut::\u003CC\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 \u0060read_or_compute\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer_context/src/cache/memoizers.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d31ebc76e37b396d3060f4d7bc01846045ef60126ba312d3d981a0886d46e5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060conflicting_chunk_samples.samples.front()\u0060 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_affected_sample_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":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs"},"region":{"startLine":1874}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93d8091b0887230c33cdf08f11b997b033b6f0371be42cda05ab2bff79ba57d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060conflicting_chunk_samples.samples.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 \u0060find_affected_sample_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":"crates/viewer/dl_viewer_context/src/cache/video_stream_cache.rs"},"region":{"startLine":1880}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4f4a3618c21a54767750f2f55692f9d75e731befb46e02b5ec6d4b7010d2e39"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060welcome_screen_blueprint.add_chunk(\u0026Arc::new(chunk))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060setup_welcome_screen_blueprint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app_blueprint.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7b3b5d3fe9f0088f37ea6b42db06d8cf3f4c9228630be2fcfc5b3e01e3d5dd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Chunk::builder(entity_path).with_archetype(RowId::new(),timepoint,component_update).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 \u0060get_panel_state_chunk\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app_blueprint.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"366cef4387764f545593e3bf7eb1b32b97fc2dd946afafc9d6b26991ebdc7336"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060view_states.get(recording.store_id(),view.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 \u0060show\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app_state.rs"},"region":{"startLine":413}}}],"partialFingerprints":{"codehealthFindingId/v1":"b33d8d2924c68486b62797bcd357ec12835fe23924fcea4fb0b588e2522c7454"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060any.downcast::\u003CT\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 \u0060poll_promise\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/background_tasks.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"195ea26eca345fbc9c242f7d4c005dd95dc34b1b883d8cef248c56f2e804a208"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060image::RgbaImage::from_raw(w,h,bytemuck::pod_collect_to_vec(\u0026image.pixels))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060save\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/screenshotter.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c50412b183de7dc9bd94151efe0d785620a047aece66e93063fae89e00907d4c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060slice.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 \u0060to_color_image\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/texture_readback.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"a067c571a32209433554e8514172b90a7fff62df106abc157f9535f0a6a95939"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060slice[0..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.expect()\u0060 in \u0060to_color_image\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/texture_readback.rs"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4c4d77b2fbf482b91cf614574efefc57980f88338fbec12c9931cacc55c148"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060slice[2..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 \u0060to_color_image\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/texture_readback.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"336515e7f2f2b55ccf2763dc7b426b10ff86d60a90a1e72c5c09958f7c94e64f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060slice[4..6].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 \u0060to_color_image\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/texture_readback.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"dda5e2e116a4c83cc42f3f62c939d4ab967a72e622e67ff44b5b0596d64803cc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060slice[0..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.expect()\u0060 in \u0060to_color_image\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/texture_readback.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"a679bbb09ac362644b1cbb0d42f1dc0b41d7977f0ab34132a5cbbe1220c019e1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060slice[2..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 \u0060to_color_image\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/texture_readback.rs"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"19c3ddf5997f498b5e2eccfff964a9d2309034e844e8f19e1c2a04e0c9ec6bfc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060slice[4..6].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 \u0060to_color_image\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/texture_readback.rs"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"27436c84875421068fe90249bc844719218fc7beace06b14bee6dab85945a418"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060slice[6..8].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060to_color_image\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/texture_readback.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"c875144c50bb97281c8c3d02557cf5543d34d2c9f4ee3189e4798d622d1d69d7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060AsyncRuntimeHandle::from_current_tokio_runtime_or_wasmbindgen()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060create_app\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/web.rs"},"region":{"startLine":813}}}],"partialFingerprints":{"codehealthFindingId/v1":"33774d1a2ddfb30cb851b683f5f3f829d8b29c9f4243dfc29dd6a96a73599917"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dl_analytics::Config::load()\u0060 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_email\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/web.rs"},"region":{"startLine":856}}}],"partialFingerprints":{"codehealthFindingId/v1":"09cf18c70b3d9f90b19d1e5860d5f3d1478e6695a4411649bb9fa046d96de2b2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060config.save()\u0060 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_email\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/web.rs"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a1e609ff77f6368e7b7be622ee4f33709aebd43efa65ed8f42a8f99c05d6e78"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060jiff::Timestamp::from_str(\u00222023-02-14 21:47:18Z\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 \u0060time_format_section_ui\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/settings_screen.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e3010f3c02b0adf81a7a0495cf6a113cbd1e4f5bc0e17e5d075740d531b4c9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ui.style_mut().text_styles.get_mut(\u0026TextStyle::Body)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060show\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/ui/welcome_screen/intro_section.rs"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"414809ec47eb9eda6d2419c584f2979dbf7c8cfbacbd21eedf94b2721476dc93"}},{"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.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":"crates/viewer/dl_viewer/src/bin/viewer/main.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"fecebb6ea782c7ae99d36b72c77c2feb8bbe55272cf6b250dbde9aa75a4d8014"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060url::Url::parse(\u0022file:///\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 \u0060file_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":"crates/viewer/dl_viewer/src/app/add_data_source.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"961dcb5dff2ac849da14faa27038da35b314db51646cea7bcdf37c7d67e3f0df"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file_url.path_segments_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 \u0060file_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":"crates/viewer/dl_viewer/src/app/add_data_source.rs"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"40f0410872d5909063e62ce15fa06d787ee4a0904a22cab5f74b81920f398a81"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.store_hub.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 \u0060logic_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":"crates/viewer/dl_viewer/src/app/logic.rs"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"96323fdfbe222d2db5cf431fe46f6e02b1fbdf0362be55a5ed8f79d919d94411"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060store_hub.entity_db(store_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 \u0060receive_log_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":"crates/viewer/dl_viewer/src/app/logic.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bfb12282fb7615065e86f4024cf72c4f45c8b2d9e966c46c84233d2e9ff2e39"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060timelines.keys().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 \u0060apply_set_time_cursor\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/logic.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8005935317db43d71991533947f681e23ce0a9d9fc951ee8da68ec170b1029"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.store_hub.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 \u0060ui\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/mod.rs"},"region":{"startLine":1286}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5764a673eea6828ce8aaed8572e7669edf35e346f59554699c9a8a0239f179"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060frame.wgpu_render_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 \u0060ui\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/mod.rs"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff404fbacc9c0726594899fe583459b6efcea7450adb27e4d4ab7337b9ab4dd0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060egui_renderer.callback_resources.get::\u003Cdl_renderer::RenderContext\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 \u0060ui\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_viewer/src/app/mod.rs"},"region":{"startLine":1349}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbb38caea5767c0e4b768487a39b094b8d76802fd382f6db4e9d1779bc6a657"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060frame.wgpu_render_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 \u0060ui_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":"crates/viewer/dl_viewer/src/app/ui.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ebd721c42c463de6dee33a2804323e50ac0c95e965c157941c69479cddf3158"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060prev_series.points.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 \u0060add_series_runs\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_time_series/src/util.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"5658f1071f81ec0a4ef4bc7ddfb4716cfb3d5bdee277d3f444746c4768a257e3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ndarray::ArrayViewMut2::from_shape(slice.raw_dim(),pixels.as_mut_slice())\u0060 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_texture_desc\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_tensor/src/tensor_slice_to_gpu.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8eff355fbe9f408255f1a700d4e8ed7b3b572acbaa6cb53c5928c38b71d7ef"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tensor.view().into_shape_with_order(ndarray::IxDyn(\u0026[tensor.len(),1]))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060selected_tensor_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":"crates/viewer/dl_view_tensor/src/view_class.rs"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"7316f3ca8bc6410fd8a47870fa509d3ec9debe129f45b9cd69585179ab4d3235"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.subspaces.get(\u0026self.subspace_origin_hash_for_entity(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 \u0060subspace_for_entity\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/spatial_topology.rs"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fdb46a937ce07f83230f82df5a55000bbb78d88708c41fa05e638b1140e298"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.subspaces.get_mut(\u0026self.subspace_origin_hash_for_entity(entity_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 \u0060on_store_diff\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/spatial_topology.rs"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"58bac945e69eeb0509d995b01001a18223685d0e637db0622de1e4ebb3d3dcf4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.subspaces.get_mut(\u0026subspace_origin_hash)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060update_space_with_new_connections\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/spatial_topology.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65a25ab4657d90903bdbd425d06f805d934bce9c0da32383231413a9fc4539b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.subspaces.get_mut(\u0026subspace_origin_hash)\u0060 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_new_entity\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/spatial_topology.rs"},"region":{"startLine":387}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e07db8deb0f6b0fc5b680f3a69f282c1d3a95b28526a65459256982ccbefd97"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.subspaces.get_mut(\u0026split_subspace_origin_hash)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060split_subspace\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/spatial_topology.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d80b4c72ea99b5f47bd23b98872626d80c5803e98804083090f685ab38922e9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.subspaces.get_mut(\u0026child_origin.hash())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060split_subspace\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/spatial_topology.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ea73dc356338993b880034b916fad58898b68485c230f6903041aeb07412226"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060NotNan::new(ratio)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060process_data\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/capsules3d.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a40f46247c97243b615f859f6a87ee7451d1fb1596bba6ac39bc5e180a1f744"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060vec1::Vec1::try_from_vec(target_from_instances)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060combine_instance_poses_with_archetype_transforms\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/visualizers/utilities/proc_mesh_vis.rs"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6e17fd28f1cbefb533c30953bf65591aa1ebac08965db8f8b6061d3a63c974a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060static_execution_result.downcast_ref::\u003CTransformTreeContextOncePerFrameResult\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 \u0060execute\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/contexts/transform_tree_context.rs"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"3801b46893643a2fd1e6d13eab446f1f980cf20625c1c34947154428eb555d2b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060reflection.fields.iter().find(|field|field.component_type==Enabled::name())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060view_property_force_ui\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_graph/src/ui/selection.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ed2dedfe1c256e2397c1c52431816d2e97b7504ee1b76bb39911c1ad3aa910"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060entity_groups.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060column_visibility_ui_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":"crates/viewer/dl_view_dataframe/src/view_query/ui.rs"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"758a32b477f31996ba6a4f4cdaf1903acc9e077422b62195e7d56ca53911cff3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chunk.into_unit()\u0060 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_unit_chunk\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/src/blueprint_resolved_results.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76c77ad7b29fb68f449879bf1a861bbc89f07aef57645fcb9878a90745dcf34"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chunk.into_unit()\u0060 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_unit_chunk\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/src/blueprint_resolved_results.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f548a344403bc2062d6de3739b02cec029cdc114f4bdb90aa52968635fc793"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::sync::Arc::new(modified_chunk).to_unit()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060latest_at_with_blueprint_resolved_data_polymorphic\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view/src/query.rs"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"d078634d8ccc4001eba2374d09063753ed1aa5e9716f87209c31067a0e49067a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dl_build_tools::get_and_track_env_var(\u0022CARGO_CFG_TARGET_FAMILY\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":"crates/viewer/dl_ui/build.rs"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f3e5f1be8e178bdfc38406459145840377fac78b21742d55e256e4bcd98761"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060atom_response\u0060 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_hover_icon_buttons\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/button.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8a21910e2c0d5c8c941a30dd9969073df3855551e519b93c580e994b227038"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::try_get(color_table,ron,name)\u0060 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":"crates/viewer/dl_ui/src/design_tokens.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"491e65f95a35e8bd410c8e51e50b3b56dd4b2ca7bbb011c777a13f993217f701"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::try_get(color_table,ron,name)\u0060 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":"crates/viewer/dl_ui/src/design_tokens.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2d81a0b9bb80185d5cebdb4b3937dfadf73cab7081c99d9acd35a8934f1d53"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060font_definitions.families.get_mut(\u0026egui::FontFamily::Proportional)\u0060 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_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":"crates/viewer/dl_ui/src/design_tokens.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a3ffb22fd842a101f63a9cf831a4c5010f72f50b0e6f8fd1c1671a8c0372f2b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060egui_style.text_styles.get_mut(\u0026text_style)\u0060 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_text_styles\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/design_tokens.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dab38bd6070a737ec720a457a303eb0b8dbe846d7405cbed9b19762cb408881"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060egui_style.text_styles.get_mut(\u0026egui::TextStyle::Heading)\u0060 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_text_styles\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/design_tokens.rs"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"082b44dda386b5d47636c127a0d91a28f06ff4821c16d2d1f2db43c052cd3406"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Color32::from_hex(hex)\u0060 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_color_from_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":"crates/viewer/dl_ui/src/design_tokens.rs"},"region":{"startLine":1027}}}],"partialFingerprints":{"codehealthFindingId/v1":"82bfdc2c640c34a125d89f6480a1c624280959130a63b017d0e747bef1802ac9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060follow_path_or_panic(value,global_path).get(\u0022value\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 \u0060global_path_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":"crates/viewer/dl_ui/src/design_tokens.rs"},"region":{"startLine":1131}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf01e597b86616d9b42ba18d7ff92dff54fbb6c6611f91b03bf9ebd191dd2f3c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pixels.strip_suffix(\u0022px\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 \u0060parse_px\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/design_tokens.rs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"03cc4df6a6f53cb5f354126527edbf43750d078f138cbb46ce2aec3a312f64c9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pixels.strip_suffix(\u0022px\u0022).unwrap().parse()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060parse_px\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/design_tokens.rs"},"region":{"startLine":1170}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e8704d2c302796ed6474aa4733f50c2ab6fb42516d807da9eda4e379bd994da"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060getrandom::fill(\u0026mut random_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 \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":"crates/viewer/dl_ui/src/filter_widget.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab808d198dcea549d226284bdfc8196e0d210c17590630325349c6c6dd6b2513"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::canonicalize(std::path::PathBuf::from(env!(\u0022CARGO_MANIFEST_DIR\u0022)).join(\u0022data\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 \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":"crates/viewer/dl_ui/src/hot_reload_design_tokens.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"98d8ddee242d0f16fb866326f89989382e651b062e4697c3943e1fdb709d3e7a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::read_to_string(data_path.join(\u0022dark_theme.ron\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 \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":"crates/viewer/dl_ui/src/hot_reload_design_tokens.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"941e85d4bf25b42955cbca9ab0d45fee0a5531ae12c2f275861553a594bc38e5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::read_to_string(data_path.join(\u0022light_theme.ron\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 \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":"crates/viewer/dl_ui/src/hot_reload_design_tokens.rs"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6605bff3341f44cc7a6ef9f1c50fb5a0f56218a0eab5e0dced42d90097789a1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060DesignTokensPerTheme::load()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060design_tokens_per_theme\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/hot_reload_design_tokens.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"82189aca2d40805177d600e3385235fd34f38cc24a8543d2de9becfaff513235"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::canonicalize(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 \u0060setup_file_watcher\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/hot_reload_design_tokens.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34e48a7de0ad2814f7f190f467e67d9cdf51dd8b5eddec90367a3b745b3be73"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060thread::Builder::new().name(\u0022dl_ui design token hot reloader\u0022.to_owned()).spawn(||{#[expect(clippy::disallowed_methods)]let(tx,rx)=mpsc::channel();let mut watcher:RecommendedWatcher=match Watcher::new(move|res:Result\u003CEvent,notify::Error\u003E|{if let Ok(event)=res\u0026\u0026event.kind.is_modify(){tx.send(()).ok();}},notify::Config::default(),){Ok(watcher)=\u003Ewatcher,Err(err)=\u003E{dl_log::error!(\u0022Failed to create file watcher: {err}\u0022);return;}};let path=std::path::PathBuf::from(env!(\u0022CARGO_MANIFEST_DIR\u0022)).join(\u0022data\u0022);let path=std::fs::canonicalize(path).expect(\u0022Failed to find data directory\u0022);match watcher.watch(\u0026path,RecursiveMode::Recursive){Ok(())=\u003E{dl_log::debug!(\u0022Watching for file changes in {}\u0022,path.display());while rx.recv().is_ok(){run_all_hot_reloading();}}Err(err)=\u003E{dl_log::error!(\u0022Failed to watch design tokens directory: {err}\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 \u0060setup_file_watcher\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/hot_reload_design_tokens.rs"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"7726903e316ad9cad37742c6b944c2479b7e028e63e4ea1262b4781e221244b3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060DesignTokensPerTheme::load()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060design_tokens_per_theme\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_ui/src/hot_reload_design_tokens.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"0014c90450993fc982ddc40990f82752c4df9f962a8d44f95f4dc89f9916fa05"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060view_states.get(store_id,*view_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 \u0060entity_selection_ui\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_selection_panel/src/selection_panel.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee7d120a6d6c221fb517eee07f10f7592294b2bfe8bee0f07897a07b0d5fade"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file_path.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 \u0060check_hermeticity\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/build.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ee8a56ba1875e21d81933c0eede7a494b427967b6ccca797cd88af01ee47c8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::read_to_string(file_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 \u0060check_hermeticity\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/build.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66475ecfe84989d37c8c5d1b52ea61b2cd444d342f634076604aa7c6974f5ca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::read_to_string(file_path).unwrap().lines().try_for_each(|line|{if!line.trim().starts_with(ImportClause::PREFIX){return Ok(());}let clause=line.parse::\u003CImportClause\u003E()?;let clause_path=dir_path.join(clause.path);let clause_path=std::fs::canonicalize(clause_path)?;ensure!(clause_path.starts_with(\u0026root_path),\u0022trying to import {clause_path:?} which lives outside of the workspace, \\\n                    this is illegal in release and/or Wasm builds!\u0022);Ok::\u003C_,anyhow::Error\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 \u0060check_hermeticity\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/build.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eee483501f710d04d1e717b707f15df5e59feacd1faad677388090713475e1f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060get_and_track_env_var(\u0022CARGO_CFG_TARGET_FAMILY\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":"crates/viewer/dl_renderer/build.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"c54ff84c3c5c3c1e209daeaa3680a053010a73132b7d8424eaff79b9af9a7511"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060get_and_track_env_var(\u0022CARGO_MANIFEST_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":"crates/viewer/dl_renderer/build.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc16b6493a19164ee901472a0b1141a4f44aca5e5aa3e881c1029f1f2f77b88"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::canonicalize(manifest_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 \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":"crates/viewer/dl_renderer/build.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"55c895bb33e5d0a88d358b5ebfbfabc0072b38427ca0269ef167fc745639f136"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::canonicalize(shader_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":"crates/viewer/dl_renderer/build.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b38cf5586d3dff4b0b901c90493bed416dc9859335e78173beec81fa47ae93b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pathdiff::diff_paths(entry.path(),\u0026src_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 \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":"crates/viewer/dl_renderer/build.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"3886696b67e804fcc2388d6a8a2e6466edb2c35602caa9cb8d73b5c2b5e688a4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060relpath.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 \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":"crates/viewer/dl_renderer/build.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c169a542a20b5ad6f377c409b26425bcfa615443595c887d95b6bd5480cc504"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060entry.path().strip_prefix(\u0026manifest_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 \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":"crates/viewer/dl_renderer/build.rs"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"632703eb184113bc9b9d7dd72a22d3a61bcc525c02a6da82088320035ff6fc33"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060virtpath.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 \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":"crates/viewer/dl_renderer/build.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f645d33d2a53134a875232541d3964104bd0d2fa520b06e0c982b733c13cbf0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write_file_if_necessary(file_path,contents.as_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 \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":"crates/viewer/dl_renderer/build.rs"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"542cc2f1cf79a1c681a302546f2e229837ba06dbc327f7edd74199e55d1b69e5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060r.get::\u003CR\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 \u0060renderer\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/context.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"51d3d88eec94b73402016e00f379056c212a8cc3ad4949f133ed9732cdbbd9cf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.0.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.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":"crates/viewer/dl_renderer/src/context.rs"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf6f9e5f01ee0ffccceabf3aa340c908cb6f573b737c466a975f6dd85fb3417"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path_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 \u0060populate_rec\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/file_resolver.rs"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"50956fae9fe4fccca99d48831971eb0b880ed395f7b0d0e9841b43de2a75b2ae"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path_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 \u0060populate_rec\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/file_resolver.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce76626d76d9a3e3f3cc855f77b1f5b94cc398fc96c4253a84d0528f99b9e848"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::new()\u0060 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":"crates/viewer/dl_renderer/src/file_server.rs"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b252b9af6901627f8fa1424f84a2f41768f275b58d47fb29d0913fe48e9b698"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060FILE_SERVER.read().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 \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":"crates/viewer/dl_renderer/src/file_server.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"62f5412cc6e6d417197a4aeb9cd89947aa62a60196d63001015e87d4babc1855"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::new()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060get_mut\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/file_server.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9598d44bc3c03c7fe762d8fea88ff25ec604e2c02ff66496e3ac8cf3a631f52"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060global.as_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_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":"crates/viewer/dl_renderer/src/file_server.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"6490a84d32fad6b6d1a040c75245733b906386ba9af591e5ff9aa4e902e054f8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060files.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 \u0060read_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":"crates/viewer/dl_renderer/src/file_system.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"007a080b0500df406a3b7190b4990f9414deac09a7dffad1a6681babaf365c7c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060files.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 \u0060canonicalize\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/file_system.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fafe86642d70eecb0593272816276e82a6af19c4d2e186e11eb1ab8e216f821"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060files.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 \u0060exists\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/file_system.rs"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"d189f6f768c215bf422cd747ba8fa993980ab9c8dd6ade0b7f9618460404f8b4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060files.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_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":"crates/viewer/dl_renderer/src/file_system.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"14d70c0288ddaea9c9bfd9145a226903e41c00f15150c4c0c67ccf47f3565c20"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.0.batches.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 \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":"crates/viewer/dl_renderer/src/gaussian_splat_builder.rs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"00801a0dbdf7b7dbef05c97380b01753d432fa38f3d5ea7581c4b7b62885c6b6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.0.batches.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060batch_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":"crates/viewer/dl_renderer/src/gaussian_splat_builder.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"58ae32b2d016832aabcb0278bdf6ffeda31fba45d863cff72bee05e38c2481e7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.0.batches.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 \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":"crates/viewer/dl_renderer/src/line_drawable_builder.rs"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"503fe4a562471712947a0c298cbc378cf0445ea10b94eaf7940f36c69098e856"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.0.batches.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060batch_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":"crates/viewer/dl_renderer/src/line_drawable_builder.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"c962c32ebeed85919f9574b0c7de3d789ea82334efc0ea48a075c516cc1a90cb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.builder.batches.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \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":"crates/viewer/dl_renderer/src/line_drawable_builder.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"06cbf28646e40143735fe07092fdef5e1789856441d25b619cadf9a0f060e513"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060vertex_buffer_layouts().iter().flat_map(|layout|layout.attributes.iter()).max_by(|a1,a2|a1.shader_location.cmp(\u0026a2.shader_location))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060next_free_shader_location\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/mesh.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"029ebbb7a0499c21dbd88ae9062dfa5526067fe904203d2d98ab97e3c6329f4d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.builder.batches.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 \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":"crates/viewer/dl_renderer/src/point_cloud_builder.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dfc6b61b2224f38cf7562a1d3c1e7547309b35cdef34cb2921720e61d6af4f4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.builder.batches.last_mut()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060batch_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":"crates/viewer/dl_renderer/src/point_cloud_builder.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6ec281e19a0107f7b56d8bfc5689c2052f591d6ff9d5d1fe620041a3f895b84"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(self.0.as_ref()as\u0026dyn Any).downcast_ref::\u003CD\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 \u0060expect_downcast\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/queueable_draw_data.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"b179adb14e71ad162f7d0067188f1f6f88f949a1b2fc21db9b4ce524bb26156c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pools.buffers.get_from_handle(*handle)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060alloc\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/wgpu_resources/bind_group_pool.rs"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"d61412c63b224e8cd282945de8b22d7b20038dcad75583b81b731cb8a85c580d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pools.textures.get_from_handle(*handle)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060alloc\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/wgpu_resources/bind_group_pool.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb8453de0fc7938edb0a6665b735bd9a55ffbec4928ef2832dea77a26955486"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060samplers.get(*handle)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060alloc\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/wgpu_resources/bind_group_pool.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"22aa8aacc8b81ce6696db7896550e6bed05401b3fc3a50551284d4862dfce4c3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060pools.bind_group_layouts.resources().get(desc.layout)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060alloc\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/wgpu_resources/bind_group_pool.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"29cef3608145ddc561cb5d99e9b356c55fbbf85bb85e2e081c38bc8565054c21"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060entry.get_mut().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 \u0060alloc\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/wgpu_resources/dynamic_resource_pool.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3ff3fbd6d21bd94e334c2fc76385b27deaea1851dd083c37fff61fc40aec8e4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060desc.create_render_pipeline(\u0026ctx.device,\u0026ctx.gpu_resources.pipeline_layouts,\u0026ctx.gpu_resources.shader_modules,)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060get_or_create\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/wgpu_resources/render_pipeline_pool.rs"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"65067551888b4edfb022aa16c718bd96f9c7ebce8f35a545b857449a31289a66"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::create_dir_all(\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 \u0060create_shader_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":"crates/viewer/dl_renderer/src/wgpu_resources/shader_module_pool.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"da496d4db6fe61f7be21d01a3f302720deeb6c4758297bc82928fcc2495159ce"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.source.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 \u0060create_shader_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":"crates/viewer/dl_renderer/src/wgpu_resources/shader_module_pool.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac2bc125ff035eb58a7bd2c1ac5856cdb59d2a401be734f701be56cd4b80941"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(\u0026path,\u0026source_interpolated.contents)\u0060 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_shader_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":"crates/viewer/dl_renderer/src/wgpu_resources/shader_module_pool.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b077d0ee4e6ccf86f7b83698cfa49dbe029e7c4d8ac7676d9c2dfa66c80d881"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.resources.get_mut().get_mut(*handle)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060recreate_resources\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/wgpu_resources/static_resource_pool.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aacb4ecc3e748a01f067e5a25bd3d5d847b6baff18baedbcdf9f6d202f21413"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060GpuTexture2D::new(texture,alpha_channel_usage)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060create\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/resource_managers/texture_manager.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0ac1bbd79544d11c160559b9a31d4a49aa4c85f13c49a7a454e3a6d22cd89e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data_texture_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.expect()\u0060 in \u0060num_data_buffer_bytes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/resource_managers/yuv_converter.rs"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"d983e23de4678946ed037a5078984bcdcb5d7d8d186e9f434a0daf5eec6b227a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060uniform_buffer_bindings_mask_only_batches.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 \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":"crates/viewer/dl_renderer/src/renderer/gaussian_splat.rs"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"840224de63526cfc89abda1083d55cc47ca71df73c2b04e7b99134962785a6ce"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060uniform_buffer_bindings_mask_only_batches.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 \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":"crates/viewer/dl_renderer/src/renderer/lines.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8d47ee8fcf7cdff5ac99490502ef96a2dc5d03f8908c8a77d18263e9e78e02"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060draw_data_uniform_buffer_bindings.into_iter().collect_tuple()\u0060 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":"crates/viewer/dl_renderer/src/renderer/point_cloud.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9887dfc97c884c6e1d8c563859ac1b2499af1c549c64ed553868631bb655753"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060uniform_buffer_bindings_mask_only_batches.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 \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":"crates/viewer/dl_renderer/src/renderer/point_cloud.rs"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"963d745dbea5ecaa3a74c67ffb0d369130e9b8ce0b0a1c30cfb6a1c38529664d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Regex::new(r#\u0022\\bid=([\u0022\u0027])([^\u0022\u0027]\u002B)[\u0022\u0027]\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 \u0060sanitize_dae_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":"crates/viewer/dl_renderer/src/importer/dae.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"73eda68ef6c58b7df221998d704baa0cf1421dc88ab0998b8be4dc6c92b2d279"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::PICKING_LAYER_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 \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":"crates/viewer/dl_renderer/src/draw_phases/picking_layer.rs"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"32e5d8b85ea87563de042095f9c4567a8877aaa13810abfdd73f5751d1f438a1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::PICKING_LAYER_DEPTH_FORMAT.block_copy_size(Some(wgpu::TextureAspect::DepthOnly))\u0060 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":"crates/viewer/dl_renderer/src/draw_phases/picking_layer.rs"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc2286a28fa19272eb662c4de9fa3c73bc6a2a39e58c6156a37bb1a92c01750"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::PICKING_LAYER_DEPTH_FORMAT.block_copy_size(Some(wgpu::TextureAspect::DepthOnly))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060readback_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":"crates/viewer/dl_renderer/src/draw_phases/picking_layer.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8599998c4a93ba9ad21787465820b27712bae547acd67a874ab4d9895c50741"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::PICKING_LAYER_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 \u0060readback_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":"crates/viewer/dl_renderer/src/draw_phases/picking_layer.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fd4ea705f8e1a5bb8200164f86dddc93b3af1848b186d3a05f4de510d29c90d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060DepthReadbackWorkaround::READBACK_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 \u0060readback_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":"crates/viewer/dl_renderer/src/draw_phases/picking_layer.rs"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1f64a80cb4238fc054908181b61496dc722d7dbfcd3f18cebfcfafe92bd021"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060buffer_slice.get_mapped_range_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 \u0060allocate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/allocator/cpu_write_gpu_read_belt.rs"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"170681f70c85956e65d0ebf95f333a3a33bb929d43a1c33370b6c99946873178"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060wgpu::TextureFormat::Rgba32Uint.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 \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":"crates/viewer/dl_renderer/src/allocator/cpu_write_gpu_read_belt.rs"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c391167674bbeeb3d3f7a1552814d22d268f8d354e00589c6b45bd3d7de5890"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060texture_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.expect()\u0060 in \u0060finish\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/allocator/data_texture_source.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47d788f7b503a99058358887ada347f0b294d77e22cec6f9e101e219923e932"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060slice.get_mapped_range()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060readback_next_available_internal\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/allocator/gpu_readback_belt.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccb22b3223b88d10ab75b062c8e2ce80819e0182ef90fb3c6d838554a5dcddf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060range.user_data.downcast::\u003CUserDataType\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 \u0060readback_next_available_internal\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_renderer/src/allocator/gpu_readback_belt.rs"},"region":{"startLine":478}}}],"partialFingerprints":{"codehealthFindingId/v1":"b713b31a18abe9218052d45026f2f9e0dc83cbc3cfc32115901572b839473d7d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::num::NonZeroU64::new(element_size)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060create_and_fill_uniform_buffer_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":"crates/viewer/dl_renderer/src/allocator/uniform_buffer_fill.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c19139195f6308ea970ff64204601682b65a813ad11ce3d8584031d7f90af65"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060create_and_fill_uniform_buffer_batch(ctx,label,std::iter::once(content)).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 \u0060create_and_fill_uniform_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":"crates/viewer/dl_renderer/src/allocator/uniform_buffer_fill.rs"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc2ec90c3a6afbd19d8f726eba4612f200b4f1241b39a9c99e530282957bbf73"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dl_backoff::BackoffGenerator::new(std::time::Duration::from_secs(1),std::time::Duration::from_secs(30),)\u0060 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_events_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":"crates/viewer/dl_redap_browser/src/servers.rs"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca49ff0d213d01ec9a9c985e58337f7801f9ad8f2bd60d4da346ea1855e1b644"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060web_sys::window()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_redap_browser/src/server_modal/login_flow/web.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0036b763897d28a779f5abdabe91b8510b2a54ba59ff0c7b93a5461dff5bf2b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060web_sys::window()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060open\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_redap_browser/src/server_modal/login_flow/web.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f56474b08477fe945a0638542b36189ccff271c3330a84383e9f9291f89a0f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060column_data.downcast_array_ref::\u003CArrowListArray\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 \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":"crates/viewer/dl_dataframe_ui/src/display_record_batch.rs"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b40ef43b203b8bd4dd1a35dafa6cdc56875daedc0fd002ef50b437c6bb73970"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060column_data.downcast_array_ref::\u003CArrowInt32DictionaryArray\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 \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":"crates/viewer/dl_dataframe_ui/src/display_record_batch.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4019892f211f388ba5aa26bad7f5cc51c1a38098630d2a38a2e9608e1d1a61"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dict.values().downcast_array_ref::\u003CArrowListArray\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 \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":"crates/viewer/dl_dataframe_ui/src/display_record_batch.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff50265babe6e4697a4929634ca3f4a1aeac13695d946f78568ceac0c5511bb3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060combined_response\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060edit_marker_shape_ui\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/marker_shape.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c6517b2f052ee38304d6549ef2339d1210b832be5b2b6cb5314d6f0970ec323"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060variants.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 \u0060edit_or_view_plane3d\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/plane3d.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ee4de690f40185170397207f7fac4cdec6e722ccd17f11c470b506ccb37978"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060response\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060singleline_edit_or_view_view_coordinates\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/view_coordinates.rs"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"388ae0fd1ffeb24be4d3251486b2769c0bc17b305355c0a6656045308c70f3ac"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060response\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060multiline_edit_or_view_view_coordinates\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_component_ui/src/view_coordinates.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"24219d44ef1828b65ab61da794889267dd7851dfcfb37d737dfb9731acbc0b5c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060array.as_any().downcast_ref::\u003CFixedSizeBinaryArray\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 \u0060make_ui\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_arrow_ui/src/show_index.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e6674600ffebb7ce7ef49d969b0ea0fd089848492b5c137d0c05749957ae90c"}},{"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.expect()\u0060 in \u0060make_ui\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_arrow_ui/src/show_index.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"82037ae3580a3cddaefba2d0b1e82b4e18f6a187e7dcb4a3cad68531ce420e3e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fields[id as usize].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 \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":"crates/viewer/dl_arrow_ui/src/show_index.rs"},"region":{"startLine":871}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04e90dfb76161904edb71926a400f2f00d6a7dc8abd21370324c63e12b62da6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fields[id as usize].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 \u0060show\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_arrow_ui/src/show_index.rs"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd483183ac7cca620e2db8f7c5d49c3f57e7386dd80cf34f54205897a6b19a6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060e.ok_or_else(||{ImageSizeError::InvalidData(\u0022Invalid PNG data, couldn\u0027t extract size\u0022.to_owned())})?.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 \u0060png_meta\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_video/src/gop_detection.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3d697add20cc308b52d34d0f3918b4b61ac2dd8b99bade1b48a713774f4110f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data[buffer_offset..(buffer_offset\u002B2)].try_into()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060write_length_prefixed_nalus_to_annexb_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":"crates/utils/dl_video/src/nalu.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"af45c9827760ac4fa67b37e470d9dbbed466ca929ce49bc702d5e1dcb95bfb37"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data[buffer_offset..(buffer_offset\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 \u0060write_length_prefixed_nalus_to_annexb_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":"crates/utils/dl_video/src/nalu.rs"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db8346c0ebe0cb4e02acae7dc8c7c226193b4eaa02492d765a9bc6357ca3c4e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(format!(\u0022decoder of {debug_name}\u0022)).spawn({let comms=comms.clone();move||{econtext::econtext_data!(\u0022Video\u0022,debug_name.clone());decoder_thread(sync_decoder.as_mut(),\u0026comms,\u0026command_rx,\u0026output_sender);dl_log::debug!(\u0022Closing decoder thread for {debug_name}\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 \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":"crates/utils/dl_video/src/decode/sync_decoder_wrapper_native.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc5cb9745bed1b5f27dcbf56abb42a84709e3e3bc56bd69706b71231371061e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(format!(\u0022ffmpeg-reader for {debug_name}\u0022)).spawn({let output_sender=output_sender.clone();let debug_name=debug_name.to_owned();let ffmpeg_path=ffmpeg_path.map(|p|p.to_owned());let outstanding_frames=num_outstanding_frames.clone();move||{read_ffmpeg_output(\u0026debug_name,ffmpeg_path.as_deref(),ffmpeg_iterator,\u0026frame_info_rx,\u0026pixel_format,\u0026outstanding_frames,\u0026output_sender,);}})\u0060 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":"crates/utils/dl_video/src/decode/ffmpeg_cli/ffmpeg.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"c51bd2bfa6980c5a66f1c0b494ae4e281cf12739254abdf34b799e6a5e8e2189"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(format!(\u0022ffmpeg-writer for {debug_name}\u0022)).spawn({let output_sender=output_sender.clone();let ffmpeg_stdin=ffmpeg.take_stdin().ok_or(Error::NoStdin)?;let mut ffmpeg_stdin=StdinWithShutdown{stdin:ffmpeg_stdin,shutdown:stdin_shutdown.clone(),};move||{write_ffmpeg_input(\u0026mut ffmpeg_stdin,\u0026frame_data_rx,\u0026output_sender,\u0026mut codec_meta,);}})\u0060 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":"crates/utils/dl_video/src/decode/ffmpeg_cli/ffmpeg.rs"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7827e9c9ed99c4d74cf5bf56d5c68009493149716f90dcb1044e8c65ae21124"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060getrandom::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_u64\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_tuid/src/lib.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"b954e09b1b117a48d1cdafc7d8049b170c21214c3a1f2836eff910aa111b4c59"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(\u0022PeakMemoryStates\u0022.to_owned()).spawn(move||collect_peak_memory_use(\u0026shutdown_rx))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_memory/src/peak_memory_stats.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd76d173a2b064e8436e005b21fe331a62c5b09703e277bccb0db3c9fdb0fd0c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060version.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 \u0060call\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_grpc_headers/src/lib.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed5cba050c195102b357b0176e7b009100c1e546cc39b5f34f30fae95b64dcb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.parse()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060size_bytes_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_byte_size_derive/src/lib.rs"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"84cb6a20e7e8bbc483c8c8124b240b624a250967c215fd7b16c575be3eaa5d19"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060field.ident.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 \u0060enum_body\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_byte_size_derive/src/lib.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"868b070a7b8a4d8234adef476139acd1be9adf49b5737fb20eb6ec3585e8863a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tiny_http::Header::from_bytes(key,value)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060header\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_auth/src/callback_server.rs"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8fe3fe9d724f0050075bff4cf738b0a302034afe85c7e2d6982f31f065c87c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.oauth.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 \u0060verify\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_auth/src/provider.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"e837db6f2210ab33fd7bed68bb97ee4aae11e0ff736548f165019763288bd1dc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060getrandom::fill(\u0026mut indices)\u0060 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":"crates/utils/dl_auth/src/oauth/api.rs"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"3305096dd9ddbc67638cba067d19eafa6741ac4fdaca561bd76b8ad960e64b52"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060String::from_utf8(indices.into_iter().map(|idx|CHARSET[(idx as usize)%CHARSET.len()]).collect::\u003CVec\u003Cu8\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 \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":"crates/utils/dl_auth/src/oauth/api.rs"},"region":{"startLine":214}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f53778214d378e51aefeffaf870d8672de7662e616fb3436c8304f08f7a96ff"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060web_sys::window()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060sleep\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_async/src/lib.rs"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c3f9167557254e280f96d68f4a0117d6773f28fcb6727c676acc9606ec88269"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060web_sys::window().expect(\u0022browser window should exist\u0022).set_timeout_with_callback_and_timeout_and_arguments_0(\u0026resolve,milliseconds)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060sleep\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_async/src/lib.rs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d1b6733996dd8825fc8138ee739b75fe6aea56299da02cf01780e1c8ef9cff"}},{"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 \u0060sleep\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_async/src/lib.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a668896cc1347e5d86f22c2e5a2f7aa5ba4a3ac8e87ab526ceb3c1c2ff363f"}},{"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 \u0060sleep\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_async/src/lib.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"60f224fe6ed2342f770fc9e61bd3ae4fed78d32e7e9e5ed3e60ed3a75dc83df4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060yield_fn.call0(\u0026scheduler)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060yield_now\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_async/src/lib.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2583db938aa551793cc22aefc93ba78b73f1949266a4a55d57957b865134b984"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060yield_fn.call0(\u0026scheduler).expect(\u0022scheduler.yield should return a promise\u0022).dyn_into::\u003Cjs_sys::Promise\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 \u0060yield_now\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_async/src/lib.rs"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8c2d7d70db9e4a2d83278d23a175409948ed49b50879bcd3c20a35ecfef83c"}},{"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 \u0060yield_now\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_async/src/lib.rs"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd47150de6aeb7e0b5fd9ce171cc3cc6d8847a7901f00dbf3736c8ff6821b4df"}},{"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":"crates/utils/dl_async/src/lib.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"704672bbb4fe0165ef960daf2214fdf238a3006db71047a804c823ab78339126"}},{"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 \u0060dropping_result_cancels_spawned_future\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_async/src/lib.rs"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"de6c6d4baebc89fe3e4e7ce16372bc94b6cf849e7cc304881d5f0d4944e1610b"}},{"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 \u0060dropping_result_cancels_spawned_future\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_async/src/lib.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fccdc7a8c5bfafb2f588f89e3b680d725c7f4c7e0f0e14a2191cd7a8abd8285"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060arrow::compute::filter(array,filter)\u0060 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_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":"crates/utils/dl_arrow_util/src/arrays.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef49b8f3b08be2802380f3c29f32a18c6c52896c449d9b34dc253b4f74f92245"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060arrow::compute::filter(array,filter).unwrap().as_any().downcast_ref::\u003CA\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 \u0060filter_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":"crates/utils/dl_arrow_util/src/arrays.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"799e81e1030220177635755132ac379cb6e2255a8bb3aac4dc93242148bb83e0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060array.clone().as_any().downcast_ref::\u003CA\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 \u0060take_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":"crates/utils/dl_arrow_util/src/arrays.rs"},"region":{"startLine":363}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ccbadba8201b98e7c8456beb365a800a8828ccc00cb8a8ebc60d74f22ce2e82"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060arrow::compute::take(array,indices,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 \u0060take_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":"crates/utils/dl_arrow_util/src/arrays.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"2572e51cb69d7fc3daaac28e24512cb4a03ff23a8736bca9a537d39e847db308"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060arrow::compute::take(array,indices,Default::default()).unwrap().as_any().downcast_ref::\u003CA\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 \u0060take_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":"crates/utils/dl_arrow_util/src/arrays.rs"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"21a9711745d23922be418044399fdaba55521a2413a8b3543a457ab172c49641"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.clone().with_schema(Arc::new(schema))\u0060 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_nullable\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_arrow_util/src/batches.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"05895ef35ba10408b309f5f81119839a9c70a437c49a6c2ff6911065e5e1b87f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060arrow::compute::kernels::cast::cast(list_array,\u0026target_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 \u0060widen_binary_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":"crates/utils/dl_arrow_util/src/lib.rs"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33a1f19593366b77a21a954a8274c7809d179e9881700b38273960d4e5ddd49"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060RecordBatch::try_new_with_options(batch.schema(),new_columns,\u0026options)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060garbage_collect_string_view_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":"crates/utils/dl_arrow_util/src/string_view.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27a0831f862812a679554b274acd613a3b324c2f58ef0b5cb602289c809df11"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.config_file_path.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 \u0060config_dir\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utils/dl_analytics/src/native/config.rs"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6f91595397ec41af1613619b807438ceebd8d557952b8f063a347b412f67eda"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060builder.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 \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":"crates/top/dl_sdk/src/grpc_server.rs"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"991a4d43f6d3eeac0552567ef71ddf5041a8a22fe22a29eb3ca0caa257a85d74"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(\u0022message_proxy_server\u0022.to_owned()).spawn(move||{let mut builder=tokio::runtime::Builder::new_current_thread();builder.enable_all();let rt=builder.build().expect(\u0022failed to build tokio runtime\u0022);rt.block_on(dl_grpc_server::serve_from_channel(grpc_server_addr,server_options,shutdown,channel_rx,));})\u0060 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":"crates/top/dl_sdk/src/grpc_server.rs"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"82637131cf177d9842f9b92b9a8d26fae916525d74c47087d43d3e1b014c7618"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dl_uri::ProxyUri::from_str(crate::DEFAULT_CONNECT_URL)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\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":"crates/top/dl_sdk/src/log_sink.rs"},"region":{"startLine":601}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef77c7038d32842b3c8230d0610ee434129f06f2781ac2195a8f8e76d4194d5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060crate::sink::FileSink::new(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 \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":"crates/top/dl_sdk/src/recording_stream.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6985abdccc8fe94071f5ef6a46cb8e7d669a5982ffb83153648f93c7112b99f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060builder.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 \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":"crates/top/dl_sdk/src/web_viewer.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8f20e8c3b7812fd86d5b8d3c33d0bb472d96ee53be51a4cd2c7ad4ea0d2493"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(\u0022message_proxy_server\u0022.to_owned()).spawn(move||{let mut builder=tokio::runtime::Builder::new_current_thread();builder.enable_all();let rt=builder.build().expect(\u0022failed to build tokio runtime\u0022);rt.block_on(dl_grpc_server::serve_from_channel(grpc_server_addr,server_options,shutdown,channel_rx,));})\u0060 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":"crates/top/dl_sdk/src/web_viewer.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed6b1497bdb43cef1b2a2c19e131ef419f7e6a4f8c0e7dff697101fbc76c808f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060msgs.first().and_then(|msg|match msg{LogMsg::SetStoreInfo(info)=\u003ESome(info.info.store_id.clone()),_=\u003ENone,})\u0060 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\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dl_sdk/src/blueprint/api.rs"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fbddd7da05f4ca4458dc57ba195b454c5dfa4dd4eddc45703e504e691b33e09"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060CString::new(dl_sdk::build_info().version.to_string())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060dl_version_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":"crates/top/dalaran_c/src/lib.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fe8d5aff73fa8b093a1c1ed92fa0135edf4c2645b0701872c22473905b61003"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060url::Url::parse(\u0026url.as_url())\u0060 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_http_or_dalaran_uri\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/auth.rs"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe90368a00ab6bf6329ab49e641280b0f9bbf53fe792de36df6488e2d098b07"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dl_perf_telemetry::Telemetry::init(args,dl_perf_telemetry::TelemetryDropBehavior::Shutdown,)\u0060 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":"crates/top/dalaran/src/commands/entrypoint.rs"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e37cb298b69d159f073171217f3eac0bb0314d04b133b26d4334f169a75df96"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060col.iter().max()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060unordered_chunk_counts\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/mcap/check.rs"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb2f5576602bc819d63630508cdc501bca13bda6af332d35451457877856594c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chunk.to_record_batch()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060format_chunk\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/compare.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"13938215f872d598e976ccf4da37b7c8d49eb304ece5339d005ae96e05af7992"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060stores.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 \u0060load_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":"crates/top/dalaran/src/commands/dlr/compare.rs"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd3a1c7b1c37810b4aab41d37d3001a111e6d62c5449a0fd5ed638fcb5e9119"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060arrow_msg.chunk_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 \u0060process_messages\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/route.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"674c0f25bafd60197563ec99a77ddbf70c72996d41aaf618befb69c1ecb9941f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060(*chunk_id).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 \u0060process_messages\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/route.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c8130105b795fbc216ef32dc2b09284c2f54be247493fb41a7a1cfe30f4c26e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chunk.to_record_batch()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060split_store\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/split.rs"},"region":{"startLine":775}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7551518b71916c25a951b4af6dc18022a42f43391ef62464de10eb971142f46"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chunk.iter_indices(timeline.name()).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 \u0060extract_chunks_for_single_split\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/split.rs"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"250807ea12babea853365431f82e2dd793866aad2c05352655d3d2a4d73d6444"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chunk.iter_indices(timeline.name()).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 \u0060extract_chunks_for_single_split\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/split.rs"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"d77b63fbccf6ccb66e34e6a596af4546940ea36b3e852fa765cebc788a98dde9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060decompress_thread_handle.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 \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":"crates/top/dalaran/src/commands/dlr/stats.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e5a03618adef9654d00c7aa3693a62407850fdeb210054614d601e362fe4921"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chunk.chunk_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 \u0060load_from_dlr_filepath_with_dlr_manifest\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/verify.rs"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1857753fce2618fa3a635894ab5e0917092f49e732891dfb4117d7febb49750"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chunk.chunk_id.expect(\u0022must have chunk ID\u0022).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 \u0060load_from_dlr_filepath_with_dlr_manifest\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/top/dalaran/src/commands/dlr/verify.rs"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cad8db6b7eb45d2062c577b6628aead4590448ccf71c15db92cbac221ff9cde"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060url::Url::parse(\u0022http://x/\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 \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":"crates/store/dl_uri/src/endpoints/folder.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cb78d38e0b8ffd78438f6f02a4b97635a2655395e057c612d01ed418c4517f8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tmp.path_segments_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 \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":"crates/store/dl_uri/src/endpoints/folder.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bef0b6c422f86ceb369b4435481ff4f92dbf6dcf8b3383bbf0484c516a337a7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::try_new(format!(\u0022{}:{field}\u0022,archetype.short_name()))\u0060 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_archetype_field\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_types_core/src/archetype.rs"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4f99957ea4c0e0d9d356107b83dafb25c4263b33ecb2b81f94f28d4212e6fd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060[expect(clippy::unwrap_used)]\u003CTuid as Loggable\u003E::to_arrow(tuids.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 \u0060tuids_to_arrow\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_types_core/src/tuid.rs"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"998f858f3cb7ace33df6b73e94ea8eb17b7d397ec44dea14d8b16808ae2d7f86"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.associated_entity_path_static.as_ref().or(self.associated_entity_path_temporal.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 \u0060associated_entity_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_resolution_cache/tree_transforms_for_child_frame.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"452764bb2d0e0bd06184e81b771998155ac382961e54ed3436dd0676125f191d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.associated_entity_path_temporal.as_ref().or(self.associated_entity_path_static.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 \u0060associated_entity_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_tf/src/transform_resolution_cache/tree_transforms_for_child_frame.rs"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"e776926581ad91ce9df83d13cad4f2b23f121ea2ca6a4e1367f44312962e756c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060RecordBatch::try_new_with_options(Arc::new(Schema::new_with_metadata(modified_fields,batch.schema().metadata().clone(),)),batch.columns().to_vec(),\u0026RecordBatchOptions::default().with_row_count(Some(batch.num_rows())),)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060port_recording_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":"crates/store/dl_sorbet/src/migrations/v0_0_2__to__v0_1_0.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93fc5c92db67df06776a641bc72e3759585242d6fb4d78bdee28e1827f75ee4"}},{"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 \u0060start\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/server.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"52011b7ca913b5ff710d359aab0e2b667eb3ddeba7542a6e12683df10c3db28a"}},{"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\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/server.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"be30878ca28f036f3856c37398e1113b7a6642e477a4c6cefd58206eaff487cf"}},{"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\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/server.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfd25fe7f5e9e864d8f762fcfda7628ae61280d68b2b7fa149cc29ac730244d1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060DEFAULT_ADDRESS.to_socket_addrs()\u0060 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\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/server.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a82ee665ec2dfb3cbe18286fdf63d291d93714cc628cf3464cf3fd1899695f4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060DEFAULT_ADDRESS.to_socket_addrs().unwrap().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 \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":"crates/store/dl_server/src/server.rs"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"c492f6f46ddd6252c4b822a813729f6b74d969857d121088cab690c5aa05a7cb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060url::Url::parse(\u0026format!(\u0022memory:///{}\u0022,self.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 \u0060as_dataset_entry\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/dataset.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e995f75f96ee1feaca556f73a9caa56d59dc79b510e7cd7d1d5134e29936994"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ret.update_entries_table()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\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":"crates/store/dl_server/src/store/in_memory_store.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"851123943200bad06478edaa7423504f8e82b17c4dc68abf6924a10d9b3939dc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060directory.file_name()\u0060 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_directory_as_dataset\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/in_memory_store.rs"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee07c4709bc9b824c852575e65d64b918ff8343ce50f94531e79ca97327b5c9c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.create_dataset(entry_name,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 \u0060load_directory_as_dataset\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/in_memory_store.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7581dab6f52dd3f03a78bba4d671195a269873234c2230a0c38fd3a7badffe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060directory.file_name()\u0060 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_directory_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":"crates/store/dl_server/src/store/in_memory_store.rs"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"843aeb0ce866fe94cd08d79c71e66b8483bc13d13b6b1f13c8afdc97b6e71882"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Chunk::builder(entity_path.clone()).with_sparse_component_batches(RowId::new(),TimePoint::default().with(timeline,i64::from(i)),[(MyPoints::descriptor_points(),Some(\u0026points as _))],).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 \u0060write_dlr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/resolved_store.rs"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"f70f84ea6e55650b5af4fa549de6c995aaa090ba10808684d22b5cce9b78ffc8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::File::create(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_dlr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/resolved_store.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d504656109925223361422ed2e0159f4141079e073e4e25676738220006aeed"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dl_log_encoding::Encoder::new_eager(dl_build_info::CrateVersion::LOCAL,dl_log_encoding::EncodingOptions::PROTOBUF_COMPRESSED,\u0026mut 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 \u0060write_dlr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/resolved_store.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"122dd37fe8a7c68c11c52403ebe0d4075bda31fdfbfd771b30e8c4318c7434c4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060encoder.append(\u0026LogMsg::SetStoreInfo(SetStoreInfo{row_id:*RowId::ZERO,info:StoreInfo::new(store_id.clone(),StoreSource::Unknown),}))\u0060 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_dlr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/resolved_store.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a7f2baaf3435ab95a6b3175cf575ef3dee141742dcd1a8650910d0a052a425d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chunk.to_arrow_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 \u0060write_dlr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/resolved_store.rs"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac58da5cdf127223bba1f43c493367c7fd518c103aaf061ace3ebacceb35070b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060encoder.append(\u0026LogMsg::ArrowMsg(store_id.clone(),chunk.to_arrow_msg().expect(\u0022test chunk should encode as arrow\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 \u0060write_dlr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/resolved_store.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c8b3a1cad86904a56e1391d2f6a8547287039e160a06e8edd5562e7a067d0a"}},{"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.expect()\u0060 in \u0060write_dlr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/resolved_store.rs"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f07fc114e4f5301e41e31389a9009b872189aa301ca1bb6dcaa44b3561ed058"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Chunk::builder(entity_path).with_sparse_component_batches(dl_chunk::RowId::new(),TimePoint::default().with(timeline,frame_idx),[(MyPoints::descriptor_points(),Some(\u0026points as _))],).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 \u0060build_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":"crates/store/dl_server/src/store/source.rs"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"201220a4ded13e7809451f41852cbc2d27cfd8e08589721255e688cfcc4087dc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::File::create(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_dlr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/source.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca7c88f87489495e88c16c9d7055f49a0dc02fdb8d30da6c60c7129e0525a5a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dl_log_encoding::Encoder::new_eager(dl_log_encoding::CrateVersion::LOCAL,EncodingOptions::PROTOBUF_COMPRESSED,\u0026mut 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 \u0060write_dlr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/source.rs"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2dcec3a8cd44d87e9ec2b77758cb10d1545d43667165123a675f48fa312fc0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060encoder.append(\u0026set_store_info)\u0060 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_dlr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/source.rs"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed77d0ee3c6618efbf1a13bbd87e858218977370e8dc0d2c428359f7b9f8f033"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chunk.to_arrow_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 \u0060write_dlr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/source.rs"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"8204fed12acbef6b1353159524de6da447caee1f292e5f51240059364a054b36"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060encoder.append(\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 \u0060write_dlr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/source.rs"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"d363dcd16a608be0cf8935b81fe83dc6ce4d2a88023a0b4c506af836bcdf2ed0"}},{"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.expect()\u0060 in \u0060write_dlr\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/store/source.rs"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"85939847f9091dceb009a9c44f161b880952a98f1de9fe7d67459a65e2258719"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060create_data_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 \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":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcced9af4c4b87f613d7ab7f23612b7392ad09f9e1c1da8c26d6dc28210b0d42"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060timelines.get_mut(timeline_name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060query_dataset\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"554a5cf7b7d651aa996c6e96565fd6735a10faed55a21e2297167e95d356f85b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060timelines.get_mut(\u0026timeline_name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060query_dataset\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_server/src/dalaran_cloud/mod.rs"},"region":{"startLine":1704}}}],"partialFingerprints":{"codehealthFindingId/v1":"a374f8719b7a4e9a446c8b09a3b84f2d39982d555e48f0c11a392e64fccfad36"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dlr_manifest_parts.pop()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060get_dlr_manifest\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_redap_client/src/connection_client.rs"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1737e3fe2faa59b54dc93638e762e3b1077679898597fb2fc7b042d7f653cfb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dl_backoff::BackoffGenerator::new(policy.base,policy.max)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060retry_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":"crates/store/dl_redap_client/src/lib.rs"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7e6f86c3e78852c6933fee305cd427384ae4cd939118951eb199c6dc7a5bcf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060last_retryable_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 \u0060retry_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":"crates/store/dl_redap_client/src/lib.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f16707bdc9e6425f056c0e78efd039dd22f2c3f4cd40784663d3158bd25771a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060entry_id.to_string().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 \u0060with_entry_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":"crates/store/dl_protos/src/headers.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"43362061e780264ff75b02c95c37a77b97f50f105a8375102d66d93893a5c80e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060arrow::ipc::writer::StreamWriter::try_new(\u0026mut uncompressed,schema)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060record_batch_to_ipc_bytes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_protos/src/v1alpha1/dalaran.common.v1alpha1.ext.rs"},"region":{"startLine":1191}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fbfe902651d192d94fa09e9b20d961269dce242c62e30f698617d051612d6cb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sw.write(batch)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060record_batch_to_ipc_bytes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_protos/src/v1alpha1/dalaran.common.v1alpha1.ext.rs"},"region":{"startLine":1197}}}],"partialFingerprints":{"codehealthFindingId/v1":"641e70c3e9446792cee750ad71c6b258a8294e5582e46ee51c913fa15334a295"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sw.finish()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060record_batch_to_ipc_bytes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_protos/src/v1alpha1/dalaran.common.v1alpha1.ext.rs"},"region":{"startLine":1201}}}],"partialFingerprints":{"codehealthFindingId/v1":"55993559855ece79ee7407409fefa7ccbedfd113813776bb1e5afdb2f7919332"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060refs.iter().find(|(n,_)|n==col_name)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060process_static_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":"crates/store/dl_parquet/src/streaming.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb9890e0f8a75d5cfce6155faef57dc96a8fb27d373862b5fa02df265db796d1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060prefix[1..].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 \u0060read_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":"crates/store/dl_mcap/src/info.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"532e064b1c55af1b37f8ce67f0f80eb14078f7fdf646000d3109037bd393b18b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060mcap[off\u002B1..off\u002Bcrate::RECORD_HEADER_LEN].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 \u0060build_chunk_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":"crates/store/dl_mcap/src/recover.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bf02aaf0c759968b8b8d25af40fd349c83e4fd55421b716f2930624f9ce1df3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060struct_builder.values().field_builder::\u003CStringBuilder\u003E(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 \u0060append\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/point_cloud_2.rs"},"region":{"startLine":443}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c807d3ad75f087a25741c9bba24b2ab765882f1f45030dac85e365cba1f5e04"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060struct_builder.values().field_builder::\u003CUInt32Builder\u003E(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 \u0060append\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/point_cloud_2.rs"},"region":{"startLine":450}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef205e2d4b49332d454800c52f8089818f11fd7f753206ca130a81dce7612de"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060struct_builder.values().field_builder::\u003CUInt8Builder\u003E(2)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060append\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/point_cloud_2.rs"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ab1c4401c2ceea5f1c36749c360769e6105e272a72e1959b8a493abaec4851"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060struct_builder.values().field_builder::\u003CUInt32Builder\u003E(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 \u0060append\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/parsers/ros2msg/sensor_msgs/point_cloud_2.rs"},"region":{"startLine":464}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba331f7878b56f4a84b227e95a758248cf2504c1349a43c7d70acf12a1182a4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060handle.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 \u0060process\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/decoders/mod.rs"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"1096682248fe904fa5e9bb8d978cf16f2441deefc9f1138626626918909b48ef"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060field_builder.as_any_mut().downcast_mut::\u003CStructBuilder\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 \u0060append_message_fields\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/decoders/protobuf.rs"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4bbc377d205ec5091ab4157a4d69fe620403d2e449e9bd0d69f5793905a7528"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060builder.as_any_mut().downcast_mut::\u003C$T\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 \u0060append_map_key\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_mcap/src/decoders/protobuf.rs"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97517ca6f42d50e14c247bd00f93ea9bf449d540b58f05e23336a5438c96aae"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060EntryName::new(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 \u0060try_new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/app_id.rs"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dd1dedb735526ed38fc1adcf06cac9c75de3628ce5a54d72151910e04795386"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::try_new(entry_id.to_string())\u0060 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_entry_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":"crates/store/dl_log_types/src/app_id.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6b4c843d24ec80f142063521d55850590a32843902448245dba25187dfe2ba1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::try_new(format!(\u0022app_{}\u0022,uuid::Uuid::new_v4().simple()))\u0060 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\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/app_id.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb34007d4fd99e5c1ef4eb97027967dad907c9967cfa69796691d85d0dd1e333"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::new(\u0022__entries\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 \u0060entries_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":"crates/store/dl_log_types/src/entry_name.rs"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ae6f3afa8f05e3d1be5ecbe486d0f93994d1003ac6dabbfc92d7b5295b6510"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::new(format!(\u0022__bp_{dataset_id}\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060blueprint_for\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/entry_name.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec023b101a326d9b4cd307609d4a4432b3b214d8f0599cec0a8c2234b8131a2b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::new(format!(\u0022__as_{dataset_id}\u0022))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060asset_for\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/entry_name.rs"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6fd91264f868d476c5c5060814130e9153c75c2c4d394af51b0dc4b3554657"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::str::from_utf8(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 \u0060split_whitespace_smart\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/path/entity_path_filter.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"407f5c02f2de71940f9613c5f5a4d73de1cc851f638d00edb4f26525bcdc923c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::str::from_utf8(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 \u0060tokenize_by\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/path/parse_path.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"2535a3f642eeb5cd00bc11d5c1abc8e0e770fbd20d664002ad1f17191c81d593"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::new(self.get().midpoint(rhs.get()))\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060midpoint\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_types/src/index/non_min_i64.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"24569be8d2237626fb7436b2dacc687bc4cec1bcca68f57d40c2e23e219bbc4e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060web_time::SystemTime::UNIX_EPOCH.elapsed()\u0060 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":"crates/store/dl_log_types/src/index/timestamp.rs"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9c5fe6d61938388a0d5821325b62597b24f20c8899fc47eeddd90f8523e770b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Self::from_nanosecond(value.nanos_since_epoch()as i128)\u0060 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":"crates/store/dl_log_types/src/index/timestamp.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd9203ca1d0f98b26c0e8d24dac4df755ce020c6dcaa9522526e456b5bbdae20"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060slice.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 \u0060from_dlr_bytes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/frames.rs"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"33ac45537f141cc44d7cbc82cf9b133af4c8ab9de32114fc18267740801c6bfa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060slice.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 \u0060from_dlr_bytes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/frames.rs"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b78a2bc5ff95bf6b2ffeec17f2c841053c5cb32a1f1f2e05aa6893424df88e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fixed_data[8..12].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 \u0060from_dlr_bytes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/frames.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d3c19c8cb6902cd2b424cbf96844547e335af346326f197d8998f66329ccff4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dynamic_data[pos..pos\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.expect()\u0060 in \u0060from_dlr_bytes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/frames.rs"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefc4458e56b6efbfb9a38b3669388afa5b4dd1129dbd1db284916d1dc5a5ec0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dynamic_data[pos\u002B8..pos\u002B16].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 \u0060from_dlr_bytes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/frames.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"5eddde423eb7c6168584d53043f89fa67e5d387ecc2eec989085be6309aeda97"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dynamic_data[pos\u002B16..pos\u002B20].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 \u0060from_dlr_bytes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/frames.rs"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc628df41f0a522ad6ab6b074b53126d7d33ddd3d74d45955a2059566e07db3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data[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.expect()\u0060 in \u0060from_dlr_bytes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/frames.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dff153ab473c4cf7cbb8d19b9a61e5dbc791e4c476e6d94dbb3cea07beb6ab4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060data[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.expect()\u0060 in \u0060from_dlr_bytes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/frames.rs"},"region":{"startLine":548}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a452aa0cd524d36aaf05d3eb91fe9f9c4f5ffbdc4396ae322dc046cadf1c098"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060web_sys::window()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060stream_dlr_from_event_listener\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/stream_from_http.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfc6fde1d4b3d281de7f3e95d1a835ca2a20bd7c44f977851c071f5daab7aa4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060window.add_event_listener_with_callback(\u0022message\u0022,closure.as_ref().unchecked_ref())\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060stream_dlr_from_event_listener\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/stream_from_http.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"530a22b486dfb160322dac6d926044ee3f56ebd0176406b10148c68b277438d3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060column_chunk_ids.to_arrow()\u0060 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_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":"crates/store/dl_log_encoding/src/dlr/footer/builders.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac98eeb00b75b5b690b41464dfc26116a210b33a30a72fedaaee0f8ac6dbd40"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dl_arrow_util::concat_arrays(\u0026arrays).map_err(|err|CodecError::FrameDecoding(format!(\u0022concat chunk_ids: {err}\u0022)))?.as_any().downcast_ref::\u003CFixedSizeBinaryArray\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 \u0060concat\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/dlr_manifest.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed85ce69663f8b799cc22810c42ad24516a74dfb7379ab9ba795fb20097e237"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dl_arrow_util::concat_arrays(\u0026arrays).map_err(|err|{CodecError::FrameDecoding(format!(\u0022concat chunk_entity_paths: {err}\u0022))})?.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.expect()\u0060 in \u0060concat\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/dlr_manifest.rs"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"5183deead3e88b3caa833f1b4d1e865ebcfa3d776dc245e5636bd873fb61b1ef"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dl_arrow_util::concat_arrays(\u0026arrays).map_err(|err|CodecError::FrameDecoding(format!(\u0022concat chunk_keys: {err}\u0022)))?.as_any().downcast_ref::\u003CBinaryArray\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 \u0060concat\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/footer/dlr_manifest.rs"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"adaf2739aa04506f0cfe254dd923b60d3ea08863e694c71d53c7530385cf17d2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ChunkId::try_slice_from_arrow(\u0026self.chunk_ids)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060col_chunk_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":"crates/store/dl_log_encoding/src/dlr/footer/dlr_manifest.rs"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"31c20a879e4d08fa051ebb2cb94745b9eb3fa62ff6859e75b3d33b5eb39b46a4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060RecordBatch::try_new_with_options(Arc::new(arrow::datatypes::Schema::new_with_metadata(fields,schema.metadata().clone(),)),columns,\u0026arrow::array::RecordBatchOptions::new().with_row_count(Some(num_rows)),)\u0060 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_null_chunk_key_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":"crates/store/dl_log_encoding/src/dlr/footer/dlr_manifest.rs"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b72384c18607374c45ff411f055762c851807290c0983975c648a87a66a9afa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dl_chunk::Chunk::builder(\u0022test_entity\u0022).with_archetype(dl_chunk::RowId::new(),dl_log_types::TimePoint::default().with(dl_log_types::Timeline::new_sequence(\u0022blueprint\u0022),dl_log_types::TimeInt::from_millis(dl_log_types::NonMinI64::MIN),),\u0026dl_sdk_types::blueprint::archetypes::Background::new(dl_sdk_types::blueprint::components::BackgroundKind::SolidColor,).with_color([255,0,0]),).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 \u0060fake_log_messages\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/decoder/iterator.rs"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0d7bb9ffcdfe3a3f8fe5fad65073801e409fbab713c1c1250570a7e2bd3c11"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dl_chunk::Chunk::builder(\u0022test_entity\u0022).with_archetype(dl_chunk::RowId::new(),dl_log_types::TimePoint::default().with(dl_log_types::Timeline::new_sequence(\u0022blueprint\u0022),dl_log_types::TimeInt::from_millis(dl_log_types::NonMinI64::MIN),),\u0026dl_sdk_types::blueprint::archetypes::Background::new(dl_sdk_types::blueprint::components::BackgroundKind::SolidColor,).with_color([255,0,0]),).build().unwrap().to_arrow_msg()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060fake_log_messages\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/decoder/iterator.rs"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"700f914b8658f24e8fea3802792f0deaaf830765e132dce830362bde3f7ed5bb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060msg.to_transport(Compression::Off)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060legacy_fake_log_messages\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/decoder/iterator.rs"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"bde39ee2eb27c4fb06e1a154132ed0e1cd3e1029ede97f209801e9ec99b4c0ea"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060store_id.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 \u0060legacy_fake_log_messages\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/decoder/iterator.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cba11fb921e9081062fae71735f3e487ac317f0f65f865888687a158fb4b66e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.byte_chunks.try_read(MessageHeader::ENCODED_SIZE_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 \u0060try_read_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":"crates/store/dl_log_encoding/src/dlr/decoder/state_machine.rs"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b5575a68588f93c48f130cc3e24c0a56925e90b9377af2e5bddc1b549a5d56"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060byte_chunk.read(remainder)\u0060 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_read\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/decoder/state_machine.rs"},"region":{"startLine":485}}}],"partialFingerprints":{"codehealthFindingId/v1":"2589894237945fef97ebfbb231107a2434ee483bcb7ba076ecdfc7bad3c6bda3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out.write(\u0026self.buffer[..self.buffer_fill])\u0060 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_peek\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/decoder/state_machine.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ddb938da3ae4cc33cc88c27fd64395604c64de9b1d2d9671cc968c2310b9cb5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060out.write(\u0026byte_chunk.get_ref()[pos..])\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060try_peek\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/decoder/state_machine.rs"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d008c00e725fcfd28c6008554dd519b0fbc9398c7d18f7737b34bdd5744c1f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dl_chunk::Chunk::builder(\u0022test_entity\u0022).with_archetype(dl_chunk::RowId::new(),dl_log_types::TimePoint::default().with(dl_log_types::Timeline::new_sequence(\u0022blueprint\u0022),dl_log_types::TimeInt::from_millis(dl_log_types::NonMinI64::MIN),),\u0026dl_sdk_types::blueprint::archetypes::Background::new(dl_sdk_types::blueprint::components::BackgroundKind::SolidColor,).with_color([255,0,0]),).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 \u0060fake_log_messages\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/decoder/stream.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b345f9751ee054c6ea37926fef5e22c8aff793136bafbb4abe5e04c3019f279"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dl_chunk::Chunk::builder(\u0022test_entity\u0022).with_archetype(dl_chunk::RowId::new(),dl_log_types::TimePoint::default().with(dl_log_types::Timeline::new_sequence(\u0022blueprint\u0022),dl_log_types::TimeInt::from_millis(dl_log_types::NonMinI64::MIN),),\u0026dl_sdk_types::blueprint::archetypes::Background::new(dl_sdk_types::blueprint::components::BackgroundKind::SolidColor,).with_color([255,0,0]),).build().unwrap().to_arrow_msg()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060fake_log_messages\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_log_encoding/src/dlr/decoder/stream.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"0acd125ba20b943045143c9d09d5c3bb87334234d71ec277bf1a9a7e070e2ba2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060registry.register(\u0022string_prefix\u0022,|prefix:String|{crate::op::string_prefix(prefix)})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060default_runtime\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_lenses/src/runtime.rs"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"718237ed370896c49d6cb68ddc916ba63751d2b7c1fb649247746f927059b5ff"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::thread::Builder::new().name(\u0022importer\u0022.to_owned()).spawn(f)\u0060 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\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/import_file.rs"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"09510d7e04a0c16ccc1ed7c70b49206359b1678ce513c3c15c3e85ca67a81d06"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dl_arrow_util::arrays_to_list_array(data_field_inner.data_type().clone(),\u0026data_arrays)\u0060 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_scalar_entity_chunk\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_importer/src/lerobot/common.rs"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a0726ab84706703ac0a40d9fbdfdeff44398f1da5fc5e963bdaf666d9d1c4a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dataset.path.relative_to(root)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060check_alignment\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_hdf5/src/plan.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"19a475fa4fbcdd96151da1730bf06bd834ef10972fccc2e27d870e5f1aa34ea2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.leaf()\u0060 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_timeline\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_hdf5/src/plan.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"958e2027f5a516b8cd8bfc391c923ae124c8f54d3bf9f6ad90afcd92d228c9fc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.relative_to(root)\u0060 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_units\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_hdf5/src/plan.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e57eee550ae9164f5369374685d974484fa7ec175da79511f6857c27345eaa9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.pending.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 \u0060emit_window\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_hdf5/src/streaming.rs"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4e4be18b56ffd4f922bb6b7c03b191148a43be2271cdee208f35719b82e520"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.timeline.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 \u0060emit_window\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_hdf5/src/streaming.rs"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8de6afaee40b764bae8000e8423b994056520f138e4dd1045e5b44c043eb298"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.path.leaf()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060name\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_hdf5/src/walk.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"6087ac6a8e99f6ad21c074f96070d7ebe153396b153142dd6a457770dcaa646b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060runtime.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 \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":"crates/store/dl_grpc_client/src/write.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"f13e333cfe2c16ac8a0e36970e103a015cbb3d7b86a3b7b6edea9f29c5520aaa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060thread::Builder::new().name(\u0022message_proxy_client\u0022.to_owned()).spawn(move||{let mut runtime=runtime::Builder::new_current_thread();runtime.enable_all();runtime.build().expect(\u0022Failed to build tokio runtime\u0022).block_on(message_proxy_client(uri.clone(),cmd_rx,shutdown_rx,options.compression,status,));})\u0060 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":"crates/store/dl_grpc_client/src/write.rs"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ec53bd8fc61860b62778fa389c8139b551063a5bb493310661a63fd9cb58733"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.root_chunks.get_mut(\u0026chunk_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 \u0060append\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_entity_db/src/dlr_manifest_index.rs"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b72ba9f07128f6201798ee9e0f5cbc2c24fc635cb664ad2b0445c704687799"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060is_not_null(url_col)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060split_batch_by_direct_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":"crates/store/dl_datafusion/src/chunk_fetcher.rs"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ee0ef3bc5ac4fd79a9ab648faa393d431e6fb570bfec214f34800bdee1b83a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060not(\u0026has_url)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060split_batch_by_direct_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":"crates/store/dl_datafusion/src/chunk_fetcher.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"324f462b0f2a2a6e56bc4ab2e55a9c3974f5a9117606ba8d08693c813cf2fa4f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060filter_record_batch(batch,\u0026has_url)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060split_batch_by_direct_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":"crates/store/dl_datafusion/src/chunk_fetcher.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d827d056552baa9a9a900c4a5e115396dd0e6c1cc395cd1a47ced21b315a07"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060filter_record_batch(batch,\u0026no_url)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060split_batch_by_direct_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":"crates/store/dl_datafusion/src/chunk_fetcher.rs"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f2c868ba8a062b1602dd154eff922f1e43980fc34c91a7ce3b6fa25baf2dcfb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dl_backoff::BackoffGenerator::new(Duration::from_millis(100),Duration::from_secs(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 \u0060fetch_batch_via_direct_urls\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/chunk_fetcher.rs"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"2348b7995c36256346386163515ba35c01fdfa9123f19b2e1bae4f404566289e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060last_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 \u0060fetch_batch_via_direct_urls\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/chunk_fetcher.rs"},"region":{"startLine":822}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bf4cee6ec9c83f4fd32dd8f1c3e63425d75e6ebe6dafcc16580d3f81d3420b"}},{"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 \u0060fetch_merged_range_bytes\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/chunk_fetcher.rs"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"00dfe590dbfebd6590135e793aed965ca13bf8db715d0b0b940d4abd882652df"}},{"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 \u0060scan\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_common.rs"},"region":{"startLine":584}}}],"partialFingerprints":{"codehealthFindingId/v1":"42517219a1ebf1aa130786e3a5595c09dce8f94608ceeb916cbc77dc603744d3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060LexOrdering::new(physical_ordering)\u0060 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_new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider.rs"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7d0f58d8e8fd19e77fd1852bf9569a4f6aa970ee384e8e18d8a2e7b9e4bf6a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060this.current_query.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_next\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30fb75596f5aad03aaded4bc0c16773b4b3a688d4b8c35448aa8733e7407374"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060LexOrdering::new(physical_ordering)\u0060 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_new\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider_wasm.rs"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc19bdccd7ae4f69425d55e6307f3ef7dbb33725b9d4f2f93fba48c44f0a7be"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.estimate_multiplier.fetch_update(AcqRel,Acquire,|bits|{let curr=f64::from_bits(bits);let next=ESTIMATE_EMA_ALPHA*observed\u002B(1.0-ESTIMATE_EMA_ALPHA)*curr;let next=next.clamp(MIN_ESTIMATE_MULTIPLIER,MAX_ESTIMATE_MULTIPLIER);Some(next.to_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 \u0060record_actual_sample\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/pipeline_budget.rs"},"region":{"startLine":1228}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b43d69f0351063ec274de752644287a1b5220f3c834adbfa4697884de293532"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.current.fetch_update(AcqRel,Acquire,|current|{Some(current.saturating_sub(reserved-actual))})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060adjust_reservation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/pipeline_budget.rs"},"region":{"startLine":1650}}}],"partialFingerprints":{"codehealthFindingId/v1":"d860919071b01b53bb711e4bc28e2b269b546a1094d1625e980a906336492ccd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.current.fetch_update(AcqRel,Acquire,|current|{Some(current.saturating_sub(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 \u0060release\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/pipeline_budget.rs"},"region":{"startLine":1676}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2b9022977ab920dcbb753ecea3348c7d78f96b80c275c8ccda1ff8ea5800b1"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.current.fetch_update(AcqRel,Acquire,|current|{Some(current.saturating_sub(reserved))})\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060refund_reservation\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/pipeline_budget.rs"},"region":{"startLine":1798}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4881f44d624d481952fc15a2a1243215516b76d9486de71ddca954ebca5f862"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060current_stores.remove(\u0026segment_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 \u0060chunk_store_cpu_worker_thread\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs"},"region":{"startLine":860}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a05ab3e93c1defa9ce6f5fa0b3b778b0444d14fd12085ac4cd9114a59836ed"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060current_stores.remove(\u0026segment_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 \u0060chunk_store_cpu_worker_thread\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"39d16d0bf04fc726b18d64d48b7ec1722014b595aef18d70a8263b23f59c9b7c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060emit_order.pop_front()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060maybe_emit_head\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider/cpu_worker.rs"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d722c1c33b3fb86aa189fa71390334f6caf1266924bf3a27a674be7714c59b7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rb.column_by_name(\u0026start_col_name)\u0060 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_segment_manifests\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/dataframe_query_provider/io_loop.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"e23b1546a9435557d5dacae4c3b3eed64c9efb67087f6cb35ff10049e5e4fbb3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060reqwest::Client::builder().connect_timeout(DIRECT_FETCH_CONNECT_TIMEOUT).read_timeout(DIRECT_FETCH_READ_TIMEOUT).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 \u0060chunk_stream_io_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":"crates/store/dl_datafusion/src/dataframe_query_provider/io_loop.rs"},"region":{"startLine":1087}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fca3d491a14ded3e908ca923b54e5201e4387a00ec3688b1b6a30ce2cddc472"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.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 \u0060init_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":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5f41f742764fba3fb19cfba1322ad24a46b04978c8e8c51d1936abab8e637e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chunk.add_component(SerializedComponentColumn::new(dl_arrow_util::new_list_array_of_empties(\u0026child_datatype,chunk.num_rows(),),dl_types_core::ComponentDescriptor{component_type:descr.component_type,archetype:descr.archetype,component:descr.component,},))\u0060 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":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"893ec14ad9e6adb54499877c14c6c60a799391c7e69a9f00a5edca7688f1283c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.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 \u0060next_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":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":1249}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f8132169ceabb9e82d07c4c23340871a7b2d4f8421229d7f1d99cb7a3d27318"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060state.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 \u0060next_n_rows\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":1729}}}],"partialFingerprints":{"codehealthFindingId/v1":"d17b1569ce2b003f2b3146d7c11e9f44a88d5af6fa50ba549168807f14e5fb13"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.state.get()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060next_row_batch_async\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_dataframe/src/query.rs"},"region":{"startLine":2490}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c5b60b54ebdb34d02207de32ca9d6ae516c351a67b02af8ff83d918c2d7fb80"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sorted.timelines().get(timeline)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060drop_time_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":"crates/store/dl_chunk_store/src/drop_time_range.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"1684dd248c72e4d7b44b862b632c6850fbb0a6299b7bcac4e892c97bda50f96e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.insert_chunk(\u0026chunk.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 \u0060drop_time_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":"crates/store/dl_chunk_store/src/drop_time_range.rs"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ae7a4ab31951b249fd86fb23cefb87550b641db517f5ec76fcb26fb34267de"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.inner.rx_chunks.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 \u0060chunks\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/batcher.rs"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eca9a2d501d8e1726b14046d2cf256c0392d0f5f04a37d178c77f93af3dc33c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chunk.sanity_check()\u0060 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_auto_row_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":"crates/store/dl_chunk/src/chunk.rs"},"region":{"startLine":1055}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab59a90c71a8f72f6c617bfdf1bd86d65ad45af5b1970a230d40c2286b0d66d4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060row_ids.first().copied()\u0060 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_id_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":"crates/store/dl_chunk/src/chunk.rs"},"region":{"startLine":1505}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf6040b5fadbc1b83cc11b21eab6d96e7d7b76cfb2f06db89130cf80d4e912b8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060row_ids.last().copied()\u0060 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_id_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":"crates/store/dl_chunk/src/chunk.rs"},"region":{"startLine":1506}}}],"partialFingerprints":{"codehealthFindingId/v1":"c24245628cbca0f696386fcb0daf3c51ee4a875923399ba33958eaba5b1988ce"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060row_ids.iter().min().copied()\u0060 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_id_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":"crates/store/dl_chunk/src/chunk.rs"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"843b160180d9ed0cf17e73cedfa6a468f65b8e52323aba4f46cd2302f2453283"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060row_ids.iter().max().copied()\u0060 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_id_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":"crates/store/dl_chunk/src/chunk.rs"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2f8a4dc1983a839b8bbcef4d96af059e90e810eb80d01bd32983aacb56c106b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060row_ids.downcast_array_ref::\u003CFixedSizeBinaryArray\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 \u0060concatenated_unsorted\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/merge.rs"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1541e72997744a142244d4d736b045287bd01be0cf4ce47bef5e6400d2c82476"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.sanity_check()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sort_by_row_ids_if_needed\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/shuffle.rs"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b560a04b722a35c5ecef1a942ef44341a81e1edfefd94ae81ed84212586cb2be"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chunk.sanity_check()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060sorted_by_timeline_if_unsorted\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/shuffle.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4f8cde2a26c3979f29d75753eca3f11296a4f4081e7579dcb14ad58418761b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dl_arrow_util::concat_arrays(\u0026sorted_arrays)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060shuffle_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":"crates/store/dl_chunk/src/shuffle.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ff461b361ad5632bca468cd6860f484fb3f30b3d4305e7b35d1814cb296684"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.row_sliced_shallow(index,1).into_unit_with_original_chunk_id(original_chunk_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 \u0060row_sliced_unit_shallow\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/slice.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ab587ac3cb41f9aef20c277d40a5af28d98e7e5d6af56547404472eff6b8247"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chunk.sanity_check()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060timeline_sliced\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/slice.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"d32c6451d2407b8c3566eb8a10807a20de67017b313b3bfd81c372cd51ecaeeb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chunk.sanity_check()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060components_sliced\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/slice.rs"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2896cf02be2fee21ae807370863860013fa2fa789262dfaf1a34197afee130"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chunk.sanity_check()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060components_dropped\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/slice.rs"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa0dc3818310c9190849e8de12a243d6eab8fb45d703622d5ec5bbbe21444fb3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chunk.sanity_check()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060timelines_sliced\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/slice.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3502b8dbbb15f284e127db22fc166543d6020a355fd18560c1c0b24c3a4261f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chunk.sanity_check()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060densified\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/slice.rs"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"30b33796d8c6b29fe6cbe92ac349e4927ed724645bbe882ee4a8163427658db3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chunk.sanity_check()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060deduped_latest_on_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":"crates/store/dl_chunk/src/slice.rs"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"0770fc4ae907ca64112e05d15799b30f2ded2b66f6f6ef5653da875cdedb6cdc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chunk.sanity_check()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060filtered\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/slice.rs"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"725c131598a2b19e9f00f58c53b074f54e1980ba9a04a71f6c595eba08dd9364"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060chunk.sanity_check()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060taken\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_chunk/src/slice.rs"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c8656dc6fec5860f419399f2eaf3cfaad498887828e049317e00ee6d81be142"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Shell::new()\u0060 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":"crates/build/dl_types_builder/build.rs"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"767ecbdd4956a40e931d05cafd141fe6678927870bc3ed6e625a5600a4ea87ad"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060[expect(clippy::unwrap_used)]cmd!(sh,\u0022flatc -o src/ --rust --gen-onefile --filename-suffix \u0027\u0027 {FBS_REFLECTION_DEFINITION_PATH}\u0022).run().map_err(|err|eprintln!(\u0022flatc failed with error: {err}\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":"crates/build/dl_types_builder/build.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"52616363430ea85712b3190fb27e94be21b33e27082b723a6671e4bb1bb151ab"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060line.split_whitespace().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 \u0060parse_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":"crates/build/dl_types_builder/src/docs.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac605cf7fa070c952f520624d181d1d7c27c13d3041cba47d11ea2b6ee00fb30"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060content.chars().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 \u0060find_and_recommend_doclinks\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/docs.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"88e8a9bae50206ceea1f77dc931c81786ab5c0582ee7ff920fd4632eb055e39b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Shell::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 \u0060compile_binary_schemas\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/lib.rs"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5bab036bcd9500a632e21617289cb62e849c00e3d5c1bdcbbf3e391ece1d94f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cmd!(sh,\u0022flatc -I {include_dir_path}\n            -o {output_dir_path}\n            -b --bfbs-comments --schema\n            {entrypoint_path}\u0022).run()\u0060 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_binary_schemas\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/lib.rs"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"675c08a621c2635d3cdb3b9b7ac97bc59ec958139a41921590562bd76edb44ae"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Shell::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 \u0060generate_lang_agnostic\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/lib.rs"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"101dd7fd077011eead821677587ba9ab25cebb380656655f15a7bd6da783c343"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sh.create_temp_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 \u0060generate_lang_agnostic\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/lib.rs"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"67379584531ea425984aaa7db477d9767b532f4256ff76e58eddb7ba11eb81c8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Utf8PathBuf::try_from(tmp.path().to_path_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 \u0060generate_lang_agnostic\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/lib.rs"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"16b713f1487d7835929c96dc6f857846a6d67ef065bad248da7ca9cddf500286"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060entrypoint_path.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 \u0060generate_lang_agnostic\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/lib.rs"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"84ea5ef3c6c0542de3806748249a55258d98d8c59ea8214f06865b69eeb4fdeb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060include_dir_path.canonicalize_utf8().with_context(||format!(\u0022failed to canonicalize include path: {include_dir_path:?}\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 \u0060generate_lang_agnostic\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/lib.rs"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"87eeec59a629592148dbf1f9aaa64239b456706b3dba686bf8d8a4607a375435"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060sh.read_binary_file(tmp_path.join(binary_entrypoint_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 \u0060generate_lang_agnostic\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/lib.rs"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd1619de6a68be09b4d81c095caff0a53b3ffa1f3a1a026dcbee7c78b121e129"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060filepath.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 \u0060generate_gitattributes_for_generated_files\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/lib.rs"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed45b98de5d400d83fb055adf24978340bd29613fab723c7d03e639851b041d8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060filepath.strip_prefix(\u0026dirpath).with_context(||{format!(\u0022Failed to make {filepath} relative to {dirpath}.\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 \u0060generate_gitattributes_for_generated_files\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/lib.rs"},"region":{"startLine":329}}}],"partialFingerprints":{"codehealthFindingId/v1":"837e18506cbf8139680948d18eb66a2de0560a29db7b333f12ba6760ab4eb5fc"}},{"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 \u0060compute_re_types_hash\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/lib.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bfe27a1f2373ed3c799fb8a6d5319e4cb556ed3278d5b31e841aa212160174b"}},{"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 \u0060compute_re_types_hash\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/lib.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4efd41637b850a8fe3d6ebfd8ee266594e8dcf97e8081757e26b3cefe9110c"}},{"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 \u0060compute_re_types_hash\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/lib.rs"},"region":{"startLine":378}}}],"partialFingerprints":{"codehealthFindingId/v1":"565fd1925ad8d9304ef0d088a2b60046fc3603d9b2664d82202b3fb1608561a9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::read_to_string(filepath)\u0060 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_code\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/lib.rs"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f80d51a8498aa266ef5f2a51a30eab706cd66b03c3835222022ba5b3f8bb8cd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060camino::Utf8PathBuf::from(manifest_dir).canonicalize_utf8()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060dalaran_workspace_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/lib.rs"},"region":{"startLine":672}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e30a37125ae737c3d3df7ae0b769088a5afaf052ca691c69fc078f8b18144f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060manifest_dir.parent().and_then(|p|p.parent()).and_then(|p|p.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 \u0060dalaran_workspace_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/lib.rs"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d6541aeeda2ecb6811dc0a7b5270c2473674a857fc0a448be0d2b0d69b4d34b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060camino::Utf8PathBuf::from(file!()).canonicalize_utf8()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060dalaran_workspace_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/lib.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ad1c88d777fb418b4201c05f46dcaa1eeb5fc1380196cf062b8559875238807"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060file_path.parent().and_then(|p|p.parent()).and_then(|p|p.parent()).and_then(|p|p.parent()).and_then(|p|p.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 \u0060dalaran_workspace_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/lib.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd4214c25ec1a8bd379713fd8ce3cdfdebf34bd0bb05166d3be4ecabfe2038dc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060workspace_root.canonicalize_utf8()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060dalaran_workspace_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/lib.rs"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc08979431486dc909af9335e79f30eb26d758fdd293943e59ff6d935da595e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.try_get(fqname).with_context(||format!(\u0022{fqname:?} not found in Arrow registry\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 \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":"crates/build/dl_types_builder/src/type_registry.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"b890fe7d8e103632408cd42f8d148f5bc8beebdd9303ae59d906f79230f4f27c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060root_as_schema(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 \u0060from_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":"crates/build/dl_types_builder/src/objects/from_fbs.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d64810a8280374b5d2b215fef07e2c3c30cb4cc4969821c95f3e62b5063375"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060obj.declaration_file().map(ToOwned::to_owned).with_context(||format!(\u0022no declaration_file found for {fqname}\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 \u0060object_from_raw_object\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/objects/from_fbs.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"34566409dd4173b1b357d071a62fc0a1e092902aeca222fba8e57097d41f2a10"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060enm.declaration_file().map(ToOwned::to_owned).with_context(||format!(\u0022no declaration_file found for {fqname}\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 \u0060object_from_raw_enum\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/objects/from_fbs.rs"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fd33fe07f44b34ee8159d97f6bd49d57e3dcfec06762661bac9663be5b72d3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060obj.declaration_file().map(ToOwned::to_owned).with_context(||format!(\u0022no declaration_file found for {fqname}\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 \u0060object_field_from_raw_object_field\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/objects/from_fbs.rs"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d26d5edc7d2cdb5e1f76ad9e56c9b295770a10ea93cf0dab4322b62b753daf6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060enm.declaration_file().map(ToOwned::to_owned).with_context(||format!(\u0022no declaration_file found for {fqname}\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 \u0060object_field_from_raw_enum_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":"crates/build/dl_types_builder/src/objects/from_fbs.rs"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec9ee87d80501588ed004fadf52560fcac479b982caed7134d3cc710a934ae0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060val.union_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 \u0060object_field_from_raw_enum_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":"crates/build/dl_types_builder/src/objects/from_fbs.rs"},"region":{"startLine":430}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bf915d32fde52c7f1f384a1dd3a47d45012dc6cc48f8cadfdf5c4c7cb9756c6"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060target_obj.fields.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 \u0060resolve_and_validate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/objects/mod.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"e824ce35471b12cb72eb82c8a40f93c0079daff2a68fce06df2f3e674a34311a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060parts.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 \u0060archetype_view_types\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/objects/mod.rs"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f95b90d93bc2bb075d9c1604307d41ffb462e72587f1bddbad92e8a9c3f6eee"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.0.get(name).cloned().flatten().with_context(||format!(\u0022no \u0060{name}\u0060 attribute was specified for \u0060{owner_fqname}\u0060\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 \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":"crates/build/dl_types_builder/src/objects/mod.rs"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0bafa693cb91938f5eba776d0512be528ca2c8e1914ab8d3cf336980784ea2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060value_str.parse().with_context(||{let type_of_t=std::any::type_name::\u003CT\u003E();format!(\u0022invalid \u0060{name}\u0060 attribute for \u0060{owner_fqname}\u0060: \\\n                    expected {type_of_t}, got \u0060{value_str}\u0060 instead\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 \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":"crates/build/dl_types_builder/src/objects/mod.rs"},"region":{"startLine":1220}}}],"partialFingerprints":{"codehealthFindingId/v1":"04acc962130c8770bb35785efdbaae68c378b5fc8a59349c014368344206574e"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060value_str.parse().with_context(||{let type_of_t=std::any::type_name::\u003CT\u003E();format!(\u0022invalid \u0060{name}\u0060 attribute for \u0060{owner_fqname}\u0060: \\\n                        expected {type_of_t}, got \u0060{value_str}\u0060 instead\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 \u0060try_get\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/objects/mod.rs"},"region":{"startLine":1251}}}],"partialFingerprints":{"codehealthFindingId/v1":"426d0fa576b06813a354251738c1479873fc79e1967b40ecc847657f331a990d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060tempfile::tempdir()\u0060 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\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/format/python.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50063ddd6f7313e76d965496e81b4b79a55a4a1f4c79a7fedeb7c52daab17db"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Utf8PathBuf::try_from(tempdir.path().to_owned())\u0060 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\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/format/python.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf20f3d0aae051f3e3eaa027a1ae4c50af1a986f42d18e6be419fbd1ed249fd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::read_to_string(formatted_source_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 \u0060format\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/format/python.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1e87f96cb027e8168651d049f21b666945074037f4db3ed5745955b9300976d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060filepath.strip_prefix(testing_pkg_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 \u0060format_path_for_tmp_dir\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/format/python.rs"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1a2a314ea7509fdf31dd2ba3a29e1ef30a25d857b5cfe70a36a09aee08dbca"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060entry.file_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 \u0060remove_orphaned_files\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/common.rs"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6433cf3b4d68ea854348c61e217dc8a09bad28fed8a3ac805423c2d4263b5ad"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Utf8PathBuf::try_from(entry.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 \u0060remove_orphaned_files\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/common.rs"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"7302bad49e7c30f85976ef0eef6cbdcd555f819a9b67095745ae605daf76e084"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060filepath.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 \u0060write_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":"crates/build/dl_types_builder/src/codegen/common.rs"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"a25ed040d51d74322424c4161bdfe0caf1ac2230770a8b6b73dfe5aca2adcc38"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060obj.enum_integer_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 \u0060quote_enum\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/api.rs"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"0024436ac65d54c7759e4abfbaf31b8b3d369dc570db2dcef1b927cedecdb7a0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060proc_macro2::Literal::from_str(\u0026obj.enum_integer_type().expect(\u0022enums must have an integer type\u0022).format_value(enum_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 \u0060quote_enum\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/api.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0fb91359fe8d14fe3ae98c2125220a885e551778013cebbd74bad0a0ca116b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060obj.enum_integer_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 \u0060quote_enum\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/api.rs"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81325ba52068e55bb155f57b34d4a612e03bc741b96d8231cb34e7712a8de89"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060field.enum_or_union_variant_value\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060quote_enum\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/api.rs"},"region":{"startLine":546}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42e7bcfd97dc3ed99d6ce7711f1c63001347fc4dda6aed8a6e8dda8cfad1276"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060obj.enum_integer_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 \u0060quote_enum\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/api.rs"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4663d5356855b5563ce142e8d27f9fdbd3d39f3b68c8d9564dcbbfc82981a8a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060proc_macro2::Literal::from_str(\u0026obj.enum_integer_type().expect(\u0022enums must have an integer type\u0022).format_value(enum_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 \u0060quote_enum\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/api.rs"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"35589397c3abe838d7f28d38c3fd516bc88dfa81f04ed377d002e99a203227eb"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060syn::parse_str::\u003Csyn::Meta\u003E(contents.as_str()).with_context(||format!(\u0022illegal meta clause: {clause:?}\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 \u0060quote_meta_clause_from_obj\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/api.rs"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8dafafb91d9b9790ebe4ca156643375406f6086e54ad2e17cb4531d572a405b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060syn::parse_str::\u003Csyn::Meta\u003E(\u0026format!(\u0022{clause}({contents})\u0022)).with_context(||format!(\u0022illegal meta clause: {clause}({contents})\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 \u0060quote_meta_clause_from_obj\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/api.rs"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"42dfa0f11c887628511b3a12ae164739c92029e54d4970ed024ec9c12282d86f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060UnionFields::try_new(vec![#(#types,)*],vec![#(#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 \u0060to_tokens\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/arrow.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8b38221ff4b59d2cd3a2bef7ddf43adef20998289bba7287ad1c0eff76079f0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060syn::parse_str(\u0026fqname)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060quote_fqname_as_type_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/arrow.rs"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77c83f167cb2cc5b03f6bf5be67d6290042e6e99ee8db06cb078d32a51d5a07"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060array_init::from_iter(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 \u0060quote_arrow_field_deserializer\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/deserializer.rs"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"686c97ffad277c1b53d5be72d96affd1d492708ae647dea000636ece38edda6f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner_obj.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 \u0060quote_iterator_transparency\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/deserializer.rs"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"366d509b3bbc56a31c80bc5a267abf52fff9925036e5324b5cb482dfff64882a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060i32::try_from(*length)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060quote_arrow_field_deserializer_buffer_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":"crates/build/dl_types_builder/src/codegen/rust/deserializer.rs"},"region":{"startLine":1162}}}],"partialFingerprints":{"codehealthFindingId/v1":"10081c0ed629183a2692b01e75d6d1a40d9ac6cc2516b246b8f22111898f2711"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060flag_tokens.into_iter().reduce(|a,b|quote!{#a|#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 \u0060generate_archetype_reflection\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/reflection.rs"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"5df729a2bc8c5da045a025ebf5a075bcc1119685455415e32633e3e06456b694"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner_obj.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 \u0060quote_arrow_field_serializer\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/serializer.rs"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19a7b3ef811903003dc4c67d6ff63e8be9fb811266f080929fefa95cc097dbc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner_obj.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 \u0060quote_arrow_field_serializer\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/serializer.rs"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb16bbd0a4f43eea5b8f9a082314d9e7c2d3599ccaddcd764ad8ae5698f1e53a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060offsets.last().copied()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060quote_arrow_field_serializer\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/serializer.rs"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"58f4521309d177dca99665b7efab05527114f7adf675f218feaecb2fd9bac4f5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060offsets.last().copied()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060quote_arrow_field_serializer\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/serializer.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5579933a6e80911dc941a633ae5926d28757c492a29c13eda77b1d4f336b912"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060inner_obj.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 \u0060quote_arrow_field_serializer\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/rust/serializer.rs"},"region":{"startLine":711}}}],"partialFingerprints":{"codehealthFindingId/v1":"5522ba79959f978400dd76f9b49d8138aa4669d4e77476362f971b8340cf87bc"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ext_filepath.file_stem()\u0060 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":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"882b70150fe873bc9c1832276423a8f87bb3bff641175a478deac7785dbf4fed"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::read_to_string(\u0026ext_filepath).with_context(||format!(\u0022couldn\u0027t load overrides module at {ext_filepath:?}\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":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"22f7539e8b5b5ae8d1362de9f96786bd6ca3c58f3501ed8248d976e1f9f57ba7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Regex::new(\u0026field_pattern)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060check_ext_consistency\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecf45d877144d4d24b65f8e83a0c73bb3f7f48840785a4cf3c04bd37e59464c4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060ext_classes.get(\u0026obj.fqname)\u0060 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_folder\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":503}}}],"partialFingerprints":{"codehealthFindingId/v1":"8330bc8f5c763d06b26c6283007da6084a0275b15d2fead52613d2ef27b3ef21"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060filepath.file_stem()\u0060 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_folder\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6c85a26bef6de08a4c32dd48ee0e568b0e9e95047faf9a0102bb8862fb8876"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060obj.delegate_datatype(objects)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060code_for_struct\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"6849d75cdaefd7ea7101f4ff5ac5c7b614bc0bbc06677df453b2d39bef176979"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060obj.delegate_datatype(objects)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060code_for_struct\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":845}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a665d1bbc31e1d3f5c1e22fe837ba68e0bb33a2afb1853f271a33a71fd127a9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060obj.delegate_datatype(objects)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060code_for_struct\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":933}}}],"partialFingerprints":{"codehealthFindingId/v1":"60063d0dae8e28dc5899c237893cc7b629c2c3f295b2d96a4ad619104a28478d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060obj.enum_integer_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 \u0060code_for_enum\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d16174a83430761014b8870c44373493fb2fa12b08a1a4e80eaa78d3c94b6e2"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060variant.enum_or_union_variant_value\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.expect()\u0060 in \u0060code_for_enum\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"1437dbff4d46ae751aabb96195ec7f42b725334386d518d3b52795dd4a146c7b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060field_types.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 \u0060code_for_union\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":1341}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2eb0f08fada7bbbc92069720f05bfc3f74ea67dfca719f5fc37d0c77eb4e866"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060collect_snippets_for_api_docs(\u0026field.docs,\u0022py\u0022,true)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060quote_doc_from_fields\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"c74d78572f047aaa1016102a67a49b2857c79e29636e3360cde0bb63ea420471"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060np_dtype_from_type(\u0026field.typ)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060quote_arrow_serialization\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/python/mod.rs"},"region":{"startLine":2605}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a50b79dd90affcc623ddcd3f311f44ef6f64c01ac014bec95e7ed70625f6bf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060dir_path.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 \u0060generate_include_file_for_dir\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/fbs/mod.rs"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e53b8be2f7e369027202077e5c24ddae55baf0c1fc2b2e05d2273c9f976fe5c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060entry_path.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 \u0060generate_include_file_for_dir\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/fbs/mod.rs"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27d3c252c6726eeb6068480fffe3c56f85f8358cbaeb37e7c23e434e408b8cd"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060entry_name.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 \u0060generate_include_file_for_dir\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/fbs/mod.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2dc8f51531d28068c4d4978fdf6057cd8076bbbcf42c3ffc15929217fb79d4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_stem()\u0060 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_snippets_recursively\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/docs/snippets_ref.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3eb45226ef6b876fa90c5c25fb2fac4717b3cd2c6621be6d7244675d4ebe04"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path.file_stem().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 \u0060collect_snippets_recursively\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/docs/snippets_ref.rs"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"503a6ef60b34b1b89b9a5aa97d8664c864733928a9a97375939ba8874b20e8fe"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060name_qualified.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 \u0060collect_snippets_recursively\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/docs/snippets_ref.rs"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"b024e00716c22a23a0d57cfe6fe10f340673a7a9160793ff798c558aa35780ed"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Utf8Path::from_path(\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 \u0060collect_snippets_recursively\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/docs/snippets_ref.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f954c049d370ea113d90cd76aa430a034b4b60291c4cbb95947e3da67c6cfa"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060objects.get(fqname)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060type_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":"crates/build/dl_types_builder/src/codegen/docs/website.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"816f74f350468d0467b8036e1ac4d68c2dd88719ad59218e85c552e5efc45329"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060field.kind()\u0060 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_archetype_fields\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/docs/website.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a481e09ebb04a7a12914cabee1eefffb7aa187a1bfc73c6594ceb0a6d46915"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060generated_code[comment_start..].find(\u0027\\n\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 \u0060string_from_token_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":"crates/build/dl_types_builder/src/codegen/cpp/mod.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2b33be0017bd235d565697c403d03f6fb002de9f17a8435b91eacc9c67d7ed"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060folder_path.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 \u0060generate_folder\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/cpp/mod.rs"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"de1134bb8f20edcfda3ffd7917967b92f87255a6fa997018b1819d2171e8d71a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060extension_file.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 \u0060hpp_type_extensions\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/cpp/mod.rs"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"a75b3f4bfb5867789304fdcb041ce078a0bf3809d4871790a9bb0b7c06513ef9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060extension_file.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 \u0060hpp_type_extensions\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/cpp/mod.rs"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"51c8076002e71fe12be443efc708d1d58c850ae89ef4f6df4d2fce4267e68d0d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060datatype_fqname.split(\u0027.\u0027).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_struct\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/cpp/mod.rs"},"region":{"startLine":915}}}],"partialFingerprints":{"codehealthFindingId/v1":"711fd9fceb971efce25807b1b685a57eb9bd3ffc4913201dfba4b11448c8a065"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060obj.enum_integer_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 \u0060from_enum\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/cpp/mod.rs"},"region":{"startLine":1465}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c156aca34eccc93fc87b1cf2895a42b0ec1c47c787fa064906f41450ab5a64d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060obj_field.enum_or_union_variant_value\u0060 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_enum\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/cpp/mod.rs"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"a28a88b8a35c79906b4b302efbde1a84d098e9a01108b7536c008c64f78d493d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060proc_macro2::Literal::from_str(\u0026obj.enum_integer_type().expect(\u0022enums must have an integer type\u0022).format_value(obj_field.enum_or_union_variant_value.expect(\u0022enums fields must have values\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 \u0060from_enum\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/cpp/mod.rs"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e292926cb2d07697b700102c50dccbb54c3cf6d8469c053b1a6ca582e1dcb55"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060obj.enum_integer_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 \u0060from_enum\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/cpp/mod.rs"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04d769ab5e1626ac8d413be4f3eaad759d772ee907319522b45b912353a86a9"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060syn::parse_str(\u0026fqname)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060quote_fqname_as_type_path\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_types_builder/src/codegen/cpp/mod.rs"},"region":{"startLine":2685}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8e4731d5223c306418615089051e1ca6769df686830474f532c022e5a4a54f"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060rayon::ThreadPoolBuilder::new().thread_name(|i|format!(\u0022rayon-{i}\u0022)).build_global()\u0060 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":"crates/build/dl_types_builder/src/bin/build_re_types.rs"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd394aa6fb2d6d60563c169d144ac52675b00d1893de308ca445fd390005c306"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Utf8Path::new(env!(\u0022CARGO_MANIFEST_DIR\u0022)).parent().and_then(|p|p.parent()).and_then(|p|p.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 \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":"crates/build/dl_types_builder/src/bin/build_re_types.rs"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97994c48579e48885ae0775c361879d006731bb2919cfd7175a333f7826eead"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Utf8Path::new(env!(\u0022CARGO_MANIFEST_DIR\u0022)).parent().and_then(|p|p.parent()).and_then(|p|p.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 \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":"crates/build/dl_protos_builder/src/bin/build_re_remote_store_types.rs"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"138f302ea0532dc015d8ac2f6e63d0476ff6a374cbab5574a404aba6295a695d"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::read_dir(definitions_dir_path.join(INPUT_V1ALPHA1_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":"crates/build/dl_protos_builder/src/bin/build_re_remote_store_types.rs"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"091765606d21657830f82495f466d974393bf6dc7ba7896b54ea45b638f75577"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060v\u0060 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":"crates/build/dl_protos_builder/src/bin/build_re_remote_store_types.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab0431d583134d48d2d96f7d93f193558cce300d2546a57653bbe06b69eddb7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Utf8Path::from_path(\u0026v.unwrap().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 \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":"crates/build/dl_protos_builder/src/bin/build_re_remote_store_types.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ad77141a948d1f928e87eab93b6317229a78252c4dc7e993978456adfc45b7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060Utf8Path::from_path(\u0026v.unwrap().path()).unwrap().strip_prefix(\u0026definitions_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 \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":"crates/build/dl_protos_builder/src/bin/build_re_remote_store_types.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbec954c347b05c1ca19447f70e02a529fd0fea42aef49ec598f9dbd5b503cb7"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cargo_metadata::MetadataCommand::new().manifest_path(concat!(env!(\u0022CARGO_MANIFEST_DIR\u0022),\u0022/Cargo.toml\u0022)).features(cargo_metadata::CargoOpt::NoDefaultFeatures).no_deps().exec()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060workspace_root\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_dev_tools/src/build_web_viewer/lib.rs"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"1962838206e1aa3b4357a53ba9c8cbf5427aeb6a5c7debd8364db5295ca23fb0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060cargo_metadata::MetadataCommand::new().manifest_path(concat!(env!(\u0022CARGO_MANIFEST_DIR\u0022),\u0022/Cargo.toml\u0022)).features(cargo_metadata::CargoOpt::NoDefaultFeatures).exec()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060target_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":"crates/build/dl_dev_tools/src/build_web_viewer/lib.rs"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"f54dd55c5df435eb78e9ad6761d985c3713276c170484aff18185c70de5e88ed"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060bar.style().template(\u0022{spinner} {prefix}: {msg}\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 \u0060progress_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":"crates/build/dl_dev_tools/src/build_search_index/ingest.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0be01a2a9256485d8112f3e6e51907e12ff2b77c0a2c8ce8c6bcce978a3b61"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.metadata.packages.iter().find(|pkg|pkg.name.as_str()==\u0022dalaran\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 \u0060dalaran_pkg\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_dev_tools/src/build_search_index/ingest.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"129c27ea070155ea2d3b12f156c9c1e6899ecaca3683efc0df6391324e4da059"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060self.error.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 \u0060check_status\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_dev_tools/src/build_search_index/meili.rs"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"383384994e00afe8f213ffb51780a44f7b91c9c2212be301c9e56a044798abe0"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060get_first_by_tag_name(\u0026root,\u0022compoundname\u0022)?.text()\u0060 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_innerclass_document\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_dev_tools/src/build_search_index/ingest/cpp.rs"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e497143a261d4e2969cfb5faace05392bd6e91381bb28f1b3daef10ac505f9c"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060get_first_by_tag_name(\u0026node,\u0022qualifiedname\u0022).or_else(|_|get_first_by_tag_name(\u0026node,\u0022name\u0022))?.text()\u0060 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_memberdef\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_dev_tools/src/build_search_index/ingest/cpp.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22cc0736850843d3cdc0ec1ab1deef5243655b5335cce9291d2ffcce99230e4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060n.text()\u0060 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_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":"crates/build/dl_dev_tools/src/build_search_index/ingest/cpp.rs"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53d80fbb876996f589ee237ea9d249704e4858e38856937293cf589bfcc1d62"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060write!(\u0026mut s,\u0022{b:02x}\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 \u0060encode_hex\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_build_tools/src/hashing.rs"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"70fd97fdc7e4160316fbac31ea6c28f0bb54ee0058de9c82ac2b2886c23ff05b"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::File::open(path).with_context(||format!(\u0022couldn\u0027t open {path:?}\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 \u0060compute_file_hash\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_build_tools/src/hashing.rs"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e68d8b79e010c9d11904bd5486bd7b13e4967c309fe83df5e003d188f1619d5"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060io::copy(\u0026mut file,\u0026mut hasher).with_context(||format!(\u0022couldn\u0027t copy from {path:?}\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 \u0060compute_file_hash\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_build_tools/src/hashing.rs"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"428843d38e9455085124f92c548507a721f25ba8c4b6fe9c1673f12ae0f9d3b4"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::File::open(\u0026filepath).with_context(||format!(\u0022couldn\u0027t open {filepath:?}\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 \u0060compute_dir_hash\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_build_tools/src/hashing.rs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9cdcf1668ac112829daf748990364415bc8b9eb996e1c04ee3efaa7074b0249"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060io::copy(\u0026mut file,\u0026mut hasher).with_context(||format!(\u0022couldn\u0027t copy from {filepath:?}\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 \u0060compute_dir_hash\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_build_tools/src/hashing.rs"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b6ab22bcb21c5bc7403384edc12e9fc669ca647b99a4d9e30c29f16bac531a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060fs::File::open(\u0026filepath).with_context(||format!(\u0022couldn\u0027t open {filepath:?}\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 \u0060compute_dir_filtered_hash\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_build_tools/src/hashing.rs"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3970f2ca6c5ef277ec7b0fcfc02d1ea3cd7f9f8550956483df46abbd8550dda"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060io::copy(\u0026mut file,\u0026mut hasher).with_context(||format!(\u0022couldn\u0027t copy from {filepath:?}\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 \u0060compute_dir_filtered_hash\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_build_tools/src/hashing.rs"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"db90ab158e1a945241b3a5742e9b1f4409be62d422e926822f3c84abb657274a"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060MetadataCommand::new().features(CargoOpt::AllFeatures).exec()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060compute_crate_hash\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_build_tools/src/hashing.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"994482f692ce233566e649f2e1e5837ae623f8a11d7d95ffb91dc493aeec6ab8"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::fs::write(path,contents.trim_start()).with_context(||format!(\u0022couldn\u0027t write to {path:?}\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 \u0060write_versioning_hash\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_build_tools/src/hashing.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1c27558fe96094dcf088b1a44b332f4b08a35c21bbe4338e70dbca1b968e67"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060std::env::var(\u0022TARGET\u0022)\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060export_build_info_vars_for_crate\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_build_tools/src/lib.rs"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad352d95382418d6b48e6d445170c3b114a5e2afa37cd8e1e9150059e2d2214"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060MetadataCommand::new().features(CargoOpt::AllFeatures).exec()\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060rebuild_if_crate_changed\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_build_tools/src/rebuild_detector.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"6181581ee00e7274a96f5049bcbe2f4facb05f97e9c0f30f02f104b9ca350ba7"}},{"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 \u0060dalaran_if_changed\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_build_tools/src/rebuild_detector.rs"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"d201b5aa2b51937c25cf4bda1ef8ea924dc2bb771a51f4d532276e00d65524fc"}},{"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 \u0060dalaran_if_changed_or_doesnt_exist\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_build_tools/src/rebuild_detector.rs"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cfb081521aa6b7c5cfc7780f4096a01a8a607423b8d96add12a2cbd77cb8273"}},{"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 \u0060dalaran_if_changed_glob\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_build_tools/src/rebuild_detector.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"3559dcae10545528fac5c3330b7f5748f13589f791d48f57b4166fb20b60b9f3"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060glob::glob(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 \u0060dalaran_if_changed_glob\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_build_tools/src/rebuild_detector.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb76c1a7e61b55329022a28f55232d072fc7be08944618635a391b5329f1aaf"}},{"ruleId":"X5","level":"warning","message":{"text":"Symbol treated as nullable, then dereferenced unguarded: \u0060path\u0060 can be absent \u2014 it is an \u0060Option\u0060 or \u0060Result\u0060, which is why it is forced \u2014 and \u0060.unwrap()\u0060 in \u0060dalaran_if_changed_glob\u0060 forces it with nothing on this path excluding \u0060None\u0060/\u0060Err\u0060: no \u0060if let\u0060 or \u0060match\u0060 arm that matched it present, no \u0060let \u2026 else\u0060, no \u0060is_some()\u0060/\u0060is_ok()\u0060 test (or \u0060is_none()\u0060/\u0060is_err()\u0060 test that leaves), no \u0060assert!\u0060 of it, and for a lookup no proof the key or index exists. This line panics the first time the value is not there. Handle the absent case where it arises: propagate it with \u0060?\u0060, branch on it with \u0060if let\u0060 / \u0060match\u0060 / \u0060let \u2026 else\u0060, or give it a default (\u0060unwrap_or\u0060, \u0060unwrap_or_default\u0060, \u0060unwrap_or_else\u0060)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/build/dl_build_tools/src/rebuild_detector.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"27523c2cff2590b3e5a96775dc45be978eaac2877b404d655ba3833cf44ba3ee"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060nanos_since_epoch\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":"crates/utils/dl_tuid/src/lib.rs"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"74aad5f68f5502ccd9f5afb3d278e5518f1f22bd15cbfda09c6d2560ed5ab9d4"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060download_advice\u0060 (in \u0060read_ffmpeg_output\u0060) turns every \u0060Err\u0060 into \u0060String::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":"crates/utils/dl_video/src/decode/ffmpeg_cli/ffmpeg.rs"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bcbdcf0546779dad5c582d311d98a07aec175222356bf348828fbecc3204ce2"}},{"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":"crates/viewer/dl_renderer/src/file_resolver.rs"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b0411cfed41e2bb4ed87a32a54d392422522df975fa1da8611957e34ffa721"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060on_register\u0060 turns every \u0060Err\u0060 into \u0060dl_sdk_types::blueprint::components::VisualBounds2D::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":"crates/viewer/dl_view_graph/src/view.rs"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e1af9949c4efc56d377c64f566e7d6002813e18ff5365ef24b0e5d1f3cf0a3"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060on_register\u0060 turns every \u0060Err\u0060 into \u0060dl_sdk_types::blueprint::components::VisualBounds2D::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":"crates/viewer/dl_view_spatial/src/view_2d.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c137079553b4bddb47bbc277922b2be3c97a37899f120a94e5449ac5e89e7c1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060on_register\u0060 turns every \u0060Err\u0060 into \u00601.0.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/viewer/dl_view_spatial/src/view_3d.rs"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76a383f0c4053ebc761d23a89e7eb15fe3ef36264c27e0bad6f7c4144c763a6"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060register_fallbacks\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":"crates/viewer/dl_view_spatial/src/shared_fallbacks.rs"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"372c0cf85db21c2345fe6164229e8c1cc83b2fc2448183d60efbe1d5defd4a25"}},{"ruleId":"X9","level":"note","message":{"text":"Subsumed condition operand: \u0060msg.contains(\u0022connection\u0022)\u0060 can never decide this \u0060||\u0060 \u2014 every value satisfying \u0060msg.contains(\u0022connection\u0022)\u0060 also satisfies \u0060msg.contains(\u0022connect\u0022)\u0060, so the \u0060||\u0060 chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/store/dl_datafusion/src/chunk_fetcher.rs"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc233b48b8c7b6b1bebccc8f2e8577335eefbf950777d59693041e829f5f6fe"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-345","guid":"d80d4b65-bbbe-b65d-958e-7ac466af18f9","name":"Insufficient Verification of Data Authenticity","shortDescription":{"text":"Insufficient Verification of Data Authenticity"},"helpUri":"https://cwe.mitre.org/data/definitions/345.html"},{"id":"CWE-426","guid":"7b39d500-c310-9a5d-9a3d-4c2bf49492a3","name":"Untrusted Search Path","shortDescription":{"text":"Untrusted Search Path"},"helpUri":"https://cwe.mitre.org/data/definitions/426.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-611","guid":"1afbae66-ea29-2d59-aaa2-134e3ae2e85a","name":"Improper Restriction of XML External Entity Reference","shortDescription":{"text":"Improper Restriction of XML External Entity Reference"},"helpUri":"https://cwe.mitre.org/data/definitions/611.html"},{"id":"CWE-693","guid":"b9b141dc-018a-9c59-8953-1e3c4e020745","name":"Protection Mechanism Failure","shortDescription":{"text":"Protection Mechanism Failure"},"helpUri":"https://cwe.mitre.org/data/definitions/693.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"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_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":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"}]}],"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":80,"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."]}]}